diff options
| author | Tobias Brunner <tobias@strongswan.org> | 2011-07-20 15:57:53 +0200 |
|---|---|---|
| committer | Tobias Brunner <tobias@strongswan.org> | 2011-07-20 16:14:10 +0200 |
| commit | f3bb1bd0390407cdc0e807cd9789f5d464034479 (patch) | |
| tree | b4f0a5dea4b9f4814bbdec5f1809dec532b9d458 /src/libstrongswan/processing/scheduler.h | |
| parent | 20a44a5c66960db55803e8a24a3f855a7462adf1 (diff) | |
| download | strongswan-f3bb1bd0390407cdc0e807cd9789f5d464034479.tar.bz2 strongswan-f3bb1bd0390407cdc0e807cd9789f5d464034479.tar.xz | |
Fixed common misspellings.
Mostly found by 'codespell'.
Diffstat (limited to 'src/libstrongswan/processing/scheduler.h')
| -rw-r--r-- | src/libstrongswan/processing/scheduler.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/libstrongswan/processing/scheduler.h b/src/libstrongswan/processing/scheduler.h index f2c72550f..abbf74e2c 100644 --- a/src/libstrongswan/processing/scheduler.h +++ b/src/libstrongswan/processing/scheduler.h @@ -35,7 +35,7 @@ typedef struct scheduler_t scheduler_t; * based data structure that satisfies the following property: if B is a child * node of A, then key(A) >= (or <=) key(B). So either the element with the * greatest (max-heap) or the smallest (min-heap) key is the root of the heap. - * We use a min-heap whith the key being the absolute unix time at which an + * We use a min-heap with the key being the absolute unix time at which an * event is scheduled. So the root is always the event that will fire next. * * An earlier implementation of the scheduler used a sorted linked list to store |