hamster 1.0.0 → 1.0.1.pre.rc.1

data/lib/hamster/mutable_hash.rb

@@ -1,3 +1,4 @@
+require "forwardable"
 require "hamster/hash"
 require "hamster/read_copy_update"
 
@@ -7,6 +8,7 @@ module Hamster
   end
 
   class MutableHash
+    extend Forwardable
     include ReadCopyUpdate
 
     def put(key, value = Undefined, &block)
@@ -17,7 +19,7 @@ module Hamster
       put(key, value)
       value
     end
-    alias :[]= :store
+    def_delegator :self, :store, :[]=
 
     def delete(key)
       old_value = nil

data/lib/hamster/queue.rb

@@ -0,0 +1,87 @@
+require "forwardable"
+require "hamster/immutable"
+require "hamster/list"
+
+module Hamster
+  def self.queue(*items)
+    items.reduce(EmptyQueue) { |queue, item| queue.enqueue(item) }
+  end
+
+  class Queue
+    extend Forwardable
+    include Immutable
+
+    def initialize
+      @front = @rear = EmptyList
+    end
+
+    def empty?
+      @front.empty? && @rear.empty?
+    end
+    def_delegator :self, :empty?, :null?
+
+    def size
+      @front.size + @rear.size
+    end
+    def_delegator :self, :size, :length
+
+    def head
+      return @front.head unless @front.empty?
+      @rear.last
+    end
+    def_delegator :self, :head, :first
+    def_delegator :self, :head, :peek
+    def_delegator :self, :head, :front
+
+    def enqueue(item)
+      transform { @rear = @rear.cons(item) }
+    end
+    def_delegator :self, :enqueue, :<<
+    def_delegator :self, :enqueue, :add
+
+    def dequeue
+      front = @front
+      rear = @rear
+      if front.empty?
+        return EmptyQueue if rear.empty?
+        front = rear.reverse
+        rear = EmptyList
+      end
+
+      transform do
+        @front = front.tail
+        @rear = rear
+      end
+    end
+    def_delegator :self, :dequeue, :tail
+
+    def clear
+      EmptyQueue
+    end
+
+    def eql?(other)
+      instance_of?(other.class) &&
+        to_list.eql?(other.to_list)
+    end
+    def_delegator :self, :eql?, :==
+
+    def to_a
+      to_list.to_a
+    end
+    def_delegator :self, :to_a, :entries
+
+    def to_ary
+      to_list.to_ary
+    end
+
+    def to_list
+      @front.append(@rear.reverse)
+    end
+
+    def inspect
+      to_list.inspect
+    end
+  end
+
+  EmptyQueue = Hamster::Queue.new
+end

data/lib/hamster/read_copy_update.rb

@@ -2,7 +2,6 @@ require "forwardable"
 require "thread"
 
 module Hamster
-  # @private
   module ReadCopyUpdate
     extend Forwardable
 
@@ -14,7 +13,7 @@ module Hamster
     def eql?(other)
       instance_of?(other.class) && @content.eql?(other.instance_variable_get(:@content))
     end
-    alias :== :eql?
+    def_delegator :self, :eql?, :==
 
     def_delegator :@content, :inspect
     def_delegator :@content, :to_s

data/lib/hamster/set.rb

@@ -1,572 +1,167 @@
+require "forwardable"
 require "hamster/immutable"
 require "hamster/undefined"
 require "hamster/enumerable"
-require "hamster/hash"
+require "hamster/sorter"
 require "hamster/trie"
-require "hamster/sorted_set"
-require "set"
+require "hamster/list"
 
 module Hamster
   def self.set(*items)
-    items.empty? ? EmptySet : Set.new(items)
+    items.reduce(EmptySet) { |set, item| set.add(item) }
   end
 
-  # `Hamster::Set` is a collection of unordered values with no duplicates. Testing whether
-  # an object is present in the `Set` is fast. `Set` is also `Enumerable`, so you can
-  # iterate over the members of the set with {#each}, transform them with {#map}, filter
-  # them with {#select}, and so on. Some of the `Enumerable` methods are overridden to
-  # return Hamster collections.
-  #
-  # Like the `Set` class in Ruby's standard library, which we will call RubySet,
-  # `Hamster::Set` defines equivalency of objects using `#hash` and `#eql?`. No two
-  # objects with the same `#hash` code, and which are also `#eql?`, can coexist in the
-  # same `Set`. If one is already in the `Set`, attempts to add another one will have
-  # no effect.
-  #
-  # `Set`s have no natural ordering and cannot be compared using `#<=>`. However, they
-  # define {#<}, {#>}, {#<=}, and {#>=} as shorthand for {#proper_subset?},
-  # {#proper_superset?}, {#subset?}, and {#superset?} (respectively).
-  #
-  # The basic set-theoretic operations {#union}, {#intersection}, {#difference}, and
-  # {#exclusion} work with any `Enumerable` object. They may be more efficient when used
-  # with another `Hamster::Set`, or a RubySet.
-  #
-  # A `Set` can be created in any of the following ways:
-  #
-  #     Hamster.set('Tom', 'Dick', 'Harry')
-  #     Hamster::Set.new([1, 2, 3]) # any Enumerable can be used to initialize
-  #     Hamster::Set['A', 'B', 'C', 'D']
-  #
-  # The latter 2 forms of initialization can be used with your own, custom subclasses
-  # of `Hamster::Set`.
-  #
-  # Unlike RubySet, all methods which you might expect to "modify" a `Hamster::Set`
-  # actually return a new set and leave the existing one unchanged.
-  #
-  # @example
-  #   require 'hamster/set'
-  #   set1 = Hamster.set(1, 2)  # => Hamster::Set[1, 2]
-  #   set2 = Hamster::Set[1, 2] # => Hamster::Set[1, 2]
-  #   set1 == set2              # => true
-  #   set3 = set1.add("foo")    # => Hamster::Set[1, 2, "foo"]
-  #   set3 - set2               # => Hamster::Set["foo"]
-  #   set3.subset?(set1)        # => false
-  #   set1.subset?(set3)        # => true
-  #
   class Set
+    extend Forwardable
     include Immutable
     include Enumerable
 
-    class << self
-      # Create a new `Set` populated with the given items.
-      # @return [Set]
-      def [](*items)
-        new(items)
-      end
-
-      # Return an empty `Set`. If used on a subclass, returns an empty instance
-      # of that class.
-      #
-      # @return [Set]
-      def empty
-        @empty ||= self.new
-      end
-
-      # "Raw" allocation of a new `Set`. Used internally to create a new
-      # instance quickly after obtaining a modified {Trie}.
-      #
-      # @return [Set]
-      # @private
-      def alloc(trie = EmptyTrie)
-        allocate.tap { |s| s.instance_variable_set(:@trie, trie) }
-      end
-    end
-
-    def initialize(items=[])
-      @trie = Trie.new(0)
-      items.each { |item| @trie.put!(item, nil) }
+    def initialize(trie = EmptyTrie)
+      @trie = trie
     end
 
-    # Return `true` if this `Set` contains no items.
-    # @return [Boolean]
     def empty?
       @trie.empty?
     end
+    def_delegator :self, :empty?, :null?
 
-    # Return the number of items in this `Set`.
-    # @return [Integer]
     def size
       @trie.size
     end
-    alias :length :size
+    def_delegator :self, :size, :length
 
-    # Return a new `Set` with `item` added. If `item` is already in the set,
-    # return `self`.
-    #
-    # @example
-    #   Hamster::Set[1, 2, 3].add(4) # => Hamster::Set[1, 2, 4, 3]
-    #   Hamster::Set[1, 2, 3].add(2) # => Hamster::Set[1, 2, 3]
-    #
-    # @param item [Object] The object to add
-    # @return [Set]
     def add(item)
-      include?(item) ? self : self.class.alloc(@trie.put(item, nil))
-    end
-    alias :<< :add
-
-    # If `item` is not a member of this `Set`, return a new `Set` with `item` added.
-    # Otherwise, return `false`.
-    #
-    # @example
-    #   Hamster::Set[1, 2, 3].add?(4) # => Hamster::Set[1, 2, 4, 3]
-    #   Hamster::Set[1, 2, 3].add?(2) # => false
-    #
-    # @param item [Object] The object to add
-    # @return [Set, false]
-    def add?(item)
-      !include?(item) && add(item)
+      transform_unless(include?(item)) { @trie = @trie.put(item, nil) }
     end
+    def_delegator :self, :add, :<<
 
-    # Return a new `Set` with `item` removed. If `item` is not a member of the set,
-    # return `self`.
-    #
-    # @example
-    #   Hamster::Set[1, 2, 3].delete(1)  # => Hamster::Set[2, 3]
-    #   Hamster::Set[1, 2, 3].delete(99) # => Hamster::Set[1, 2, 3]
-    #
-    # @param item [Object] The object to remove
-    # @return [Set]
     def delete(item)
       trie = @trie.delete(item)
-      new_trie(trie)
+      transform_unless(trie.equal?(@trie)) { @trie = trie }
     end
 
-    # If `item` is a member of this `Set`, return a new `Set` with `item` removed.
-    # Otherwise, return `false`.
-    #
-    # @example
-    #   Hamster::Set[1, 2, 3].delete?(1)  # => Hamster::Set[2, 3]
-    #   Hamster::Set[1, 2, 3].delete?(99) # => false
-    #
-    # @param item [Object] The object to remove
-    # @return [Set, false]
-    def delete?(item)
-      include?(item) && delete(item)
-    end
-
-    # Call the block once for each item in this `Set`. No specific iteration order
-    # is guaranteed (but the order will be stable for any particular `Set`.)
-    #
-    # @example
-    #   Hamster::Set["Dog", "Elephant", "Lion"].each { |e| puts e }
-    #   Elephant
-    #   Dog
-    #   Lion
-    #   # => Hamster::Set["Dog", "Elephant", "Lion"]
-    #
-    # @return [self]
     def each
-      return to_enum if not block_given?
-      @trie.each { |key, _| yield(key) }
-      self
+      return self unless block_given?
+      @trie.each { |entry| yield(entry.key) }
     end
 
-    # Call the block once for each item in this `Set`. Iteration order will be
-    # the opposite of {#each}.
-    #
-    # @example
-    #   Hamster::Set["Dog", "Elephant", "Lion"].reverse_each { |e| puts e }
-    #   Lion
-    #   Dog
-    #   Elephant
-    #   # => Hamster::Set["Dog", "Elephant", "Lion"]
-    #
-    # @return [self]
-    def reverse_each
-      return enum_for(:reverse_each) if not block_given?
-      @trie.reverse_each { |key, _| yield(key) }
-      self
-    end
-
-    # Return a new `Set` with all the items for which the block returns true.
-    #
-    # @example
-    #   Hamster::Set["Elephant", "Dog", "Lion"].select { |e| e.size >= 4 }
-    #   # => Hamster::Set["Elephant", "Lion"]
-    #
-    # @return [Set]
-    def select
-      return enum_for(:select) unless block_given?
-      trie = @trie.select { |key, _| yield(key) }
-      new_trie(trie)
-    end
-    alias :find_all :select
-    alias :keep_if  :select
-
-    # Call the block once for each item in this `Set`.
-    # All the values returned from the block will be gathered into a new `Set`.
-    #
-    # @example
-    #   Hamster::Set["Cat", "Elephant", "Dog", "Lion"].map { |e| e.size }
-    #   # => Hamster::Set[8, 4, 3]
-    #
-    # @return [Set]
     def map
-      return enum_for(:map) if not block_given?
+      return self unless block_given?
       return self if empty?
-      self.class.new(super)
+      transform { @trie = @trie.reduce(EmptyTrie) { |trie, entry| trie.put(yield(entry.key), nil) } }
+    end
+    def_delegator :self, :map, :collect
+
+    def filter
+      return self unless block_given?
+      trie = @trie.filter { |entry| yield(entry.key) }
+      return EmptySet if trie.empty?
+      transform_unless(trie.equal?(@trie)) { @trie = trie }
     end
-    alias :collect :map
 
-    # Return `true` if the given item is present in this `Set`. More precisely,
-    # return `true` if an object with the same `#hash` code, and which is also `#eql?`
-    # to the given object is present.
-    #
-    # @example
-    #   Hamster::Set["A", "B", "C"].include?("B") # => true
-    #   Hamster::Set["A", "B", "C"].include?("Z") # => false
-    #
-    # @param object [Object] The object to check for
-    # @return [Boolean]
     def include?(object)
-      @trie.key?(object)
+      any? { |item| item.eql?(object) }
     end
-    alias :member? :include?
 
-    # Return a member of this `Set`. The member chosen will be the first one which
-    # would be yielded by {#each}. If the set is empty, return `nil`.
-    #
-    # @example
-    #   Hamster::Set["A", "B", "C"].first # => "C"
-    #
-    # @return [Object]
-    def first
-      (entry = @trie.at(0)) && entry[0]
+    def head
+      find { true }
     end
+    def_delegator :self, :head, :first
 
-    # Return a {SortedSet} which contains the same items as this `Set`, ordered by
-    # the given comparator block. The comparator block should take 2 parameters and
-    # return 0, 1, or -1 depending on whether the first parameter is equal, greater than,
-    # or less than the second.
-    #
-    # @example
-    #   Hamster::Set["Elephant", "Dog", "Lion"].sort
-    #   # => Hamster::SortedSet["Dog", "Elephant", "Lion"]
-    #   Hamster::Set["Elephant", "Dog", "Lion"].sort { |a,b| a.size <=> b.size }
-    #   # => Hamster::SortedSet["Dog", "Lion", "Elephant"]
-    #
-    # @yield [a, b] A pair of items to be compared
-    # @yieldreturn [Integer]
-    # @return [SortedSet]
     def sort(&comparator)
-      SortedSet.new(self.to_a, &comparator)
+      Stream.new { Sorter.new(self).sort(&comparator) }
     end
 
-    # Return a {SortedSet} which contains the same items as this `Set`, ordered by
-    # mapping each item through the provided block to obtain sort keys, and then
-    # sorting the keys.
-    #
-    # @example
-    #   Hamster::Set["Elephant", "Dog", "Lion"].sort_by { |e| e.size }
-    #   # => Hamster::SortedSet["Dog", "Lion", "Elephant"]
-    #
-    # @yield [item] The item to obtain a sort key for
-    # @yieldreturn [Object]
-    # @return [SortedSet]
-    def sort_by(&mapper)
-      SortedSet.new(self.to_a, &mapper)
+    def sort_by(&transformer)
+      return sort unless block_given?
+      Stream.new { Sorter.new(self).sort_by(&transformer) }
+    end
+
+    def join(sep = nil)
+      to_a.join(sep)
     end
 
-    # Return a new `Set` which contains all the members of both this `Set` and `other`.
-    # `other` can be any `Enumerable` object.
-    #
-    # @example
-    #   Hamster::Set[1, 2] | Hamster::Set[2, 3] # => Hamster::Set[1, 2, 3]
-    #
-    # @param other [Enumerable] The collection to merge with
-    # @return [Set]
     def union(other)
-      if other.is_a?(Hamster::Set)
-        if other.size > size
-          small_set_pairs = @trie
-          large_set_trie = other.instance_variable_get(:@trie)
-        else
-          small_set_pairs = other.instance_variable_get(:@trie)
-          large_set_trie = @trie
-        end
-      else
-        if other.respond_to?(:lazy)
-          small_set_pairs = other.lazy.map { |e| [e, nil] }
-        else
-          small_set_pairs = other.map { |e| [e, nil] }
-        end
-        large_set_trie = @trie
+      trie = other.reduce(@trie) do |a, element|
+        next a if a.key?(element)
+        a.put(element, nil)
       end
-
-      trie = large_set_trie.bulk_put(small_set_pairs)
-      new_trie(trie)
+      transform_unless(trie.equal?(@trie)) { @trie = trie }
     end
-    alias :| :union
-    alias :+ :union
-    alias :merge :union
+    def_delegator :self, :union, :|
+    def_delegator :self, :union, :+
+    def_delegator :self, :union, :merge
 
-    # Return a new `Set` which contains all the items which are members of both
-    # this `Set` and `other`. `other` can be any `Enumerable` object.
-    #
-    # @example
-    #   Hamster::Set[1, 2] & Hamster::Set[2, 3] # => Hamster::Set[2]
-    #
-    # @param other [Enumerable] The collection to intersect with
-    # @return [Set]
     def intersection(other)
-      if other.size < @trie.size
-        if other.is_a?(Hamster::Set)
-          trie = other.instance_variable_get(:@trie).select { |key, _| include?(key) }
-        else
-          trie = Trie.new(0)
-          other.each { |obj| trie.put!(obj, nil) if include?(obj) }
-        end
-      else
-        trie = @trie.select { |key, _| other.include?(key) }
-      end
-      new_trie(trie)
+      trie = @trie.filter { |entry| other.include?(entry.key) }
+      transform_unless(trie.equal?(@trie)) { @trie = trie }
     end
-    alias :& :intersection
+    def_delegator :self, :intersection, :intersect
+    def_delegator :self, :intersection, :&
 
-    # Return a new `Set` with all the items in `other` removed. `other` can be
-    # any `Enumerable` object.
-    #
-    # @example
-    #   Hamster::Set[1, 2] - Hamster::Set[2, 3] # => Hamster::Set[1]
-    #
-    # @param other [Enumerable] The collection to subtract from this set
-    # @return [Set]
     def difference(other)
-      trie = if (@trie.size <= other.size) && (other.is_a?(Hamster::Set) || (defined?(::Set) && other.is_a?(::Set)))
-        @trie.select { |key, _| !other.include?(key) }
-      else
-        @trie.bulk_delete(other)
-      end
-      new_trie(trie)
+      trie = @trie.filter { |entry| !other.include?(entry.key) }
+      transform_unless(trie.equal?(@trie)) { @trie = trie }
     end
-    alias :subtract :difference
-    alias :- :difference
+    def_delegator :self, :difference, :diff
+    def_delegator :self, :difference, :subtract
+    def_delegator :self, :difference, :-
 
-    # Return a new `Set` which contains all the items which are members of this
-    # `Set` or of `other`, but not both. `other` can be any `Enumerable` object.
-    #
-    # @example
-    #   Hamster::Set[1, 2] ^ Hamster::Set[2, 3] # => Hamster::Set[1, 3]
-    #
-    # @param other [Enumerable] The collection to take the exclusive disjunction of
-    # @return [Set]
     def exclusion(other)
       ((self | other) - (self & other))
     end
-    alias :^ :exclusion
+    def_delegator :self, :exclusion, :^
 
-    # Return `true` if all items in this `Set` are also in `other`.
-    #
-    # @example
-    #   Hamster::Set[2, 3].subset?(Hamster::Set[1, 2, 3]) # => true
-    #
-    # @param other [Set]
-    # @return [Boolean]
     def subset?(other)
-      return false if other.size < size
-
-      # This method has the potential to be very slow if 'other' is a large Array, so to avoid that,
-      #   we convert those Arrays to Sets before checking presence of items
-      # Time to convert Array -> Set is linear in array.size
-      # Time to check for presence of all items in an Array is proportional to set.size * array.size
-      # Note that both sides of that equation have array.size -- hence those terms cancel out,
-      #   and the break-even point is solely dependent on the size of this collection
-      # After doing some benchmarking to estimate the constants, it appears break-even is at ~190 items
-      # We also check other.size, to avoid the more expensive #is_a? checks in cases where it doesn't matter
-      #
-      if other.size >= 150 && @trie.size >= 190 && !(other.is_a?(Hamster::Set) || other.is_a?(::Set))
-        other = ::Set.new(other)
-      end
       all? { |item| other.include?(item) }
     end
-    alias :<= :subset?
 
-    # Return `true` if all items in `other` are also in this `Set`.
-    #
-    # @example
-    #   Hamster::Set[1, 2, 3].superset?(Hamster::Set[2, 3]) # => true
-    #
-    # @param other [Set]
-    # @return [Boolean]
     def superset?(other)
       other.subset?(self)
     end
-    alias :>= :superset?
-
-    # Returns `true` if `other` contains all the items in this `Set`, plus at least
-    # one item which is not in this set.
-    #
-    # @example
-    #   Hamster::Set[2, 3].proper_subset?(Hamster::Set[1, 2, 3])    # => true
-    #   Hamster::Set[1, 2, 3].proper_subset?(Hamster::Set[1, 2, 3]) # => false
-    #
-    # @param other [Set]
-    # @return [Boolean]
-    def proper_subset?(other)
-      return false if other.size <= size
-      # See comments above
-      if other.size >= 150 && @trie.size >= 190 && !(other.is_a?(Hamster::Set) || other.is_a?(::Set))
-        other = ::Set.new(other)
-      end
-      all? { |item| other.include?(item) }
-    end
-    alias :< :proper_subset?
-
-    # Returns `true` if this `Set` contains all the items in `other`, plus at least
-    # one item which is not in `other`.
-    #
-    # @example
-    #   Hamster::Set[1, 2, 3].proper_superset?(Hamster::Set[2, 3])    # => true
-    #   Hamster::Set[1, 2, 3].proper_superset?(Hamster::Set[1, 2, 3]) # => false
-    #
-    # @param other [Set]
-    # @return [Boolean]
-    def proper_superset?(other)
-      other.proper_subset?(self)
-    end
-    alias :> :proper_superset?
-
-    # Return `true` if this `Set` and `other` do not share any items.
-    #
-    # @example
-    #   Hamster::Set[1, 2].disjoint?(Hamster::Set[8, 9]) # => true
-    #
-    # @param other [Set]
-    # @return [Boolean]
-    def disjoint?(other)
-      if other.size <= size
-        other.each { |item| return false if include?(item) }
-      else
-        # See comment on #subset?
-        if other.size >= 150 && @trie.size >= 190 && !(other.is_a?(Hamster::Set) || other.is_a?(::Set))
-          other = ::Set.new(other)
-        end
-        each { |item| return false if other.include?(item) }
-      end
-      true
-    end
-
-    # Return `true` if this `Set` and `other` have at least one item in common.
-    #
-    # @example
-    #   Hamster::Set[1, 2].intersect?(Hamster::Set[2, 3]) # => true
-    #
-    # @param other [Set]
-    # @return [Boolean]
-    def intersect?(other)
-      !disjoint?(other)
-    end
 
-    # Recursively insert the contents of any nested `Set`s into this `Set`, and
-    # remove them.
-    #
-    # @example
-    #   Hamster::Set[Hamster::Set[1, 2], Hamster::Set[3, 4]].flatten
-    #   # => Hamster::Set[1, 2, 3, 4]
-    #
-    # @return [Set]
     def flatten
-      reduce(self.class.empty) do |set, item|
+      reduce(EmptySet) do |set, item|
         next set.union(item.flatten) if item.is_a?(Set)
         set.add(item)
       end
     end
 
-    alias :group :group_by
-    alias :classify :group_by
-
-    # Return a randomly chosen item from this `Set`. If the set is empty, return `nil`.
-    #
-    # @example
-    #   Hamster::Set[1, 2, 3, 4, 5].sample # => 3
-    #
-    # @return [Object]
-    def sample
-      empty? ? nil : @trie.at(rand(size))[0]
+    def group_by(&block)
+      return group_by { |item| item } unless block_given?
+      reduce(EmptyHash) do |hash, item|
+        key = yield(item)
+        hash.put(key, (hash.get(key) || EmptySet).add(item))
+      end
     end
+    def_delegator :self, :group_by, :group
 
-    # Return an empty `Set` instance, of the same class as this one. Useful if you
-    # have multiple subclasses of `Set` and want to treat them polymorphically.
-    #
-    # @return [Hash]
     def clear
-      self.class.empty
+      EmptySet
     end
 
-    # Return true if `other` has the same type and contents as this `Set`.
-    #
-    # @param other [Object] The object to compare with
-    # @return [Boolean]
     def eql?(other)
-      return true if other.equal?(self)
-      return false if not instance_of?(other.class)
-      other_trie = other.instance_variable_get(:@trie)
-      return false if @trie.size != other_trie.size
-      @trie.each do |key, _|
-        return false if !other_trie.key?(key)
-      end
-      true
+      instance_of?(other.class) && @trie.eql?(other.instance_variable_get(:@trie))
     end
-    alias :== :eql?
+    def_delegator :self, :eql?, :==
 
-    # See `Object#hash`.
-    # @return [Integer]
     def hash
       reduce(0) { |hash, item| (hash << 5) - hash + item.hash }
     end
 
-    undef :"<=>" # Sets are not ordered, so Enumerable#<=> will give a meaningless result
-    undef :each_index # Set members cannot be accessed by 'index', so #each_index is not meaningful
+    def_delegator :self, :dup, :uniq
+    def_delegator :self, :dup, :nub
+    def_delegator :self, :dup, :to_set
+    def_delegator :self, :dup, :remove_duplicates
 
-    # Return `self`.
-    #
-    # @return [self]
-    def to_set
-      self
-    end
-
-    # @private
-    def marshal_dump
-      output = {}
-      each do |key|
-        output[key] = nil
-      end
-      output
+    def to_list
+      reduce(EmptyList) { |list, item| list.cons(item) }
     end
 
-    # @private
-    def marshal_load(dictionary)
-      @trie = dictionary.reduce(EmptyTrie) do |trie, key_value|
-        trie.put(key_value.first, nil)
-      end
-    end
-
-    private
-
-    def new_trie(trie)
-      if trie.empty?
-        self.class.empty
-      elsif trie.equal?(@trie)
-        self
-      else
-        self.class.alloc(trie)
-      end
+    def inspect
+      "{#{to_a.inspect[1..-2]}}"
     end
   end
 
-  # The canonical empty `Set`. Returned by `Hamster.set` and `Set[]` when
-  # invoked with no arguments; also returned by `Set.empty`. Prefer using this
-  # one rather than creating many empty sets using `Set.new`.
-  #
-  EmptySet = Hamster::Set.empty
+  EmptySet = Hamster::Set.new
 end