queuehash 0.1.0

data/lib/queuehash.rb

@@ -0,0 +1,51 @@
+# A QueueHash is an ordered hash: Keys are ordered according to when they were 
+# inserted.
+#
+# The RubyForge project page is at http://rubyforge.org/projects/queuehash .
+
+require 'delegate'
+
+class QueueHash < DelegateClass( Array )
+	Version = '0.1.0'
+	
+	# Creates a QueueHash with all the elements in <tt>array</tt> as keys, and 
+	# each value initially set to be the same as the corresponding key.
+	def self.new_from_array(array)
+		new( *( ( array.map { |elt| [ elt, elt ] } ).flatten ) )
+	end
+
+	# Takes an even number of arguments, and sets each odd-numbered argument to 
+	# correspond to the argument immediately afterward. For example:
+	#   queueHash = QueueHash.new (1, 2, 3, 4)
+	#   queueHash[1] => 2
+	#   queueHash[3] => 4
+	def initialize(*values)
+		@pairs = []
+		0.step(values.size-1, 2) { |i| @pairs << [ values[i], values[i+1] ] }
+		super( @pairs )
+	end
+	
+	def ==( otherObj )
+		if otherObj.class == QueueHash && otherObj.size == size
+			( 0..size ).all? { |i|
+				keys[i] == otherObj.keys[i] && values[i] == otherObj.values[i]
+			}
+		else
+			false
+		end
+	end
+
+	def [](key)
+		( pair = @pairs.find { |pair| pair[0] == key } ) ? pair.last : nil
+	end
+
+	def []=(key, value); @pairs << [key, value]; end
+
+	def each; @pairs.each { |pair| yield pair[0], pair[1] }; end
+
+	def keys; @pairs.map { |pair| pair[0] }; end
+
+	def values; @pairs.map { |pair| pair[1] }; end
+end
+
+

data/lib/queuehash.rb~

@@ -0,0 +1,45 @@
+require 'delegate'
+
+# An ordered hash: Keys are ordered according to when they were inserted.
+class QueueHash < DelegateClass( Array )
+	# Creates a QueueHash with all the elements in <tt>array</tt> as keys, and 
+	# each value initially set to be the same as the corresponding key.
+	def self.new_from_array(array)
+		new( *( ( array.map { |elt| [ elt, elt ] } ).flatten ) )
+	end
+
+	# Takes an even number of arguments, and sets each odd-numbered argument to 
+	# correspond to the argument immediately afterward. For example:
+	#   queueHash = QueueHash.new (1, 2, 3, 4)
+	#   queueHash[1] => 2
+	#   queueHash[3] => 4
+	def initialize(*values)
+		@pairs = []
+		0.step(values.size-1, 2) { |i| @pairs << [ values[i], values[i+1] ] }
+		super( @pairs )
+	end
+	
+	def ==( otherObj )
+		if otherObj.class == QueueHash && otherObj.size == size
+			( 0..size ).all? { |i|
+				keys[i] == otherObj.keys[i] && values[i] == otherObj.values[i]
+			}
+		else
+			false
+		end
+	end
+
+	def [](key)
+		( pair = @pairs.find { |pair| pair[0] == key } ) ? pair.last : nil
+	end
+
+	def []=(key, value); @pairs << [key, value]; end
+
+	def each; @pairs.each { |pair| yield pair[0], pair[1] }; end
+
+	def keys; @pairs.map { |pair| pair[0] }; end
+
+	def values; @pairs.map { |pair| pair[1] }; end
+end
+
+

metadata

@@ -0,0 +1,40 @@
+--- !ruby/object:Gem::Specification 
+rubygems_version: 0.8.6
+specification_version: 1
+name: queuehash
+version: !ruby/object:Gem::Version 
+  version: 0.1.0
+date: 2005-06-08
+summary: "A QueueHash is an ordered hash: Keys are ordered according to when they were
+  inserted."
+require_paths: 
+  - lib
+email: sera@fhwang.net
+homepage: http://queuehash.rubyforge.org/
+rubyforge_project: 
+description: "A QueueHash is an ordered hash: Keys are ordered according to when they were
+  inserted."
+autorequire: queuehash
+default_executable: 
+bindir: bin
+has_rdoc: false
+required_ruby_version: !ruby/object:Gem::Version::Requirement 
+  requirements: 
+    - 
+      - ">"
+      - !ruby/object:Gem::Version 
+        version: 0.0.0
+  version: 
+platform: ruby
+authors: 
+  - Francis Hwang
+files: 
+  - lib/queuehash.rb
+  - lib/queuehash.rb~
+test_files: []
+rdoc_options: []
+extra_rdoc_files: []
+executables: []
+extensions: []
+requirements: []
+dependencies: []