# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
Name |
---|
Auto comment: topic has been translated by adamant (original revision, translated revision, compare)
It is a great proposal but I don't think that it will be a successful one. The standard is kept as clear and simple as possible so adding a lot of data structures might break this idea.
STL should be useful, not simple.
That's wrong on many levels. Every single piece of code in the C++ standard must be maintainable and possibly upgradable (see move semantics for example). It is very hard to maintain a large number of containers so don't expect any new data structure in the near future (there are much more useful containers like
dynarray
which are not ready yet so I don't expect to see tries any time soon)Absolutely agree!!!
The find_by_order() and order_of_key() should be added to set, map. I do not want to make a long declaration to have exactly the same set structure with only two more functionality.
And I don't want to spend precious processor time to update counters I'll never use if I don't use find-by-order or orderofkey