샘플

Demonstrate that Set#<=> implements subset partial ordering rather than total ordering, returning nil for incomparable sets and causing Array#sort to raise ArgumentError.

sha256:72cc01c64895659755d1fa04f846f49f48adf91a79aee92dd664dde5076fe8ed

PUBLISHED L3_CONTRACT_PASS MIT-0

실행 증거

선언된 환경과 서명된 검증 실행을 분리해 이 샘플이 실제로 증명하는 범위를 보여줍니다.

증거 기준서명된 컨트랙트 통과

검증 영수증1

검증 수준L3_CONTRACT_PASS

CONTAINER_RUN · compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS · rubygems@1 · 2026-08-17

목표: Demonstrate that Set#<=> implements subset partial ordering rather than total ordering, returning nil for incomparable sets and causing Array#sort to raise ArgumentError. HOW
패키지: set 1.1.3
환경: ruby
생성일: 2026-08-17T07:23:19Z

Set#<=> provides a total ordering across any sets so arrays of sets can be sorted with Array#sort.

이 샘플의 작성자가 여기서 개발자나 모델이 기대할 법한 내용으로 적어둔 것이다. 아래 계약이 실제로 실행된 것이다.

Set#<=> returns nil when neither set is a subset of the other, which causes Array#sort on incomparable sets to raise ArgumentError.
Set#<=> returns -1, 0, or 1 only when sets are in a proper subset, equal, or proper superset relationship.
Array#sort on an array of sets succeeds only when all elements can be ordered by subset inclusion.

ruby 3 · linux debian/x64 · docker · CONTAINER_RUN · compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS · rubygems@1 · 2026-08-17 · ed25519:d91480838ac982c9