/dports/math/yacas/yacas-1.9.1/jyacas/net/sf/yacas/ |
H A D | LispPtr.java | 15 iNext = null; in LispPtr() 19 iNext = aOther.iNext; in LispPtr() 23 iNext = aOther; in LispPtr() 27 iNext = aNext; in Set() 31 return iNext; in Get() 35 iNext = iNext.iNext.iNext; in GoNext() 39 iNext = aNext; in DoSet() 41 LispObject iNext; field in LispPtr
|
/dports/math/stp/stp-2.3.3/lib/extlib-abc/aig/aig/ |
H A D | aigOrder.c | 74 p->iPrev = p->iNext = 0; in Aig_ManOrderStart() 96 p->iPrev = p->iNext = 0; in Aig_ManOrderStop() 124 iPrev = p->pOrderData[2*p->iNext]; in Aig_ObjOrderInsert() 128 p->pOrderData[2*p->iNext] = ObjId; in Aig_ObjOrderInsert() 147 int iPrev, iNext; in Aig_ObjOrderRemove() local 151 iNext = p->pOrderData[2*ObjId+1]; in Aig_ObjOrderRemove() 154 p->pOrderData[2*iNext] = iPrev; in Aig_ObjOrderRemove() 155 p->pOrderData[2*iPrev+1] = iNext; in Aig_ObjOrderRemove() 161 if ( p->iNext == ObjId ) in Aig_ObjOrderRemove() 162 p->iNext = iNext; in Aig_ObjOrderRemove() [all …]
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/aig/ |
H A D | aigOrder.c | 59 p->iPrev = p->iNext = 0; in Aig_ManOrderStart() 81 p->iPrev = p->iNext = 0; in Aig_ManOrderStop() 109 iPrev = p->pOrderData[2*p->iNext]; in Aig_ObjOrderInsert() 113 p->pOrderData[2*p->iNext] = ObjId; in Aig_ObjOrderInsert() 132 int iPrev, iNext; in Aig_ObjOrderRemove() local 136 iNext = p->pOrderData[2*ObjId+1]; in Aig_ObjOrderRemove() 139 p->pOrderData[2*iNext] = iPrev; in Aig_ObjOrderRemove() 140 p->pOrderData[2*iPrev+1] = iNext; in Aig_ObjOrderRemove() 146 if ( p->iNext == ObjId ) in Aig_ObjOrderRemove() 147 p->iNext = iNext; in Aig_ObjOrderRemove() [all …]
|
/dports/devel/eastl/EASTL-3.13.06/include/EASTL/bonus/ |
H A D | sort_extra.h | 84 BidirectionalIterator iCurrent, iNext, iLastModified; in shaker_sort() local 92 for(iCurrent = first; iCurrent != last; iCurrent = iNext) in shaker_sort() 94 iNext = iCurrent; in shaker_sort() 95 ++iNext; in shaker_sort() 97 if(compare(*iNext, *iCurrent)) in shaker_sort() 101 eastl::iter_swap(iCurrent, iNext); in shaker_sort() 109 for(iCurrent = last; iCurrent != first; iCurrent = iNext) in shaker_sort() 111 iNext = iCurrent; in shaker_sort() 112 --iNext; in shaker_sort() 114 if(compare(*iCurrent, *iNext)) in shaker_sort() [all …]
|
/dports/devel/upp/upp/bazaar/plugin/geotiff/libgeotiff/gcore/ |
H A D | gdalpamproxydb.cpp | 136 int iNext = 0; in LoadDB() local 138 while( iNext < nBufLength ) in LoadDB() 142 osOriginal.assign( pszDBData + iNext ); in LoadDB() 144 for( ; iNext < nBufLength && pszDBData[iNext] != '\0'; iNext++ ) {} in LoadDB() 146 if( iNext == nBufLength ) in LoadDB() 149 iNext++; in LoadDB() 153 osProxy += pszDBData + iNext; in LoadDB() 155 for( ; iNext < nBufLength && pszDBData[iNext] != '\0'; iNext++ ) {} in LoadDB() 156 iNext++; in LoadDB()
|
/dports/devel/upp/upp/bazaar/plugin/gdal/gcore/ |
H A D | gdalpamproxydb.cpp | 136 int iNext = 0; in LoadDB() local 138 while( iNext < nBufLength ) in LoadDB() 142 osOriginal.assign( pszDBData + iNext ); in LoadDB() 144 for( ; iNext < nBufLength && pszDBData[iNext] != '\0'; iNext++ ) {} in LoadDB() 146 if( iNext == nBufLength ) in LoadDB() 149 iNext++; in LoadDB() 153 osProxy += pszDBData + iNext; in LoadDB() 155 for( ; iNext < nBufLength && pszDBData[iNext] != '\0'; iNext++ ) {} in LoadDB() 156 iNext++; in LoadDB()
|
/dports/science/PETSc/petsc-3.14.1/src/dm/impls/stag/tests/ |
H A D | ex23.c | 10 PetscInt ex,ey,ez,n[3],start[3],nExtra[3],iNext,iPrev,iCenter,d,round; in main() local 25 ierr = DMStagGetProductCoordinateLocationSlot(dm,DMSTAG_RIGHT,&iNext);CHKERRQ(ierr); in main() 31 cArrX[ex][iNext] = cArrX[ex][iPrev] + 0.1; in main() 32 cArrX[ex][iCenter] = 0.5 * (cArrX[ex][iPrev] + cArrX[ex][iNext]); in main() 36 cArrY[ey][iNext] = cArrY[ey][iPrev] + 0.1; in main() 37 cArrY[ey][iCenter] = 0.5 * (cArrY[ey][iPrev] + cArrY[ey][iNext]); in main() 41 cArrZ[ez][iNext] = cArrZ[ez][iPrev] + 0.1; in main() 42 cArrZ[ez][iCenter] = 0.5 * (cArrZ[ez][iPrev] + cArrZ[ez][iNext]); in main() 48 cArrX[ex][iNext] = 2.0; in main() 53 cArrY[ey][iNext] = 2.0; in main() [all …]
|
/dports/graphics/py-gdal/gdal-3.3.3/gcore/ |
H A D | gdalpamproxydb.cpp | 164 int iNext = 0; in LoadDB() local 166 while( iNext < nBufLength ) in LoadDB() 169 osOriginal.assign( pszDBData + iNext ); in LoadDB() 171 for( ; iNext < nBufLength && pszDBData[iNext] != '\0'; iNext++ ) {} in LoadDB() 173 if( iNext == nBufLength ) in LoadDB() 176 iNext++; in LoadDB() 180 osProxy += pszDBData + iNext; in LoadDB() 182 for( ; iNext < nBufLength && pszDBData[iNext] != '\0'; iNext++ ) {} in LoadDB() 183 iNext++; in LoadDB()
|
/dports/graphics/p5-Geo-GDAL/gdal-3.3.3/gcore/ |
H A D | gdalpamproxydb.cpp | 164 int iNext = 0; in LoadDB() local 166 while( iNext < nBufLength ) in LoadDB() 169 osOriginal.assign( pszDBData + iNext ); in LoadDB() 171 for( ; iNext < nBufLength && pszDBData[iNext] != '\0'; iNext++ ) {} in LoadDB() 173 if( iNext == nBufLength ) in LoadDB() 176 iNext++; in LoadDB() 180 osProxy += pszDBData + iNext; in LoadDB() 182 for( ; iNext < nBufLength && pszDBData[iNext] != '\0'; iNext++ ) {} in LoadDB() 183 iNext++; in LoadDB()
|
/dports/graphics/gdal/gdal-3.3.3/gcore/ |
H A D | gdalpamproxydb.cpp | 164 int iNext = 0; in LoadDB() local 166 while( iNext < nBufLength ) in LoadDB() 169 osOriginal.assign( pszDBData + iNext ); in LoadDB() 171 for( ; iNext < nBufLength && pszDBData[iNext] != '\0'; iNext++ ) {} in LoadDB() 173 if( iNext == nBufLength ) in LoadDB() 176 iNext++; in LoadDB() 180 osProxy += pszDBData + iNext; in LoadDB() 182 for( ; iNext < nBufLength && pszDBData[iNext] != '\0'; iNext++ ) {} in LoadDB() 183 iNext++; in LoadDB()
|
/dports/math/octave-forge-matgeom/matgeom-1.2.3/inst/polygons2d/ |
H A D | polygonSecondAreaMoments.m | 58 iNext = [2:N 1]; variable 61 common = px .* py(iNext) - px(iNext) .* py; 64 Ixx = sum( (py.^2 + py .* py(iNext) + py(iNext).^2) .* common) / 12; 65 Iyy = sum( (px.^2 + px .* px(iNext) + px(iNext).^2) .* common) / 12; 67 (px .* py(iNext) + 2 * px .* py + 2 * px(iNext) .* py(iNext) ... 68 + px(iNext) .* py ) .* common) / 24;
|
/dports/sysutils/conman/conman-conman-0.3.0/ |
H A D | list.c | 182 l->iNext = NULL; in list_create() 199 i = l->iNext; in list_destroy() 202 iTmp = i->iNext; in list_destroy() 360 for (i=l->iNext; i; i=i->iNext) { in list_sort() 450 i->iNext = l->iNext; in list_iterator_create() 451 l->iNext = i; in list_iterator_create() 479 for (pi=&i->list->iNext; *pi; pi=&(*pi)->iNext) { in list_iterator_destroy() 482 *pi = (*pi)->iNext; in list_iterator_destroy() 589 for (i=l->iNext; i; i=i->iNext) { in list_node_create() 622 for (i=l->iNext; i; i=i->iNext) { in list_node_destroy() [all …]
|
/dports/science/jmol/jmol-14.32.7/src/org/jmol/renderbio/ |
H A D | BioShapeRenderer.java | 305 int iPrev, iNext, iNext2, iNext3; field in BioShapeRenderer 316 iNext = (i + 1) % monomerCount; in setNeighbors() 321 iNext = Math.min(i + 1, monomerCount); in setNeighbors() 343 madEnd = mads[iNext]; in setMads() 357 madEnd = (short) (((mads[iNext] == 0 ? madMid : mads[iNext]) + madMid) >> 1); in setMads() 365 boolean doCap1 = (iNext == iNext2 || iNext2 == iNext3 || !bsVisible.get(iNext) || thisTypeOnly in setMads() 366 && structureTypes[i] != structureTypes[iNext]); in setMads() 377 screens[iNext], screens[iNext2]); in renderHermiteCylinder() 427 ribbonBottomScreens[i], ribbonBottomScreens[iNext], in renderHermiteRibbon() 461 screenArrowTop, controlPointScreens[iNext], in renderHermiteArrowHead() [all …]
|
/dports/science/jmol/jmol-14.32.7/src/org/jmol/modelset/ |
H A D | AtomIteratorWithinModel.java | 134 private int iNext; field in AtomIteratorWithinModel 145 if ((iNext = a.i) != atomIndex in hasNext2() 146 && (!checkGreater || iNext > atomIndex) in hasNext2() 147 && (bsSelected == null || bsSelected.get(iNext))) { in hasNext2() 153 iNext = a.i; in hasNext2() 156 iNext = -1; in hasNext2() 164 return iNext - zeroBase; in next()
|
/dports/graphics/ossim/ossim-OrchidIsland-2.11.1/src/base/ |
H A D | ossimActiveEdgeTable.cpp | 36 int iNext = (i+1)%numPts; // INDEX FOR SECOND EDGE VERTEX in addPolygon() local 37 iNextY = ossim::round<ossim_int32>(polygon[iNext].y-theRectOrigin.y); in addPolygon() 44 double m = (polygon[iNext].x-polygon[i].x)/ in addPolygon() 45 (polygon[iNext].y-polygon[i].y); in addPolygon() 56 double m = (polygon[i].x-polygon[iNext].x)/ in addPolygon() 57 (polygon[i].y-polygon[iNext].y); in addPolygon() 61 polygon[iNext].x); in addPolygon()
|
/dports/graphics/libdmtx/libdmtx-0.7.5/ |
H A D | dmtxreedsol.c | 332 int i, iNext, j; in RsFindErrorLocatorPoly() local 356 for(iNext = 2, i = 1; /* explicit break */; i = iNext++) in RsFindErrorLocatorPoly() 361 dmtxByteListCopy(&elp[iNext], &elp[i], &passFail); CHKPASS; in RsFindErrorLocatorPoly() 372 elp[iNext].b[j+i-m] = antilog301[(NN - log301[dis.b[m]] + in RsFindErrorLocatorPoly() 377 elp[iNext].b[j] = GfAdd(elp[iNext].b[j], elp[i].b[j]); in RsFindErrorLocatorPoly() 379 elp[iNext].length = max(elp[i].length, elp[m].length + i - m); in RsFindErrorLocatorPoly() 382 lambda = elp[iNext].length - 1; in RsFindErrorLocatorPoly() 387 for(disTmp = syn->b[iNext], j = 1; j <= lambda; j++) in RsFindErrorLocatorPoly() 388 disTmp = GfAdd(disTmp, GfMult(syn->b[iNext-j], elp[iNext].b[j])); in RsFindErrorLocatorPoly() 390 assert(dis.length == iNext); in RsFindErrorLocatorPoly() [all …]
|
/dports/sysutils/powerman/powerman-2.3.20/liblsd/ |
H A D | list.c | 97 struct listIterator *iNext; /* iterator chain for list_destroy() */ member 223 l->iNext = NULL; in list_create() 241 i = l->iNext; in list_destroy() 244 iTmp = i->iNext; in list_destroy() 429 for (i=l->iNext; i; i=i->iNext) { in list_sort() 525 i->iNext = l->iNext; in list_iterator_create() 526 l->iNext = i; in list_iterator_create() 556 for (pi=&i->list->iNext; *pi; pi=&(*pi)->iNext) { in list_iterator_destroy() 559 *pi = (*pi)->iNext; in list_iterator_destroy() 672 for (i=l->iNext; i; i=i->iNext) { in list_node_create() [all …]
|
/dports/devel/eastl/EASTL-3.13.06/include/EASTL/ |
H A D | sort.h | 239 iNext = iCurrent = iSorted; in insertion_sort() 246 for(--iCurrent; (iNext != first) && compare(temp, *iCurrent); --iNext, --iCurrent) in insertion_sort() 271 iNext = iCurrent = iSorted; in insertion_sort() 278 for(--iCurrent; (iNext != first) && (temp < *iCurrent); --iNext, --iCurrent) in insertion_sort() 466 for (--iCurrent; (iNext != first) && compare(temp, *iCurrent); --iNext, --iCurrent) in insertion_sort_already_started() 469 *iNext = *iCurrent; in insertion_sort_already_started() 472 *iNext = temp; in insertion_sort_already_started() 1823 iCurrent = iNext = first; in comb_sort() 1826 for(bSwapped = false; iNext != last; iCurrent++, iNext++) in comb_sort() 1867 for(++iNext; iNext != last; iCurrent = iNext, ++iNext) in bubble_sort_impl() [all …]
|
/dports/devel/fossil/fossil-src-2.17/src/ |
H A D | deltafunc.c | 175 int iNext; /* Next cursor value */ member 300 pCur->iCursor = pCur->iNext; in deltaparsevtabNext() 308 pCur->iNext = (int)(&z[1] - pCur->aDelta); in deltaparsevtabNext() 315 pCur->iNext = (int)(&z[pCur->a1] - pCur->aDelta); in deltaparsevtabNext() 320 pCur->iNext = pCur->nDelta; in deltaparsevtabNext() 324 if( pCur->iNext==pCur->nDelta ){ in deltaparsevtabNext() 328 pCur->iNext = pCur->nDelta; in deltaparsevtabNext() 427 pCur->iNext = pCur->nDelta; in deltaparsevtabFilter() 431 pCur->iNext = (unsigned int)(a - pCur->aDelta); in deltaparsevtabFilter()
|
/dports/databases/sqlcipher/sqlcipher-3.4.2/ext/fts3/ |
H A D | fts3_aux.c | 158 int iNext = 1; /* Next free argvIndex value */ in fts3auxBestIndexMethod() local 192 pInfo->aConstraintUsage[iEq].argvIndex = iNext++; in fts3auxBestIndexMethod() 199 pInfo->aConstraintUsage[iGe].argvIndex = iNext++; in fts3auxBestIndexMethod() 204 pInfo->aConstraintUsage[iLe].argvIndex = iNext++; in fts3auxBestIndexMethod() 209 pInfo->aConstraintUsage[iLangid].argvIndex = iNext++; in fts3auxBestIndexMethod() 378 int iNext = 0; in fts3auxFilterMethod() local 390 iEq = iNext++; in fts3auxFilterMethod() 394 iGe = iNext++; in fts3auxFilterMethod() 397 iLe = iNext++; in fts3auxFilterMethod() 400 if( iNext<nVal ){ in fts3auxFilterMethod() [all …]
|
/dports/databases/sqlite3/sqlite-src-3350500/ext/fts3/ |
H A D | fts3_aux.c | 158 int iNext = 1; /* Next free argvIndex value */ in fts3auxBestIndexMethod() local 192 pInfo->aConstraintUsage[iEq].argvIndex = iNext++; in fts3auxBestIndexMethod() 199 pInfo->aConstraintUsage[iGe].argvIndex = iNext++; in fts3auxBestIndexMethod() 204 pInfo->aConstraintUsage[iLe].argvIndex = iNext++; in fts3auxBestIndexMethod() 209 pInfo->aConstraintUsage[iLangid].argvIndex = iNext++; in fts3auxBestIndexMethod() 378 int iNext = 0; in fts3auxFilterMethod() local 390 iEq = iNext++; in fts3auxFilterMethod() 394 iGe = iNext++; in fts3auxFilterMethod() 397 iLe = iNext++; in fts3auxFilterMethod() 400 if( iNext<nVal ){ in fts3auxFilterMethod() [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/sqlite/src/ext/fts3/ |
H A D | fts3_aux.c | 158 int iNext = 1; /* Next free argvIndex value */ in fts3auxBestIndexMethod() local 192 pInfo->aConstraintUsage[iEq].argvIndex = iNext++; in fts3auxBestIndexMethod() 199 pInfo->aConstraintUsage[iGe].argvIndex = iNext++; in fts3auxBestIndexMethod() 204 pInfo->aConstraintUsage[iLe].argvIndex = iNext++; in fts3auxBestIndexMethod() 209 pInfo->aConstraintUsage[iLangid].argvIndex = iNext++; in fts3auxBestIndexMethod() 378 int iNext = 0; in fts3auxFilterMethod() local 390 iEq = iNext++; in fts3auxFilterMethod() 394 iGe = iNext++; in fts3auxFilterMethod() 397 iLe = iNext++; in fts3auxFilterMethod() 400 if( iNext<nVal ){ in fts3auxFilterMethod() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/sqlite/src/ext/fts3/ |
H A D | fts3_aux.c | 158 int iNext = 1; /* Next free argvIndex value */ in fts3auxBestIndexMethod() local 192 pInfo->aConstraintUsage[iEq].argvIndex = iNext++; in fts3auxBestIndexMethod() 199 pInfo->aConstraintUsage[iGe].argvIndex = iNext++; in fts3auxBestIndexMethod() 204 pInfo->aConstraintUsage[iLe].argvIndex = iNext++; in fts3auxBestIndexMethod() 209 pInfo->aConstraintUsage[iLangid].argvIndex = iNext++; in fts3auxBestIndexMethod() 378 int iNext = 0; in fts3auxFilterMethod() local 390 iEq = iNext++; in fts3auxFilterMethod() 394 iGe = iNext++; in fts3auxFilterMethod() 397 iLe = iNext++; in fts3auxFilterMethod() 400 if( iNext<nVal ){ in fts3auxFilterMethod() [all …]
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/mem/ |
H A D | mem2.h | 43 int iNext; // next word to be used member 89 p->iNext = (1 << nPageBase); in Mmr_FlexStart() 107 assert( h > 0 && h < p->iNext ); in Mmr_FlexEntry() 114 if ( p->iNext + nWords >= p->PageMask ) in Mmr_FlexFetch() 117 p->iNext = 1; in Mmr_FlexFetch() 119 hEntry = ((Vec_PtrSize(&p->vPages) - 1) << p->nPageBase) | p->iNext; in Mmr_FlexFetch() 120 p->iNext += nWords; in Mmr_FlexFetch() 127 assert( h > 0 && h < p->iNext ); in Mmr_FlexRelease()
|
/dports/sysutils/pdsh/pdsh-pdsh-2.34/src/common/ |
H A D | list.c | 101 struct listIterator *iNext; /* iterator chain for list_destroy() */ member 227 l->iNext = NULL; in list_create() 245 i = l->iNext; in list_destroy() 248 iTmp = i->iNext; in list_destroy() 435 for (i=l->iNext; i; i=i->iNext) { in list_sort() 531 i->iNext = l->iNext; in list_iterator_create() 532 l->iNext = i; in list_iterator_create() 562 for (pi=&i->list->iNext; *pi; pi=&(*pi)->iNext) { in list_iterator_destroy() 565 *pi = (*pi)->iNext; in list_iterator_destroy() 679 for (i=l->iNext; i; i=i->iNext) { in list_node_create() [all …]
|