We need Priority Queue, Queue and Stack!

[gogo40]

Hi, I think we need more STL objects like Prioirty Queue, Queue and Stack and a "generic" Map.

function comparator(var a, var b) {
          return lexicographic_compare(a, b);
}

var o = Class.new(3, 4, 5);
var m = GenericMap.new(comparator);

m[Class.new(3, 4, 5)] = o;

var pQ = PriorityQueue.new(comparator);
pQ.push(o);

while (!pQ.empty()) {
         var u = pQ.top(); pQ.pop();
         pQ.push(Class.new(3, 4));
}

[felipensp]

I've started with the std.collection module. Initially have added Stack class.

[gogo40]

We need set<>, multiset. list and multimap too! And iterator!

[gogo40]

@felipensp great work!

[gogo40]

I think we need some collection operations:

//Array and List operations
a =[ 3];
a += [1];   // result =  [3,1]
a += [3];   // result  =  [3, 1, 3]
a += [3, 4, 5, 6]; // result = [ 3, 1, 3, 3, 4, 5, 6]
a = [3] + [ 4];  // result =  [3, 4]

//Set operations
a = { 3 , 4} + {3, 5, 6}; // result =  {3, 4, 5, 6}
a = a - { 5 , 3}; // result = { 4, 6}
a -= {4}; // result = {6}
a -= {7}; // resutl = {6}