Talk:DIP55
Revision as of 14:42, 15 June 2016 by FBergemann (talk | contribs)
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 was modelled on some existing legacy implementation. So it's far away from a natural implementation using the new programming model.
+) ASF-RBT is just an example for this new toolbox offered by functions having a *caller ptr for the calling function.
