| [37] | 1 | #include <iostream> | 
|---|
| [258] | 2 | #include <bin_heap.h> | 
|---|
| [37] | 3 | #include <string> | 
|---|
|  | 4 | #include <map> | 
|---|
|  | 5 |  | 
|---|
| [105] | 6 | using namespace hugo; | 
|---|
| [37] | 7 | using namespace std; | 
|---|
|  | 8 |  | 
|---|
|  | 9 | class string_int_map; | 
|---|
|  | 10 |  | 
|---|
| [39] | 11 | // Egy binaris kupac, ami stringekhez rendelt double ertekeket tarol, | 
|---|
|  | 12 | // azaz mindig az a string van a tetejen, amihez a legkisebb szam tartozik. | 
|---|
|  | 13 | // A kupac egy string_int_map tipusu property_map segitsegevel tarolja | 
|---|
|  | 14 | // a stringek aktualis helyet sajatmagan belul. | 
|---|
|  | 15 | // Egy olyan stringhez, ami meg nincsen a kupac -1 -et kell rendelnunk. | 
|---|
| [37] | 16 | typedef BinHeap<string, double, string_int_map> StrDoubleHeap; | 
|---|
|  | 17 |  | 
|---|
|  | 18 | class string_int_map : public map<string,int> { | 
|---|
| [214] | 19 | typedef map<string,int> parent; | 
|---|
| [37] | 20 | public: | 
|---|
|  | 21 | int get(const string &s) { | 
|---|
|  | 22 | // Bocs, ez igy gaaaany, de nem volt kedvem utananezni, hogy | 
|---|
|  | 23 | // hogy is mukodik ez a map :) | 
|---|
|  | 24 | if( count(s) == 0 ) { | 
|---|
| [214] | 25 | parent::operator[](s) = StrDoubleHeap::PRE_HEAP; | 
|---|
| [37] | 26 | } | 
|---|
| [214] | 27 | return parent::operator[](s); | 
|---|
|  | 28 | } | 
|---|
|  | 29 | int operator[](const string &s) { | 
|---|
|  | 30 | return get(s); | 
|---|
| [37] | 31 | } | 
|---|
| [172] | 32 | void set(const string &s, int i) { | 
|---|
| [214] | 33 | parent::operator[](s) = i; | 
|---|
| [37] | 34 | } | 
|---|
|  | 35 | }; | 
|---|
|  | 36 |  | 
|---|
|  | 37 |  | 
|---|
|  | 38 | int main() | 
|---|
|  | 39 | { | 
|---|
|  | 40 | string_int_map sim; | 
|---|
|  | 41 |  | 
|---|
|  | 42 |  | 
|---|
|  | 43 | cout << "testing string_int_map default value:\n"; | 
|---|
| [214] | 44 | cout << "  sim.get(\"alma\"): " << sim.get("alma") << endl; | 
|---|
|  | 45 | cout << "  sim[\"alma\"]: " << sim["alma"] << endl; | 
|---|
| [37] | 46 |  | 
|---|
|  | 47 | cout << "creating the heap\n"; | 
|---|
|  | 48 | StrDoubleHeap heap(sim); | 
|---|
|  | 49 |  | 
|---|
|  | 50 | cout << "heap.push(\"alma\", 15);\n"; | 
|---|
|  | 51 | heap.push("alma", 15); | 
|---|
|  | 52 |  | 
|---|
| [172] | 53 | cout << "heap.set(\"korte\", 3.4);\n"; | 
|---|
|  | 54 | heap.set("korte", 3.4); | 
|---|
| [37] | 55 |  | 
|---|
| [214] | 56 | cout << "heap[\"alma\"] = " | 
|---|
|  | 57 | << heap["alma"] | 
|---|
|  | 58 | << endl; | 
|---|
| [37] | 59 |  | 
|---|
|  | 60 | cout << "heap.top() = " | 
|---|
|  | 61 | << heap.top() << endl; | 
|---|
| [274] | 62 | cout << "heap.prio() = " | 
|---|
|  | 63 | << heap.prio() << endl; | 
|---|
| [37] | 64 |  | 
|---|
|  | 65 | cout << "heap.decrease(\"alma\", 1.2);\n"; | 
|---|
| [172] | 66 | heap.set("alma", 1.2); | 
|---|
| [37] | 67 |  | 
|---|
|  | 68 | cout << "heap.top() = " | 
|---|
|  | 69 | << heap.top() << endl; | 
|---|
| [274] | 70 | cout << "heap.prio() = " | 
|---|
|  | 71 | << heap.prio() << endl; | 
|---|
| [37] | 72 |  | 
|---|
| [172] | 73 | cout << "heap.set(\"alma\", 22);\n"; | 
|---|
|  | 74 | heap.set("alma", 22); | 
|---|
| [37] | 75 |  | 
|---|
|  | 76 | cout << "heap.top() = " | 
|---|
|  | 77 | << heap.top() << endl; | 
|---|
| [274] | 78 | cout << "heap.prio() = " | 
|---|
|  | 79 | << heap.prio() << endl; | 
|---|
| [37] | 80 |  | 
|---|
|  | 81 | cout << "heap.size() = " | 
|---|
|  | 82 | << heap.size() << endl; | 
|---|
|  | 83 | cout << "heap.pop();\n"; | 
|---|
|  | 84 | heap.pop(); | 
|---|
|  | 85 |  | 
|---|
|  | 86 | cout << "heap.top() = " | 
|---|
|  | 87 | << heap.top() << endl; | 
|---|
| [274] | 88 | cout << "heap.prio() = " | 
|---|
|  | 89 | << heap.prio() << endl; | 
|---|
| [37] | 90 |  | 
|---|
| [39] | 91 | cout << "heap.state(\"szilva\") = " | 
|---|
|  | 92 | << heap.state("szilva") << endl; | 
|---|
| [172] | 93 | cout << "heap.set(\"szilva\", 0.5);\n"; | 
|---|
|  | 94 | heap.set("szilva", 0.5); | 
|---|
| [39] | 95 | cout << "heap.state(\"szilva\") = " | 
|---|
|  | 96 | << heap.state("szilva") << endl; | 
|---|
|  | 97 | cout << "heap.top() = " | 
|---|
|  | 98 | << heap.top() << endl; | 
|---|
|  | 99 | cout << "heap.pop();\n"; | 
|---|
|  | 100 | heap.pop(); | 
|---|
|  | 101 | cout << "heap.state(\"szilva\") = " | 
|---|
|  | 102 | << heap.state("szilva") << endl; | 
|---|
|  | 103 |  | 
|---|
| [37] | 104 | cout << "heap.size() = " | 
|---|
|  | 105 | << heap.size() << endl; | 
|---|
|  | 106 | cout << "heap.pop();\n"; | 
|---|
|  | 107 | heap.pop(); | 
|---|
|  | 108 |  | 
|---|
|  | 109 | cout << "heap.size() = " | 
|---|
|  | 110 | << heap.size() << endl; | 
|---|
|  | 111 | cout << "heap.empty() = " | 
|---|
|  | 112 | << (heap.empty()?"true":"false") << endl; | 
|---|
|  | 113 | } | 
|---|