I don't know the internals of the C++ std::map. I *suspect* it does not: if you add sorted data you will end up with a very unbalanced tree. I could be wrong. I used it extensively in my SIEM Agent and it worked like a charm, but I never looked under the covers.
Charles -----Original Message----- From: IBM Mainframe Assembler List [mailto:[email protected]] On Behalf Of Paul Gilmartin Sent: Wednesday, February 23, 2022 2:47 PM To: [email protected] Subject: Re: SRST vs. SRSTU On Feb 23, 2022, at 15:08:16, Charles Mills wrote: > > If you are writing in C++ then the B-tree is all implemented for you, and it is a d@mned fast implementation. > ' That would be nice. I've played with the POSIX tdelete, tfind, tsearch, twalk - manage a binary search tree on various platforms and they appear not to balance the tree. <https://pubs.opengroup.org/onlinepubs/9699919799/functions/tdelete.html#tag _16_609> -- gil
