In its current implementation, IsInNode creates its state data structure without any knowledge about its predecessors min and max values. For integral predecessors, we could optimize this by preallocating the memory at construction. This could open up the door for different data structure (as opposed to the current std::unordered_map), e.g. a modified sparse set.
In its current implementation,
IsInNodecreates its state data structure without any knowledge about its predecessorsminandmaxvalues. For integral predecessors, we could optimize this by preallocating the memory at construction. This could open up the door for different data structure (as opposed to the currentstd::unordered_map), e.g. a modified sparse set.