Lines Matching defs:nColumn
1089 int nColumn; /* number of columns in virtual table */
1140 appendList(&sb, v->nColumn, v->azContentColumn);
1142 for(i=0; i<v->nColumn; ++i)
1158 for(i=0; i<v->nColumn; ++i) {
1255 for(i=0; i<v->nColumn; ++i){
1272 for(i=0; i<v->nColumn; ++i){
1277 rc = sqlite3_bind_int64(s, 1+v->nColumn, iRowid);
1316 values = (const char **) malloc(v->nColumn * sizeof(const char *));
1317 for(i=0; i<v->nColumn; ++i){
1333 freeStringArray(v->nColumn, values);
1385 ** columns is v->nColumn. If iColumn==v->nColumn, then return
1386 ** position information about all columns. If iColumn<v->nColumn,
1392 int iColumn, /* If <nColumn, only look at the iColumn-th column */
1420 if( iColumn<v->nColumn ){ /* querying a single column */
1521 for(i = 0; i < v->nColumn; ++i) {
1791 int nColumn; /* Number of columns to be indexed */
1854 pSpec->nColumn = 0;
1861 z = azArg[pSpec->nColumn] = firstToken(azArg[i], &zDummy);
1862 pSpec->nColumn++;
1865 if( pSpec->nColumn==0 ){
1867 pSpec->nColumn = 1;
1883 pSpec->azContentColumn = malloc( pSpec->nColumn * sizeof(char *) );
1888 for(i=0; i<pSpec->nColumn; i++){
1913 int nColumn, /* Number of columns */
1921 for(i=0; i<nColumn; i++){
1955 v->nColumn = spec->nColumn;
1986 schema = fulltextSchema(v->nColumn, (const char*const*)v->azColumn,
2068 appendList(&schema, spec.nColumn, spec.azContentColumn);
2222 int nColumn; /* Number of columns in the index */
2239 nColumn = pVtab->nColumn;
2260 if( iCol>=0 && iCol<nColumn && iCol!=iColumn ) continue;
2285 int nColumn;
2293 nColumn = pFts->nColumn;
2295 if( iColumn<0 || iColumn>=nColumn ){
2297 iLast = nColumn-1;
2589 int iColumn, /* column to restrict to. No restrition if >=nColumn */
2652 for(i=0; i<pVtab->nColumn; i++){
2772 ** Queries must match column iColumn. Or if iColumn>=nColumn
2910 assert( idxNum<=QUERY_FULLTEXT+v->nColumn);
2944 if( idxCol<v->nColumn ){
2947 }else if( idxCol==v->nColumn ){
3086 for(i = 0; i < v->nColumn ; ++i){
3103 for(i = 0 ; i < v->nColumn; ++i) {
3108 freeStringArray(v->nColumn, pValues);
3168 * ppArg[2..2+v->nColumn-1] = values
3169 * ppArg[2+v->nColumn] = value for magic column (we ignore this)
3176 assert( nArg==2+v->nColumn+1);
3182 * ppArg[2..2+v->nColumn-1] = values
3183 * ppArg[2+v->nColumn] = value for magic column (we ignore this)
3185 assert( nArg==2+v->nColumn+1);
