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

无数据

分类

全部后端开发(87)Julia(87)

语言

全部英语(76)中文(繁体)(10)中文(简体)(1)

格式

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

    。Julia 的包加载机制不要求包名称是全局唯一的, 即使在单个项目的依赖关系图中也是如此。相反,包由通用唯一标识符 (UUID)进行标识,它在每 个包创建时进行分配。通常,您不必直接使用这些有点麻烦的 128 位标识符,因为 Pkg 将负责生成 和跟踪它们。但是,这些 UUID 为问题「X 所指的包是什么?」提供了确定的答案 由于去中心化的命名问题有些抽象,因此可以通过具体情境来理解问题。假设你正在开发一个名为 继续正常工作依赖于他们两者,因此表达式 import Priv 必须引用不同的 Priv 包, 具体取决于它是出现在 App 的代码中还是出现在 Pub 的代码中。为了处理这种情况,Julia 的包加载 机制通过 UUID 区分两个 Priv 包并根据它(调用 import 的模块)的上下文选择正确的包。这种区分 的工作原理取决于环境,如以下各节所述。 29.3 环境(Environments) 环境决定了 import name::Symbol ⟶ uuid::UUID 环境的 roots 映射将包名称分配给 UUID,以获取环境可用于主项目的所有顶级依赖项(即可 以在 Main 中加载的那些依赖项)。当 Julia 在主项目中遇到 import X 时,它会将 X 的标识作为 roots[:X]。 • graph: context::UUID ⟶ name::Symbol ⟶ uuid::UUID 环境的 graph
    0 码力 | 1238 页 | 4.59 MB | 1 年前
    3
  • pdf文档 Julia v1.6.6 Documentation

    code. To handle this, Julia's package loading mechanism distinguishes the two Priv packages by their UUID and picks the correct one based on its context (the module that called import). How this distinction locate the source code of X. The specific roles of the three maps are: • roots: name::Symbol ⟶ uuid::UUID An environment's roots map assigns package names to UUIDs for all the top-level dependencies that identity of X as roots[:X]. • graph: context::UUID ⟶ name::Symbol ⟶ uuid::UUID An environment's graph is a multilevel map which assigns, for each context UUID, a map from names to UUIDs, similar to the
    0 码力 | 1324 页 | 4.54 MB | 1 年前
    3
  • pdf文档 Julia 1.6.5 Documentation

    code. To handle this, Julia's package loading mechanism distinguishes the two Priv packages by their UUID and picks the correct one based on its context (the module that called import). How this distinction locate the source code of X. The specific roles of the three maps are: • roots: name::Symbol ⟶ uuid::UUID An environment's roots map assigns package names to UUIDs for all the top-level dependencies that identity of X as roots[:X]. • graph: context::UUID ⟶ name::Symbol ⟶ uuid::UUID An environment's graph is a multilevel map which assigns, for each context UUID, a map from names to UUIDs, similar to the
    0 码力 | 1325 页 | 4.54 MB | 1 年前
    3
  • pdf文档 Julia 1.6.7 Documentation

    code. To handle this, Julia's package loading mechanism distinguishes the two Priv packages by their UUID and picks the correct one based on its context (the module that called import). How this distinction locate the source code of X. The specific roles of the three maps are: • roots: name::Symbol ⟶ uuid::UUID An environment's roots map assigns package names to UUIDs for all the top-level dependencies that identity of X as roots[:X]. • graph: context::UUID ⟶ name::Symbol ⟶ uuid::UUID An environment's graph is a multilevel map which assigns, for each context UUID, a map from names to UUIDs, similar to the
    0 码力 | 1324 页 | 4.54 MB | 1 年前
    3
  • pdf文档 Julia 1.6.1 Documentation

    code. To handle this, Julia's package loading mechanism distinguishes the two Priv packages by their UUID and picks the correct one based on its context (the module that called import). How this distinction locate the source code of X. The specific roles of the three maps are: • roots: name::Symbol ⟶ uuid::UUID An environment's roots map assigns package names to UUIDs for all the top-level dependencies that identity of X as roots[:X]. • graph: context::UUID ⟶ name::Symbol ⟶ uuid::UUID An environment's graph is a multilevel map which assigns, for each context UUID, a map from names to UUIDs, similar to the
    0 码力 | 1397 页 | 4.59 MB | 1 年前
    3
  • pdf文档 Julia 1.6.4 Documentation

    code. To handle this, Julia's package loading mechanism distinguishes the two Priv packages by their UUID and picks the correct one based on its context (the module that called import). How this distinction locate the source code of X. The specific roles of the three maps are: • roots: name::Symbol ⟶ uuid::UUID An environment's roots map assigns package names to UUIDs for all the top-level dependencies that identity of X as roots[:X]. • graph: context::UUID ⟶ name::Symbol ⟶ uuid::UUID An environment's graph is a multilevel map which assigns, for each context UUID, a map from names to UUIDs, similar to the
    0 码力 | 1324 页 | 4.54 MB | 1 年前
    3
  • pdf文档 Julia 1.6.2 Documentation

    code. To handle this, Julia's package loading mechanism distinguishes the two Priv packages by their UUID and picks the correct one based on its context (the module that called import). How this distinction locate the source code of X. The specific roles of the three maps are: • roots: name::Symbol ⟶ uuid::UUID An environment's roots map assigns package names to UUIDs for all the top-level dependencies that identity of X as roots[:X]. • graph: context::UUID ⟶ name::Symbol ⟶ uuid::UUID An environment's graph is a multilevel map which assigns, for each context UUID, a map from names to UUIDs, similar to the
    0 码力 | 1324 页 | 4.54 MB | 1 年前
    3
  • pdf文档 Julia 1.6.0 Documentation

    code. To handle this, Julia's package loading mechanism distinguishes the two Priv packages by their UUID and picks the correct one based on its context (the module that called import). How this distinction locate the source code of X. The specific roles of the three maps are: • roots: name::Symbol ⟶ uuid::UUID An environment's roots map assigns package names to UUIDs for all the top-level dependencies that identity of X as roots[:X]. • graph: context::UUID ⟶ name::Symbol ⟶ uuid::UUID An environment's graph is a multilevel map which assigns, for each context UUID, a map from names to UUIDs, similar to the
    0 码力 | 1397 页 | 4.59 MB | 1 年前
    3
  • pdf文档 Julia 1.6.3 Documentation

    code. To handle this, Julia's package loading mechanism distinguishes the two Priv packages by their UUID and picks the correct one based on its context (the module that called import). How this distinction locate the source code of X. The specific roles of the three maps are: • roots: name::Symbol ⟶ uuid::UUID An environment's roots map assigns package names to UUIDs for all the top-level dependencies that identity of X as roots[:X]. • graph: context::UUID ⟶ name::Symbol ⟶ uuid::UUID An environment's graph is a multilevel map which assigns, for each context UUID, a map from names to UUIDs, similar to the
    0 码力 | 1325 页 | 4.54 MB | 1 年前
    3
  • pdf文档 Julia 1.6.0 DEV Documentation

    code. To handle this, Julia's package loading mechanism distinguishes the two Priv packages by their UUID and picks the correct one based on its context (the module that called import). How this distinction locate the source code of X. The specific roles of the three maps are: • roots: name::Symbol ⟶ uuid::UUID An environment's roots map assigns package names to UUIDs for all the top-level dependencies that identity of X as roots[:X]. • graph: context::UUID ⟶ name::Symbol ⟶ uuid::UUID An environment's graph is a multilevel map which assigns, for each context UUID, a map from names to UUIDs, similar to the
    0 码力 | 1383 页 | 4.56 MB | 1 年前
    3
共 87 条
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 9
前往
页
相关搜索词
Julia中文文档v16.6Documentation1.6DEV
IT文库
关于我们 文库协议 联系我们 意见反馈 免责声明
本站文档数据由用户上传或本站整理自互联网,不以营利为目的,供所有人免费下载和学习使用。如侵犯您的权益,请联系我们进行删除。
IT文库 ©1024 - 2025 | 站点地图
Powered By MOREDOC AI v3.3.0-beta.70
  • 关注我们的公众号【刻舟求荐】,给您不一样的精彩
    关注我们的公众号【刻舟求荐】,给您不一样的精彩