Using the Microsoft Graph API to get Office 365 data in your mobile apps Alex Ziskind Technical Director @digitalix www.nuvious.com Hi, I’m Alex From + 750 Million 50 Million per month Problems

EXECUTORS PROPOSAL The vision: “An asynchronous analog of the STL” • A full suite of standard async algorithms based on real-world requirements: E.g., then, when_all, sync_wait, repeat, stop_when, timeout etc. (not all proposed yet) • A standard set of abstractions (aka, concepts) derived from the algorithms • Efficient interoperability with coroutines • An open and extensible way to specify where, how (aka, sender) • A completion handler (aka, receiver) • A small, initial set of generic async algorithms: • E.g., then, when_all, sync_wait, let_* • Utilities for integration with C++20 coroutines5

in_range(T t) noexcept;11 constexpr Algorithms12 C++20 constexpr Everything • constexpr enables compile-time programming without arcane templates • Algorithms: • P0202R3 constexpr And And exchange() (GH-425) • P0879R0 constexpr Algorithms, Part II (GH-425, BillyONeal) • P1645R1 constexpr Algorithms (GH-399, Neargye) • More: • P0415R1 constexpr Again (GH-367, Neargye) time-efficient • Sorted arrays: binary_search, lower_bound, equal_range • Now you can use constexpr algorithms • Easy: static_assert with constexpr is_sorted • string_view is also constexpr; not limited to

requirements  Any container supporting begin()/end() is a valid range  Range-based algorithms: all Standard Library algorithms accepting ranges instead of iterator pairs  Projection: Transform elements

started hacking Rustc [100+ Prs] parser, diagnostics, ICE, Infra tools, code refactor, algorithms improvements Some PR stories • Rust cares about error messages • We are building a sufficiently

refer • V.S service in pure eBPF • Reuse the IPVS’s functionality and maturity • Many scheduling algorithms • Reuse IPVS timer to reclaim eBPF map • More efficient and secure • V.S Taobao IPVS SNAT patch

std::ranges::contains_subrange(v1, v2)); // true75 Changes to Ranges Library  Several folding algorithms: ranges::fold_left(), fold_left_first(), fold_right(), fold_right_last(), fold_left_with_iter()

传统的关系型数据库的存储方式丢失了事物之间的关系信息 Relational Table Real World Multi-Context is Preserved with Graph Analytics Source: KDnuggets 图技术全景图—— Graph Technology Landscape 2020 • 图数据库 • 图数据建模 • 图计算引擎 • 图数据集成 • 可视化分析 • 知识图谱解决方案 知识图谱解决方案 • 图查询语言 • 欺诈检测 • 网络安全分析 • 社交网络分析 • BI 工具 • 图分析工具集 • 图咨询服务 Source ： Graph Aware 图数据库发展趋势 AtlasGraph 研发背景 • 业务对大图分析的诉求（千亿点、万亿边） • 实时风控对图库的性能挑战（ OLTP 毫秒级响应） • 海致图平台产品服务于金融、政府行业有大量业务经验积累（接近客户需求） 特性 信 雅 达 • 高可用 • 一致性（事 务） • 高性能 • 低资源消耗 • 易用 • 功能丰富 AtlasGraph 关键特性 云原生 Cloud-Native Graph Database 支持弹性伸缩，有 效利用硬件资源，高可用，高 可靠，故障自愈，低成本运维 HTAP Hybrid Transactional/Analytical Processing