#!/usr/local/bin/ruby -w

# $Id: tree2.rb,v 1.1 2000/09/20 07:59:04 kondo Exp kondo $

class Tree
	class Branch<Hash
		def initialize
			@leaf = []
		end
		attr_accessor :leaf
#		def inspect
#			super.inspect + "@leaf: " + @leaf
#		end
	end

	def initialize
		@t = Branch.new
	end

	def add(tree, item)
		ptr = @t
		tree.each do |x|
			ptr[x] = Branch.new unless ptr.has_key? x
			ptr = ptr[x]
		end
		ptr.leaf += [item]
	end

  def _subtree(node, depth)
    return @treefmt % [depth, "..."] if @limit && @limit < depth
    result = ""
    node.sort.each do |k, v|
      result += @treefmt % [depth, k]
			v.leaf.each do |i|
				if @leaffmt.scan('%\d*s').size == 2
					result += @leaffmt % [depth, i] 
				else
					result += @leaffmt % [i] 
				end
			end
      if v.type == Tree::Branch
        result += _subtree(v, depth + @indent)
      end
    end
    result
  end

  def to_s(limit = nil, treefmt = "%s+- %s\n", leaffmt = "%s   %s\n", indent = "  ")
    @treefmt = treefmt
    @leaffmt = leaffmt
    @indent = indent
    @limit = if limit then @indent * limit else nil end
    result = _subtree(@t, "")
    result
  end
end


if __FILE__ == $0
	t = Tree.new
	while gets
		addr, *ext = split
		addr.scan(/^[^@]+@(.*)$/) do |domain|
			t.add(domain[0].downcase.split('.').reverse, addr)
		end
	end
	print t.to_s
end