immutable-ruby 0.0.4 → 0.1.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: d4dfc5d75d70e963c56837a552ac1902889f05f2fd73a3995c69959815780594
-  data.tar.gz: b9daefb94ad6bd5e3bf3a0bc7b74265a9d97188856ab78508f2cdf813b342636
+  metadata.gz: 54e4768953f4e1a9afbfc0d8496bdb563ae850419c905ea4dce78b560c88da3c
+  data.tar.gz: 9237a022ed3107aad98adfaed510cbd4b76367b06aab7a2d6a1f8dc2d6d3c911
 SHA512:
-  metadata.gz: 306f0ef37c0ba06cf729b230f8eb6ec850cf6ff6130fea45eaf125d307078617f8688bc02b2dd6a75aae11134a45172f7ca11a12e6693409c36d5f00b7f18fc0
-  data.tar.gz: '0039ef718ca215f12d6826ea6803c7e404fd211536095c5a4995ca04e30b0effefa11951a640bca03b37ee9834ff94bac7acd9d1ccaf2d08ba449204850e42cb'
+  metadata.gz: 7aa2208347fcce032af7b0885cb5088ea7d93573dd54c59fbebf7d98bd962be8880533c3c0fabe92fb7cfc5eddf1a9cc06cb60a0180ee55507d09dde7b2a0396
+  data.tar.gz: f10991e1881c42941d9723eb0acc569126b06716273852089c7f25a3bf2e5fefc25e1d5c767682dbb75d88a52da9dc12aee90627c7e1a92cf513f586aab3ef42

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
 

data/lib/immutable/hash.rb

@@ -1,8 +1,8 @@
-require "immutable/undefined"
-require "immutable/enumerable"
-require "immutable/trie"
-require "immutable/set"
-require "immutable/vector"
+require 'immutable/undefined'
+require 'immutable/enumerable'
+require 'immutable/trie'
+require 'immutable/set'
+require 'immutable/vector'
 
 module Immutable
 
@@ -78,7 +78,7 @@ module Immutable
       #
       # @return [Hash]
       def empty
-        @empty ||= self.new
+        @empty ||= new
       end
 
       # "Raw" allocation of a new `Hash`. Used internally to create a new
@@ -119,7 +119,7 @@ module Immutable
     def size
       @trie.size
     end
-    alias :length :size
+    alias length size
 
     # Return `true` if this `Hash` contains no key/value pairs.
     #
@@ -140,9 +140,9 @@ module Immutable
     def key?(key)
       @trie.key?(key)
     end
-    alias :has_key? :key?
-    alias :include? :key?
-    alias :member?  :key?
+    alias has_key? key?
+    alias include? key?
+    alias member?  key?
 
     # Return `true` if this `Hash` has one or more keys which map to the provided value.
     #
@@ -155,7 +155,7 @@ module Immutable
       each { |k,v| return true if value == v }
       false
     end
-    alias :has_value? :value?
+    alias has_value? value?
 
     # Retrieve the value corresponding to the provided key object. If not found, and
     # this `Hash` has a default block, the default block is called to provide the
@@ -182,7 +182,7 @@ module Immutable
         @default.call(key)
       end
     end
-    alias :[] :get
+    alias [] get
 
     # Retrieve the value corresponding to the given key object, or use the provided
     # default value or block, or otherwise raise a `KeyError`.
@@ -293,7 +293,7 @@ module Immutable
     # @return [Hash]
     def update_in(*key_path, &block)
       if key_path.empty?
-        raise ArgumentError, "must have at least one key in path"
+        raise ArgumentError, 'must have at least one key in path'
       end
       key = key_path[0]
       if key_path.size == 1
@@ -348,7 +348,7 @@ module Immutable
       @trie.each(&block)
       self
     end
-    alias :each_pair :each
+    alias each_pair each
 
     # Call the block once for each key/value pair in this `Hash`, passing the key/value
     # pair as parameters. Iteration order will be the opposite of {#each}.
@@ -423,7 +423,7 @@ module Immutable
       return self if empty?
       self.class.new(super, &@default)
     end
-    alias :collect :map
+    alias collect map
 
     # Return a new `Hash` with all the key/value pairs for which the block returns true.
     #
@@ -439,8 +439,8 @@ module Immutable
       return enum_for(:select) unless block_given?
       derive_new_hash(@trie.select(&block))
     end
-    alias :find_all :select
-    alias :keep_if  :select
+    alias find_all select
+    alias keep_if  select
 
     # Yield `[key, value]` pairs until one is found for which the block returns true.
     # Return that `[key, value]` pair. If the block never returns true, return `nil`.
@@ -458,7 +458,7 @@ module Immutable
       each { |entry| return entry if yield entry }
       nil
     end
-    alias :detect :find
+    alias detect find
 
     # Return a new `Hash` containing all the key/value pairs from this `Hash` and
     # `other`. If no block is provided, the value for entries with colliding keys
@@ -485,7 +485,7 @@ module Immutable
     def merge(other)
       trie = if block_given?
         other.reduce(@trie) do |trie, (key, value)|
-          if entry = trie.get(key)
+          if (entry = trie.get(key))
             trie.put(key, yield(key, entry[1], value))
           else
             trie.put(key, value)
@@ -771,7 +771,7 @@ module Immutable
     # @param other [Object] The object to compare with
     # @return [Boolean]
     def ==(other)
-      self.eql?(other) || (other.respond_to?(:to_hash) && to_hash == other.to_hash)
+      eql?(other) || (other.respond_to?(:to_hash) && to_hash == other.to_hash)
     end
 
     # Return true if this `Hash` is a proper superset of `other`, which means
@@ -840,7 +840,7 @@ module Immutable
         result << key.inspect << ' => ' << val.inspect
         i += 1
       end
-      result << "]"
+      result << ']'
     end
 
     # Return `self`. Since this is an immutable object duplicates are
@@ -849,7 +849,7 @@ module Immutable
     def dup
       self
     end
-    alias :clone :dup
+    alias clone dup
 
     # Allows this `Hash` to be printed at the `pry` console, or using `pp` (from the
     # Ruby standard library), in a way which takes the amount of horizontal space on
@@ -858,7 +858,7 @@ module Immutable
     #
     # @private
     def pretty_print(pp)
-      pp.group(1, "#{self.class}[", "]") do
+      pp.group(1, "#{self.class}[", ']') do
         pp.breakable ''
         pp.seplist(self, nil) do |key, val|
           pp.group do
@@ -883,7 +883,7 @@ module Immutable
       end
       output
     end
-    alias :to_h :to_hash
+    alias to_h to_hash
 
     # Return a `Proc` which accepts a key as an argument and returns the value.
     # The `Proc` behaves like {#get} (when the key is missing, it returns nil or

data/lib/immutable/list.rb

@@ -1,11 +1,11 @@
-require "thread"
-require "set"
-require "concurrent"
+require 'thread'
+require 'set'
+require 'concurrent'
 
-require "immutable/undefined"
-require "immutable/enumerable"
-require "immutable/hash"
-require "immutable/set"
+require 'immutable/undefined'
+require 'immutable/enumerable'
+require 'immutable/hash'
+require 'immutable/set'
 
 module Immutable
   class << self
@@ -175,7 +175,7 @@ module Immutable
       end
       result
     end
-    alias :length :size
+    alias length size
 
     # Create a new `List` with `item` added at the front. This is a constant
     # time operation.
@@ -189,7 +189,7 @@ module Immutable
     def add(item)
       Cons.new(item, self)
     end
-    alias :cons :add
+    alias cons add
 
     # Create a new `List` with `item` added at the end. This is much less efficient
     # than adding items at the front.
@@ -235,7 +235,7 @@ module Immutable
         Cons.new(yield(head), tail.map(&block))
       end
     end
-    alias :collect :map
+    alias collect map
 
     # Return a `List` which is realized by transforming each item into a `List`,
     # and flattening the resulting lists.
@@ -268,15 +268,15 @@ module Immutable
       return enum_for(:select) unless block_given?
       LazyList.new do
         list = self
-        while true
+        loop do
           break list if list.empty?
           break Cons.new(list.head, list.tail.select(&block)) if yield(list.head)
           list = list.tail
         end
       end
     end
-    alias :find_all :select
-    alias :keep_if  :select
+    alias find_all select
+    alias keep_if  select
 
     # Return a `List` which contains all elements up to, but not including, the
     # first element for which the block returns `nil` or `false`.
@@ -380,8 +380,8 @@ module Immutable
         Cons.new(head, tail.append(other))
       end
     end
-    alias :concat :append
-    alias :+ :append
+    alias concat append
+    alias + append
 
     # Return a `List` with the same items, but in reverse order.
     #
@@ -440,7 +440,7 @@ module Immutable
     def transpose
       return EmptyList if empty?
       LazyList.new do
-        next EmptyList if any? { |list| list.empty? }
+        next EmptyList if any?(&:empty?)
         heads, tails = EmptyList, EmptyList
         reverse_each { |list| heads, tails = heads.cons(list.head), tails.cons(list.tail) }
         Cons.new(heads, tails.transpose)
@@ -477,7 +477,7 @@ module Immutable
     # @return [Vector]
     # @raise [TypeError] if count is not an integer.
     def rotate(count = 1)
-      raise TypeError, "expected Integer" if not count.is_a?(Integer)
+      raise TypeError, 'expected Integer' if not count.is_a?(Integer)
       return self if empty? || (count % size) == 0
       count = (count >= 0) ? count % size : (size - (~count % size) - 1)
       drop(count).append(take(count))
@@ -640,7 +640,7 @@ module Immutable
         Cons.new(head, tail.union(other, items.add(head)))
       end
     end
-    alias :| :union
+    alias | union
 
     # Return a `List` with all elements except the last one.
     #
@@ -742,7 +742,7 @@ module Immutable
       chunk(number).each(&block)
       self
     end
-    alias :each_slice :each_chunk
+    alias each_slice each_chunk
 
     # Return a new `List` with all nested lists recursively "flattened out",
     # that is, their elements inserted into the new `List` in the place where
@@ -776,7 +776,7 @@ module Immutable
     def group_by(&block)
       group_by_with(EmptyList, &block)
     end
-    alias :group :group_by
+    alias group group_by
 
     # Retrieve the item at `index`. Negative indices count back from the end of
     # the list (-1 is the last item). If `index` is invalid (either too high or
@@ -868,7 +868,7 @@ module Immutable
         list.take(length)
       end
     end
-    alias :[] :slice
+    alias [] slice
 
     # Return a `List` of indices of matching objects.
     #
@@ -895,7 +895,7 @@ module Immutable
       return EmptyList if empty?
       LazyList.new do
         node = self
-        while true
+        loop do
           break Cons.new(i, node.tail.indices(Undefined, i + 1, &block)) if yield(node.head)
           node = node.tail
           break EmptyList if node.empty?
@@ -1187,7 +1187,7 @@ module Immutable
     def dup
       self
     end
-    alias :clone :dup
+    alias clone dup
 
     # Return `self`.
     # @return [List]
@@ -1201,9 +1201,9 @@ module Immutable
     #
     # @return [String]
     def inspect
-      result = "Immutable::List["
+      result = 'Immutable::List['
       each_with_index { |obj, i| result << ', ' if i > 0; result << obj.inspect }
-      result << "]"
+      result << ']'
     end
 
     # Allows this `List` to be printed at the `pry` console, or using `pp` (from the
@@ -1213,7 +1213,7 @@ module Immutable
     #
     # @private
     def pretty_print(pp)
-      pp.group(1, "Immutable::List[", "]") do
+      pp.group(1, 'Immutable::List[', ']') do
         pp.breakable ''
         pp.seplist(self) { |obj| obj.pretty_print(pp) }
       end
@@ -1290,7 +1290,7 @@ module Immutable
     def size
       @size ||= super
     end
-    alias :length :size
+    alias length size
 
     def cached_size?
       @size != nil
@@ -1319,7 +1319,7 @@ module Immutable
       realize if @atomic.value != 2
       @head
     end
-    alias :first :head
+    alias first head
 
     def tail
       realize if @atomic.value != 2
@@ -1334,7 +1334,7 @@ module Immutable
     def size
       @size ||= super
     end
-    alias :length :size
+    alias length size
 
     def cached_size?
       @size != nil
@@ -1346,7 +1346,7 @@ module Immutable
     MUTEX = Mutex.new
 
     def realize
-      while true
+      loop do
         # try to "claim" the right to run the block which realizes target
         if @atomic.compare_and_set(0,1) # full memory barrier here
           begin
@@ -1392,7 +1392,7 @@ module Immutable
       realize if @head == Undefined
       @head
     end
-    alias :first :head
+    alias first head
 
     def tail
       realize if @tail == Undefined
@@ -1407,7 +1407,7 @@ module Immutable
     def size
       @size ||= super
     end
-    alias :length :size
+    alias length size
 
     def cached_size?
       @size != nil
@@ -1455,7 +1455,7 @@ module Immutable
       mutex = @mutex
       mutex && mutex.synchronize do
         return if @head != Undefined # another thread got ahead of us
-        while true
+        loop do
           if !@buffer.empty?
             @head = @buffer.shift
             @tail = Partitioned.new(@partitioner, @buffer, @mutex)
@@ -1516,7 +1516,7 @@ module Immutable
         mutex = @mutex
         mutex && mutex.synchronize do
           return if @head != Undefined # another thread got ahead of us
-          while true
+          loop do
             if !@buffer.empty?
               @head = @buffer.shift
               @tail = Left.new(@splitter, @buffer, @mutex)
@@ -1568,7 +1568,7 @@ module Immutable
       def head
         nil
       end
-      alias :first :head
+      alias first head
 
       # There are no subsequent elements, so return an empty list.
       # @return [self]
@@ -1585,7 +1585,7 @@ module Immutable
       def size
         0
       end
-      alias :length :size
+      alias length size
 
       def cached_size?
         true

data/lib/immutable/nested.rb

@@ -1,11 +1,11 @@
-require "set"
-require "immutable/hash"
-require "immutable/set"
-require "immutable/vector"
-require "immutable/sorted_set"
-require "immutable/list"
-require "immutable/deque"
-require "immutable/core_ext/struct"
+require 'set'
+require 'sorted_set'
+require 'immutable/hash'
+require 'immutable/set'
+require 'immutable/vector'
+require 'immutable/sorted_set'
+require 'immutable/list'
+require 'immutable/deque'
 
 module Immutable
   class << self