Home
last modified time | relevance | path

Searched refs:anEq (Results 1 – 25 of 164) sorted by relevance

1234567

/dports/databases/sqlcipher/sqlcipher-3.4.2/src/
H A Danalyze.c347 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol); in sampleCopy()
509 if( pNew->anEq[i]>pOld->anEq[i] ) return 1; in sampleIsBetterPost()
510 if( pNew->anEq[i]<pOld->anEq[i] ) return 0; in sampleIsBetterPost()
587 pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol]; in sampleInsert()
596 tRowcnt *anEq = pMin->anEq; in sampleInsert() local
603 pSample->anEq = anEq; in sampleInsert()
656 pBest->anEq[i] = p->current.anEq[i]; in samplePushPrevious()
674 if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j]; in samplePushPrevious()
750 p->current.anEq[i]++; in statPush()
757 p->current.anEq[i] = 1; in statPush()
[all …]
H A Dwhere.c1123 iLower = aSample[iSamp].anLt[n-1] + aSample[iSamp].anEq[n-1]; in whereKeyStats()
1181 aStat[1] = aSample[i].anEq[iCol]; in whereKeyStats()
H A DsqliteInt.h2193 tRowcnt *anEq; /* Est. number of rows where the key equals this sample */ member
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/sqlite/src/src/
H A Danalyze.c341 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol); in sampleCopy()
504 if( pNew->anEq[i]>pOld->anEq[i] ) return 1; in sampleIsBetterPost()
505 if( pNew->anEq[i]<pOld->anEq[i] ) return 0; in sampleIsBetterPost()
577 pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol]; in sampleInsert()
585 tRowcnt *anEq = pMin->anEq; in sampleInsert() local
592 pSample->anEq = anEq; in sampleInsert()
641 pBest->anEq[i] = p->current.anEq[i]; in samplePushPrevious()
659 if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j]; in samplePushPrevious()
714 p->current.anEq[i]++; in statPush()
721 p->current.anEq[i] = 1; in statPush()
[all …]
H A Dwhere.c1183 iLower = aSample[iSamp].anLt[n-1] + aSample[iSamp].anEq[n-1]; in whereKeyStats()
1241 aStat[1] = aSample[i].anEq[iCol]; in whereKeyStats()
H A DsqliteInt.h2441 tRowcnt *anEq; /* Est. number of rows where the key equals this sample */ member
/dports/databases/sqlite3/sqlite-src-3350500/src/
H A Danalyze.c351 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol); in sampleCopy()
520 if( pNew->anEq[i]>pOld->anEq[i] ) return 1; in sampleIsBetterPost()
521 if( pNew->anEq[i]<pOld->anEq[i] ) return 0; in sampleIsBetterPost()
593 pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol]; in sampleInsert()
601 tRowcnt *anEq = pMin->anEq; in sampleInsert() local
608 pSample->anEq = anEq; in sampleInsert()
657 pBest->anEq[i] = p->current.anEq[i]; in samplePushPrevious()
675 if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j]; in samplePushPrevious()
730 p->current.anEq[i]++; in statPush()
737 p->current.anEq[i] = 1; in statPush()
[all …]
H A Dwhere.c1218 iLower = aSample[iSamp].anLt[n-1] + aSample[iSamp].anEq[n-1]; in whereKeyStats()
1276 aStat[1] = aSample[i].anEq[iCol]; in whereKeyStats()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/sqlite/src/src/
H A Danalyze.c351 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol); in sampleCopy()
520 if( pNew->anEq[i]>pOld->anEq[i] ) return 1; in sampleIsBetterPost()
521 if( pNew->anEq[i]<pOld->anEq[i] ) return 0; in sampleIsBetterPost()
593 pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol]; in sampleInsert()
601 tRowcnt *anEq = pMin->anEq; in sampleInsert() local
608 pSample->anEq = anEq; in sampleInsert()
657 pBest->anEq[i] = p->current.anEq[i]; in samplePushPrevious()
675 if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j]; in samplePushPrevious()
730 p->current.anEq[i]++; in statPush()
737 p->current.anEq[i] = 1; in statPush()
[all …]
H A Dwhere.c1198 iLower = aSample[iSamp].anLt[n-1] + aSample[iSamp].anEq[n-1]; in whereKeyStats()
1256 aStat[1] = aSample[i].anEq[iCol]; in whereKeyStats()
/dports/cad/opencascade/opencascade-7.6.0/src/OpenGl/
H A DOpenGl_CappingPlaneResource.cxx181 const Graphic3d_ClipPlane::Equation& anEq = myPlaneRoot->GetEquation(); in updateTransform() local
185 const Graphic3d_Vec3 aNorm (anEq.xyz()); in updateTransform()
186 const Graphic3d_Vec3 T (anEq.xyz() * -anEqW); in updateTransform()
189 const Standard_ShortReal aProjLen = sqrt ((Standard_ShortReal)anEq.xz().SquareModulus()); in updateTransform()
H A DOpenGl_ShaderManager.hxx69 const Graphic3d_Vec4d& anEq = thePlane.GetEquation(); in LocalClippingPlaneW() local
73 return -(anEq.x() * aPos.X() + anEq.y() * aPos.Y() + anEq.z() * aPos.Z()); in LocalClippingPlaneW()
75 return anEq.w(); in LocalClippingPlaneW()
/dports/cad/opencascade/opencascade-7.6.0/inc/
H A DOpenGl_ShaderManager.hxx69 const Graphic3d_Vec4d& anEq = thePlane.GetEquation(); in LocalClippingPlaneW() local
73 return -(anEq.x() * aPos.X() + anEq.y() * aPos.Y() + anEq.z() * aPos.Z()); in LocalClippingPlaneW()
75 return anEq.w(); in LocalClippingPlaneW()
/dports/devel/py-cadquery-pywrap/pywrap-e8c7bc9/opencascade/
H A DOpenGl_ShaderManager.hxx66 const Graphic3d_Vec4d& anEq = thePlane.GetEquation(); in LocalClippingPlaneW() local
70 return -(anEq.x() * aPos.X() + anEq.y() * aPos.Y() + anEq.z() * aPos.Z()); in LocalClippingPlaneW()
72 return anEq.w(); in LocalClippingPlaneW()
/dports/games/craft/Craft-1.0fbsd/deps/sqlite/
H A Dsqlite3.c82524 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol);
82666 if( pNew->anEq[i]>pOld->anEq[i] ) return 1;
82667 if( pNew->anEq[i]<pOld->anEq[i] ) return 0;
82737 pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol];
82746 tRowcnt *anEq = pMin->anEq;
82753 pSample->anEq = anEq;
82806 pBest->anEq[i] = p->current.anEq[i];
82816 if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j];
82887 p->current.anEq[i]++;
82894 p->current.anEq[i] = 1;
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vic/vendor/github.com/docker/docker/vendor/github.com/mattn/go-sqlite3/code/
H A Dsqlite3-binding.c83029 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol);
83171 if( pNew->anEq[i]>pOld->anEq[i] ) return 1;
83172 if( pNew->anEq[i]<pOld->anEq[i] ) return 0;
83242 pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol];
83251 tRowcnt *anEq = pMin->anEq;
83258 pSample->anEq = anEq;
83311 pBest->anEq[i] = p->current.anEq[i];
83321 if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j];
83392 p->current.anEq[i]++;
83399 p->current.anEq[i] = 1;
[all …]
/dports/databases/R-cran-RSQLite/RSQLite/src/sqlite/
H A Dsqlite3.c83756 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol);
83916 if( pNew->anEq[i]>pOld->anEq[i] ) return 1;
83917 if( pNew->anEq[i]<pOld->anEq[i] ) return 0;
83987 pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol];
83996 tRowcnt *anEq = pMin->anEq;
84003 pSample->anEq = anEq;
84056 pBest->anEq[i] = p->current.anEq[i];
84066 if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j];
84140 p->current.anEq[i]++;
84147 p->current.anEq[i] = 1;
[all …]
/dports/games/freeminer/freeminer-0.4.10.4/src/sqlite/
H A Dsqlite3.c83029 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol);
83171 if( pNew->anEq[i]>pOld->anEq[i] ) return 1;
83172 if( pNew->anEq[i]<pOld->anEq[i] ) return 0;
83242 pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol];
83251 tRowcnt *anEq = pMin->anEq;
83258 pSample->anEq = anEq;
83311 pBest->anEq[i] = p->current.anEq[i];
83321 if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j];
83392 p->current.anEq[i]++;
83399 p->current.anEq[i] = 1;
[all …]
/dports/devel/libgpkg/luciad-libgpkg-c56e3708453e/sqlite/
H A Dsqlite3.c83029 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol);
83171 if( pNew->anEq[i]>pOld->anEq[i] ) return 1;
83172 if( pNew->anEq[i]<pOld->anEq[i] ) return 0;
83242 pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol];
83251 tRowcnt *anEq = pMin->anEq;
83258 pSample->anEq = anEq;
83311 pBest->anEq[i] = p->current.anEq[i];
83321 if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j];
83392 p->current.anEq[i]++;
83399 p->current.anEq[i] = 1;
[all …]
/dports/biology/hyphy/hyphy-2.5.33/contrib/SQLite-3.8.2/
H A Dsqlite3.c81988 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol);
82130 if( pNew->anEq[i]>pOld->anEq[i] ) return 1;
82131 if( pNew->anEq[i]<pOld->anEq[i] ) return 0;
82201 pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol];
82210 tRowcnt *anEq = pMin->anEq;
82217 pSample->anEq = anEq;
82270 pBest->anEq[i] = p->current.anEq[i];
82280 if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j];
82351 p->current.anEq[i]++;
82358 p->current.anEq[i] = 1;
[all …]
/dports/devel/cppcheck-gui/cppcheck-2.6.3/test/bug-hunting/cve/CVE-2019-16168/
H A Dwhere.c1185 iLower = aSample[iSamp].anLt[n-1] + aSample[iSamp].anEq[n-1]; in whereKeyStats()
1243 aStat[1] = aSample[i].anEq[iCol]; in whereKeyStats()
/dports/devel/cppcheck/cppcheck-2.6.3/test/bug-hunting/cve/CVE-2019-16168/
H A Dwhere.c1185 iLower = aSample[iSamp].anLt[n-1] + aSample[iSamp].anEq[n-1]; in whereKeyStats()
1243 aStat[1] = aSample[i].anEq[iCol]; in whereKeyStats()
/dports/games/redeclipse/base-2.0.0/src/support/
H A Dsqlite3.c89503 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol);
89667 if( pNew->anEq[i]>pOld->anEq[i] ) return 1;
89668 if( pNew->anEq[i]<pOld->anEq[i] ) return 0;
89738 pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol];
89747 tRowcnt *anEq = pMin->anEq;
89754 pSample->anEq = anEq;
89807 pBest->anEq[i] = p->current.anEq[i];
89817 if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j];
89891 p->current.anEq[i]++;
89898 p->current.anEq[i] = 1;
[all …]
/dports/games/redeclipse16/base-1.6.0/src/support/
H A Dsqlite3.c89503 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol);
89667 if( pNew->anEq[i]>pOld->anEq[i] ) return 1;
89668 if( pNew->anEq[i]<pOld->anEq[i] ) return 0;
89738 pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol];
89747 tRowcnt *anEq = pMin->anEq;
89754 pSample->anEq = anEq;
89807 pBest->anEq[i] = p->current.anEq[i];
89817 if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j];
89891 p->current.anEq[i]++;
89898 p->current.anEq[i] = 1;
[all …]
/dports/security/libzrtpcppcore/ZRTPCPP-4.6.6/clients/tivi/android/jni/sqlite3/
H A Dsqlite3.c88046 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol);
88210 if( pNew->anEq[i]>pOld->anEq[i] ) return 1;
88211 if( pNew->anEq[i]<pOld->anEq[i] ) return 0;
88281 pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol];
88290 tRowcnt *anEq = pMin->anEq;
88297 pSample->anEq = anEq;
88350 pBest->anEq[i] = p->current.anEq[i];
88360 if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j];
88434 p->current.anEq[i]++;
88441 p->current.anEq[i] = 1;
[all …]

1234567