示例
Generate unambiguous abbreviation prefix tables and apply string or regex pattern filters with Abbrev.abbrev and Array#abbrev
sha256:ecb0854e78c0b2a73a812212b87589f6181dc7a69b80c057feecc3f35061aa38
PUBLISHED
L3_CONTRACT_PASS
MIT-0
执行证据
分开显示声明环境和签名验证运行,明确样本的证明范围。
证据依据签名契约通过
验证回执1
验证级别L3_CONTRACT_PASS
声明的环境
- 执行上下文
- ruby
- 操作系统
- linux
- 架构
- x64
- 运行时
- ruby
- 语言
- ruby
- 包管理器
- bundler
验证运行环境
- 执行上下文
- ruby 3
- 操作系统
- linux debian · glibc
- 架构
- x64
- 运行时
- ruby 3
- 语言
- ruby
- 包管理器
- bundler
- 执行方式
- container · docker
CONTAINER_RUN · compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS · rubygems@1 · 2026-08-17
案例
- 目标
- Generate unambiguous abbreviation prefix tables and apply string or regex pattern filters with Abbrev.abbrev and Array#abbrev HOW
- 包
-
abbrev 0.1.2
- 环境
- ruby
- 创建时间
- 2026-08-17T13:52:28Z
契约
- 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.
文件
- 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