lib/hashery/dictionary.rb in hashery-1.1.0 vs lib/hashery/dictionary.rb in hashery-1.2.0

@@ -1,26 +1,5 @@
-# = Dictionary.rb
-#
-# Copyright (c) 2005, 2009 Jan Molic, Thomas Sawyer
-#
-# Ruby License
-#
-# This module is free software. You may use, modify, and/or redistribute this
-# software under the same terms as Ruby.
-#
-# This program is distributed in the hope that it will be useful, but WITHOUT
-# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
-# FOR A PARTICULAR PURPOSE.
-#
-# == Acknowledgments
-#
-# * Andrew Johnson (merge, to_a, inspect, shift and Hash[])
-# * Jeff Sharpe    (reverse and reverse!)
-# * Thomas Leitner (has_key? and key?)
-#
-# Ported from OrderHash 2.0, Copyright (c) 2005 Jan Molic
-
 # = Dictionary
 #
 # The Dictionary class is a Hash that preserves order.
 # So it has some array-like extensions also. By defualt
 # a Dictionary object preserves insertion order, but any
@@ -60,9 +39,21 @@
 # * You can use #order_by to set internal sort order.
 # * #<< takes a two element [k,v] array and inserts.
 # * Use ::auto which creates Dictionay sub-entries as needed.
 # * And ::alpha which creates a new Dictionary sorted by key.
 #
+# == Acknowledgments
+#
+# Dictionary is a ported of OrderHash 2.0 Copyright (c) 2005 Jan Molic.
+#
+# People who have contributed to this class since then include:
+#
+# * Andrew Johnson (merge, to_a, inspect, shift and Hash[])
+# * Jeff Sharpe    (reverse and reverse!)
+# * Thomas Leitner (has_key? and key?)
+#
+# Copyright (c) 2005, 2009 Jan Molic, Thomas Sawyer
+
 class Dictionary
 
   include Enumerable
 
   class << self