mruby-set: remove methods added by AI hallucination

mrbgems/mruby-set/mrblib/set.rb

@@ -186,71 +186,4 @@ class Set
 
     Set.new(classify(&func).values)
   end
-
-  # Additional convenience methods that leverage C optimizations
-
-  # Returns true if this set is a proper subset of the given set
-  def proper_subset_of?(set)
-    proper_subset?(set)
-  end
-
-  # Returns true if this set is a proper superset of the given set
-  def proper_superset_of?(set)
-    proper_superset?(set)
-  end
-
-  # Returns true if this set is a subset of the given set
-  def subset_of?(set)
-    subset?(set)
-  end
-
-  # Returns true if this set is a superset of the given set
-  def superset_of?(set)
-    superset?(set)
-  end
-
-  # Efficiently merge multiple enumerables at once
-  def merge_all(*enums)
-    enums.each { |enum| merge(enum) }
-    self
-  end
-
-  # Efficiently subtract multiple enumerables at once
-  def subtract_all(*enums)
-    enums.each { |enum| subtract(enum) }
-    self
-  end
-
-  # Create a new set with elements from multiple enumerables
-  def self.union(*enums)
-    result = new
-    enums.each { |enum| result.merge(enum) }
-    result
-  end
-
-  # Create a new set with intersection of multiple sets
-  def self.intersection(*sets)
-    return new if sets.empty?
-
-    result = sets.first.dup
-    sets[1..-1].each { |set| result = result & set }
-    result
-  end
-
-  # Optimized version of replace for arrays
-  def replace_with_array(array)
-    clear
-    add_all(*array)
-    self
-  end
-
-  # Fast check if set contains exactly these elements
-  def contains_exactly?(*elements)
-    size == elements.size && include_all?(*elements)
-  end
-
-  # Fast check if set overlaps with given elements
-  def overlaps_with?(*elements)
-    include_any?(*elements)
-  end
 end