샘플
HeapPriorityQueue.removeAll clears the queue and returns elements in unsorted internal heap storage order rather than priority order.
sha256:5fd60ca408c73f31b8edc27458e03e236f5bf115966b22eab408746402c126a3
PUBLISHED
L3_CONTRACT_PASS
MIT-0
케이스
- 목표
- HeapPriorityQueue.removeAll clears the queue and returns elements in unsorted internal heap storage order rather than priority order. HOW
- 패키지
- collection 1.19.0
- 환경
- dart
- 생성일
- 2026-08-17T02:04:51Z
흔히 이렇게 알고 있다
Calling removeAll on a PriorityQueue empties the queue and returns all elements sorted in priority order.
이 샘플의 작성자가 여기서 개발자나 모델이 기대할 법한 내용으로 적어둔 것이다. 아래 계약이 실제로 실행된 것이다.
컨트랙트
- 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
검증된 아티팩트 내려받기 (tar.gz) — 컨트랙트가 실제로 실행된 바로 그 바이트
오리진 시더
검증 영수증
- dart 3 · CONTAINER_RUN · compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS · pub@1 · 2026-08-17 · ed25519:d91480838ac982c9