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

无数据

分类

全部后端开发(130)C++(62)Python(42)Julia(18)Conda(16)云计算&大数据(13)数据库(11)VirtualBox(11)TiDB(10)Rust(8)

语言

全部英语(140)中文(繁体)(11)中文(简体)(8)西班牙语(1)日语(1)韩语(1)zh(1)英语(1)

格式

全部PDF文档 PDF(159)DOC文档 DOC(3)PPT文档 PPT(2)其他文档 其他(1)
 
本次搜索耗时 0.227 秒,为您找到相关结果约 165 个.
  • 全部
  • 后端开发
  • C++
  • Python
  • Julia
  • Conda
  • 云计算&大数据
  • 数据库
  • VirtualBox
  • TiDB
  • Rust
  • 全部
  • 英语
  • 中文(繁体)
  • 中文(简体)
  • 西班牙语
  • 日语
  • 韩语
  • zh
  • 英语
  • 全部
  • PDF文档 PDF
  • DOC文档 DOC
  • PPT文档 PPT
  • 其他文档 其他
  • 默认排序
  • 最新排序
  • 页数排序
  • 大小排序
  • 全部时间
  • 最近一天
  • 最近一周
  • 最近一个月
  • 最近三个月
  • 最近半年
  • 最近一年
  • pdf文档 Coroutines and Structured Concurrency in Practice

    A task can only run when it’s being awaited by another task https://vorpus.org/blog/notes-on-structured-concurrency-or-go-statement-considered-harmful/Sketching an API Task greet() { cout co_return co_await resolveOn(name, "1.1.1.1"); }); co_return visit(identity{}, v); }Structured concurrency Tasks naturally form a "call tree" • coroutines • leaf awaitables (sleeping, I/O, cancel()? No longer a simple allOf()Dynamic allOf() We have created a fundamental primitive of structured concurrency • nursery in Python trio • task group in Python asyncio • task scope in Rust • coroutine
    0 码力 | 103 页 | 1.98 MB | 6 月前
    3
  • pdf文档 C++26 Preview

    collections, new ranges, language features 4Outline of the talk I Language & Library debugging structured bindings Language Templates Misc Contracts Reflection 5Outline of the talk II Library: string is_debugger_present is_replaceable 13Structured Bindings 14use as conditions in if, while, for, and switch statements success evaluation prior to destructuring blog: P0963 Structured binding declaration as a condition while, for, and switch statements success evaluation prior to destructuring blog: P0963 Structured binding declaration as a condition https://mariusbancila.ro/blog/2024/09/06/whats-new-in-c26- part-1/
    0 码力 | 118 页 | 2.02 MB | 6 月前
    3
  • pdf文档 Named Optional Parameters - JavaScript Style

    function logger({one, two, three} = {}) { // in signature: = {} provides destructure // similar to structured binding // first check for what would be a “compiler” error if ( one == null ) throw new Error("i data members only ▪designated initializers -- initializing a struct with: { .field = value } ▪structured binding -- disaggregating a struct with: auto& [field1, field1] = myStruct ▪function overloading - noDefaultExists; Speed speed; }; Inside of processCarStateTransition the struct argument is spread with structured binding. Answer processCarStateTransition(const PathToChangingStatus& path) { auto& [car, roadType
    0 码力 | 1 页 | 3.17 MB | 6 月前
    3
  • pdf文档 Back to Basics: Algebraic Data Types

    generateDefaultCert(); std::cout << "Made cert for host " << std::get<0>(hct) << "\n"; // C++17 structured binding auto [host, cert, ttl] = generateDefaultCert(); std::cout << "Made cert for host " << host = generateDefaultCert(); std::cout << "Made cert for host " << info.host << "\n"; // C++17 structured binding still permits this auto [host, cert, ttl] = generateDefaultCert(); std::cout << "Made cert
    0 码力 | 73 页 | 267.05 KB | 6 月前
    3
  • pdf文档 Back to Basics: Lambda Expressions

    myLamb = [ ] (auto var1, int var2) { return var1 + var2; } 42Lambda Expressions ● Structured Bindings ○ structured bindings make it easier to access elements of tuples, arrays, and other compound types // line A auto myLamb = [x] () { return x + 7; }; // line B ○ capturing a structured binding was deemed invalid according to the standard, so line B does not compile as of C++17 ○ workaround:
    0 码力 | 48 页 | 175.89 KB | 6 月前
    3
  • pdf文档 Julia 1.11.4

    names.) Since Julia allows numeric literals to be juxtaposed with identifiers as coefficients, this binding suffices to provide convenient syntax for complex numbers, similar to the traditional mathematical languages.) For example, in the function function f(x, y) x[1] = 42 # mutates x y = 7 + y # new binding for y, no mutation return y end The statement x[1] = 42 mutates the object x, and hence this change passed by the caller for this argument. On the other hand, the assignment y = 7 + y changes the binding ("name") y to refer to a new value 7 + y, rather than mutating the original object referred to by
    0 码力 | 2007 页 | 6.73 MB | 3 月前
    3
  • pdf文档 Julia 1.11.5 Documentation

    names.) Since Julia allows numeric literals to be juxtaposed with identifiers as coefficients, this binding suffices to provide convenient syntax for complex numbers, similar to the traditional mathematical languages.) For example, in the function function f(x, y) x[1] = 42 # mutates x y = 7 + y # new binding for y, no mutation return y end The statement x[1] = 42 mutates the object x, and hence this change passed by the caller for this argument. On the other hand, the assignment y = 7 + y changes the binding ("name") y to refer to a new value 7 + y, rather than mutating the original object referred to by
    0 码力 | 2007 页 | 6.73 MB | 3 月前
    3
  • pdf文档 Julia 1.11.6 Release Notes

    names.) Since Julia allows numeric literals to be juxtaposed with identifiers as coefficients, this binding suffices to provide convenient syntax for complex numbers, similar to the traditional mathematical languages.) For example, in the function function f(x, y) x[1] = 42 # mutates x y = 7 + y # new binding for y, no mutation return y end The statement x[1] = 42 mutates the object x, and hence this change passed by the caller for this argument. On the other hand, the assignment y = 7 + y changes the binding ("name") y to refer to a new value 7 + y, rather than mutating the original object referred to by
    0 码力 | 2007 页 | 6.73 MB | 3 月前
    3
  • pdf文档 Whats in a Name? Whats a Name in? - Walter E. Brown - CppCon 2020

    underscore plus most characters from ISO/IEC 10646). � “An en:ty is a value, object, reference, structured binding, func`on, enumerator, type, class member, bit-field, template, template specializa`on, namespace
    0 码力 | 7 页 | 4.37 MB | 6 月前
    3
  • pdf文档 Julia 1.11.0-rc4 Documentation

    names.) Since Julia allows numeric literals to be juxtaposed with identifiers as coefficients, this binding suffices to provide convenient syntax for complex numbers, similar to the traditional mathematical languages.) For example, in the function function f(x, y) x[1] = 42 # mutates x y = 7 + y # new binding for y, no mutation return y end The statement x[1] = 42 mutates the object x, and hence this change passed by the caller for this argument. On the other hand, the assignment y = 7 + y changes the binding ("name") y to refer to a new value 7 + y, rather than mutating the original object referred to by
    0 码力 | 1985 页 | 6.67 MB | 10 月前
    3
共 165 条
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 17
前往
页
相关搜索词
CoroutinesandStructuredConcurrencyinPracticeC++26PreviewNamedOptionalParametersJavaScriptStyleBacktoBasicsAlgebraicDataTypesLambdaExpressionsJulia1.11DocumentationReleaseNotesWhatsNameWalterBrownCppCon2020rc4
IT文库
关于我们 文库协议 联系我们 意见反馈 免责声明
本站文档数据由用户上传或本站整理自互联网,不以营利为目的,供所有人免费下载和学习使用。如侵犯您的权益,请联系我们进行删除。
IT文库 ©1024 - 2025 | 站点地图
Powered By MOREDOC AI v3.3.0-beta.70
  • 关注我们的公众号【刻舟求荐】,给您不一样的精彩
    关注我们的公众号【刻舟求荐】,给您不一样的精彩