Difference between revisions of "Talk:DIP55"

From D Wiki
Jump to: navigation, search
(Created page with "2016-06-15 - FBergemann: ------------------------ An initial version of <br> [https://github.com/FBergemann/ASF-RBT/tree/for_delete ASF RBT] Red/Black-Tree algorithm using thi...")
 
Line 3: Line 3:
 
An initial version of <br>
 
An initial version of <br>
 
[https://github.com/FBergemann/ASF-RBT/tree/for_delete ASF RBT] Red/Black-Tree algorithm using this programming model w/o need for a parent ptr in the node structure. <br>
 
[https://github.com/FBergemann/ASF-RBT/tree/for_delete ASF RBT] Red/Black-Tree algorithm using this programming model w/o need for a parent ptr in the node structure. <br>
...is available now. <br>
+
- including delete operation - <br>
 +
is available now. <br>
 
I feel excited about the new way of programming :-) <br>
 
I feel excited about the new way of programming :-) <br>
 
And i am pretty sure, so far i only touched the top of an iceberg. <br>
 
And i am pretty sure, so far i only touched the top of an iceberg. <br>

Revision as of 14:34, 15 June 2016

2016-06-15 - FBergemann:


An initial version of
ASF RBT Red/Black-Tree algorithm using this programming model w/o need for a parent ptr in the node structure.
- including delete operation -
is available now.
I feel excited about the new way of programming :-)
And i am pretty sure, so far i only touched the top of an iceberg.
Notes:
+) ASF-RBT still has to be tested, documented, and cleaned-up (re-align "insert" with experiences from "delete"), maybe still some errors to be fixed.
+) ASF-RBT is just an example