diff options
| author | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2011-12-05 22:04:08 -0600 |
|---|---|---|
| committer | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2011-12-05 22:04:08 -0600 |
| commit | e02e31c8b9d854cd62cbe9799228f6e08e882773 (patch) | |
| tree | 53303c981d0b20e03c5a2fc8e959fa74adcb90d1 /src/3rdparty/sqlite/btree.c | |
| parent | 143f194af098d44bf0dd1ebb29e59f30ce48d523 (diff) | |
| download | tqt3-e02e31c8b9d854cd62cbe9799228f6e08e882773.tar.gz tqt3-e02e31c8b9d854cd62cbe9799228f6e08e882773.zip | |
Sync with latest script
Diffstat (limited to 'src/3rdparty/sqlite/btree.c')
| -rw-r--r-- | src/3rdparty/sqlite/btree.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/3rdparty/sqlite/btree.c b/src/3rdparty/sqlite/btree.c index 84a398f17..c5f077ab3 100644 --- a/src/3rdparty/sqlite/btree.c +++ b/src/3rdparty/sqlite/btree.c @@ -31,7 +31,7 @@ ** on Ptr(N+1) and its subpages have values greater than Key(N). And ** so forth. ** -** Finding a particular key retquires reading O(log(M)) pages from the +** Finding a particular key requires reading O(log(M)) pages from the ** disk where M is the number of entries in the tree. ** ** In this implementation, a single file can hold one or more separate @@ -100,7 +100,7 @@ typedef struct FreelistInfo FreelistInfo; ** All structures on a database page are aligned to 4-byte boundries. ** This routine rounds up a number of bytes to the next multiple of 4. ** -** This might need to change for computer architectures that retquire +** This might need to change for computer architectures that require ** and 8-byte alignment boundry for structures. */ #define ROUNDUP(X) ((X+3) & ~3) |