| OLD | NEW |
| 1 # 2007 April 26 | 1 # 2007 April 26 |
| 2 # | 2 # |
| 3 # The author disclaims copyright to this source code. | 3 # The author disclaims copyright to this source code. |
| 4 # | 4 # |
| 5 #************************************************************************* | 5 #************************************************************************* |
| 6 # This file implements tests for prefix-searching in the fts2 | 6 # This file implements tests for prefix-searching in the fts2 |
| 7 # component of the SQLite library. | 7 # component of the SQLite library. |
| 8 # | 8 # |
| 9 # $Id: fts2n.test,v 1.2 2007/12/13 21:54:11 drh Exp $ | 9 # $Id: fts2n.test,v 1.2 2007/12/13 21:54:11 drh Exp $ |
| 10 # | 10 # |
| (...skipping 176 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 187 | 187 |
| 188 # TODO(shess) It would be useful to test a couple edge cases, but I | 188 # TODO(shess) It would be useful to test a couple edge cases, but I |
| 189 # don't know if we have the precision to manage it from here at this | 189 # don't know if we have the precision to manage it from here at this |
| 190 # time. Prefix hits can cross leaves, which the code above _should_ | 190 # time. Prefix hits can cross leaves, which the code above _should_ |
| 191 # hit by virtue of size. There are two variations on this. If the | 191 # hit by virtue of size. There are two variations on this. If the |
| 192 # tree is 2 levels high, the code will find the leaf-node extent | 192 # tree is 2 levels high, the code will find the leaf-node extent |
| 193 # directly, but if its higher, the code will have to follow two | 193 # directly, but if its higher, the code will have to follow two |
| 194 # separate interior branches down the tree. Both should be tested. | 194 # separate interior branches down the tree. Both should be tested. |
| 195 | 195 |
| 196 finish_test | 196 finish_test |
| OLD | NEW |