How about us to make a list of pointers in onlist and then remove? Best Regards,
SZ On Sun, Dec 4, 2011 at 15:24, Fastream Technologies <ga...@fastream.com>wrote: > Arno, > > The deletions occur once in a day/week or so, when the end admin user > clicks a button in GUI. It is not a part of every second cache operation. > What is the easiest/safest way to delete by iteration? > > a. Implement a new TCacheTree with IPv6 AVLPointerTree? > b. A very slow workaround for the current class (speed is NOT an issue). > Best Regards, > > SZ > On Sun, Dec 4, 2011 at 14:31, Arno Garrels <arno.garr...@gmx.de> wrote: > >> Fastream Technologies wrote: >> > Ok but how do I delete with respect to a data->property?? >> >> One needs one linked tree for each search key, if you >> have to iterate over a tree in order to find something a list >> would likely be faster. But if can live with slow deletions >> maybe you can use TIcsAvlPointerTree rather than TAvlTree to write >> a new TCacheTree. >> >> > We use >> > regex and string comparison for this! If you can help me with it, I >> > will appreciate. We can be sponsors for this feature. I think we can >> > live with OnList way but really need to be able to delete with >> > respect to data... >> >> Sounds like plenty of keys, I'm not sure whether this would be faster >> with trees. >> >> -- >> Arno Garrels >> >> >> >> -- >> To unsubscribe or change your settings for TWSocket mailing list >> please goto http://lists.elists.org/cgi-bin/mailman/listinfo/twsocket >> Visit our website at http://www.overbyte.be >> > > -- To unsubscribe or change your settings for TWSocket mailing list please goto http://lists.elists.org/cgi-bin/mailman/listinfo/twsocket Visit our website at http://www.overbyte.be
