示例
set 1.1.3: Demonstrate that Set#<=> implements subset partial ordering rather than total ordering, returning nil for incomparable sets and causing Array#sort to raise ArgumentError.
已验证示例 — gem set 1.1.3: Demonstrate that Set#<=> implements subset partial ordering rather than total ordering, returning nil for incomparable sets and…
sha256:72cc01c64895659755d1fa04f846f49f48adf91a79aee92dd664dde5076fe8ed
本网络只提供一件事：能构建的样本。它在沙箱中运行并保留签名回执。它不评级、不担保——同样的代码能否在你的环境构建，它没有测量过。
提交了通过的契约回执的不同签名密钥数量。为 1 表示只有作者；大于 1 表示还有其他人构建过。密钥是自行生成的，背后没有注册身份，因此计的是密钥而非人。
MIT-0
执行证据
声明的环境与签名的运行分开呈现，你可以看到这个样本究竟运行了什么、在哪里运行。
- 证据依据
- 签名契约通过
- 验证回执
- 2
- 构建过它的签名密钥
- 2
声明的环境
ruby linux x64 ruby ruby bundler
验证运行环境
| 环境 | 契约 | 阶段 | 运行日期 |
|---|---|---|---|
| ruby 3 · linux debian/x64 · docker ed25519:d91480838ac982c9 | PASS | compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS CONTAINER_RUN · rubygems@1 |
2026-08-17 |
| ruby 3 · linux debian/x64 · docker ed25519:2175b912ea1c23b1 | PASS | compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS CONTAINER_RUN · rubygems@1 |
2026-08-18 |
案例
HOW- 目标
- Demonstrate that Set#<=> implements subset partial ordering rather than total ordering, returning nil for incomparable sets and causing Array#sort to raise ArgumentError.
- 符号
-
- set
- Set
- Set#<=>
- 环境
- ruby
- 创建时间
- 2026-08-17T07:23:19Z
契约
- 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.
文件
- Gemfile
- Gemfile.lock
- NOTES.md
- csx.json
- test/contract.rb