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

无数据

分类

全部综合其他(80)Weblate(60)后端开发(19)系统运维(19)httpd(17)Blender(9)Krita(6)KiCad(5)Python(4)区块链(3)

语言

全部中文(简体)(122)

格式

全部PDF文档 PDF(65)其他文档 其他(57)
 
本次搜索耗时 0.072 秒,为您找到相关结果约 122 个.
  • 全部
  • 综合其他
  • Weblate
  • 后端开发
  • 系统运维
  • httpd
  • Blender
  • Krita
  • KiCad
  • Python
  • 区块链
  • 全部
  • 中文(简体)
  • 全部
  • PDF文档 PDF
  • 其他文档 其他
  • 默认排序
  • 最新排序
  • 页数排序
  • 大小排序
  • 全部时间
  • 最近一天
  • 最近一周
  • 最近一个月
  • 最近三个月
  • 最近半年
  • 最近一年
  • pdf文档 1 Beautiful Python

    NON-NEGATIVE INTEGERS Inspired by the intset example in chapter 6 of The Go Programming Language by A. Donovan and B. Kernighan An empty set is represented by zero.
 A set of integers {a, b, c} is offsets a, b, and c. Source code: 62 https://github.com/standupdev/uintset REPRESENTING SETS OF INTEGERS AS BIT PATTERNS This set: UintSet({13, 14, 22, 28, 38, 53, 64, 76, 94, 102, 107, 121, 136, 143 169, 173, 187, 201, 213, 216, 234, 247, 257, 268, 283, 288, 290}) 63 REPRESENTING SETS OF INTEGERS AS BIT PATTERNS This set: UintSet({13, 14, 22, 28, 38, 53, 64, 76, 94, 102, 107, 121, 136, 143
    0 码力 | 109 页 | 34.99 MB | 1 年前
    3
  • pdf文档 Rust算法教程 The Algos (algorithms)

    } #[test] fn success_search_integers() { let integers = vec![0, 10, 20, 30, 40, 50, 60, 70, 80, 90]; for (index, target) in integers.iter().enumerate() { assert_eq binary_search_rec(&integers, target, &LEFT, &integers.len()), Some(index) ) } } #[test] fn fail_search_integers() { let integers = vec![0, 10, 20 target in &[100, 444, 336] { assert_eq!( binary_search_rec(&integers, target, &LEFT, &integers.len()), None ); } } #[test] fn fa
    0 码力 | 270 页 | 8.46 MB | 1 年前
    3
  • pdf文档 Java 应用与开发 - Java 语言基础与流程控制

    循环结构 O for 循环 1 1 int[] integers = {1, 2, 3, 4}; 3 for (int j = 0; j < integers.length; j++) { 4 int i = integers[j]; 5 System.out.println(i); 6 } O for 循环 2 1 int[] integers = {1, 2, 3, 4}; 3 for for (int i : integers) { 4 System.out.println(i); 5 } 大纲 数据类型 常量和变量 关键字与标识符 运算符与表达式 从键盘获得输入 语句 分支结构 循环结构 循环中的跳转 break 语句 使程序的流程从一个语句块(switch 或循环结构) 内跳出。 continue 语句 终止当前这一轮(次)的循环,进入下一轮(次) 循环。 return
    0 码力 | 37 页 | 685.82 KB | 1 年前
    3
  • pdf文档 Julia 中文文档

    updated the same s created by the initialization s = 0 since we get the correct sum of 55 for the integers 1 through 10. Let’s dig into the fact that the for loop body has its own scope for a second by – 非布尔的整数 – CartesianIndex {N}s,其行为类似于跨越多个维度的 N 维整数元组(详见下文)s, which behave like an N-tuple of integers spanning multiple dimensions (see below for more details) 2. 标量索引数组。这包括: – 整数向量和多维整数数组 – 像 [] values are true. Indexing by a boolean vector B is effectively the same as indexing by the vector of integers that is returned by findall(B). Similarly, indexing by a N-dimensional boolean array is effectively
    0 码力 | 1238 页 | 4.59 MB | 1 年前
    3
  • pdf文档 Python 2.7.18 正则表达式 HOWTO

    homebrew or home-brew. The most complicated repeated qualifier is {m,n}, where m and n are decimal integers. This qualifier means there must be at least m repetitions, and at most n. For example, a/{1,3}b a name with a group. The match object methods that deal with capturing groups all accept either integers that refer to the group by number or strings that contain the desired group’s name. Named groups
    0 码力 | 18 页 | 369.95 KB | 11 月前
    3
  • pdf文档 Python 2.7.18 正则表达式 HOWTO

    homebrew or home-brew. The most complicated repeated qualifier is {m,n}, where m and n are decimal integers. This qualifier means there must be at least m repetitions, and at most n. For example, a/{1,3}b a name with a group. The match object methods that deal with capturing groups all accept either integers that refer to the group by number or strings that contain the desired group’s name. Named groups
    0 码力 | 18 页 | 369.95 KB | 11 月前
    3
  • pdf文档 Python 2.7.18 正则表达式 HOWTO

    homebrew or home-brew. The most complicated repeated qualifier is {m,n}, where m and n are decimal integers. This qualifier means there must be at least m repetitions, and at most n. For example, a/{1,3}b a name with a group. The match object methods that deal with capturing groups all accept either integers that refer to the group by number or strings that contain the desired group’s name. Named groups
    0 码力 | 18 页 | 369.95 KB | 11 月前
    3
  • pdf文档 《Java 应用与开发》课程讲义 - 王晓东

    expression); for 循环 1 1 int [] integers = {1, 2, 3, 4}; 3 for (int j = 0; j < integers.length; j++) { 4 int i = integers[ j ]; 5 System.out.println(i); 6 } for 循环 2 1 int [] integers = {1, 2, 3, 4}; 3 for for (int i : integers) { 4 System.out.println(i); 5 } 循环中的跳转 break 语句 使程序的流程从一个语句块(switch 或循环结构)内跳出。 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
    0 码力 | 330 页 | 6.54 MB | 1 年前
    3
  • pdf文档 Comprehensive Rust(简体中文) 202412

    the ? format parameter: {} gives the default output, {:?} gives the debug output. Types such as integers and strings implement the default output, but arrays only implement the debug output. This means //! 或/*! .. */,这称为“内部文档注释”: //! This module contains functionality relating to divisibility of integers. • Show students the generated docs for the rand crate at https://docs.rs/rand. 16.3 Option 我 function next to hello_from_rust. Some suggestions: adding two integers received as arguments, computing the nth Fibonacci number, summing integers in a slice, etc. • Add a separate ..._unittest.rs file with
    0 码力 | 359 页 | 1.33 MB | 10 月前
    3
  • pdf文档 KiCad PCB 编辑器 6.0

    measurement resolution of all objects in KiCad is 1 nanometer, and measurements are stored as 32-bit integers. This means it is possible to create boards up to approximately 4 meters by 4 meters. KiCad 目前支持每个工程/原理图一个电路板文件。 component’s outline and dimensions. The component outline section contains fields which are strings, integers, or floating point numbers. A string is a combination of characters which may include spaces; if
    0 码力 | 101 页 | 4.78 MB | 1 年前
    3
共 122 条
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 13
前往
页
相关搜索词
BeautifulPythonRust教程TheAlgoalgorithmJavalanguagebasicandflowcontrolpdfJulia中文文档正则表达达式表达式正则表达式HOWTO2.718lecturenotesforApplicationDevelopmentComprehensive简体简体中文202412KiCadPCB编辑编辑器6.0
IT文库
关于我们 文库协议 联系我们 意见反馈 免责声明
本站文档数据由用户上传或本站整理自互联网,不以营利为目的,供所有人免费下载和学习使用。如侵犯您的权益,请联系我们进行删除。
IT文库 ©1024 - 2025 | 站点地图
Powered By MOREDOC AI v3.3.0-beta.70
  • 关注我们的公众号【刻舟求荐】,给您不一样的精彩
    关注我们的公众号【刻舟求荐】,给您不一样的精彩