diff options
| author | drh <drh@noemail.net> | 2015-04-28 01:28:36 +0000 |
|---|---|---|
| committer | drh <drh@noemail.net> | 2015-04-28 01:28:36 +0000 |
| commit | 42c0a2b2f3cb0d66a732a4a371d87b7c8be859d2 (patch) | |
| tree | 48b85f10be6a166b5a3ed975ddd5b09a036756e3 /src | |
| parent | 4d35c41f48507c7cb9e7d27e291eda16347cf34e (diff) | |
| download | sqlite-42c0a2b2f3cb0d66a732a4a371d87b7c8be859d2.tar.gz sqlite-42c0a2b2f3cb0d66a732a4a371d87b7c8be859d2.zip | |
Fix comment typos. No code changes.
FossilOrigin-Name: 60174cf572f8788e67a0434d5fe763724d7425a3
Diffstat (limited to 'src')
| -rw-r--r-- | src/btree.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/btree.c b/src/btree.c index c23cdb947..154b29787 100644 --- a/src/btree.c +++ b/src/btree.c @@ -8537,12 +8537,12 @@ static void checkList( ** ** The heap property is this: Every node is less than or equal to both ** of its daughter nodes. A consequence of the heap property is that the -** root node aHeap[1] is always the minimum value current in the heap. +** root node aHeap[1] is always the minimum value currently in the heap. ** ** The btreeHeapInsert() routine inserts an unsigned 32-bit number onto ** the heap, preserving the heap property. The btreeHeapPull() routine ** removes the root element from the heap (the minimum value in the heap) -** and then move other nodes around as necessary to preserve the heap +** and then moves other nodes around as necessary to preserve the heap ** property. ** ** This heap is used for cell overlap and coverage testing. Each u32 |