Searched refs:nIdx (Results 1 - 8 of 8) sorted by relevance

/external/chromium_org/third_party/sqlite/src/src/
H A Dupdate.c101 int nIdx; /* Number of indices that need updating */ local
239 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){}
240 if( nIdx>0 ){
241 aRegIdx = sqlite3DbMallocRaw(db, sizeof(Index*) * nIdx );
H A Dinsert.c755 int nIdx; local
758 nIdx = sqlite3OpenTableAndIndices(pParse, pTab, baseCur, OP_OpenWrite);
759 aRegIdx = sqlite3DbMallocRaw(db, sizeof(int)*(nIdx+1));
763 for(i=0; i<nIdx; i++){
1435 int nIdx; local
1444 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){}
1445 for(i=nIdx-1; i>=0; i--){
/external/chromium_org/third_party/sqlite/src/ext/rtree/
H A Drtree.c1848 ** nIdx. The aIdx array contains the set of integers from 0 to
1849 ** (nIdx-1) in no particular order. This function sorts the values
1865 int nIdx,
1869 if( nIdx>1 ){
1873 int nLeft = nIdx/2;
1874 int nRight = nIdx-nLeft;
1908 for(jj=1; jj<nIdx; jj++){
1920 ** nIdx. The aIdx array contains the set of integers from 0 to
1921 ** (nIdx-1) in no particular order. This function sorts the values
1932 int nIdx,
1863 SortByDistance( int *aIdx, int nIdx, float *aDistance, int *aSpare ) argument
1929 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
[all...]
/external/pdfium/fpdfsdk/src/javascript/
H A DField.cpp3673 int nIdx = -1; local
3675 nIdx = (FX_INT32) params[0];
3693 if (nIdx == -1 || nIdx > pFormField->CountOptions())
3694 nIdx = pFormField->CountOptions() -1;
3697 CFX_WideString strval = pFormField->GetOptionValue(nIdx);
3699 vRet = pFormField->GetOptionLabel(nIdx);
3704 vRet = pFormField->GetOptionLabel(nIdx);
/external/svox/pico/lib/
H A Dpicopam.c1900 picoos_uint8 *sDest, nI, nType, nIdx, fde; local
1933 nIdx = PICOPAM_PWIDX_SBEG;
1936 nIdx = PICOPAM_PWIDX_PHR1;
1939 nIdx = PICOPAM_PWIDX_PHR2;
1943 nIdx = PICOPAM_PWIDX_SEND;
1946 nIdx = PICOPAM_PWIDX_DEFA;
1956 pam->sil_weights[nIdx], /* integer weights */
/external/sqlite/dist/orig/
H A Dsqlite3.c91063 int nIdx; /* Number of indices */ local
95533 int nIdx; local
108287 int nIdx; /* Number of indices that need updating */ local
141124 int nIdx = 0; /* Valid entries in aIdx[] */ local
146616 SortByDistance( int *aIdx, int nIdx, RtreeDValue *aDistance, int *aSpare ) argument
146682 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
[all...]
/external/sqlite/dist/
H A Dsqlite3.c91083 int nIdx; /* Number of indices */ local
95553 int nIdx; local
108307 int nIdx; /* Number of indices that need updating */ local
141156 int nIdx = 0; /* Valid entries in aIdx[] */ local
146648 SortByDistance( int *aIdx, int nIdx, RtreeDValue *aDistance, int *aSpare ) argument
146714 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
[all...]
/external/chromium_org/third_party/sqlite/amalgamation/
H A Dsqlite3.c85238 int nIdx; local
85918 int nIdx; local
95800 int nIdx; /* Number of indices that need updating */ local
126131 SortByDistance( int *aIdx, int nIdx, float *aDistance, int *aSpare ) argument
126197 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
[all...]

Completed in 643 milliseconds