diff options
| author | Nick Mathewson <nickm@torproject.org> | 2008-12-26 17:35:08 +0000 |
|---|---|---|
| committer | Nick Mathewson <nickm@torproject.org> | 2008-12-26 17:35:08 +0000 |
| commit | df5e8f65bcc1ed3353c45a80baab126476aa5011 (patch) | |
| tree | 142809c03246a9f40c8813313f1ade11466dfe05 /src/common/container.c | |
| parent | 41aef35963efb37b85ac7ea1d24b3bd1dea936cb (diff) | |
| download | tor-df5e8f65bcc1ed3353c45a80baab126476aa5011.tar tor-df5e8f65bcc1ed3353c45a80baab126476aa5011.tar.gz | |
Add more missing documentation, and correct an error in container.c documentation: Don't introduce two parameters called n when you're calling an algorithm O(n).
svn:r17783
Diffstat (limited to 'src/common/container.c')
| -rw-r--r-- | src/common/container.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/common/container.c b/src/common/container.c index 4fed9184d..f5cde0261 100644 --- a/src/common/container.c +++ b/src/common/container.c @@ -1199,7 +1199,7 @@ digestmap_size(const digestmap_t *map) * function for an array of type <b>elt_t</b>*. * * NOTE: The implementation kind of sucks: It's O(n log n), whereas finding - * the nth element of a list can be done in O(n). Then again, this + * the kth element of an n-element list can be done in O(n). Then again, this * implementation is not in critical path, and it is obviously correct. */ #define IMPLEMENT_ORDER_FUNC(funcname, elt_t) \ static int \ |