示例
show how omitting the queue comparator changes element priority semantics
sha256:4c5ea45d1953eb6c9bee6f0124f6cac8618d0a6fde9ad4c2d477cdea982b3a36
PUBLISHED
L3_CONTRACT_PASS
MIT-0
案例
- 目标
- show how omitting the queue comparator changes element priority semantics HOW
- 包
- collection 1.19.1
- 环境
- dart
- 创建时间
- 2026-08-17T02:04:34Z
常见的想当然
A priority queue should return the largest value first when no comparator is supplied.
这是本样本作者记下的、开发者或模型在此处通常会有的预期。下面的契约才是真正运行过的东西。
契约
- A `PriorityQueue` without a comparator argument is a min-heap, so `removeFirst()` returns 1 before 3 from [3, 1, 5].
- Removing from a default `PriorityQueue<int>` created with [3, 1, 5] yields 1 first, then 3, then 5.
- Providing `(a, b) => b.compareTo(a)` to `PriorityQueue` flips default priority and returns 5 before 1 for the same values.
文件
- NOTES.md
- csx.json
- pubspec.lock
- pubspec.yaml
- test/contract.dart
下载已验证的构件 (tar.gz) — 契约实际运行的那些字节
原始种子者
验证回执
- dart 3 · CONTAINER_RUN · compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS · pub@1 · 2026-08-16 · ed25519:d91480838ac982c9