Lines Matching defs:depth
4321 ** <dd>The maximum depth of the parse tree on any expression.</dd>)^
4348 ** <dd>The maximum depth of recursion for triggers.</dd>)^
13349 ** The maximum depth of an expression tree. This is limited to
13491 ** Maximum depth of recursion for triggers.
18309 ** TK_AGG_FUNCTION: nesting depth
19494 int mxParserStack; /* maximum depth of the parser stack */
26198 SQLITE_PRIVATE void sqlite3MemdebugBacktrace(int depth){
26199 if( depth<0 ){ depth = 0; }
26200 if( depth>20 ){ depth = 20; }
26201 depth = (depth+1)&0xfe;
26202 mem.nBacktrace = depth;
55146 ** tree with depth of iDepth. A depth of 1 means the tree contains a single
55147 ** node taken from the head of *ppList. A depth of 2 means a tree with
64452 if( NEVER(i) ) return; /* Defense-in-depth, in case (1) above is wrong */
68055 ** Maximum depth of an SQLite B-Tree structure. Any B-Tree deeper than
79015 ** the tree depth. Root pages return 0. Parents of root pages
79025 ** 5. Verify that the depth of all children is the same.
79036 int depth = -1, d2; /* Depth of a subtree */
79116 depth = checkTreePage(pCheck, pgno, &maxKey, maxKey);
79183 if( d2!=depth ){
79184 checkAppendMsg(pCheck, "Child page depth differs");
79185 depth = d2;
79279 return depth+1;
102114 ** Return the depth of a tree comprising nPMA PMAs, assuming a fanout of
102134 ** pRoot is the root of an incremental merge-tree with depth nDepth (according
103701 ** depth (the Expr.op2 field) by N on every TK_AGG_FUNCTION node.
106519 ** expression depth allowed. If it is not, leave an error message in
106527 "Expression tree is too large (maximum depth %d)", mxHeight
106596 ** the height is greater than the maximum allowed expression depth,
117767 assert( pParse->nested<10 ); /* Nesting should only be of limited depth */
166678 ** YYSTACKDEPTH is the maximum depth of the parser's stack. If
168735 ** Return the peak depth of the stack for a parser.
179324 ** This constant determines the maximum depth of an FTS expression tree
187077 ** Return SQLITE_ERROR if the maximum depth of the expression tree passed
187101 ** nMaxDepth is the maximum allowable depth of the balanced sub-tree.
187275 ** maximum allowable depth.
187358 /* Rebalance the expression. And check that its depth does not exceed
187372 "FTS expression tree is too large (maximum depth %d)",
190107 SegmentNode *pLeftmost; /* Pointer to left-most node of this depth */
198379 u16 iDepth; /* Nesting depth */
198385 ** Maximum nesting depth of JSON for this implementation.
198388 ** descent parser. A depth of 2000 is far deeper than any sane JSON
200989 ** of the node contain the tree depth as a big-endian integer.
201107 int iDepth; /* Current depth of the r-tree structure */
201118 ** RtreeNode.pNext. RtreeNode.iNode stores the depth of the sub-tree
201209 ** 3^40 is greater than 2^64, an r-tree structure always has a depth of
201710 ** are the leaves, and so on. If the depth as specified on the root node
202344 ** is a depth-first search, which is the desired default behavior.
204853 /* This routine implements an SQL function that returns the "depth" parameter
204858 ** The depth value is 0 for all nodes other than the root node, and the root
205116 ** Run rtreecheck() checks on node iNode, which is at depth iDepth within
205147 rtreeCheckAppendMsg(pCheck, "Rtree depth out of range (%d)", iDepth);
222909 ** fts5YYSTACKDEPTH is the maximum depth of the parser's stack. If
223471 ** Return the peak depth of the stack for a parser.