首页 文库资料 文章资讯  上传文档  发布文章  登录账户

分类

全部后端开发(204)C++(204)

语言

全部英语(178)中文（简体）(24)中文（繁体）(1)英语(1)

格式

全部PDF文档 PDF(184)PPT文档 PPT(20)
 
本次搜索耗时 0.044 秒，为您找到相关结果约 204 个.

  • pdf文档 Designing a Slimmer Vector of Variants

    L.P. All rights reserved.© 2024 Bloomberg Finance L.P. All rights reserved. Designing a Slimmer Vector of Variants CppCon 2024 September 18, 2024 Chris Fretz Senior C++ Engineer 2© 2024 Bloomberg details my experience in creating a novel solution to an observed problem with memory usage of std::vector> • The talk starts with the motivating use case, considers several candidate Heterogeneous containers like std::vector> are an extremely natural way to represent data across many different paradigms • Naive usage of std::vector> can result in
    0 码力 | 64 页 | 1.98 MB | 6 月前
    3

  • pdf文档 Back to Basics Almost Always Vector

    1#include #include #include <vector> int a[] = {0, 1, 2, 3, 4}; std::vector c = {0, 1, 2, 3, 4}; auto main() -> int { std::cout << "C style array: " << sizeof(a) / sizeof(a[0]) sizeof(a[0]) << std::endl; std::cout << "Vector size: " << c.size() << std::endl; return 0; } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 https://www.reddit.com/r/cpp/comments/qm6i25/my_professor_is_telling _us_to_never_use_vectors/ 2more std::vector? 3How do you read a technical book front to back? As a technical editor... 4#include int main() { int cppconEarlyYears[6] = {2014, 2015, 2016
    0 码力 | 62 页 | 4.86 MB | 6 月前
    3

  • ppt文档 C++高性能并行编程与优化 - 课件 - 13 C++ STL 容器全解之 vector

    C++ STL 容器全解之 vector by 彭于斌（ @archibate ） 往期录播： https://www.bilibili.com/video/BV1fa411r7zp 课程 PPT 和代码： https://github.com/parallel101/course C++ 标准库五大件：容器（ container ） C++ 标准库五大件：迭代器（ iterator STL 侯捷 STL vector 容器 vector 容器：构造函数 • vector 的功能是长度可变的数组，他里面的数据 存储在堆上。 • vector 是一个模板类，第一个模板参数是数组里 元素的类型。 • 例如，声明一个元素是 int 类型的动态数组 a ： • vector a; vector 容器：构造函数和 size • vector 可以在构造时指定初始长度。 explicit vector(size_t n); • 例如，要创建一个长度为 4 的 int 型数组 ： • vector a(4); • 之后可以通过 a.size() 获得数组的长度。 • 比如右边这段代码会得到 4 。 • size_t size() const noexcept; vector 容器： operator[] • 要访问 vector 里的元素，只需用
    0 码力 | 90 页 | 4.93 MB | 1 年前
    3

  • pdf文档 Better Code: Contracts

    Reserved. zip_vector template 
 class zip_vector { vector _first;
 vector _second; public: const vector& first() const { return _first; }
 const vector& second() Reserved. zip_vector template 
 class zip_vector { vector _first;
 vector _second; public: const vector& first() const { return _first; }
 const vector& second() Reserved. zip_vector template 
 class zip_vector { vector _first;
 vector _second; public: const vector& first() const { return _first; }
 const vector& second()
    0 码力 | 204 页 | 4.46 MB | 6 月前
    3

  • pdf文档 Cache-Friendly Design in Robot Path Planning

    // std::map #include <vector> // std::vector class TerminateAtGoal { private: VertexID goal_; std::priority_queuevector, std::greater> // std::map #include <vector> // std::vector class TerminateAtGoal { private: VertexID goal_; std::priority_queuevector, std::greater> // std::map #include <vector> // std::vector 1 2 3 4 5 class TerminateAtGoal 6 { 7 private: 8 VertexID goal_; 9 10 std::priority_queuevector, std::greater>
    0 码力 | 216 页 | 10.68 MB | 6 月前
    3

  • pdf文档 Noexcept: Enabling Testing of Contract Checks

    2023 (CC BY 4.0) 9 int a, b; vector v; static_assert(noexcept(a + b)); // OK, int addition can't throw static_assert(noexcept(v.empty())); // OK, vector::empty can't throw static_assert(noexcept(v preconditions have been met • Example contract for vector::pop_back() : • Precondition: the vector is not empty • Postcondition: the last element of the vector has been removed 4-Oct-23 Pablo Halpern and Timur addition • Example: vector::size() • A function has a narrow contract if it has preconditions: • Example: signed integer addition (precondition: a + b will not over/underflow) • Example: vector::front() (precondition:
    0 码力 | 90 页 | 1.38 MB | 6 月前
    3

  • pdf文档 Thinking Functionally In C++

    implementation std::vector GetBirthdayEmployeesThisWeek() { const auto allEmployees = GetCurrentEmployees(); const auto dateRange = GetThisWeekDateRange(); std::vector birthdayEmployees; implementation std::vector GetBirthdayEmployeesThisWeek() { const auto allEmployees = GetCurrentEmployees(); const auto dateRange = GetThisWeekDateRange(); std::vector birthdayEmployees; implementation std::vector GetBirthdayEmployeesThisWeek() { const auto allEmployees = GetCurrentEmployees(); const auto dateRange = GetThisWeekDateRange(); std::vector birthdayEmployees;
    0 码力 | 114 页 | 3.14 MB | 6 月前
    3

  • pdf文档 Hello 算法 1.0.0b4 C++版

    入数据大小；在下面遍历数组的示例中，数据大小 ? 为数组的长度。 // === File: time_complexity.cpp === /* 线性阶（遍历数组） */ int arrayTraversal(vector &nums) { int count = 0; // 循环次数与数组长度成正比 for (int num : nums) { count++; } return count; 。 ?((? − 1)? 2 ) = ?(?2) // === File: time_complexity.cpp === /* 平方阶（冒泡排序） */ int bubbleSort(vector &nums) { 2. 复杂度 hello‑algo.com 22 int count = 0; // 计数器 // 外循环：未排序区间为 [0, i] for (int i File: worst_best_time_complexity.cpp === /* 生成一个数组，元素为 { 1, 2, ..., n }，顺序被打乱 */ vector randomNumbers(int n) { vector nums(n); // 生成数组 nums = { 1, 2, 3, ..., n } for (int i = 0; i < n; i++)
    0 码力 | 343 页 | 27.39 MB | 1 年前
    3

  • pdf文档 Hello 算法 1.0.0b5 C++版

    ?(?) ，其中 ? 为数组或链表的长度： // === File: time_complexity.cpp === /* 线性阶（遍历数组） */ int arrayTraversal(vector &nums) { int count = 0; // 循环次数与数组长度成正比 for (int num : nums) { count++; } return count; === File: time_complexity.cpp === /* 平方阶（冒泡排序） */ 第 2 章 复杂度分析 hello‑algo.com 33 int bubbleSort(vector &nums) { int count = 0; // 计数器 // 外循环：未排序区间为 [0, i] for (int i = nums.size() - 1; i > 0; File: worst_best_time_complexity.cpp === /* 生成一个数组，元素为 { 1, 2, ..., n }，顺序被打乱 */ vector randomNumbers(int n) { vector nums(n); // 生成数组 nums = { 1, 2, 3, ..., n } for (int i = 0; i < n; i++)
    0 码力 | 377 页 | 30.69 MB | 1 年前
    3

  • pdf文档 Hello 算法 1.1.0 C++ 版

    ?(?) ，其中 ? 为数组或链表的长度： // === File: time_complexity.cpp === /* 线性阶（遍历数组） */ int arrayTraversal(vector &nums) { int count = 0; // 循环次数与数组长度成正比 for (int num : nums) { count++; } return count; 此时间复杂度为 ?((? − 1)?/2) = ?(?2) ： // === File: time_complexity.cpp === /* 平方阶（冒泡排序） */ int bubbleSort(vector &nums) { int count = 0; // 计数器 // 外循环：未排序区间为 [0, i] for (int i = nums.size() - 1; i > 0; File: worst_best_time_complexity.cpp === /* 生成一个数组，元素为 { 1, 2, ..., n }，顺序被打乱 */ vector randomNumbers(int n) { vector nums(n); // 生成数组 nums = { 1, 2, 3, ..., n } for (int i = 0; i < n; i++)
    0 码力 | 379 页 | 18.47 MB | 1 年前
    3
共 204 条
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 21
前往
页
相关搜索词
DesigningSlimmerVectorofVariantsBacktoBasicsAlmostAlwaysC++高性性能高性能并行编程优化课件13BetterCodeContractsCacheFriendlyDesigninRobotPathPlanningNoexceptEnablingTestingContractChecksThinkingFunctionallyInHello算法1.00b40b51.1