| /sqlite-3.40.0/test/ |
| H A D | closure01.test | 46 SELECT count(*), depth FROM below GROUP BY depth ORDER BY 1;
85 AND depth=1
93 AND depth=3
109 # depth<5
111 SELECT count(*), depth FROM cx WHERE root=1 AND depth<5
123 SELECT count(*), depth FROM below GROUP BY depth ORDER BY 1;
126 # depth<=5
128 SELECT count(*), depth FROM cx WHERE root=1 AND depth<=5
132 # depth==5
134 SELECT count(*), depth FROM cx WHERE root=1 AND depth=5
[all …]
|
| H A D | with1.test | 548 WITH flat(fid, depth, p) AS (
551 SELECT id, depth+1, p||'/'||payload FROM flat, tree WHERE parentid=fid
646 WITH flat(fid, depth, p) AS (
649 SELECT id, depth+1, p||'/'||payload FROM flat, tree WHERE parentid=fid
658 WITH flat(fid, depth, p) AS (
662 SELECT id, depth+1, (p||'/'||payload)
673 WITH flat(fid, depth, p) AS (
677 SELECT id, depth+1, (p||'/'||payload) COLLATE nocase
702 # used to control depth-first versus breath-first search in a tree.
759 # Change that to "ORDER BY level DESC" for a depth-first search.
|
| H A D | sqllimits1.test | 425 longer without increasing the expression depth */\
435 longer without increasing the expression depth */\
694 # EVIDENCE-OF: R-12723-08526 SQLITE_LIMIT_EXPR_DEPTH The maximum depth
707 } "1 {Expression tree is too large (maximum depth $::SQLITE_MAX_EXPR_DEPTH)}"
709 # Attempting to beat the expression depth limit using nested SELECT
741 } "1 {Expression tree is too large (maximum depth $::SQLITE_MAX_EXPR_DEPTH)}"
|
| H A D | fts3expr3.test | 160 # These exceed the depth limit.
168 # This also exceeds the depth limit.
|
| H A D | hook.test | 745 eval lappend ::preupdate [db preupdate depth]
|
| H A D | e_fkey.test | 2922 # Test that the maximum recursion depth of foreign key action programs is
2928 # depth of trigger program recursion. For the purposes of these limits,
|
| H A D | fts1porter.test | 5544 depth depth
5545 depths depth
|
| /sqlite-3.40.0/tool/ |
| H A D | stack_usage.tcl | 33 scan $xdepth %x depth
34 set stkdepth($curfunc) $depth
47 foreach {depth fname} $sd break
48 puts [format {%6d %s} $depth $fname]
84 set depth 0
86 set depth [expr {$depth+$stkdepth($b)}]
88 lappend pathlist [list $depth $m]
92 foreach {depth m} $path break
94 puts [format {%6d %s %d} $depth $first $stkdepth($first)]
|
| H A D | fragck.tcl | 122 set depth 1
126 incr depth
132 puts [format {LEVEL %d: %6d} $depth $pg]
|
| H A D | spaceanal.tcl | 222 depth int, -- Depth of the b-tree
247 set depth 0
269 AS depth
482 if {$cnt==1} {statline {B-tree depth} $depth}
|
| /sqlite-3.40.0/src/ |
| H A D | mem2.c | 439 void sqlite3MemdebugBacktrace(int depth){ in sqlite3MemdebugBacktrace() argument
440 if( depth<0 ){ depth = 0; } in sqlite3MemdebugBacktrace()
441 if( depth>20 ){ depth = 20; } in sqlite3MemdebugBacktrace()
442 depth = (depth+1)&0xfe; in sqlite3MemdebugBacktrace()
443 mem.nBacktrace = depth; in sqlite3MemdebugBacktrace()
|
| H A D | test_rtree.c | 373 double depth; member
421 pCube->depth = p->aParam[5]; in cube_geom()
433 && aCoord[4]<=(pCube->z+pCube->depth) in cube_geom()
|
| H A D | test_malloc.c | 522 int depth; in test_memdebug_backtrace() local
527 if( Tcl_GetIntFromObj(interp, objv[1], &depth) ) return TCL_ERROR; in test_memdebug_backtrace()
531 sqlite3MemdebugBacktrace(depth); in test_memdebug_backtrace()
|
| H A D | btree.c | 10396 int depth = -1, d2; /* Depth of a subtree */ in checkTreePage() local
10476 depth = checkTreePage(pCheck, pgno, &maxKey, maxKey); in checkTreePage()
10543 if( d2!=depth ){ in checkTreePage()
10545 depth = d2; in checkTreePage()
10639 return depth+1; in checkTreePage()
|
| H A D | sqlite.h.in | 4001 ** <dd>The maximum depth of the parse tree on any expression.</dd>)^
4028 ** <dd>The maximum depth of recursion for triggers.</dd>)^
|
| /sqlite-3.40.0/ext/misc/ |
| H A D | btreeinfo.c | 96 int depth; /* depth value */ member
286 pCsr->depth = 1; in binfoCompute()
320 pCsr->depth++; in binfoCompute()
368 sqlite3_result_int(ctx, pCsr->depth); in binfoColumn()
|
| /sqlite-3.40.0/ext/wasm/fiddle/ |
| H A D | fiddle.js | 631 f.measure = function callee(e, depth){ argument
634 if(0===depth){
641 Array.prototype.forEach.call(e.children,(e)=>callee(e,depth+1));
642 if(0===depth){
|
| /sqlite-3.40.0/ext/rtree/ |
| H A D | rtree_util.tcl | 120 set depth [rtree_depth $db $zTab]
121 puts "Node $iNode: Has only 1 child (tree depth is $depth)"
|
| H A D | rtreeA.test | 154 # Set the "depth" of the tree stored on the root node incorrectly. Test
192 } {{Rtree depth out of range (65535)
|
| H A D | viewrtree.tcl | 122 set depth [rtree_nodedepth db $zTab $iNode]
|
| H A D | rtreeE.test | 75 # Exclude odd rowids on a depth-first search
|
| H A D | rtreedoc2.test | 302 # depth-first search of the r-tree.
|
| /sqlite-3.40.0/ext/wasm/api/ |
| H A D | sqlite3-api-opfs.js | 1126 const doDir = async function callee(dirHandle, depth){ argument
1128 if(false === opt.callback(handle, dirHandle, depth)) return false;
1130 if(false === await callee(handle, depth + 1)) break;
|
| /sqlite-3.40.0/ext/fts5/test/ |
| H A D | fts5porter.test | 2779 deprive depriv depth depth
2780 depths depth deputation deput
|