积分充值
 首页
前端开发
AngularDartElectronFlutterHTML/CSSJavaScriptReactSvelteTypeScriptVue.js构建工具
后端开发
.NetC#C++C语言DenoffmpegGoIdrisJavaJuliaKotlinLeanMakefilenimNode.jsPascalPHPPythonRISC-VRubyRustSwiftUML其它语言区块链开发测试微服务敏捷开发架构设计汇编语言
数据库
Apache DorisApache HBaseCassandraClickHouseFirebirdGreenplumMongoDBMySQLPieCloudDBPostgreSQLRedisSQLSQLiteTiDBVitess数据库中间件数据库工具数据库设计
系统运维
AndroidDevOpshttpdJenkinsLinuxPrometheusTraefikZabbix存储网络与安全
云计算&大数据
Apache APISIXApache FlinkApache KarafApache KyuubiApache OzonedaprDockerHadoopHarborIstioKubernetesOpenShiftPandasrancherRocketMQServerlessService MeshVirtualBoxVMWare云原生CNCF机器学习边缘计算
综合其他
BlenderGIMPKiCadKritaWeblate产品与服务人工智能亿图数据可视化版本控制笔试面试
文库资料
前端
AngularAnt DesignBabelBootstrapChart.jsCSS3EchartsElectronHighchartsHTML/CSSHTML5JavaScriptJerryScriptJestReactSassTypeScriptVue前端工具小程序
后端
.NETApacheC/C++C#CMakeCrystalDartDenoDjangoDubboErlangFastifyFlaskGinGoGoFrameGuzzleIrisJavaJuliaLispLLVMLuaMatplotlibMicronautnimNode.jsPerlPHPPythonQtRPCRubyRustR语言ScalaShellVlangwasmYewZephirZig算法
移动端
AndroidAPP工具FlutterFramework7HarmonyHippyIoniciOSkotlinNativeObject-CPWAReactSwiftuni-appWeex
数据库
ApacheArangoDBCassandraClickHouseCouchDBCrateDBDB2DocumentDBDorisDragonflyDBEdgeDBetcdFirebirdGaussDBGraphGreenPlumHStreamDBHugeGraphimmudbIndexedDBInfluxDBIoTDBKey-ValueKitDBLevelDBM3DBMatrixOneMilvusMongoDBMySQLNavicatNebulaNewSQLNoSQLOceanBaseOpenTSDBOracleOrientDBPostgreSQLPrestoDBQuestDBRedisRocksDBSequoiaDBServerSkytableSQLSQLiteTiDBTiKVTimescaleDBYugabyteDB关系型数据库数据库数据库ORM数据库中间件数据库工具时序数据库
云计算&大数据
ActiveMQAerakiAgentAlluxioAntreaApacheApache APISIXAPISIXBFEBitBookKeeperChaosChoerodonCiliumCloudStackConsulDaprDataEaseDC/OSDockerDrillDruidElasticJobElasticSearchEnvoyErdaFlinkFluentGrafanaHadoopHarborHelmHudiInLongKafkaKnativeKongKubeCubeKubeEdgeKubeflowKubeOperatorKubernetesKubeSphereKubeVelaKumaKylinLibcloudLinkerdLonghornMeiliSearchMeshNacosNATSOKDOpenOpenEBSOpenKruiseOpenPitrixOpenSearchOpenStackOpenTracingOzonePaddlePaddlePolicyPulsarPyTorchRainbondRancherRediSearchScikit-learnServerlessShardingSphereShenYuSparkStormSupersetXuperChainZadig云原生CNCF人工智能区块链数据挖掘机器学习深度学习算法工程边缘计算
UI&美工&设计
BlenderKritaSketchUI设计
网络&系统&运维
AnsibleApacheAWKCeleryCephCI/CDCurveDevOpsGoCDHAProxyIstioJenkinsJumpServerLinuxMacNginxOpenRestyPrometheusServertraefikTrafficUnixWindowsZabbixZipkin安全防护系统内核网络运维监控
综合其它
文章资讯
 上传文档  发布文章  登录账户
IT文库
  • 综合
  • 文档
  • 文章

无数据

分类

全部后端开发(93)C++(93)Conan(54)

语言

全部英语(92)中文(简体)(1)

格式

全部PDF文档 PDF(90)PPT文档 PPT(3)
 
本次搜索耗时 0.017 秒,为您找到相关结果约 93 个.
  • 全部
  • 后端开发
  • C++
  • Conan
  • 全部
  • 英语
  • 中文(简体)
  • 全部
  • PDF文档 PDF
  • PPT文档 PPT
  • 默认排序
  • 最新排序
  • 页数排序
  • 大小排序
  • 全部时间
  • 最近一天
  • 最近一周
  • 最近一个月
  • 最近三个月
  • 最近半年
  • 最近一年
  • pdf文档 Back to Basics Concepts

    requires clause Requirements with requires expression Concept (named requirements) // OK, uses 1st add() calling push_back() // OK, uses 2nd add() calling insert() Nico Josuttis C++ Concepts @cppcon coll.insert(val); } std::vector coll1; std::set coll2; add(coll1, 42); // OK, uses 1st add() calling push_back() add(coll2, 42); // OK, uses 2nd add() calling insert() C++20 C++20 add() calling insert() 2nd add() is used, because concept for 1st add() not satisfied Requirements not met => Concept not satisfied => 1st add() ignored Nico Josuttis C++ Concepts @cppcon 2024-09-18
    0 码力 | 23 页 | 2.14 MB | 6 月前
    3
  • pdf文档 A Multithreaded, Transaction-Based Locking Strategy for Containers

    public lockable_item { static constexpr size_t buf_size = 32; char ma_chars[buf_size]; void st_update(FILE* fp, prn_gen& gen, int_dist& char_dist); void tx_update(transaction const& tx, FILE* Strategy for Containers Testing – test_item::st_update() //- Updates on-board data for the non-STO tests. Checks to see if a race has occurred. // void test_item::st_update(FILE* fp, prn_gen& gen, int_dist& Strategy for Containers Testing – test_item::st_update() //- Updates on-board data for the non-STO tests. Checks to see if a race has occurred. // void test_item::st_update(FILE* fp, prn_gen& gen, int_dist&
    0 码力 | 142 页 | 474.78 KB | 6 月前
    3
  • pdf文档 Compile-Time Compression and Resource Generation with C++20

    auto st = makeStringsLambda(); // ... return tree; } static constexpr auto MakeEncodedBitStream( CallableGivesIterableStringViews auto makeStringsLambda) { constexpr auto st = makeStringsLambda(); makeStringsLambda(); constexpr auto NumStrings = std::distance(st.begin(), st.end()); constexpr auto tree = BuildHuffmanTree(makeStringsLambda); ResultType stream; // { std::array result; std::size_t i{0}; for(auto const &s : st) { result.at(i) = CalculateStringLength(s); ++i; } return result; };
    0 码力 | 59 页 | 1.86 MB | 6 月前
    3
  • pdf文档 Object Introspection: A Revolutionary Memory Profiler for C++ Objects

    Introspection Measurement Code Code Generation/* Generated from Debug Info */ static types::st::Unit getSizeType( const Foo& t, typename TypeHandler::type returnArg) { return std::vector bar_vec; std::string foo_str; };template static types::st::Unit getSizeType( const std::vector& container, typename TypeHandler class std::vector {...}; CodeGen: containers/* Generated from Debug Info */ static types::st::Unit getSizeType( const Bar& t, typename TypeHandler::type returnArg) { return
    0 码力 | 62 页 | 2.24 MB | 6 月前
    3
  • pdf文档 Back to Basics: Move Semantics

    names: =- When you need an object/value multiple times: std: :string strfgetData())} 7 J1 copy (st need the value of stz) col11.Push_ back (stz) J1 copy (but no longer need the value) col12.Push_back this value jere” =- When you need an object/value multiple times: string strfgetData()] 1 J1 copy (st need the value of stz) col11.Push_ back (stz) 1 J1 move (ok nolonger need the value) col12 .push_back(std: temporal Jsame, but doing something between compute() and process(): autogs val = compute(t); Process (st forward(val)) 7 ES josuttis | eckstein Ci
    0 码力 | 23 页 | 1020.10 KB | 6 月前
    3
  • pdf文档 generic graph libraries

    fundamental operation in graph algorithms 。 Given avertex岂find allthe neighbors of (all verticesv st. (WUV) E 古, ie st.edge (uv) is in the graph) 。Then foreach neighbor find its neighbors (and so on) G = {有了 g,std::ranges::range_value_t e) T { source(E,e) } -> std: :convertible_to>; { target(E,e) } -> st 了 : :convertible_to>; adjacency_jist 一”graph _ degree_enumerable edge jist Where Gaph ndieaaed aceightedmatching Venerhnd Edge st Gaph and ndigence Gaph ndieaaed indegree ordermg
    0 码力 | 76 页 | 6.59 MB | 6 月前
    3
  • pdf文档 10 Problems Large Companies Have with Managing C++ Dependencies and How to Solve Them

    I download prebuilt libraries from the Internet Conan vcpkg NuGet How do you manage your C++ 1st and 3rd party libraries?Most popular package managers for enterprises Conan For more on package its API version, a Diamond problem occurs •Very common with open-source, but also possible with 1st party libraries at large companies Library A version ? Library B version ? Library C version centralizing common dependency management tasks •Maintaining 3rd party packages and providing support for 1st party ones •Approving new open-source dependencies and validating compliance •Maintaining a common
    0 码力 | 46 页 | 917.72 KB | 6 月前
    3
  • pdf文档 High-Performance Cross-Platform Architecture: C++20 Innovations

    SseVal()); // w^2, x^2, y^2, z^2 __m128 add1st = _mm_hadd_ps(squares, squares); // w^2+x^2, y^2+z^2, w^2+x^2, y^2+z^2 __m128 add2nd = _mm_hadd_ps(add1st, add1st); // w^2+x^2+y^2+z^2, ... float result =
    0 码力 | 75 页 | 581.83 KB | 6 月前
    3
  • pdf文档 Taro: Task graph-based Asynchronous Programming Using C++ Coroutine

    4 while(k++ < 300) { 5 // CPU operations 6 co_await cuda.suspend_polling([=](cudaStream_t st) { 7 // GPU operations... 8 }); 9 } 10 } Assume each task is a data-driven task 77Experimental 3 cpu_busy_loop(ctime); 4 co_await _cuda.suspend_callback([=](cudaStream_t st) { 5 cuda_busy_loop<<<8, 256, 0, st>>>(gtime); // large overhead 6 }) 7 } Assume each task is a fixed-runtime task
    0 码力 | 84 页 | 8.82 MB | 6 月前
    3
  • pdf文档 Hiding Your Implementation Details is Not So Simple

    concept's 1st argument is injected // by the compiler, as if we wrote: Printable template void print1(const T& t) { cout << t << endl; } // 2. concept on auto parameter: concept's 1st argument concept’s parameter is not injected and thus shall be manually provided: // examples where concept's 1st argument is not injected // and shall be provided explicitly: // [1] template requires
    0 码力 | 145 页 | 2.45 MB | 6 月前
    3
共 93 条
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10
前往
页
相关搜索词
BacktoBasicsConceptsMultithreadedTransactionBasedLockingStrategyforContainersCompileTimeCompressionandResourceGenerationwithC++20ObjectIntrospectionRevolutionaryMemoryProfilerObjectsMoveSemanticsgenericgraphlibraries10ProblemsLargeCompaniesHaveManagingDependenciesHowSolveThemHighPerformanceCrossPlatformArchitectureInnovationsTaroTaskbasedAsynchronousProgrammingUsingCoroutineHidingYourImplementationDetailsisNotSoSimple
IT文库
关于我们 文库协议 联系我们 意见反馈 免责声明
本站文档数据由用户上传或本站整理自互联网,不以营利为目的,供所有人免费下载和学习使用。如侵犯您的权益,请联系我们进行删除。
IT文库 ©1024 - 2025 | 站点地图
Powered By MOREDOC AI v3.3.0-beta.70
  • 关注我们的公众号【刻舟求荐】,给您不一样的精彩
    关注我们的公众号【刻舟求荐】,给您不一样的精彩