Lines Matching defs:nDim
147 int nDim; /* Number of dimensions */
561 for(ii=0; ii<(pRtree->nDim*2); ii++){
698 for(ii=0; ii<pRtree->nDim*2; ii++){
872 int nCoord = pRtree->nDim*2;
1423 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
1436 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
1448 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
1453 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
1467 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
1511 for(jj=0; jj<(pRtree->nDim*2); jj+=2){
1736 for(i=0; i<pRtree->nDim; i++){
2006 int nByte = (pRtree->nDim+1)*(sizeof(int*)+nCell*sizeof(int));
2013 aSpare = &((int *)&aaSorted[pRtree->nDim])[pRtree->nDim*nCell];
2015 for(ii=0; ii<pRtree->nDim; ii++){
2017 aaSorted[ii] = &((int *)&aaSorted[pRtree->nDim])[ii*nCell];
2024 for(ii=0; ii<pRtree->nDim; ii++){
2490 for(iDim=0; iDim<pRtree->nDim; iDim++){
2495 for(iDim=0; iDim<pRtree->nDim; iDim++){
2501 for(iDim=0; iDim<pRtree->nDim; iDim++){
2738 assert( nData==(pRtree->nDim*2 + 3) );
2740 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
2749 for(ii=0; ii<(pRtree->nDim*2); ii+=2){
3023 pRtree->nDim = (argc-4)/2;
3024 pRtree->nBytesPerCell = 8 + pRtree->nDim*4*2;
3096 tree.nDim = sqlite3_value_int(apArg[0]);
3097 tree.nBytesPerCell = 8 + 8 * tree.nDim;
3109 for(jj=0; jj<tree.nDim*2; jj++){
