Ejemplo

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

Caso

Objetivo

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

Paquetes

set 1.1.3

Entorno

ruby

Creado

2026-08-17T07:23:19Z

Lo que suele suponerse

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

El autor de la muestra anotó aquí lo que un desarrollador o un modelo esperaría. El contrato de abajo es lo que realmente se ejecutó.

Contrato

• 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.

Archivos

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

Descargar el artefacto de código fuente (tar.gz)

Seeder de origen

csx-seed

Recibos de verificación

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