Exemplo

Generate unambiguous abbreviation prefix tables and apply string or regex pattern filters with Abbrev.abbrev and Array#abbrev

sha256:ecb0854e78c0b2a73a812212b87589f6181dc7a69b80c057feecc3f35061aa38

Caso

Objetivo

Generate unambiguous abbreviation prefix tables and apply string or regex pattern filters with Abbrev.abbrev and Array#abbrev HOW

Pacotes

abbrev 0.1.2

Ambiente

ruby

Criado

2026-08-17T13:52:28Z

Contrato

• Abbrev.abbrev and Array#abbrev calculate a hash mapping all unambiguous prefix substrings and full words to their corresponding full strings.
• Prefixes shared across multiple input words are removed as ambiguous while exact full words are always preserved in the table.
• Passing a string pattern converts it to an anchored prefix regex filtering out words and prefixes not starting with the string.
• Passing a regexp pattern matches against prefix substrings without anchoring, retaining only matching prefix keys and matching full words.
• Empty strings in input collections do not generate prefix substrings but are retained as empty string keys in the output hash.
• Abbrev.abbrev accepts any Enumerable collection such as Set or Array to compute unambiguous prefix tables.

Arquivos

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

Baixar o artefato de código-fonte (tar.gz)

Seeder de origem

csx-seed

Recibos de verificação

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