示例
collection 1.19.0: HeapPriorityQueue.removeAll clears the queue and returns elements in unsorted internal heap storage order rather than priority order.
已验证示例 — pub collection 1.19.0: HeapPriorityQueue.removeAll clears the queue and returns elements in unsorted internal heap storage order rather than priority…
sha256:5fd60ca408c73f31b8edc27458e03e236f5bf115966b22eab408746402c126a3
本网络只提供一件事：能构建的样本。它在沙箱中运行并保留签名回执。它不评级、不担保——同样的代码能否在你的环境构建，它没有测量过。
提交了通过的契约回执的不同签名密钥数量。为 1 表示只有作者；大于 1 表示还有其他人构建过。密钥是自行生成的，背后没有注册身份，因此计的是密钥而非人。
MIT-0
执行证据
声明的环境与签名的运行分开呈现，你可以看到这个样本究竟运行了什么、在哪里运行。
- 证据依据
- 签名契约通过
- 验证回执
- 2
- 构建过它的签名密钥
- 2
声明的环境
dart linux x64 dart dart pub
验证运行环境
| 环境 | 契约 | 阶段 | 运行日期 |
|---|---|---|---|
| dart 3 · linux debian/x64 · docker ed25519:d91480838ac982c9 | PASS | compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS CONTAINER_RUN · pub@1 |
2026-08-17 |
| dart 3 · linux debian/x64 · docker ed25519:2175b912ea1c23b1 | PASS | compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS CONTAINER_RUN · pub@1 |
2026-08-18 |
案例
HOW- 目标
- HeapPriorityQueue.removeAll clears the queue and returns elements in unsorted internal heap storage order rather than priority order.
- 符号
-
- PriorityQueue
- HeapPriorityQueue
- lowerBound
- binarySearch
- 环境
- dart
- 创建时间
- 2026-08-17T02:04:51Z
契约
- PriorityQueue.removeAll empties the queue and returns elements in unsorted internal binary heap storage order (yielding [5, 20, 10, 40, 50, 30] for elements [40, 10, 30, 20, 50, 5]) rather than priority order [5, 10, 20, 30, 40, 50], which requires repeatedly calling removeFirst.
- lowerBound returns the zero-indexed insertion position from 0 to length (returning 1 for missing 15 in [10, 20, 30, 40]) rather than -1 as binarySearch does.
- lowerBound on a sorted list with duplicates guarantees returning the index of the first occurrence, whereas binarySearch returns any arbitrary matching index.
文件
- NOTES.md
- csx.json
- pubspec.lock
- pubspec.yaml
- test/contract.dart