Home » U++ Library support » U++ Core » what about VectorBiMap / ArrayBiMap ?
| Re: what about VectorBiMap / ArrayBiMap ? [message #26416 is a reply to message #26410] |
Fri, 30 April 2010 13:13   |
Mindtraveller
Messages: 917
Registered: August 2007
Location: Russia, Moscow rgn.
|
Experienced Contributor |
|
|
Over three years of using U++ containers approved them to be extremely quick and easy to use. Everything you put into ****Map, is searched with hash, which is extremely fast even for large number of records.
The only thing which IMO is needed is Index "const hash/key" flavour which means that container element doesn't change it's internal state far enough to change it's hash value. This flavour should make possible to return (T &) from operator[], not (const T &).
Above this thing, U++ containers are far more comfortable and fast than any STL.
[Updated on: Fri, 30 April 2010 13:14] Report message to a moderator |
|
|
|
Current Time: Fri Aug 29 20:42:56 CEST 2025
Total time taken to generate the page: 0.03257 seconds
|
Members
Pages
Help
Register
Login
Home
