- 综合排序
- 最热优先
- 最新优先
- 来自专栏编舟记
Rust 入门 (Rust Rocks)
做区块链的基本几乎没有人不知道 Rust 这门编程语言，它非常受区块链底层开发人员的青睐。说来也奇怪，Rust 起源于 Mazilla，唯一大规模应用就是 Firefox，作为小众语言却在区块链圈子里火了。这其中应该和以太坊的发起人 Govin Wood 创建的 Parity 项目有关，Parity 是一款用 Rust 编写的以太坊客户端。
2.8K33发布于 2019-09-24 - 来自专栏腾讯数据库技术
TX-Rocks Sum性能调优之旅
但是，测试也发现TXRocks的sum性能较差，只有InnoDB的60%左右(InnoDB耗时38.29s, TX-Rocks耗时 62.8s)。
1K21发布于 2019-01-08 - 来自专栏Skemaloop
gRPC rocks build your first gRPC service(part 2)
In the previous aritile, we have created the schema. In this article, I will introduce how to generate the stub and server code.
37720编辑于 2022-04-10 - 来自专栏Skemaloop
gRPC rocks build your first gRPC service(part 1)
If you are a beginner, you must have been frustrated by the complexity of using protoc to build a gRPC service. The protoc compiler is powerful, but not newbee friendly. In this series of articles, I will explain how I build gRPC services in a toolkit called Skemaloop, in which you will find that building a gRPC service is quite easy.
32430编辑于 2022-04-10 - 来自专栏携程技术
开源 | 携程 Redis On Rocks 实践，节省 23 Redis成本
因此我们研发了ROR(Redis-On-Rocks)产品，通过对redis内核增强以支持数据冷热交换，使用磁盘扩展缓存容量，可节省约2/3成本，而性能也能满足大多数业务需求。 六、项目开源与未来计划 6.1 项目开源 目前ROR(Redis-On-Rocks)已开源，采用与Redis一致的BSD协议。
2.3K40编辑于 2023-11-20 - 来自专栏码匠的流水账
聊聊Spring AI的ChromaVectorStore
testAddAndSearch() { List<Document> documents = List.of( new Document("Spring AI rocks Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!" {metadata_string}\n\n{content}"},"formattedContent":"distance: 0.4350912\nmeta1: meta1\n\nSpring AI rocks Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!" Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!"}
42410编辑于 2025-04-05 - 来自专栏码匠的流水账
聊聊Spring AI的ChromaVectorStore
testAddAndSearch() { List<Document> documents = List.of( new Document("Spring AI rocks Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!" {metadata_string}\n\n{content}"},"formattedContent":"distance: 0.4350912\nmeta1: meta1\n\nSpring AI rocks Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!" Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!"}
25100编辑于 2025-04-06 - 来自专栏码匠的流水账
聊聊Spring AI的RedisVectorStore
Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!" Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!" Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!"} Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!" Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!"}
68410编辑于 2025-04-06 - 来自专栏python3
Perl Learning - 3 (A
$rocks[0]='bedrock'; $rocks[1]='slate'; $rocks[2]='lava'; $rocks[3]='crushed rock'; $rocks[99]='schist There are two ways to directly get the last element of an array: $rocks[$#rocks]='hard rock'; $rocks[ -1]='hard rock'; $#rocks is the index of last element, both above ways are correct, but [-1] is more $#rocks) ($m, 17) # two values ($m+$0, $p+$q) # two values The last 4 examples shows element can be variable @rocks=qw/bedrock slate lava/; @tiny=(); # empty list @stuff=(@giant, undef, @giant);
1.5K20发布于 2020-01-10 - 来自专栏Michael阿明学习之路
LeetCode 6075. 装满石头的背包的最大数量（贪心）
给你两个下标从 0 开始的整数数组 capacity 和 rocks 。 第 i 个背包最大可以装 capacity[i] 块石头，当前已经装了 rocks[i] 块石头。 示例 1： 输入：capacity = [2,3,4,5], rocks = [1,2,4,4], additionalRocks = 2 输出：3 解释： 1 块石头放入背包 0 ，1 块石头放入背包 示例 2： 输入：capacity = [10,2,2], rocks = [2,2,0], additionalRocks = 100 输出：3 解释： 8 块石头放入背包 0 ，2 块石头放入背包 提示： n == capacity.length == rocks.length 1 <= n <= 5 * 10^4 1 <= capacity[i] <= 10^9 0 <= rocks[i] <= : List[int], additionalRocks: int) -> int: need = [capacity[i]-rocks[i] for i in range(len(rocks
43810编辑于 2022-05-23 【POJ】3258 - River Hopscotch（二分）
Along the river between the starting and ending rocks, N (0 ≤ N ≤ 50,000) more rocks appear, each at He plans to remove several rocks in order to increase the shortest distance a cow will have to jump to He knows he cannot remove the starting and ending rocks, but he calculates that he has enough resources to remove up to M rocks (0 ≤ M ≤ N). No two rocks share the same position.
24510编辑于 2025-08-26- 来自专栏码匠的流水账
聊聊Spring AI的PgVectorStore
testAddAndSearch() { List<Document> documents = List.of( new Document("Spring AI rocks Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!" metadata_string}\n\n{content}"},"formattedContent":"distance: 0.43509135\nmeta1: meta1\n\nSpring AI rocks Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!" Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!"}
47910编辑于 2025-04-07 - 来自专栏白石
Groovy 使用Builder AST 转换为流式API
.build() // Create instance of Message assert message.body == 'Groovy rocks!' body } def message = Message.initiator() .from('mrhaki@mrhaki.com') .body('Groovy rocks .create() assert message.body == 'Groovy rocks!' .build() assert message.body == 'Groovy rocks!' assert message.body == 'Groovy rocks!'
1.2K50发布于 2019-09-18 - 来自专栏码匠的流水账
聊聊Spring AI的MilvusVectorStore
testAddAndSearch() { List <Document> documents = List.of( new Document("Spring AI rocks Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!" Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!" metadata":{"distance":0.43509113788604736,"meta1":"meta1"},"score":0.5649088621139526,"text":"Spring AI rocks Spring AI rocks!! Spring AI rocks!! Spring AI rocks!! Spring AI rocks!!"}
74100编辑于 2025-04-04 - 来自专栏加菲猫的VFP
VFP字段Varbinary 的特性，不进行代码页转换意味着什么？
例如，SEEK 0h466F7820526F636B73 跟 SEEK 'Fox Rocks' 将找到同一条记录。 '' + 0h466F7820526F636B73 && 显示 "Fox Rocks" ? Field1 = 'Fox Rocks' && 显示 .T. ? Field1 + 0h00 = 'Fox Rocks' && 显示 .T. ? Field1 = 'Fox Rocks ' && 显示 .F. ? 'Fox Rocks' = Field1 && 显示 .T. ? 'Fox Rocks ' = Field1 && 显示 .T. ? 'Fox Rocks' = Field1 + 0h00 && 显示 .F.
76830编辑于 2022-04-07 - 来自专栏机器学习入门
挑战程序竞赛系列（16）：3.1最大化最小值
static int[] rocks; static int N; public static void main(String[] args) throws IOException { System.in); int L = in.nextInt(); N = in.nextInt(); int M = in.nextInt(); rocks = new int[N + 2]; rocks[0] = 0; for (int i = 1; i <= N; ++i){ rocks[i] = in.nextInt(); } rocks[N+1] = L; Arrays.sort(rocks); lf = 0; remove(int d){ int cnt = 0; for (int i = 1, j = 0; i <= N + 1; ++i){ if (rocks
48620发布于 2019-05-26 - 来自专栏Opensource翻译专栏
通过Luarocks使Lua开发变得容易【Programming】
该命令搜索站点并根据需要安装库（定义为“rocks”）。 什么是编程库？ 如果您是编程的新手，您可能会认为library只是存储书籍的地方。 /local/lib/luarocks/rocks/cmark 通过定义 package.path 变量指向本地 rocks 目录，可以在 Lua 代码中使用该库： package.path = package.path 获取已安装rock的列表 你可以使用 list 选项列出系统上所有已安装的rock： $ luarocks list Installed rocks: ---------------- ) - /home/seth/.luarocks/lib/luarocks/rocks luce scm-0 (installed) - /home/seth/.luarocks/lib/ luarocks/rocks tekui 1.07-1 (installed) - /home/seth/.luarocks/lib/luarocks/rocks 这将显示您在默认安装位置安装的
4.4K00发布于 2019-12-01 - 来自专栏信息安全小学生
DiskDB，一个不用网的数据库
例如： var db = require('diskdb'); db.connect('db', ['articles']); var article = { title : "diskDB rocks db.articles.save(article); // 或者 db.articles.save([article]); 保存后的文件内容如下： [ { "title": "diskDB rocks diskdb'); db.connect('/examples/db', ['articles']); db.articles.find(); /* 返回： [{ title: 'diskDB rocks db = require('diskdb'); db.connect('/examples/db', ['articles']); var query = { title : 'diskDB rocks ' }; var dataToBeUpdate = { title : 'diskDB rocks again!'
79172发布于 2020-09-23 - 来自专栏叶子的开发者社区
LC-3 汇编语言 Nim游戏
Player 1, choose a row and number of rocks: A9 Invalid move. Try again. Player 1, choose a row and number of rocks: 你的程序应保持提示玩家，直到玩家选择有效的输入为止。 2, choose a row and number of rocks: G1 Invalid move. number of rocks: A3 Invalid move. of rocks: A1 ROW A: o ROW B: ROW C: Player 1, choose a row and number of rocks: A* Invalid move.
41720编辑于 2023-07-30 - 来自专栏伪架构师
使用 Helm 部署 Gitlab
--namespace gitlab \ --name core \ --set global.edition=ce \ --set global.hosts.domain=microservice.rocks HOSTS ADDRESS PORTS AGE core-minio minio.microservice.rocks 80, 443 23s core-registry registry.microservice.rocks 80, 443 23s core-unicorn gitlab.microservice.rocks 80, 443 24s 启动完成应该有几个结果： svc/Ingress 获得了地址。
6.7K11发布于 2019-07-24
腾讯云开发者
Copyright © 2013 - 2026 Tencent Cloud. All Rights Reserved. 腾讯云 版权所有
深圳市腾讯计算机系统有限公司 ICP备案/许可证号：粤B2-20090059 
粤公网安备44030502008569号
腾讯云计算（北京）有限责任公司 京ICP证150476号 | 京ICP备11018762号