Lines Matching refs:table

40 # 1. A table with a single indexed field is created.
41 # 2. Approximately 20 rows are inserted into the table. Each row is long 
42 #    enough such that it uses at least 2 overflow pages for both the table 
46 # 4. After each transaction the table data is checked to ensure it is correct
61 # The length of each table entry. 
77   # Set up the table.
94     # Delete one set of rows from the table.
109     # Ensure the data remaining in the table is what was expected.
138 # autovacuum-2.4.*: Check that a table can be created correctly when the
140 # autovacuum-2.5.*: Check that a table with indices can be dropped. This
142 #                   indices/table btrees could move the root-page of another.
156 # Create a table and put some data in it.
174 # Create another table. Check it is located immediately after the first.
186 # Create another table. Check it is located immediately after the second.
198 # Create another table. Check it is located immediately after the second.
362 # a table or indice is moved, these queries will fail. They are repeated
363 # after each table is dropped (i.e. as test cases 2.5.*.[1..4]).
385 # Drop table av3. Indices av4_i2, av4_i3 and av4_i4 are moved to fill the two
415 # Drop table av1:
437 # Drop table av4:
571 # values in the symbol table have to be updated.  There was a bug in this
572 # logic so that if an index/table was moved twice, the second move might
573 # not occur.  This would leave the internal symbol table in an inconsistent
608 # entry in the page hash-table (internal to the pager.c module.