积分充值
 首页
前端开发
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文库
  • 综合
  • 文档
  • 文章

无数据

分类

全部后端开发(59)C++(59)Conan(31)

语言

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

格式

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

    function table. class B { public: virtual int f1(); virtual void f2(int); virtual int f3(int); ~~~ }; B *bp = new B; 47 B members bp vptr other stuff… &B::f1 &B::f2 &B::f3 vtbl for B B object Copyright object’s virtual function table. The call bp‐>f1();  Is translated to something like (*(bp‐>vptr)[0])(bp) 49 B members bp vptr other stuff… &B::f1 &B::f2 &B::f3 vtbl for B B object Copyright © Copyright © 2020 by Stephen C. Dewhurst and Daniel Saks 23 Virtual Calling Sequence  The call bp‐>f1();  Is translated to something like (*(bp‐>vptr)[0])()  Or, in other words, MOV R0,R4
    0 码力 | 51 页 | 461.37 KB | 6 月前
    3
  • pdf文档 Compile-Time Validation

    two functions (f1, f2) into a new function. The return value of the previous function is passed to the next function. auto compose(auto f1, auto f2) { return [=] { return f2(f1()); }; }Composition Compose two functions (f1, f2) into a new function. Each function takes a callback to next function as argument. auto compose(auto f1, auto f2) { return [=] (auto next) { return f1([=] () { return individual functions used in its composition. auto f1 = foo | bar; auto f2 = f1 | baz; // pseudocode properties of f2 == compose( properties of f1, properties of baz )Function Composition struct
    0 码力 | 137 页 | 1.70 MB | 6 月前
    3
  • pdf文档 Beyond struct: Programming a Struct Replacement in C++20

    Google library These opinions are my ownStruct struct person { int id = 1; std::string name; int score = 0; }; int main() { person p{.id = 1, .name = "John"}; p.id = 2; p.name = "JRB"; std::cout << p // member<"id", int>, // member<"score", int, [](auto& self) { return get<"id">(self) + 1; }>, // member<"name", std::string, [] { return // >; Person p; std::cout << get<"id">(p) << " " << get<"name">(p) << " " << get<"score">(p) << "\n"; }Member template ()> struct
    0 码力 | 65 页 | 702.78 KB | 6 月前
    3
  • pdf文档 Quantifying Accidental Complexity: An empirical look at teaching and using C++

    preserves the arg’s l/rvalue-ness (incl. can move from rvalue arg) C++20 Proposed equivalent 28 void f1(int x) { g(x); } void f2(const X& x) { // for lvalues g(x); } void f2(X&& x) { // for rvalues f3(const T& t) { g(t); } // hard to overload to pass by value // hard to overload for rvalues void f1(in int x) { g(x); } void f2(in X x) { g(x); } template void f3(in T t) { g(t); virtual, some path must have a non-const use of x (else use in) C++20 Proposed equivalent 30 void f1(/*inout*/ X& x) { g(x); // ok x = 42; // ok but can omit } void f2(/*inout*/ X& x) {
    0 码力 | 36 页 | 2.68 MB | 6 月前
    3
  • pdf文档 Data Is All You Need for Fusion

    breakPipeline(0); subpipe = pipeline.subpipeline(0, 1); id f d i l( t A for x { f1(); f2(); } for x { f1(); } — - — Break for y{ f2(); }Controlling Properties of the Fused Code code-samples breakPipeline(0); subpipe = pipeline.subpipeline(0, 1); id f d i l( t A for x { f1(); f2(); } for x { f1(); } — - — Break for y{ f2(); }Controlling Properties of the Fused Code code subpipe = pipeline.subpipeline(0, 1); void my fused impl(const Array a, for x { f1(); f2(); } for x { f1(); — - — Subpipeline for y{ f2(); } } code-samples manya227 June 2024 Pipeline
    0 码力 | 151 页 | 9.90 MB | 6 月前
    3
  • pdf文档 Pipes: How Plumbing Can Make Your C++ Code More Expressive

    BRANCHING OUT: FORK fork transform(f1) transform(f2) transform(f3) results1 results2 results3 push_back push_back push_back transform(f)27 fork transform(f1) transform(f2) transform(f3) push_back push_back pipes::transform(f) >>= pipes::fork(pipes::transform(f1) >>= pipes::push_back(results1), pipes::transform(f2) >>= pipes::push_back(results2) push_back results1 set_segregate set_segregate(input1, input2, pipes::transform(f1) >>= pipes::push_back(results1), pipes::filter(p2) >>= pipes::push_back(results2),
    0 码力 | 61 页 | 9.52 MB | 6 月前
    3
  • pdf文档 COMPOSABLE C++

    writes writes code like this? code like this? auto compose(auto f1, auto f2) { return [f1, f2] (auto arg) { if (auto result = f1(arg); result) { return result; } return f2(arg); writes writes code like this? code like this? auto compose(auto f1, auto f2) { return [f1, f2] (auto arg) { if (auto result = f1(arg); result) { return result; } return f2(arg);
    0 码力 | 124 页 | 8.28 MB | 6 月前
    3
  • pdf文档 Delivering safe C++

    dereferencing • Don’t dereference an unchecked pointer • void f0(int* p) { *p = 7; } // not OK • void f1(int* p) { if (p) *p = 7; } // OK • void f2(not_null p) { *p = 7; } // OK (not_null constructor ownership • owner is low level, prefer unique_ptr or other ownership abstractions void f1(owner p) // f1() used_to_take_a_raw_pointer { // ... delete p; // required or f() must transfer ownership owner p2) { f1(p1); // error: p1 is not an owner f2(p1); // call OK, as ever, but f2()’s definition is not f1(p2); // transfers ownership; p2 in now invalid in f3() because f1() will delete it
    0 码力 | 74 页 | 2.72 MB | 6 月前
    3
  • pdf文档 Back to Basics: Templates Part 2

    std::vector stuff; public: foobar(int n=0); ... void add(T const& t) { stuff.push_back(t); } }; void f1(); void f2(); #endif //- file_2.cpp #include "foobar.h" #include using std::string; void main() { f1(); f2(); return 0; } //- file_1.cpp #include "foobar.h" #include #include using std::string; using std::complex; using cxfloat = complex; void f1(int n) { foobar std::vector stuff; public: foobar(int n=0); ... void add(T const& t) { stuff.push_back(t); } }; void f1(); void f2(); #endif //- file_2.cpp #include "foobar.h" #include using std::string; void
    0 码力 | 80 页 | 490.15 KB | 6 月前
    3
  • pdf文档 Monads in Modern C++

    std::future std::future f1 = ...; T2 continuationA(T1); auto f2 = f1.then(continuationA); std::future continuationB(T1); auto f2 = f1.then(continuationB); functor auto res = f1 .then(c1) std::future std::future f1 = ...; T2 continuationA(T1); auto f2 = f1.then(continuationA); std::future continuationB(T1); auto f2 = f1.then(continuationB); functor auto res = f1 .then(c1) constexpr /* maybe adaptor closure*/ transform(Callable&& c); 1: auto closure = maybe::views::transform(f1) 2: | maybe::views::and_then(f2) 3: | maybe::views::or_else(f3); 4: 5: /* some-maybe-type
    0 码力 | 94 页 | 4.56 MB | 6 月前
    3
共 59 条
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
前往
页
相关搜索词
ClassLayoutCompileTimeValidationBeyondstructProgrammingStructReplacementinC++20QuantifyingAccidentalComplexityAnempiricallookatteachingandusingDataIsAllYouNeedforFusionPipesHowPlumbingCanMakeYourCodeMoreExpressiveCOMPOSABLEDeliveringsafeBacktoBasicsTemplatesPartMonadsModern
IT文库
关于我们 文库协议 联系我们 意见反馈 免责声明
本站文档数据由用户上传或本站整理自互联网,不以营利为目的,供所有人免费下载和学习使用。如侵犯您的权益,请联系我们进行删除。
IT文库 ©1024 - 2025 | 站点地图
Powered By MOREDOC AI v3.3.0-beta.70
  • 关注我们的公众号【刻舟求荐】,给您不一样的精彩
    关注我们的公众号【刻舟求荐】,给您不一样的精彩