Mercurial > hg > octave-nkf
comparison src/DLD-FUNCTIONS/lookup.cc @ 10846:a4f482e66b65
Grammarcheck more of the documentation.
Use @noindent macro appropriately.
Limit line length to 80 characters.
author | Rik <octave@nomad.inbox5.com> |
---|---|
date | Sun, 01 Aug 2010 20:22:17 -0700 |
parents | 89f4d7e294cc |
children | 30f54b3b9953 |
comparison
equal
deleted
inserted
replaced
10845:c0ffe159ba1a | 10846:a4f482e66b65 |
---|---|
201 If the table is decreasing, then the tests are reversed.\n\ | 201 If the table is decreasing, then the tests are reversed.\n\ |
202 For non-strictly monotonic tables, empty intervals are always skipped.\n\ | 202 For non-strictly monotonic tables, empty intervals are always skipped.\n\ |
203 The result is undefined if @var{table} is not monotonic, or if\n\ | 203 The result is undefined if @var{table} is not monotonic, or if\n\ |
204 @var{table} contains a NaN.\n\ | 204 @var{table} contains a NaN.\n\ |
205 \n\ | 205 \n\ |
206 The complexity of the lookup is O(M*log(N)) where N is the size of @var{table}\n\ | 206 The complexity of the lookup is O(M*log(N)) where N is the size of\n\ |
207 and M is the size of @var{y}. In the special case when @var{y} is also sorted,\n\ | 207 @var{table} and M is the size of @var{y}. In the special case when @var{y}\n\ |
208 the complexity is O(min(M*log(N),M+N)).\n\ | 208 is also sorted, the complexity is O(min(M*log(N),M+N)).\n\ |
209 \n\ | 209 \n\ |
210 @var{table} and @var{y} can also be cell arrays of strings\n\ | 210 @var{table} and @var{y} can also be cell arrays of strings\n\ |
211 (or @var{y} can be a single string). In this case, string lookup\n\ | 211 (or @var{y} can be a single string). In this case, string lookup\n\ |
212 is performed using lexicographical comparison.\n\ | 212 is performed using lexicographical comparison.\n\ |
213 \n\ | 213 \n\ |