immutable-ruby 0.0.4 → 0.2.0

data/lib/immutable/core_ext/enumerable.rb

@@ -1,4 +1,4 @@
-require "immutable/list"
+require 'immutable/list'
 
 # Monkey-patches to Ruby's built-in `Enumerable` module.
 # @see http://www.ruby-doc.org/core/Enumerable.html

data/lib/immutable/core_ext/io.rb

@@ -1,4 +1,4 @@
-require "immutable/list"
+require 'immutable/list'
 
 # Monkey-patches to Ruby's built-in `IO` class.
 # @see http://www.ruby-doc.org/core/IO.html

data/lib/immutable/core_ext.rb

@@ -1,2 +1,2 @@
-require "immutable/core_ext/enumerable"
-require "immutable/core_ext/io"
+require 'immutable/core_ext/enumerable'
+require 'immutable/core_ext/io'

data/lib/immutable/deque.rb

@@ -1,4 +1,4 @@
-require "immutable/list"
+require 'immutable/list'
 
 module Immutable
 
@@ -48,7 +48,7 @@ module Immutable
       #
       # @return [Deque]
       def empty
-        @empty ||= self.new
+        @empty ||= new
       end
 
       # "Raw" allocation of a new `Deque`. Used internally to create a new
@@ -86,7 +86,7 @@ module Immutable
     def size
       @front.size + @rear.size
     end
-    alias :length :size
+    alias length size
 
     # Return the first item in the `Deque`. If the deque is empty, return `nil`.
     #
@@ -122,9 +122,9 @@ module Immutable
     # @param n [Integer] number of positions to move elements by
     # @return [Deque]
     def rotate(n)
-      return self.class.empty if self.empty?
+      return self.class.empty if empty?
 
-      n %= self.size
+      n %= size
       return self if n == 0
 
       a, b = @front, @rear
@@ -132,7 +132,7 @@ module Immutable
       if b.size >= n
         n.times { a = a.cons(b.head); b = b.tail }
       else
-        (self.size - n).times { b = b.cons(a.head); a = a.tail }
+        (size - n).times { b = b.cons(a.head); a = a.tail }
       end
 
       self.class.alloc(a, b)
@@ -149,7 +149,7 @@ module Immutable
     def push(item)
       self.class.alloc(@front, @rear.cons(item))
     end
-    alias :enqueue :push
+    alias enqueue push
 
     # Return a new `Deque` with the last item removed.
     #
@@ -198,7 +198,7 @@ module Immutable
 
       self.class.alloc(front.tail, rear)
     end
-    alias :dequeue :shift
+    alias dequeue shift
 
     # Return an empty `Deque` instance, of the same class as this one. Useful if you
     # have multiple subclasses of `Deque` and want to treat them polymorphically.
@@ -223,15 +223,15 @@ module Immutable
       return true if other.equal?(self)
       instance_of?(other.class) && to_ary.eql?(other.to_ary)
     end
-    alias :== :eql?
+    alias == eql?
 
     # Return an `Array` with the same elements, in the same order.
     # @return [Array]
     def to_a
-      @front.to_a.concat(@rear.to_a.tap { |a| a.reverse! })
+      @front.to_a.concat(@rear.to_a.tap(&:reverse!))
     end
-    alias :entries :to_a
-    alias :to_ary  :to_a
+    alias entries to_a
+    alias to_ary  to_a
 
     # Return a {List} with the same elements, in the same order.
     # @return [Immutable::List]
@@ -248,8 +248,8 @@ module Immutable
       result = "#{self.class}["
       i = 0
       @front.each { |obj| result << ', ' if i > 0; result << obj.inspect; i += 1 }
-      @rear.to_a.tap { |a| a.reverse! }.each { |obj| result << ', ' if i > 0; result << obj.inspect; i += 1 }
-      result << "]"
+      @rear.to_a.tap(&:reverse!).each { |obj| result << ', ' if i > 0; result << obj.inspect; i += 1 }
+      result << ']'
     end
 
     # Return `self`. Since this is an immutable object duplicates are
@@ -258,13 +258,13 @@ module Immutable
     def dup
       self
     end
-    alias :clone :dup
+    alias clone dup
 
     # @private
     def pretty_print(pp)
-      pp.group(1, "#{self.class}[", "]") do
+      pp.group(1, "#{self.class}[", ']') do
         pp.breakable ''
-        pp.seplist(self.to_a) { |obj| obj.pretty_print(pp) }
+        pp.seplist(to_a) { |obj| obj.pretty_print(pp) }
       end
     end
 

data/lib/immutable/enumerable.rb

@@ -15,7 +15,7 @@ module Immutable
       return enum_for(:reject) if not block_given?
       select { |item| !yield(item) }
     end
-    alias :delete_if :reject
+    alias delete_if reject
 
     # Return a new collection with all `nil` elements removed.
     def compact
@@ -91,15 +91,15 @@ module Immutable
     # Compare with `other`, and return 0, 1, or -1 if it is (respectively) equal to,
     # greater than, or less than this collection.
     def <=>(other)
-      return 0 if self.equal?(other)
-      enum1, enum2 = self.to_enum, other.to_enum
+      return 0 if equal?(other)
+      enum1, enum2 = to_enum, other.to_enum
       loop do
         item1 = enum1.next
         item2 = enum2.next
         comp  = (item1 <=> item2)
         return comp if comp != 0
       end
-      size1, size2 = self.size, other.size
+      size1, size2 = size, other.size
       return 0 if size1 == size2
       size1 > size2 ? 1 : -1
     end
@@ -107,14 +107,14 @@ module Immutable
     # Return true if `other` contains the same elements, in the same order.
     # @return [Boolean]
     def ==(other)
-      self.eql?(other) || (other.respond_to?(:to_ary) && to_ary == other.to_ary)
+      eql?(other) || (other.respond_to?(:to_ary) && to_ary == other.to_ary)
     end
 
     # Convert all the elements into strings and join them together, separated by
     # `separator`. By default, the `separator` is `$,`, the global default string
     # separator, which is normally `nil`.
     def join(separator = $,)
-      result = ""
+      result = ''
       if separator
         each_with_index { |obj, i| result << separator if i > 0; result << obj.to_s }
       else
@@ -132,19 +132,19 @@ module Immutable
     def inspect
       result = "#{self.class}["
       each_with_index { |obj, i| result << ', ' if i > 0; result << obj.inspect }
-      result << "]"
+      result << ']'
     end
 
     # @private
     def pretty_print(pp)
-      pp.group(1, "#{self.class}[", "]") do
+      pp.group(1, "#{self.class}[", ']') do
         pp.breakable ''
         pp.seplist(self) { |obj| obj.pretty_print(pp) }
       end
     end
 
-    alias :to_ary :to_a
-    alias :index :find_index
+    alias to_ary to_a
+    alias index find_index
 
     ## Compatibility fixes