From e02e31c8b9d854cd62cbe9799228f6e08e882773 Mon Sep 17 00:00:00 2001 From: Timothy Pearson Date: Mon, 5 Dec 2011 22:04:08 -0600 Subject: Sync with latest script --- src/3rdparty/sqlite/btree.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'src/3rdparty/sqlite/btree.c') diff --git a/src/3rdparty/sqlite/btree.c b/src/3rdparty/sqlite/btree.c index 84a398f1..c5f077ab 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) -- cgit v1.2.3