OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2006 Maxim Yegorushkin <maxim.yegorushkin@gmail.com> | 2 * Copyright (c) 2006 Maxim Yegorushkin <maxim.yegorushkin@gmail.com> |
3 * All rights reserved. | 3 * All rights reserved. |
4 * | 4 * |
5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
6 * modification, are permitted provided that the following conditions | 6 * modification, are permitted provided that the following conditions |
7 * are met: | 7 * are met: |
8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
(...skipping 129 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
140 if(!(min_heap_elem_greater(e, s->p[min_child]))) | 140 if(!(min_heap_elem_greater(e, s->p[min_child]))) |
141 break; | 141 break; |
142 (s->p[hole_index] = s->p[min_child])->min_heap_idx = hole_index; | 142 (s->p[hole_index] = s->p[min_child])->min_heap_idx = hole_index; |
143 hole_index = min_child; | 143 hole_index = min_child; |
144 min_child = 2 * (hole_index + 1); | 144 min_child = 2 * (hole_index + 1); |
145 } | 145 } |
146 min_heap_shift_up_(s, hole_index, e); | 146 min_heap_shift_up_(s, hole_index, e); |
147 } | 147 } |
148 | 148 |
149 #endif /* _MIN_HEAP_H_ */ | 149 #endif /* _MIN_HEAP_H_ */ |
OLD | NEW |