union_find.rb in stamina-0.4.0

- old
+ new

@@ -84,11 +84,11 @@
     # user data are freezed by this class at creation time and union time.
     #
     # == Transactional support
     #
     # The main aim of this UnionFind is to make the implementation induction algorithms 
-    # Stamina::Induction::RPNI and Stamina::Induction::RedBlue (sufficiently) efficient, 
+    # Stamina::Induction::RPNI and Stamina::Induction::BlueFringe (sufficiently) efficient, 
     # simple and readable. These algorithms rely on a try-and-error strategy are must be
     # able to revert the changes they have made during their last try. The transaction 
     # support implemented by this data structure helps them achieving this goal. For this
     # we provide the following methods:
     #
@@ -127,11 +127,11 @@
         
         #
         # Duplicates this node, ensuring that future changes will not affect the copy. 
         # Please note that the user data itself is not duplicated and is not expected 
         # to change. This property (not changing user data) is respected by the RPNI
-        # and RedBlue classes as implemented in this library.
+        # and BlueFringe classes as implemented in this library.
         #
         def dup
           Node.new(@parent, @data)
         end
         
@@ -372,6 +372,6 @@
       
       protected :elements=
     end # class UnionFind
     
   end # module Induction
-end # module Stamina
\ No newline at end of file
+end # module Stamina