Lines Matching defs:min
2442 #define SQLITE_CONFIG_HEAP 8 /* void*, int nByte, int min */
3281 ** ^If M is the size of the prior allocation, then min(N,M) bytes
17261 #define SQLITE_MinMaxOpt 0x00010000 /* The min/max optimization */
17370 #define SQLITE_FUNC_MINMAX 0x1000 /* True for min() and max() aggregates */
17382 #define SQLITE_FUNC_ANYORDER 0x08000000 /* count/min/max aggregate */
18676 #define WHERE_ORDERBY_MIN 0x0001 /* ORDER BY processing for min() func */
18760 #define NC_MinMaxAgg 0x001000 /* min/max aggregates seen. See note above */
18768 #define NC_OrderAgg 0x8000000 /* Has an aggregate other than count/min/max */
18868 #define SF_MinMaxAgg 0x0001000 /* Aggregate containing min() or max() */
19735 int csrApp; /* Function cursor (used by min/max) */
19736 int regApp; /* Function register (also used by min/max) */
23623 char min = zFormat[1] - '0';
23638 if( val<(int)min || val>(int)max || (nextC!=0 && nextC!=*zDate) ){
67665 ** the cell size drop below the min embedded payload fraction.
67667 ** The min leaf payload fraction is like the min embedded payload fraction
67849 u8 max1bytePayload; /* min(maxLocal,127) */
78962 ** An implementation of a min-heap.
79053 u32 x, prev = 0; /* Next and previous entry on the min-heap */
79198 /* For leaf pages, the min-heap has already been initialized and the
79211 /* Add the freeblocks to the min-heap
79235 /* Analyze the min-heap looking for overlap between cells and/or
79238 ** Each min-heap entry is of the form: (start_address<<16)|end_address.
79243 ** The loop below pulls entries from the min-heap in order and compares
79249 prev = contentOffset - 1; /* Implied first min-heap entry */
92189 ** be returned. This is used by the built-in min(), max() and nullif()
92192 ** If P1 is not zero, then it is a register that a subsequent min() or
124763 ** Implementation of the non-aggregate min() and max() functions
124771 int mask; /* 0 for min() or 0xffffffff for max() */
126404 ** Routines to implement min() and max() aggregate functions.
126424 /* This step function is used for both the min() and max() aggregates,
126427 ** sqlite3_user_data() function returns (void *)-1. For min() it
126430 ** aggregate, or 0 for min().
126990 FUNCTION(min, -1, 0, 1, minmaxFunc ),
126991 FUNCTION(min, 0, 0, 1, 0 ),
126992 WAGGREGATE(min, 1, 0, 1, minmaxStep, minMaxFinalize, minMaxValue, 0,
142445 ** The subquery may not be an aggregate that uses the built-in min() or
143390 ** if the query is a candidate for the min/max optimization.
143392 ** If the query is a candidate for the min/max optimization, then set
143395 ** whether pFunc is a min() or max() function.
143397 ** If the query is not a candidate for the min/max optimization, return
143425 if( sqlite3StrICmp(zFunc, "min")==0 ){
144529 ** If regAcc is non-zero and there are no min() or max() aggregates
144562 /* If regAcc==0, there there exists some min() or max() function
144569 ** invocation of min() or max() altogether. Or, if this is not
144571 ** the accumulators are not populated unless the min()/max() is invoked
144915 ExprList *pMinMaxOrderBy = 0; /* Added ORDER BY for min/max queries */
144916 u8 minMaxFlag; /* Flag for min/max queries */
145085 ** the built-in count(), min(), or max().
146027 /* If there are accumulator registers but no min() or max() functions
146032 ** there are no min() or max functions or (b) always updated for the
146034 ** least once even if the FILTER clause means the min() or max()
146062 /* If this query is a candidate for the min/max optimization, then
156659 ** While generating code for the min/max optimization, after handling
156660 ** the aggregate-step call to min() or max(), check to see if any
158225 ** nOut = nOut * ( min(U - L, 1) / N )
163184 ** min(e) OVER (PARTITION BY c ORDER BY d)
163190 ** min(e) OVER (PARTITION BY a ORDER BY b)
163196 ** SELECT e, min(e) OVER (PARTITION BY a ORDER BY b), c, d, b FROM
163201 ** so that both min() and max() may process rows in the order defined by
163262 ** functions min() and max() are implemented using VDBE instructions if
164550 /* The inline versions of min() and max() require a single ephemeral
164553 ** regApp+0: slot to copy min()/max() argument to for MakeRecord
173989 /* cap min request size at 2^12 */
206123 ** The left-most coordinate min(x1,x2) is not considered to be part of