denozord/strongswan-ext
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

typo

Browse Source
This commit is contained in:
Tobias Brunner
2009-05-18 13:04:18 +02:00
parent 09dbca9fbf
commit 68173e1fea
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/charon/processing/scheduler.h
+1 -1
View File
@@ -71,7 +71,7 @@ typedef struct scheduler_t scheduler_t;
* position. In a one-based array that position equals the number of elements * position. In a one-based array that position equals the number of elements
* currently stored in the heap. Then the heap property has to be restored, i.e. * currently stored in the heap. Then the heap property has to be restored, i.e.
* the new element has to be "bubbled up" the tree until the parent node's key * the new element has to be "bubbled up" the tree until the parent node's key
* is smaller or new element got the new root of the tree. * is smaller or the element got the new root of the tree.
* *
* Removing the next event from the heap works similarly. The event itself is * Removing the next event from the heap works similarly. The event itself is
* the root node and stored at position 1 of the array. After removing it, the * the root node and stored at position 1 of the array. After removing it, the