Lines Matching defs:aIdx
130135 IndexListTerm *aIdx; /* Array of IndexListTerms */
130152 *pIx = pIter->u.ax.aIdx[0].ix;
130153 return pIter->u.ax.aIdx[0].p;
130168 *pIx = pIter->u.ax.aIdx[i].ix;
130169 return pIter->u.ax.aIdx[i].p;
130508 sIdxIter.u.ax.aIdx = 0; /* Silence harmless compiler warning */
130537 sIdxIter.u.ax.aIdx = sqlite3DbMallocZero(db, nByte);
130538 if( sIdxIter.u.ax.aIdx==0 ) return; /* OOM */
130539 bUsed = (u8*)&sIdxIter.u.ax.aIdx[nIdx];
130540 pUpsert->pToFree = sIdxIter.u.ax.aIdx;
130552 sIdxIter.u.ax.aIdx[i].p = pIdx;
130553 sIdxIter.u.ax.aIdx[i].ix = jj;
130558 sIdxIter.u.ax.aIdx[i].p = pIdx;
130559 sIdxIter.u.ax.aIdx[i].ix = jj;
194424 int *aIdx = 0; /* Array of remaining idx values */
194425 int nIdx = 0; /* Valid entries in aIdx[] */
194426 int nAlloc = 0; /* Allocated size of aIdx[] */
194439 aNew = sqlite3_realloc64(aIdx, nAlloc*sizeof(int));
194444 aIdx = aNew;
194446 aIdx[nIdx++] = sqlite3_column_int(pSelect, 0);
194462 if( aIdx[i]!=i ){
194463 sqlite3_bind_int(pUpdate, 3, aIdx[i]);
194471 sqlite3_free(aIdx);
200694 int aIdx[2]; /* Index of constraints for JSON and ROOT */
200703 aIdx[0] = aIdx[1] = -1;
200716 aIdx[iCol] = i;
200725 if( aIdx[0]<0 ){
200732 i = aIdx[0];
200735 if( aIdx[1]<0 ){
200738 i = aIdx[1];
203262 ** Arguments aIdx, aDistance and aSpare all point to arrays of size
203263 ** nIdx. The aIdx array contains the set of integers from 0 to
203265 ** in aIdx according to the indexed values in aDistance. For
203268 ** aIdx = { 0, 1, 2, 3 }
203271 ** this function sets the aIdx array to contain:
203273 ** aIdx = { 0, 1, 2, 3 }
203279 int *aIdx,
203290 int *aLeft = aIdx;
203291 int *aRight = &aIdx[nLeft];
203301 aIdx[iLeft+iRight] = aRight[iRight];
203304 aIdx[iLeft+iRight] = aLeft[iLeft];
203310 aIdx[iLeft+iRight] = aLeft[iLeft];
203313 aIdx[iLeft+iRight] = aRight[iRight];
203324 RtreeDValue left = aDistance[aIdx[jj-1]];
203325 RtreeDValue right = aDistance[aIdx[jj]];
203334 ** Arguments aIdx, aCell and aSpare all point to arrays of size
203335 ** nIdx. The aIdx array contains the set of integers from 0 to
203337 ** in aIdx according to dimension iDim of the cells in aCell. The
203346 int *aIdx,
203359 int *aLeft = aIdx;
203360 int *aRight = &aIdx[nLeft];
203376 aIdx[iLeft+iRight] = aLeft[iLeft];
203379 aIdx[iLeft+iRight] = aRight[iRight];
203389 RtreeDValue xleft1 = aCell[aIdx[jj-1]].aCoord[iDim*2];
203390 RtreeDValue xleft2 = aCell[aIdx[jj-1]].aCoord[iDim*2+1];
203391 RtreeDValue xright1 = aCell[aIdx[jj]].aCoord[iDim*2];
203392 RtreeDValue xright2 = aCell[aIdx[jj]].aCoord[iDim*2+1];
236962 ** aIdx[]:
236963 ** There is one entry in the aIdx[] array for each phrase in the query,
236971 int nIdx; /* Number of entries in aIdx[] */
236972 int aIdx[1]; /* Offsets into aPoslist for current row */
237654 pSorter->aIdx[i] = iOff;
237656 pSorter->aIdx[i] = &aBlob[nBlob] - a;
238724 int i1 = (iPhrase==0 ? 0 : pSorter->aIdx[iPhrase-1]);
238725 *pn = pSorter->aIdx[iPhrase] - i1;
239066 int i1 = (iPhrase==0 ? 0 : pSorter->aIdx[iPhrase-1]);
239067 n = pSorter->aIdx[iPhrase] - i1;