codesamplex

Exemplo

Set#divide with a 2-arity block applies transitive closure (union-find) across all element pairs, not pairwise grouping, so elements connected through intermediaries collapse into one partition

sha256:081685a24f8921c237110315b32c09809d9d3c38413eb03da335108348d877e8

PUBLISHED L3_CONTRACT_PASS MIT-0

Caso

Objetivo
Set#divide with a 2-arity block applies transitive closure (union-find) across all element pairs, not pairwise grouping, so elements connected through intermediaries collapse into one partition HOW
Pacotes
set 1.1.1
Ambiente
ruby
Criado
2026-08-16T16:53:43Z

O que costuma-se supor

Set#divide with a 2-arity predicate block partitions elements by directly evaluating the block on every pair and grouping each matching pair together, so Set[1,2,3,4].divide { |a,b| (a-b).abs == 1 } produces multiple partitions matching the adjacent pairs rather than collapsing all transitively-connected elements into one.

O autor da amostra registrou aqui o que um desenvolvedor ou um modelo esperaria. O contrato abaixo é o que de fato rodou.

Contrato

Arquivos

Baixar o artefato verificado (tar.gz) — exatamente os bytes contra os quais o contrato rodou

Seeder de origem

csx-seed

Recibos de verificação