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) { |
146 PrioType& operator[](const Item& it) { |
149 return container[iimap[it]].prio; |
147 return container[iimap[it]].prio; |
150 } |
148 } |
|
149 |
151 |
150 |
152 const PrioType& operator[](const Item& it) const { |
151 const PrioType& operator[](const Item& it) const { |
153 return container[iimap[it]].prio; |
152 return container[iimap[it]].prio; |
154 } |
153 } |
155 |
154 |
156 // const PrioType get(const Item& it) const { |
155 |
157 // return container[iimap[it]].prio; |
156 const PrioType get(const Item& it) const { |
158 // } |
157 return container[iimap[it]].prio; |
159 |
158 } |
|
159 |
160 void pop() { |
160 void pop() { |
161 /*The first case is that there are only one root.*/ |
161 /*The first case is that there are only one root.*/ |
162 if ( container[minimum].left_neighbor==minimum ) { |
162 if ( container[minimum].left_neighbor==minimum ) { |
163 container[minimum].in=false; |
163 container[minimum].in=false; |
164 if ( container[minimum].degree!=0 ) { |
164 if ( container[minimum].degree!=0 ) { |