06786c34d7
The hash table for integer hashes is extremely limited and places most elements in the same buckets. This leads to a linear search time for structures built on this. This blocks hashes, directing the coder to utilize std::set or std::map structures instead of hash tables for implementing integer-based lookups. |
||
|---|---|---|
| .. | ||
| arraydim.h | ||
| kicad_algo.h | ||
| minoptmax.h | ||
| mirror.h | ||
| spinlock.h | ||
| typeinfo.h | ||
| wx_stl_compat.h | ||