Changes between Version 4 and Version 5 of IMMUTABLE_TREE_R0

Timestamp:

08/18/09 18:00:47 (16 years ago)

Author:

stefan

Comment:

--

IMMUTABLE_TREE_R0

@@ -6 +6 @@
 
 == Overview ==
-In order that new project's persistence could be implemented, immutable structures are needed - like immutable tree. Immutability requires that every operation delivers reference to a new tree, in which changes (one defined by the operation) are made, in same time not modifying the tree of origin.
+In order that new project's persistence could be implemented, immutable structures are needed - like immutable tree. Immutability requires that every operation delivers reference to a new tree, in which changes (one defined by the operation) are made, in same time not modifying the tree of origin. In that sence, operation should use data of the origin tree as much as possible, and add/remove/change elements only where needed.
 
 == Task requirements ==
@@ -15 +15 @@
 
 == Task result ==
-^(List the end product of the task (for example "Source code", "Wiki page", etc.))^
+Source code that contains working hierarchy of persistence structures with hashing ability.
 
 == Implementation idea ==
-^(Provide some rough implementation idea(s).)^
+Simple implementation hierarchy and name convention:
+ * Collection
+  * List
+  * Set
+  * Map
+ * Tree
+  * Hashing Tree
+For the hashing purposes, several already existing classes are introduced (like Hash, Hasher...). Good idea for the names of the classes and methods is to add "imm" prefix to classes that contain structures and are used to store persistent data. 
 
 == Related ==
@@ -24 +31 @@
 
 == How to demo ==
-^(Provide instructions for demonstration of the task.)^
+Result of the time-capacity performance of the Red-Black tree.
 
 = Design =
-^(Describe your design here.)^
+Following UML class diagram describes the class hierarchy that should be implemented:
+[[Image(imm.jpg)]]
+
+Class ImmDosTree will be the implementation of Red-Black indexed tree. It's extension - ImmHashingTree contains hashable Nodes, so, itself is a hashable tree.
 
 = Implementation =