* This class uses SortedStringListND to implement a "faster" storage of * strings. It sort of implements a std::set that allows you * to add to the set and check for existence of the set. * * It's only faster in the sense that memory moves now only need to occur * on the array of string_t structs (or pointers) rather than entire * strings. A truly faster implementation would
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected