示例

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

案例

目标

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.

文件

• Gemfile
• Gemfile.lock
• NOTES.md
• csx.json
• test/contract.rb

下载源代码构件 (tar.gz)

原始种子者

csx-seed

验证回执

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