示例
Find the index of a specific element in a sorted list containing duplicates
sha256:de4d08928887828134110edcd137f83b030f3b508973b92860e7439bf8ec2234
PUBLISHED
L3_CONTRACT_PASS
MIT-0
案例
- 目标
- Find the index of a specific element in a sorted list containing duplicates HOW
- 包
- collection 1.19.1
- 环境
- dart
- 创建时间
- 2026-08-17T02:05:20Z
常见的想当然
binarySearch returns the index of the first occurrence of the target element in the sorted list.
这是本样本作者记下的、开发者或模型在此处通常会有的预期。下面的契约才是真正运行过的东西。
契约
- if (binarySearch(list, 2) != 3) throw 'binarySearch returns an arbitrary match (3) rather than the first occurrence (1)';
- if (lowerBound(list, 2) != 1) throw 'lowerBound returns the first occurrence (1)';
文件
- 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