Changeset 2386:81b47fc5c444 in lemon-0.x for lemon/radix_heap.h
- Timestamp:
- 03/02/07 19:04:28 (17 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3217
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/radix_heap.h
r2263 r2386 151 151 private: 152 152 153 bool upper(int box, Prio pr io) {154 return pr io< boxes[box].min;155 } 156 157 bool lower(int box, Prio pr io) {158 return pr io>= boxes[box].min + boxes[box].size;153 bool upper(int box, Prio pr) { 154 return pr < boxes[box].min; 155 } 156 157 bool lower(int box, Prio pr) { 158 return pr >= boxes[box].min + boxes[box].size; 159 159 } 160 160 … … 188 188 void extend() { 189 189 int min = boxes.back().min + boxes.back().size; 190 int size= 2 * boxes.back().size;191 boxes.push_back(RadixBox(min, size));190 int bs = 2 * boxes.back().size; 191 boxes.push_back(RadixBox(min, bs)); 192 192 } 193 193 … … 201 201 202 202 /// \brief Find up the proper box for the item with the given prio. 203 int findUp(int start, int pr io) {204 while (lower(start, pr io)) {205 if (++start == (int)boxes.size()) {203 int findUp(int start, int pr) { 204 while (lower(start, pr)) { 205 if (++start == int(boxes.size())) { 206 206 extend(); 207 207 } … … 219 219 220 220 /// \brief Find up the proper box for the item with the given prio. 221 int findDown(int start, int pr io) {222 while (upper(start, pr io)) {221 int findDown(int start, int pr) { 222 while (upper(start, pr)) { 223 223 if (--start < 0) throw UnderFlowPriorityError(); 224 224 } … … 261 261 262 262 void relocate_last(int index) { 263 if (index != (int)data.size() - 1) {263 if (index != int(data.size()) - 1) { 264 264 data[index] = data.back(); 265 265 if (data[index].prev != -1) {
Note: See TracChangeset
for help on using the changeset viewer.