| /dports/graphics/luminance-qt5/luminance-hdr-2.6.1.1/src/TonemappingOperators/lischinski06/ |
| H A D | lischinski_minimization.cpp | 95 int indJ; in LischinskiMinimization() local
102 indJ = indI - width; in LischinskiMinimization()
103 tmp = LischinskiFunction(L(indJ), Lref, param, LISCHINSKI_EPSILON); in LischinskiMinimization()
104 tL.push_back(Eigen::Triplet< float > (indI, indJ, tmp)); in LischinskiMinimization()
109 indJ = indI + width; in LischinskiMinimization()
110 tmp = LischinskiFunction(L(indJ), Lref, param, LISCHINSKI_EPSILON); in LischinskiMinimization()
111 tL.push_back(Eigen::Triplet< float > (indI, indJ, tmp)); in LischinskiMinimization()
117 indJ = indI - 1; in LischinskiMinimization()
119 tL.push_back(Eigen::Triplet< float > (indI, indJ, tmp)); in LischinskiMinimization()
124 indJ = indI + 1; in LischinskiMinimization()
[all …]
|
| /dports/math/R-cran-gmp/gmp/src/ |
| H A D | extract_matrix.h | 122 std::vector<int> indJ; in get_at() local
159 if (! indJ[i+delta% indJ.size()]) in get_at()
171 indJ.erase(std::remove(indJ.begin(), indJ.end(), 0L), indJ.end()); // remove all zeroes in get_at()
173 if (indJ.empty()) in get_at()
181 if(indJ[0] < 0) in get_at()
184 std::sort(indJ.begin(),indJ.end(),std::greater<int>() ); in get_at()
189 it = std::unique(indJ.begin(),indJ.end()); in get_at()
197 it=indJ.begin(); in get_at()
202 if(it == indJ.end()) in get_at()
226 for( it=indJ.begin(); it != indJ.end(); it++) in get_at()
[all …]
|
| /dports/biology/gatk/gatk-4.2.0.0/src/main/java/org/broadinstitute/hellbender/utils/pairhmm/ |
| H A D | Log10PairHMM.java | 175 …private void updateCell( final int indI, final int indJ, final double prior, final double[] transi… in updateCell() argument
177 matchMatrix[indI][indJ] = prior + in updateCell()
178 … myLog10SumLog10(new double[]{matchMatrix[indI - 1][indJ - 1] + transition[matchToMatch], in updateCell()
179 insertionMatrix[indI - 1][indJ - 1] + transition[indelToMatch], in updateCell()
180 deletionMatrix[indI - 1][indJ - 1] + transition[indelToMatch]}); in updateCell()
181 …Matrix[indI][indJ] = myLog10SumLog10(new double[]{matchMatrix[indI - 1][indJ] + transition[matchTo… in updateCell()
182 …onMatrix[indI][indJ] = myLog10SumLog10(new double[]{matchMatrix[indI][indJ - 1] + transition[matc… in updateCell()
|
| /dports/math/vtk9/VTK-9.1.0/ThirdParty/vtkm/vtkvtkm/vtk-m/vtkm/worklet/contourtree_distributed/hierarchical_contour_tree/ |
| H A D | PermuteComparator.h | 90 vtkm::Id indJ = this->LookupPortal.Get(j); in operator() local
93 if (indI < indJ) in operator()
97 if (indI > indJ) in operator()
|
| /dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/standardize/ |
| H A D | analyzeSparsity.cpp | 84 indJ = i -> first.second; in analyzeSparsity() local
86 exprAux *aux = (indI != indJ) ? in analyzeSparsity()
89 new exprClone (Var (indJ)))) : in analyzeSparsity()
|
| H A D | CouenneLQelems.hpp | 87 void insert (int indI, int indJ, CouNumber coe) { in insert() argument
89 std::pair <int, int> nind (indI, indJ); in insert()
|
| /dports/math/spooles-mpich/spooles.2.2_SHARED/ETree/src/ |
| H A D | storage.c | 158 int *bndwghts, *head, *indI, *indJ, in ETree_GSstorageProfile() local
257 IVL_listAndSize(symbfacIVL, J, &sizeJ, &indJ) ; in ETree_GSstorageProfile()
259 v = indJ[ii] ; in ETree_GSstorageProfile()
268 IVL_listAndSize(symbfacIVL, J, &sizeJ, &indJ) ; in ETree_GSstorageProfile()
307 int *bndwghts, *indJ, *mark, *nodwghts, *stor, *vtxToFront ; in ETree_FSstorageProfile() local
359 IVL_listAndSize(symbfacIVL, J, &sizeJ, &indJ) ; in ETree_FSstorageProfile()
362 K = vtxToFront[indJ[ii]] ; in ETree_FSstorageProfile()
|
| /dports/math/spooles-mpich/spooles.2.2/ETree/src/ |
| H A D | storage.c | 158 int *bndwghts, *head, *indI, *indJ, in ETree_GSstorageProfile() local
257 IVL_listAndSize(symbfacIVL, J, &sizeJ, &indJ) ; in ETree_GSstorageProfile()
259 v = indJ[ii] ; in ETree_GSstorageProfile()
268 IVL_listAndSize(symbfacIVL, J, &sizeJ, &indJ) ; in ETree_GSstorageProfile()
307 int *bndwghts, *indJ, *mark, *nodwghts, *stor, *vtxToFront ; in ETree_FSstorageProfile() local
359 IVL_listAndSize(symbfacIVL, J, &sizeJ, &indJ) ; in ETree_FSstorageProfile()
362 K = vtxToFront[indJ[ii]] ; in ETree_FSstorageProfile()
|
| /dports/math/spooles/spooles.2.2_SHARED/ETree/src/ |
| H A D | storage.c | 158 int *bndwghts, *head, *indI, *indJ, in ETree_GSstorageProfile() local
257 IVL_listAndSize(symbfacIVL, J, &sizeJ, &indJ) ; in ETree_GSstorageProfile()
259 v = indJ[ii] ; in ETree_GSstorageProfile()
268 IVL_listAndSize(symbfacIVL, J, &sizeJ, &indJ) ; in ETree_GSstorageProfile()
307 int *bndwghts, *indJ, *mark, *nodwghts, *stor, *vtxToFront ; in ETree_FSstorageProfile() local
359 IVL_listAndSize(symbfacIVL, J, &sizeJ, &indJ) ; in ETree_FSstorageProfile()
362 K = vtxToFront[indJ[ii]] ; in ETree_FSstorageProfile()
|
| /dports/math/spooles/spooles.2.2/ETree/src/ |
| H A D | storage.c | 158 int *bndwghts, *head, *indI, *indJ, in ETree_GSstorageProfile() local
257 IVL_listAndSize(symbfacIVL, J, &sizeJ, &indJ) ; in ETree_GSstorageProfile()
259 v = indJ[ii] ; in ETree_GSstorageProfile()
268 IVL_listAndSize(symbfacIVL, J, &sizeJ, &indJ) ; in ETree_GSstorageProfile()
307 int *bndwghts, *indJ, *mark, *nodwghts, *stor, *vtxToFront ; in ETree_FSstorageProfile() local
359 IVL_listAndSize(symbfacIVL, J, &sizeJ, &indJ) ; in ETree_FSstorageProfile()
362 K = vtxToFront[indJ[ii]] ; in ETree_FSstorageProfile()
|
| /dports/finance/chiapos/chiapos-1.0.3/src/ |
| H A D | calculate_bucket.hpp | 62 uint16_t indJ = i / kC; in load_tables() local
65 ((indJ + m) % kB) * kC + (((2 * m + parity) * (2 * m + parity) + i) % kC); in load_tables()
|
| /dports/math/spooles/spooles.2.2/MPI/src/ |
| H A D | symbfacMPI.c | 24 static int mergeIndices ( int sizeJ, int indJ[],
1018 int indJ[], in mergeIndices() argument
1029 v = indJ[ii] ; in mergeIndices()
1042 v = indJ[ii] ; in mergeIndices()
1044 indK[kk++] = indJ[ii] ; in mergeIndices()
|
| /dports/math/spooles-mpich/spooles.2.2/MPI/src/ |
| H A D | symbfacMPI.c | 24 static int mergeIndices ( int sizeJ, int indJ[],
1018 int indJ[], in mergeIndices() argument
1029 v = indJ[ii] ; in mergeIndices()
1042 v = indJ[ii] ; in mergeIndices()
1044 indK[kk++] = indJ[ii] ; in mergeIndices()
|
| /dports/math/spooles-mpich/spooles.2.2_SHARED/MPI/src/ |
| H A D | symbfacMPI.c | 24 static int mergeIndices ( int sizeJ, int indJ[],
1018 int indJ[], in mergeIndices() argument
1029 v = indJ[ii] ; in mergeIndices()
1042 v = indJ[ii] ; in mergeIndices()
1044 indK[kk++] = indJ[ii] ; in mergeIndices()
|
| /dports/math/spooles/spooles.2.2_SHARED/MPI/src/ |
| H A D | symbfacMPI.c | 24 static int mergeIndices ( int sizeJ, int indJ[],
1018 int indJ[], in mergeIndices() argument
1029 v = indJ[ii] ; in mergeIndices()
1042 v = indJ[ii] ; in mergeIndices()
1044 indK[kk++] = indJ[ii] ; in mergeIndices()
|
| /dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/cut/sdpcuts/ |
| H A D | CutGen.cpp | 121 indJ = 0; in genCutSingle() local
125 j != i -> second -> getElements () . end (); ++j, ++indJ) { in genCutSingle()
128 printf ("[r%d,v%d,%d,%g,", indJ, in genCutSingle()
|
| /dports/math/casadi/casadi-3.5.5/casadi/interfaces/snopt/ |
| H A D | snopt_interface.cpp | 198 m->indJ.resize(A_structure_.nnz()); in init_mem()
362 copy_vector(A_structure_.row(), m->indJ); in solve()
405 get_ptr(m->valJ), get_ptr(m->indJ), get_ptr(m->locJ), in solve()
|
| H A D | snopt_interface.hpp | 61 std::vector<int> hs, locJ, indJ; member
|
| /dports/science/gnudatalanguage/gdl-1.0.1/src/ |
| H A D | sorting.cpp | 1365 inline SizeT median3_for_qsort ( T* val, IndexT* index, SizeT indI, SizeT indJ, SizeT indK) in median3_for_qsort() argument
1367 return (less(val[index[ indI]], val[index[ indJ]]) ? in median3_for_qsort()
1368 …(less(val[index[ indJ]], val[index[ indK]]) ? indJ : less(val[index[ indI]], val[index[ indK]]) ? … in median3_for_qsort()
1369 …(less(val[index[ indK]], val[index[ indJ]]) ? indJ : less(val[index[ indK]], val[index[ indI]]) ? … in median3_for_qsort()
|