#!/usr/bin/env julia


# Inspiré du gem abbrev de Ruby
#   http://ruby-doc.org/stdlib-2.5.0/libdoc/abbrev/rdoc/Abbrev.html
#   https://github.com/ruby/ruby/blob/trunk/lib/abbrev.rb
#
# 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 +words+ is "car" and "cone", the keys pointing to "car" would
# be "ca" and "car", while those pointing to "cone" would be "co", "con", and
# "cone".
#
#   abbrev(["car", "cone"])
#   #=> {"ca"=>"car", "con"=>"cone", "co"=>"cone", "car"=>"car", "cone"=>"cone"}
#
# The optional +pattern+ parameter is a pattern or a string. Only input
# strings that match the pattern or start with the string are included in the
# output hash.
#
#   Abbrev.abbrev(%w{car box cone crab}, /b/)
#   #=> {"box"=>"box", "bo"=>"box", "b"=>"box", "crab" => "crab"}
#
#   Abbrev.abbrev(%w{car box cone}, 'ca')
#   #=> {"car"=>"car", "ca"=>"car"}
#
function abbrev(words::Array{String,1}, pat=r".*")
    table = Dict{String, Symbol}()
    seen = Dict{String, Int}()
    for word in words
        length(word)==0 && next
        for len in length(word):-1:1
            abbrev = word[1:len]
            if !ismatch(pat, abbrev)
                continue
            end
            seen[abbrev] = 1 + get(seen, abbrev, 0)
            if seen[abbrev] == 1
                table[abbrev] = word
            elseif seen[abbrev] == 2
                delete!(table, abbrev)
            else
                break
            end
        end
    end
    for word in words
        if !ismatch(pat, word)
            continue
        end
        table[word] = word
    end
    table
end

@show ARGS
@show abbrev(ARGS)
@show abbrev(["car", "cone"])