make sqlite planner to not user vector index for any optimizations

Author: sivukhin

libsql-sqlite3/src/build.c

@@ -4345,11 +4345,6 @@ void sqlite3CreateIndex(
     goto exit_create_index;
   }
   if( vectorIdxRc >= 1 ){
-    /*
-     * SQLite can use B-Tree indices in some optimizations (like SELECT COUNT(*) can use any full B-Tree index instead of PK index)
-     * But, SQLite pretty conservative about usage of unordered indices - that's what we need here
-    */
-    pIndex->bUnordered = 1;
     pIndex->idxIsVector = 1;
   }
   if( vectorIdxRc == 1 ){

libsql-sqlite3/src/select.c

@@ -8423,6 +8423,7 @@ int sqlite3Select(
             if( pIdx->bUnordered==0
              && pIdx->szIdxRow<pTab->szTabRow
              && pIdx->pPartIdxWhere==0
+             && pIdx->idxIsVector==0
              && (!pBest || pIdx->szIdxRow<pBest->szIdxRow)
             ){
               pBest = pIdx;

libsql-sqlite3/src/where.c

@@ -2973,9 +2973,10 @@ static int whereLoopAddBtreeIndex(
     assert( pNew->u.btree.nBtm==0 );
     opMask = WO_EQ|WO_IN|WO_GT|WO_GE|WO_LT|WO_LE|WO_ISNULL|WO_IS;
   }
-  if( pProbe->bUnordered || pProbe->bLowQual ){
+  if( pProbe->bUnordered || pProbe->bLowQual || pProbe->idxIsVector ){
     if( pProbe->bUnordered ) opMask &= ~(WO_GT|WO_GE|WO_LT|WO_LE);
     if( pProbe->bLowQual )   opMask &= ~(WO_EQ|WO_IN|WO_IS);
+    if( pProbe->idxIsVector ) opMask = 0;
   }
 
   assert( pNew->u.btree.nEq<pProbe->nColumn );
@@ -3357,7 +3358,7 @@ static int indexMightHelpWithOrderBy(
   ExprList *aColExpr;
   int ii, jj;
 
-  if( pIndex->bUnordered ) return 0;
+  if( pIndex->bUnordered || pIndex->idxIsVector ) return 0;
   if( (pOB = pBuilder->pWInfo->pOrderBy)==0 ) return 0;
   for(ii=0; ii<pOB->nExpr; ii++){
     Expr *pExpr = sqlite3ExprSkipCollateAndLikely(pOB->a[ii].pExpr);
@@ -3526,6 +3527,9 @@ static SQLITE_NOINLINE u32 whereIsCoveringIndex(
     ** if pIdx is covering.  Assume it is not. */
     return 0;
   }
+  if( pIdx->idxIsVector==1 ){
+    return 0;
+  }
   if( pIdx->bHasExpr==0 ){
     for(i=0; i<pIdx->nColumn; i++){
       if( pIdx->aiColumn[i]>=BMS-1 ) break;
@@ -3814,6 +3818,9 @@ static int whereLoopAddBtree(
       testcase( pNew->iTab!=pSrc->iCursor );  /* See ticket [98d973b8f5] */
       continue;  /* Partial index inappropriate for this query */
     }
+    if( pProbe->idxIsVector!=0 ){
+      continue;  /* Vector index inappropriate for this query */
+    }
     if( pProbe->bNoQuery ) continue;
     rSize = pProbe->aiRowLogEst[0];
     pNew->u.btree.nEq = 0;
@@ -4817,7 +4824,7 @@ static i8 wherePathSatisfiesOrderBy(
         pIndex = 0;
         nKeyCol = 0;
         nColumn = 1;
-      }else if( (pIndex = pLoop->u.btree.pIndex)==0 || pIndex->bUnordered ){
+      }else if( (pIndex = pLoop->u.btree.pIndex)==0 || pIndex->bUnordered || pIndex->idxIsVector ){
         return 0;
       }else{
         nKeyCol = pIndex->nKeyCol;