# Copyright (c) 2001,2003 Akinori MUSHA <knu@iDaemons.org>
# All rights reserved. You can redistribute and/or modify it under
# the same terms as Ruby.
# $Idaemons: /home/cvs/rb/abbrev.rb,v 1.2 2001/05/30 09:37:45 knu Exp $
# $RoughId: abbrev.rb,v 1.4 2003/10/14 19:45:42 knu Exp $
# $Id: abbrev.rb 11708 2007-02-12 23:01:19Z shyouhei $
# Calculate the set of unique abbreviations for a given set of strings.
# pp Abbrev::abbrev(['ruby', 'rules']).sort
# Also adds an +abbrev+ method to class +Array+.
# Given a set of strings, calculate the set of unambiguous
# abbreviations for those strings, and return a hash where the keys
# are all the possible abbreviations and the values are the full
# strings. Thus, given input of "car" and "cone", the keys pointing
# to "car" would be "ca" and "car", while those pointing to "cone"
# would be "co", "con", and "cone".
# The optional +pattern+ parameter is a pattern or a string. Only
# those input strings matching the pattern, or begging the string,
# are considered for inclusion in the output hash
def abbrev(words, pattern = nil)
pattern = /^#{Regexp.quote(pattern)}/ # regard as a prefix
next if (abbrev = word).empty?
while (len = abbrev.rindex(/[\w\W]\z/)) > 0
next if pattern && pattern !~ abbrev
next if pattern && pattern !~ word
# Calculates the set of unambiguous abbreviations for the strings in
# +self+. If passed a pattern or a string, only the strings matching
# the pattern or starting with the string are considered.
# %w{ car cone }.abbrev #=> { "ca" => "car", "car" => "car",
# "co" => "cone", "con" => cone",
def abbrev(pattern = nil)
Abbrev::abbrev(self, pattern)