hamster 0.3.6 → 0.3.7

data/History.rdoc

@@ -1,3 +1,13 @@
+=== 0.3.7 / 2010-05-16
+
+* Initial Queue implementation complete.
+
+* Implement Stack#peek.
+
+* Add Stack#enqueue, #dequeue to reflect the fact that a Stack is also a LIFO Queue.
+
+* Fix incompatibilities with Ruby 1.8.7 syntax.
+
 === 0.3.6 / 2010-05-03
 
 * Hash#put now supports returning a value from a block instead of passing an explicit value. Almost like a substitute for the non-functional []=

data/LICENSE

@@ -1,4 +1,4 @@
-Copyright (c) 2009 Simon Harris
+Copyright (c) 2009-2010 Simon Harris
 
 Permission is hereby granted, free of charge, to any person obtaining
 a copy of this software and associated documentation files (the

data/README.rdoc

@@ -7,7 +7,7 @@
 
 == Introduction
 
-Hamster started out as an implementation of Hash Array Mapped Trees (HAMT) for Ruby (see http://lamp.epfl.ch/papers/idealhashtrees.pdf) and has since expanded to include implementations of other Persistent Data Structures (see http://en.wikipedia.org/wiki/Persistent_data_structure) including Set, List, and Stack.
+Hamster started out as an implementation of Hash Array Mapped Trees (HAMT) for Ruby (see http://lamp.epfl.ch/papers/idealhashtrees.pdf) and has since expanded to include implementations of other Persistent Data Structures (see http://en.wikipedia.org/wiki/Persistent_data_structure) including Set, List, Stack, and Queue.
 
 Hamster collections are immutable. Whenever you modify a Hamster collection, the original is preserved and a modified copy is returned. This makes them inherently thread-safe and sharable. (For an interesting perspective on why immutability itself is inherently a good thing, you might like to take a look at Matthias Felleisen's Function Objects presentation: http://www.ccs.neu.edu/home/matthias/Presentations/ecoop2004.pdf)
 
@@ -35,6 +35,7 @@ If you prefer, you can instead require individual classes as necessary:
   require 'hamster/set'
   require 'hamster/list'
   require 'hamster/stack'
+  require 'hamster/queue'
 
 == Examples
 
@@ -160,6 +161,8 @@ How is this even possible? It's possible because <tt>IO#to_list</tt> creates a l
 
 === Stack
 
+=== Queue
+
 == Disclaimer
 
 Hamster started out as a spike to prove a point and has since morphed into something I actually use. My primary concern has been to round out the functionality with good test coverage and clean, readable code.

data/Rakefile

@@ -1,4 +1,4 @@
-Dir["tasks/**/*.rb"].each do |task_file|
+Dir[File.expand_path("tasks/**/*.rb")].each do |task_file|
   require task_file
 end
 

data/lib/hamster.rb

@@ -2,6 +2,7 @@ require 'hamster/core_ext'
 require 'hamster/immutable'
 require 'hamster/list'
 require 'hamster/stack'
+require 'hamster/queue'
 require 'hamster/set'
 require 'hamster/hash'
 require 'hamster/version'

data/lib/hamster/core_ext/enumerable.rbc

@@ -0,0 +1,676 @@
+!RBIX
+0
+x
+M
+1
+n
+n
+x
+10
+__script__
+i
+69
+5
+7
+0
+64
+47
+49
+1
+1
+15
+45
+2
+3
+7
+4
+65
+49
+5
+2
+13
+45
+2
+6
+12
+7
+7
+12
+7
+8
+12
+65
+12
+49
+9
+4
+15
+48
+7
+15
+45
+2
+10
+7
+11
+65
+49
+5
+2
+13
+45
+2
+12
+12
+7
+7
+12
+7
+13
+12
+65
+12
+49
+9
+4
+15
+48
+7
+15
+2
+11
+I
+6
+I
+0
+I
+0
+I
+0
+n
+p
+14
+s
+12
+hamster/list
+x
+7
+require
+x
+8
+Rubinius
+n
+x
+7
+Hamster
+x
+11
+open_module
+n
+x
+15
+__module_init__
+M
+1
+n
+n
+x
+7
+Hamster
+i
+31
+5
+66
+45
+0
+1
+7
+2
+65
+49
+3
+2
+13
+45
+0
+4
+12
+7
+5
+12
+7
+6
+12
+65
+12
+49
+7
+4
+15
+48
+5
+11
+I
+6
+I
+0
+I
+0
+I
+0
+n
+p
+8
+x
+8
+Rubinius
+n
+x
+7
+CoreExt
+x
+11
+open_module
+n
+x
+15
+__module_init__
+M
+1
+n
+n
+x
+7
+CoreExt
+i
+31
+5
+66
+45
+0
+1
+7
+2
+65
+49
+3
+2
+13
+45
+0
+4
+12
+7
+5
+12
+7
+6
+12
+65
+12
+49
+7
+4
+15
+48
+5
+11
+I
+6
+I
+0
+I
+0
+I
+0
+n
+p
+8
+x
+8
+Rubinius
+n
+x
+10
+Enumerable
+x
+11
+open_module
+n
+x
+15
+__module_init__
+M
+1
+n
+n
+x
+10
+Enumerable
+i
+15
+5
+66
+45
+0
+1
+7
+2
+7
+3
+65
+5
+49
+4
+4
+11
+I
+5
+I
+0
+I
+0
+I
+0
+n
+p
+5
+x
+8
+Rubinius
+n
+x
+8
+included
+M
+1
+n
+n
+x
+8
+included
+i
+8
+20
+0
+56
+0
+50
+1
+0
+11
+I
+3
+I
+1
+I
+1
+I
+1
+n
+p
+2
+M
+1
+p
+2
+x
+9
+for_block
+t
+n
+x
+8
+included
+i
+15
+45
+0
+1
+7
+2
+7
+3
+65
+67
+48
+4
+49
+5
+4
+11
+I
+6
+I
+0
+I
+0
+I
+0
+I
+-2
+p
+6
+x
+8
+Rubinius
+n
+x
+7
+to_list
+M
+1
+n
+n
+x
+7
+to_list
+i
+17
+45
+0
+1
+19
+0
+15
+5
+56
+2
+47
+50
+3
+0
+15
+20
+0
+11
+I
+3
+I
+1
+I
+0
+I
+0
+n
+p
+4
+x
+9
+EmptyList
+n
+M
+1
+p
+2
+x
+9
+for_block
+t
+n
+x
+7
+to_list
+i
+16
+57
+19
+0
+15
+21
+1
+0
+20
+0
+49
+0
+1
+22
+1
+0
+11
+I
+4
+I
+1
+I
+1
+I
+1
+n
+p
+1
+x
+4
+cons
+p
+3
+I
+0
+I
+d
+I
+10
+x
+72
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/core_ext/enumerable.rb
+p
+1
+x
+4
+item
+x
+12
+reverse_each
+p
+9
+I
+0
+I
+b
+I
+0
+I
+c
+I
+6
+I
+d
+I
+e
+I
+e
+I
+11
+x
+72
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/core_ext/enumerable.rb
+p
+1
+x
+4
+list
+x
+17
+method_visibility
+x
+15
+add_defn_method
+p
+5
+I
+0
+I
+a
+I
+0
+I
+b
+I
+f
+x
+72
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/core_ext/enumerable.rb
+p
+0
+x
+10
+class_eval
+p
+5
+I
+0
+I
+9
+I
+0
+I
+a
+I
+8
+x
+72
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/core_ext/enumerable.rb
+p
+1
+x
+4
+base
+x
+13
+attach_method
+p
+3
+I
+2
+I
+9
+I
+f
+x
+72
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/core_ext/enumerable.rb
+p
+0
+x
+13
+attach_method
+p
+3
+I
+2
+I
+7
+I
+1f
+x
+72
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/core_ext/enumerable.rb
+p
+0
+x
+13
+attach_method
+p
+3
+I
+2
+I
+5
+I
+1f
+x
+72
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/core_ext/enumerable.rb
+p
+0
+x
+13
+attach_method
+n
+x
+10
+Enumerable
+n
+M
+1
+n
+n
+x
+10
+Enumerable
+i
+15
+5
+66
+5
+45
+0
+1
+43
+2
+43
+3
+47
+49
+4
+1
+11
+I
+2
+I
+0
+I
+0
+I
+0
+n
+p
+5
+x
+7
+Hamster
+n
+x
+7
+CoreExt
+x
+10
+Enumerable
+x
+7
+include
+p
+3
+I
+2
+I
+1c
+I
+f
+x
+72
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/core_ext/enumerable.rb
+p
+0
+p
+7
+I
+0
+I
+1
+I
+9
+I
+3
+I
+26
+I
+1a
+I
+45
+x
+72
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/core_ext/enumerable.rb
+p
+0