adamant's blog

Add Policy Based Data Structures in the C++ standard
By adamant, history, 9 years ago, translation, In English

Hi everyone!

I suggested adding policy based data structures from SGI STL into C++ standard. You can know this useful library from here. What do you think of it?

  • Vote: I like it
  • +82
  • Vote: I do not like it

»
9 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been translated by adamant (original revision, translated revision, compare)

→ Reply
»
9 years ago, hide # |
 
Vote: I like it +33 Vote: I do not like it

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.

→ Reply
  • »
    »
    9 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    STL should be useful, not simple.

    → Reply
    • »
      »
      »
      9 years ago, hide # ^ |
       
      Vote: I like it +18 Vote: I do not like it

      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)

      → Reply
»
9 years ago, hide # |
 
Vote: I like it -29 Vote: I do not like it

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.

→ Reply
  • »
    »
    9 years ago, hide # ^ |
     
    Vote: I like it +34 Vote: I do not like it

    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

    → Reply