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

无数据

分类

全部后端开发(11)Julia(10)Rust(1)

语言

全部中文(繁体)(11)

格式

全部PDF文档 PDF(11)
 
本次搜索耗时 0.429 秒,为您找到相关结果约 11 个.
  • 全部
  • 后端开发
  • Julia
  • Rust
  • 全部
  • 中文(繁体)
  • 全部
  • PDF文档 PDF
  • 默认排序
  • 最新排序
  • 页数排序
  • 大小排序
  • 全部时间
  • 最近一天
  • 最近一周
  • 最近一个月
  • 最近三个月
  • 最近半年
  • 最近一年
  • pdf文档 Comprehensive Rust(繁体中文)

    而非輪詢。非同步的 Python 程式需要「迴圈(loop)」來處理,類似於 Rust 的執行環境。 • JavaScript 的 Promise 也是類似的概念,但仍是基於回呼函數。JavaScript 的語言執行環境實 作了事件迴圈(event loop),所以隱藏了很多關於 Promise 的處理細節。 63.1 async/await 從高層次的角度來看,非同步的 Rust 程式碼看起來很像「一般的」同步程式碼: 因此大部分有趣的非同步作業皆無法在 Playground 中執行。 • 除非接受執行器輪詢,否則 Future 不會執行任何作業 (甚至不會啟動 I/O 作業),因此 Future 是 「惰性」的。這一點與 JS Promise 不同。舉例來說,後者即使從未使用過,仍會執行至完成為止。 63.3.1 Tokio Tokio 提供以下項目: • 執行非同步程式碼的多執行緒執行階段。 • 標準程式庫的非同步版本。 • 作的功能類似於獨立的執行作業執行緒。 • 會合 • 選取 64.1 加入 會合作業會等待整個 Future 集合準備就緒,然後蒐集多個結果一次回傳。這類似於 JavaScript 中的 Promise.all 或 Python 中的 asyncio.gather。 use anyhow::Result; use futures::future; use reqwest; use std::
    0 码力 | 358 页 | 1.41 MB | 10 月前
    3
  • pdf文档 julia 1.10.10

    results. This corresponds to the -ffast-math option of clang. • Write @simd in front of for loops to promise that the iterations are independent and may be re- ordered. Note that in many cases, Julia can automatically JL_DLLEXPORT jl_value_t *jl_apply_array_type(jl_value_t *type, size_t dim) JL_ALWAYS_LEAFTYPE; JL_GC_PROMISE_ROOTED This is a function-like annotation. Any value passed to this annotation will be considered happen to know for complicated external reasons // that val is rooted under these conditions JL_GC_PROMISE_ROOTED(val); } } Completeness of analysis The analyzer only looks at local information. In particular
    0 码力 | 1692 页 | 6.34 MB | 3 月前
    3
  • pdf文档 Julia 1.10.9

    results. This corresponds to the -ffast-math option of clang. • Write @simd in front of for loops to promise that the iterations are independent and may be re- ordered. Note that in many cases, Julia can automatically JL_DLLEXPORT jl_value_t *jl_apply_array_type(jl_value_t *type, size_t dim) JL_ALWAYS_LEAFTYPE; JL_GC_PROMISE_ROOTED This is a function-like annotation. Any value passed to this annotation will be considered happen to know for complicated external reasons // that val is rooted under these conditions JL_GC_PROMISE_ROOTED(val); } } Completeness of analysis The analyzer only looks at local information. In particular
    0 码力 | 1692 页 | 6.34 MB | 3 月前
    3
  • pdf文档 Julia 1.11.4

    results. This corresponds to the -ffast-math option of clang. • Write @simd in front of for loops to promise that the iterations are independent and may be re- ordered. Note that in many cases, Julia can automatically JL_DLLEXPORT jl_value_t *jl_apply_array_type(jl_value_t *type, size_t dim) JL_ALWAYS_LEAFTYPE; JL_GC_PROMISE_ROOTED This is a function-like annotation. Any value passed to this annotation will be considered happen to know for complicated external reasons // that val is rooted under these conditions JL_GC_PROMISE_ROOTED(val); } } Completeness of analysis The analyzer only looks at local information. In particular
    0 码力 | 2007 页 | 6.73 MB | 3 月前
    3
  • pdf文档 Julia 1.11.5 Documentation

    results. This corresponds to the -ffast-math option of clang. • Write @simd in front of for loops to promise that the iterations are independent and may be re- ordered. Note that in many cases, Julia can automatically JL_DLLEXPORT jl_value_t *jl_apply_array_type(jl_value_t *type, size_t dim) JL_ALWAYS_LEAFTYPE; JL_GC_PROMISE_ROOTED This is a function-like annotation. Any value passed to this annotation will be considered happen to know for complicated external reasons // that val is rooted under these conditions JL_GC_PROMISE_ROOTED(val); } } Completeness of analysis The analyzer only looks at local information. In particular
    0 码力 | 2007 页 | 6.73 MB | 3 月前
    3
  • pdf文档 Julia 1.11.6 Release Notes

    results. This corresponds to the -ffast-math option of clang. • Write @simd in front of for loops to promise that the iterations are independent and may be re- ordered. Note that in many cases, Julia can automatically JL_DLLEXPORT jl_value_t *jl_apply_array_type(jl_value_t *type, size_t dim) JL_ALWAYS_LEAFTYPE; JL_GC_PROMISE_ROOTED This is a function-like annotation. Any value passed to this annotation will be considered happen to know for complicated external reasons // that val is rooted under these conditions JL_GC_PROMISE_ROOTED(val); } } Completeness of analysis The analyzer only looks at local information. In particular
    0 码力 | 2007 页 | 6.73 MB | 3 月前
    3
  • pdf文档 julia 1.13.0 DEV

    results. This corresponds to the -ffast-math option of clang. • Write @simd in front of for loops to promise that the iterations are independent and may be re- ordered. Note that in many cases, Julia can automatically JL_DLLEXPORT jl_value_t *jl_apply_array_type(jl_value_t *type, size_t dim) JL_ALWAYS_LEAFTYPE; JL_GC_PROMISE_ROOTED This is a function-like annotation. Any value passed to this annotation will be considered happen to know for complicated external reasons // that val is rooted under these conditions JL_GC_PROMISE_ROOTED(val); } }CHAPTER 106. DOCUMENTATION OF JULIA'S INTERNALS 1974 Completeness of analysis
    0 码力 | 2058 页 | 7.45 MB | 3 月前
    3
  • pdf文档 Julia 1.12.0 RC1

    results. This corresponds to the -ffast-math option of clang. • Write @simd in front of for loops to promise that the iterations are independent and may be re- ordered. Note that in many cases, Julia can automatically JL_DLLEXPORT jl_value_t *jl_apply_array_type(jl_value_t *type, size_t dim) JL_ALWAYS_LEAFTYPE; JL_GC_PROMISE_ROOTED This is a function-like annotation. Any value passed to this annotation will be considered happen to know for complicated external reasons // that val is rooted under these conditions JL_GC_PROMISE_ROOTED(val); } } Completeness of analysis The analyzer only looks at local information. In particular
    0 码力 | 2057 页 | 7.44 MB | 3 月前
    3
  • pdf文档 Julia 1.12.0 Beta4

    results. This corresponds to the -ffast-math option of clang. • Write @simd in front of for loops to promise that the iterations are independent and may be re- ordered. Note that in many cases, Julia can automatically JL_DLLEXPORT jl_value_t *jl_apply_array_type(jl_value_t *type, size_t dim) JL_ALWAYS_LEAFTYPE; JL_GC_PROMISE_ROOTED This is a function-like annotation. Any value passed to this annotation will be considered happen to know for complicated external reasons // that val is rooted under these conditions JL_GC_PROMISE_ROOTED(val); } } Completeness of analysis The analyzer only looks at local information. In particular
    0 码力 | 2057 页 | 7.44 MB | 3 月前
    3
  • pdf文档 Julia 1.12.0 Beta3

    results. This corresponds to the -ffast-math option of clang. • Write @simd in front of for loops to promise that the iterations are independent and may be re- ordered. Note that in many cases, Julia can automatically JL_DLLEXPORT jl_value_t *jl_apply_array_type(jl_value_t *type, size_t dim) JL_ALWAYS_LEAFTYPE; JL_GC_PROMISE_ROOTED This is a function-like annotation. Any value passed to this annotation will be considered happen to know for complicated external reasons // that val is rooted under these conditions JL_GC_PROMISE_ROOTED(val); } } Completeness of analysis The analyzer only looks at local information. In particular
    0 码力 | 2057 页 | 7.44 MB | 3 月前
    3
共 11 条
  • 1
  • 2
前往
页
相关搜索词
ComprehensiveRust繁体中文繁体中文julia1.1010Julia1.11DocumentationReleaseNotes1.13DEV1.12RC1Beta4Beta3
IT文库
关于我们 文库协议 联系我们 意见反馈 免责声明
本站文档数据由用户上传或本站整理自互联网,不以营利为目的,供所有人免费下载和学习使用。如侵犯您的权益,请联系我们进行删除。
IT文库 ©1024 - 2025 | 站点地图
Powered By MOREDOC AI v3.3.0-beta.70
  • 关注我们的公众号【刻舟求荐】,给您不一样的精彩
    关注我们的公众号【刻舟求荐】,给您不一样的精彩