equal
deleted
inserted
replaced
141 PrioType prio() const { |
141 PrioType prio() const { |
142 return container[minimum].prio; |
142 return container[minimum].prio; |
143 } |
143 } |
144 |
144 |
145 |
145 |
|
146 |
|
147 |
|
148 PrioType& operator[](const Item& it) const { |
|
149 return container[iimap.get(it)].prio; |
|
150 } |
|
151 |
|
152 const PrioType& operator[](const Item& it) const { |
|
153 return container[iimap.get(it)].prio; |
|
154 } |
|
155 |
146 const PrioType get(const Item& it) const { |
156 const PrioType get(const Item& it) const { |
147 return container[iimap.get(it)].prio; |
157 return container[iimap.get(it)].prio; |
148 } |
158 } |
|
159 |
149 |
160 |
150 |
161 |
151 void pop() { |
162 void pop() { |
152 /*The first case is that there are only one root.*/ |
163 /*The first case is that there are only one root.*/ |
153 if ( container[minimum].left_neighbor==minimum ) { |
164 if ( container[minimum].left_neighbor==minimum ) { |