Changes between Version 25 and Version 26 of IMMUTABLE_TREE_R0

Timestamp:

08/25/09 15:42:59 (16 years ago)

Author:

stefan

Comment:

--

IMMUTABLE_TREE_R0

@@ -41 +41 @@
 Class ImmDosTree will be the implementation of Red-Black indexed tree following methods will be introduced (only description in logical sense):
 
- * add element - ''following methods are consequence of the logical add cases in the Red-Black tree algorithm.''
+ * add element - ''following methods are logical consequence of the add cases in the Red-Black tree algorithm.''
   * addCase1
   * addCase2
  * set element 
- * remove element - ''following methods are consequence of the logical remove cases in the Red-Black tree algorithm.''
+ * remove element - ''following methods are logical consequence of the remove cases in the Red-Black tree algorithm.''
   * removeCase1
   * removeCase2
@@ -51 +51 @@
   * removeCase4
   * removeCase5
- * create - ''this method is used, when extending ImmDosTree class, to be overridden and to able to create an instance of the specific class, not its parent.''
+ * create - ''this method is used, when extending ImmDosTree class, to be overridden and to able to create an instance of the specific class, not its parent's class.''
 
-ImmDosTree's extension - ImmHashingTree contains hashable Nodes. ImmHashingTree contains static method ''getHash'', which in itself invokes a public method in the inner class ''HashingNode'', which calculates : 
+ImmDosTree's extension - ImmHashingTree contains hashable Nodes. ImmHashingTree contains static method ''getHash(...)'' with ''ImmCollection'' as argument, which in itself invokes a public method in the inner class ''HashingNode'', for calculating the hash value needed: 
 
 {{{