diff options
| author | Tobias Brunner <tobias@strongswan.org> | 2009-05-18 13:04:18 +0200 |
|---|---|---|
| committer | Tobias Brunner <tobias@strongswan.org> | 2009-05-18 13:04:18 +0200 |
| commit | 68173e1fea0e642e69c20d2c50100f7392e5f823 (patch) | |
| tree | 1cbf26e6dac4dbc4ead02400978f1bccbc22e98d | |
| parent | 09dbca9fbfcf43a2e62daeac63e01f5740a16654 (diff) | |
| download | strongswan-68173e1fea0e642e69c20d2c50100f7392e5f823.tar.bz2 strongswan-68173e1fea0e642e69c20d2c50100f7392e5f823.tar.xz | |
typo
| -rw-r--r-- | src/charon/processing/scheduler.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/charon/processing/scheduler.h b/src/charon/processing/scheduler.h index 5711a636f..502f70b33 100644 --- a/src/charon/processing/scheduler.h +++ b/src/charon/processing/scheduler.h @@ -71,7 +71,7 @@ typedef struct scheduler_t scheduler_t; * 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. * 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 * the root node and stored at position 1 of the array. After removing it, the |