rhash 0.0.1

data/lib/rhash.rb

@@ -0,0 +1,303 @@
+class Symbol
+  def <=>(other)
+    self.to_s <=> other.to_s
+  end
+end
+
+class Info
+	attr_accessor :key
+	attr_accessor :value
+	
+	def to_s
+		"#{key.inspect} => #{value.inspect}"
+	end
+end
+	
+class RHash
+	def initialize(&block)
+		@hash = []
+		@default = block if block_given?
+	end
+	
+	def [] key
+		@hash.each do |info|
+			return info.value if key == info.key
+		end
+		raise "Hash não possui key '#{key}'"
+	end	
+	
+	def []= key, value
+		info = Info.new
+		info.key = key
+		info.value = value
+		
+		if new_hash_entry? info
+			@hash << info
+		else
+			update_key	info
+		end
+	end	
+	
+	def inspect		
+		msg = '{'
+		@hash.each_with_index do |info, index|
+			msg += info.to_s
+			msg += ", " if @hash.size > 1 and index + 1 < @hash.size 
+		end
+		msg += '}'
+		msg
+	end
+	
+	def sort
+		int_sort
+	end
+	
+	def sort!
+		new_hash = int_sort
+		@hash = new_hash
+		@hash
+	end	
+	
+	def sort_each(&block)
+		new_hash = int_sort
+		new_hash.each do |info|
+			yield info if block_given?
+		end
+	end
+	
+	def each(&block)
+		@hash.each do |info|
+			yield info if block_given?
+		end
+	end
+	
+	def each_pair(&block)
+		@hash.each do |info|
+			yield info.key, info.value if block_given?
+		end
+	end	
+	
+	def each_value(&block)
+		array(:value).each do |value|
+			yield value if block_given?
+		end	
+	end	
+	
+	def each_key(&block)
+		array(:key).each do |value|
+			yield value if block_given?
+		end	
+	end	
+	
+	def select(&block)
+		selected_entries = []
+		@hash.each do |info|
+			if block_given?
+				if yield info 
+					selected_entries << info
+				end
+			end
+		end
+		selected_entries
+	end	
+	
+	def keys
+		new_array = []
+		@hash.each{|info| new_array << info.key}
+		new_array
+	end	
+	
+	def values	
+		new_array = []
+		@hash.each{|info| new_array << info.value}
+		new_array
+	end	
+	
+	def has_key?(key)
+		@hash.each{|info| return true if info.key == key}
+		false
+	end
+	alias :key? :has_key?
+	alias :member? :has_key?
+	
+	def has_value?(value)
+		@hash.each{|info| return true if info.value == value}
+		false
+	end		
+	alias :value? :has_value?
+	
+	def delete_if(&block)
+		@hash.delete_if{|info| yield info.key, info.value if block_given?}
+	end
+	
+	def delete(key, &block)
+		deleted = nil
+		@hash.delete_if{|info| info.key == key; deleted = info if info.key == key}
+		yield key.inspect if block_given? and !deleted
+		return "Deleted: #{deleted.key.inspect} => #{deleted.value.inspect}" if deleted
+	end
+	
+	def size
+		@hash.size
+	end
+	alias :length :size
+		
+	def invert
+		new_hash = RHash.new
+		@hash.each do |i|
+			new_hash[i.value] = i.key
+		end
+		new_hash
+	end
+	
+	def to_s
+		inspect
+	end
+	
+	def merge(rhash)
+		new_hash = RHash.new
+		raise "Não é uma Hash ou RHash" unless rhash.is_a? RHash or rhash.is_a? Hash
+		
+		# Problema com o clone/dup Object.
+		@hash.each do |i|
+			new_hash[i.key] = i.value
+		end
+		
+		if rhash.is_a? RHash
+			rhash.each do |info|
+				new_hash[info.key] = info.value
+			end
+		else
+			rhash.each_pair do |key, value|
+				new_hash[key] = value
+			end	
+		end
+		
+		new_hash
+	end	
+	
+	def merge!(rhash)
+		raise "Não é uma Hash ou RHash" unless rhash.is_a? RHash or rhash.is_a? Hash
+		if rhash.is_a? RHash
+			rhash.each do |info|
+				self[info.key] = info.value
+			end
+		else
+			rhash.each_pair do |key, value|
+				self[key] = value
+			end	
+		end
+	end
+	
+	def first
+		@hash.first
+	end
+	
+	def last 
+		@hash.last
+	end
+	
+	def fetch(key, msg='', &block)
+		value = select{|i| i.key == key}[0]
+	
+		if block_given? and value.nil?
+			yield
+		else							
+			raise IndexError, "Key (#{key.inspect}): not found" if msg.empty?
+		end	
+	end
+	
+	def clear
+		@hash = []
+	end
+	
+	def default=(value)
+		@default = value
+	end	
+	
+	def default(key)		
+		if @default.is_a? Proc
+			info = Info.new
+			info.key = key
+			info.value = @default.call(self, key)
+			self[info.key] = info.value
+		else
+			info = Info.new
+			info.key = key
+			info.value = @default
+			self[info.key] = info.value	
+		end
+	end	
+	
+	def shift
+		shifted = @hash.shift
+		[shifted.key, shifted.value]
+	end		
+	
+	def empty?
+		@hash.empty?
+	end	
+	
+	def store(key, value)
+		self[key] = value
+	end	
+	
+	def to_a
+		array = []
+		@hash.each do |info|
+			array << [info.key, info.value]
+		end
+		array
+	end	
+	
+	def values_at(*keys)
+		selected = []
+		@hash.each do |info|
+			selected << info.value if keys.include? info.key
+		end
+		selected
+	end
+	
+	# Converte para hash
+	def to_hash
+		pure_hash = {}
+		@hash.each do |info|
+			pure_hash[info.key] = info.value
+		end
+		pure_hash
+	end	
+	
+	private
+	
+	def int_sort
+		new_hash = []
+		new_hash = @hash.sort_by{|info| info.key}
+		new_hash
+	end
+	
+	def array(mode)
+		array = []
+		@hash.each do |info|
+			array << info.__send__(mode.to_sym)
+		end
+		array
+	end	
+	
+	def new_hash_entry? info
+		@hash.each do |e|
+			return false if e.key == info.key
+		end
+		true
+	end
+	
+	def update_key info
+		@hash.each do |e|
+			if e.key == info.key
+				e.value = info.value
+			end	
+		end
+	end	
+end
+
+
+

data/test/test.rb

@@ -0,0 +1,68 @@
+require 'lib/rhash'
+
+n = RHash.new
+n[:g] = 5
+n[:a] = 8
+n[:x] = 105
+n[:xxx] = 105
+
+puts n.inspect
+n.sort!
+puts n.inspect
+#n.sort_each{|i| puts i}
+#n.each_pair{|i, j| puts i; puts j+1}
+#n.each_value{|i| puts i+10}
+#n.each_key{|i| puts i.inspect}
+#puts n.select{|i| i.value > 100}
+#puts n.keys.inspect
+#puts n.values.inspect
+#puts n.has_key?("a")
+#puts n.has_key?(:a)
+#puts n.has_value?(50)
+#puts n.has_value?(105)
+#n.delete_if{|i, j| i == :g}
+#puts n.inspect
+#puts n.delete(:gh){|i| puts "Key #{i} not found"}
+#puts n.inspect
+#puts n.invert
+#puts n.length
+#puts n.size
+#m = RHash.new
+#m[:h] = :garrafa
+#m[:b] = "a"
+#m = {:h => "garrafas", :b => :a}
+#n.merge! m
+#x = n.merge m
+#puts "Hash pós merge"
+#puts x.inspect
+#puts "Hash original"
+#puts n.inspect
+#puts n.inspect
+#puts n.first
+#puts n.last
+#puts n.fetch(:hhh){"hahahahaha"}
+#n.clear
+#puts n.inspect
+#h = RHash.new
+#h.default = "5"
+#h.default(5)
+#puts h.inspect
+#h.default= Proc.new {|h, k| h[k] = k.to_i*10}
+#h.default(5)
+#h.default(10)
+#puts h.inspect
+#h = RHash.new{|h, k| h[k] = k.to_i*10}
+#h.default(5)
+#h.default(10)
+#puts h.inspect
+#puts n.inspect
+#n.shift
+#puts n.inspect
+#n.store(666, 0)
+#puts n.inspect
+#puts n.to_a.inspect
+#puts n.empty?
+#m = RHash.new
+#puts m.empty?
+#puts n.values_at(:a, :xxx).inspect
+

metadata

@@ -0,0 +1,56 @@
+--- !ruby/object:Gem::Specification 
+name: rhash
+version: !ruby/object:Gem::Version 
+  version: 0.0.1
+platform: ruby
+authors: 
+- Rodrigo Mello Nardi
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2010-07-13 00:00:00 -03:00
+default_executable: 
+dependencies: []
+
+description: RHash is an ordenable hash, that is, its method 'sort' returns a Hash and the object remains sorted.
+email: rodrigomellonardi@gmail.com
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- lib/rhash.rb
+- test/test.rb
+has_rdoc: true
+homepage: 
+licenses: []
+
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.3.5
+signing_key: 
+specification_version: 3
+summary: an ordenable hash
+test_files: 
+- test/test.rb