Home
last modified time | relevance | path

Searched refs:segment (Results 1 – 25 of 28) sorted by relevance

12

/sqlite-3.40.0/ext/fts5/test/
H A Dfts5rowid.test29 SELECT fts5_rowid('segment')
30 } {1 {should be: fts5_rowid('segment', segid, pgno))}}
33 SELECT fts5_rowid('segment', 1, 1)
38 } {1 {first arg to fts5_rowid() must be 'segment'}}
96 SELECT fts5_decode(fts5_rowid('segment', 1000, 1), X'AB')
H A Dfts5ab.test188 # Check that a special case of segment promotion works. The case is where
189 # a new segment is written to level L, but the oldest segment within level
228 # Test also the other type of segment promotion - when a new segment is written
H A Dfts5corrupt.test47 DELETE FROM t1_data WHERE rowid = fts5_rowid('segment', $segid, 4);
57 rowid = fts5_rowid('segment', $segid, 4);
H A Dfts5fault7.test49 # Test fault-injection when a segment is promoted.
91 # Test fault-injection when a segment is promoted.
H A Dfts5determin.test15 # segment ids were allocated using sqlite3_randomness(), this was not the
H A Dfts5fault3.test26 # An OOM while resuming a partially completed segment merge.
H A Dfts5merge.test30 # * each segment contains records related to $nRowPerSeg rows
/sqlite-3.40.0/test/
H A Dfts2q.test43 # Utility function to check for the expected terms in the segment
65 # segment level/index. _all version does same for entire index.
101 # Should be a single initial segment.
144 # Should be a single optimal segment with the same logical results.
181 # Should be a single optimal segment with the same logical results.
207 # Test optimize() against a table involving segment merges.
209 # statements generates a segment.
295 # prior segment.
H A Dfts3d.test26 # Utility function to check for the expected terms in the segment
37 # segment level/index. _all version does same for entire index.
61 # Should be a single initial segment.
104 # Should be a single optimal segment with the same logical results.
141 # Should be a single optimal segment with the same logical results.
167 # Test optimize() against a table involving segment merges.
169 # statements generates a segment.
256 # prior segment.
H A Dfts2p.test67 } {1 {dump_terms: segment not found}}
103 } {1 {dump_doclist: segment not found}}
106 # Utility function to check for the expected terms in the segment
128 # segment level/index. _all version does same for entire index.
332 # Should be a single optimal segment with the same logical results.
H A Dfts4growth.test163 # merge operation will become the oldest segment in the index.
165 # 3.1 - when the oldest segment is created by an 'optimize'.
166 # 3.2 - when the oldest segment is created by an incremental merge.
378 # version that does not support storing segment sizes in the end_block
379 # field, no size is stored in the final segment (as it would be incorrect).
H A Dfts3cov.test30 # Similarly, when FTS3 first needs to scan through a set of segment leaves
64 # segment b-tree that uses the %_segments table to store internal nodes.
170 # When building the internal tree structure for each segment b-tree, FTS3
215 # When merging all segments at a given level to create a single segment
237 INSERT INTO t5 VALUES('segment number 16!');
246 INSERT INTO t5 VALUES('segment number 16!');
H A Dfts3c.test27 # Utility function to check for the expected terms in the segment
38 # segment level/index. _all version does same for entire index.
230 # Should be a single optimal segment with the same logical results.
H A Dfts3an.test150 # Test with a segment which will have multiple levels in the tree.
189 # prefix in a single segment.
H A Dfts4merge.test179 # segment.
263 # segment, which was unexpected).
H A Dfts2e.test26 # segment and 14 level-0 segments).
H A Dfts1e.test26 # segment and 14 level-0 segments).
H A Dfts1f.test26 # (over the level-1 segment and 15 level-0 segments).
H A Dfts3ae.test26 # segment and 14 level-0 segments).
H A Dfts2f.test26 # (over the level-1 segment and 15 level-0 segments).
H A Dfts3af.test26 # (over the level-1 segment and 15 level-0 segments).
H A Dfts2n.test150 # Test with a segment which will have multiple levels in the tree.
H A Djournal2.test41 # segment of the journal file-name (i.e. "test.db-journal") are appended to
H A Dfts3b.test53 # segdir and into %_segments. We also need to force segment merging
H A Dcorrupt.test67 # Go through the database and write garbage data into each 256 segment

12