/dports/misc/vxl/vxl-3.3.2/core/vbl/ |
H A D | vbl_batch_compact_multimap.h | 134 const_key_iterator k_it = std::lower_bound(keys_.begin(), keys_.end(), in lower_bound() local 137 return values_.begin() + indices_[k_it - keys_.begin()]; in lower_bound() 145 const_key_iterator k_it = std::upper_bound(keys_.begin(), keys_.end(), in upper_bound() local 148 return values_.begin() + indices_[k_it - keys_.begin()]; in upper_bound() 156 const_key_iterator k_it = std::lower_bound(keys_.begin(), keys_.end(), in equal_range() local 159 if (k_it == keys_end() || *k_it != x) in equal_range() 174 const_key_iterator k_it = std::lower_bound(keys_.begin(), keys_.end(), in find() local 177 if (k_it == keys_end() || *k_it != x) in find() 180 return values_.begin() + indices_[k_it - keys_.begin()]; in find() 189 if (k_it == keys_end() || *k_it != x) in count() [all …]
|
/dports/math/eigen3/eigen-3.3.9/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 49 typename FactorType::InnerIterator k_it(m_lu,i); in compute() 50 for(; k_it && k_it.index()<i; ++k_it) in compute() 52 int k = k_it.index(); in compute() 53 k_it.valueRef() /= diag(k); in compute() 55 typename FactorType::InnerIterator j_it(k_it); in compute() 62 j_it.valueRef() -= k_it.value() * kj_it.value(); in compute() 70 if(k_it && k_it.index()==i) diag(i) = k_it.value(); in compute()
|
/dports/math/stanmath/math-4.2.0/lib/eigen_3.3.9/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 49 typename FactorType::InnerIterator k_it(m_lu,i); in compute() 50 for(; k_it && k_it.index()<i; ++k_it) in compute() 52 int k = k_it.index(); in compute() 53 k_it.valueRef() /= diag(k); in compute() 55 typename FactorType::InnerIterator j_it(k_it); in compute() 62 j_it.valueRef() -= k_it.value() * kj_it.value(); in compute() 70 if(k_it && k_it.index()==i) diag(i) = k_it.value(); in compute()
|
/dports/math/R-cran-RcppEigen/RcppEigen/inst/include/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 49 typename FactorType::InnerIterator k_it(m_lu,i); in compute() 50 for(; k_it && k_it.index()<i; ++k_it) in compute() 52 int k = k_it.index(); in compute() 53 k_it.valueRef() /= diag(k); in compute() 55 typename FactorType::InnerIterator j_it(k_it); in compute() 62 j_it.valueRef() -= k_it.value() * kj_it.value(); in compute() 70 if(k_it && k_it.index()==i) diag(i) = k_it.value(); in compute()
|
/dports/devel/upp/upp/uppsrc/plugin/Eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 49 typename FactorType::InnerIterator k_it(m_lu,i); in compute() 50 for(; k_it && k_it.index()<i; ++k_it) in compute() 52 int k = k_it.index(); in compute() 53 k_it.valueRef() /= diag(k); in compute() 55 typename FactorType::InnerIterator j_it(k_it); in compute() 62 j_it.valueRef() -= k_it.value() * kj_it.value(); in compute() 70 if(k_it && k_it.index()==i) diag(i) = k_it.value(); in compute()
|
/dports/math/libsemigroups/libsemigroups-1.3.7/extern/eigen-3.3.7/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 49 typename FactorType::InnerIterator k_it(m_lu,i); in compute() 50 for(; k_it && k_it.index()<i; ++k_it) in compute() 52 int k = k_it.index(); in compute() 53 k_it.valueRef() /= diag(k); in compute() 55 typename FactorType::InnerIterator j_it(k_it); in compute() 62 j_it.valueRef() -= k_it.value() * kj_it.value(); in compute() 70 if(k_it && k_it.index()==i) diag(i) = k_it.value(); in compute()
|
/dports/science/pcmsolver/pcmsolver-1.3.0/external/eigen3/include/eigen3/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 49 typename FactorType::InnerIterator k_it(m_lu,i); in compute() 50 for(; k_it && k_it.index()<i; ++k_it) in compute() 52 int k = k_it.index(); in compute() 53 k_it.valueRef() /= diag(k); in compute() 55 typename FactorType::InnerIterator j_it(k_it); in compute() 62 j_it.valueRef() -= k_it.value() * kj_it.value(); in compute() 70 if(k_it && k_it.index()==i) diag(i) = k_it.value(); in compute()
|
/dports/misc/opennn/opennn-5.0.5/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 49 typename FactorType::InnerIterator k_it(m_lu,i); in compute() 50 for(; k_it && k_it.index()<i; ++k_it) in compute() 52 int k = k_it.index(); in compute() 53 k_it.valueRef() /= diag(k); in compute() 55 typename FactorType::InnerIterator j_it(k_it); in compute() 62 j_it.valueRef() -= k_it.value() * kj_it.value(); in compute() 70 if(k_it && k_it.index()==i) diag(i) = k_it.value(); in compute()
|
/dports/misc/openmvg/openMVG-2.0/src/third_party/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 49 typename FactorType::InnerIterator k_it(m_lu,i); in compute() 50 for(; k_it && k_it.index()<i; ++k_it) in compute() 52 int k = k_it.index(); in compute() 53 k_it.valueRef() /= diag(k); in compute() 55 typename FactorType::InnerIterator j_it(k_it); in compute() 62 j_it.valueRef() -= k_it.value() * kj_it.value(); in compute() 70 if(k_it && k_it.index()==i) diag(i) = k_it.value(); in compute()
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/eigen-3.3.7/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 49 typename FactorType::InnerIterator k_it(m_lu,i); in compute() 50 for(; k_it && k_it.index()<i; ++k_it) in compute() 52 int k = k_it.index(); in compute() 53 k_it.valueRef() /= diag(k); in compute() 55 typename FactorType::InnerIterator j_it(k_it); in compute() 62 j_it.valueRef() -= k_it.value() * kj_it.value(); in compute() 70 if(k_it && k_it.index()==i) diag(i) = k_it.value(); in compute()
|
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/eigen_3.3.3/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 49 typename FactorType::InnerIterator k_it(m_lu,i); in compute() 50 for(; k_it && k_it.index()<i; ++k_it) in compute() 52 int k = k_it.index(); in compute() 53 k_it.valueRef() /= diag(k); in compute() 55 typename FactorType::InnerIterator j_it(k_it); in compute() 62 j_it.valueRef() -= k_it.value() * kj_it.value(); in compute() 70 if(k_it && k_it.index()==i) diag(i) = k_it.value(); in compute()
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/eigen3/include/eigen3/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 49 typename FactorType::InnerIterator k_it(m_lu,i); in compute() 50 for(; k_it && k_it.index()<i; ++k_it) in compute() 52 int k = k_it.index(); in compute() 53 k_it.valueRef() /= diag(k); in compute() 55 typename FactorType::InnerIterator j_it(k_it); in compute() 62 j_it.valueRef() -= k_it.value() * kj_it.value(); in compute() 70 if(k_it && k_it.index()==i) diag(i) = k_it.value(); in compute()
|
/dports/security/silktools/silk-3.19.1/src/rwaggbag/ |
H A D | rwaggbag.c | 628 sk_aggbag_field_t k_it; in processFile() local 656 skAggBagInitializeKey(ab, &key, &k_it); in processFile() 658 switch (skAggBagFieldIterGetType(&k_it)) { in processFile() 676 &key, &k_it, rwRecGetSPort(&rwrec)); in processFile() 680 &key, &k_it, rwRecGetDPort(&rwrec)); in processFile() 684 &key, &k_it, in processFile() 689 &key, &k_it, in processFile() 694 &key, &k_it, rwRecGetProto(&rwrec)); in processFile() 698 &key, &k_it, rwRecGetPkts(&rwrec)); in processFile() 730 &key, &k_it, in processFile() [all …]
|
H A D | rwaggbagtool.c | 2015 sk_aggbag_field_t k_it; in mapFields() local 2028 skAggBagInitializeKey(ab_dst, &key, &k_it); in mapFields() 2030 id = skAggBagFieldIterGetType(&k_it); in mapFields() 2046 skAggBagAggregateSetIPAddress(&key, &k_it, &pv->pv.pv_ip); in mapFields() 2049 skAggBagAggregateSetUnsigned(&key, &k_it, pv->pv.pv_int); in mapFields() 2054 switch (skAggBagFieldIterGetType(&k_it)) { in mapFields() 2065 skAggBagAggregateSetIPAddress(&key, &k_it, &ip); in mapFields() 2071 skAggBagAggregateSetUnsigned(&key, &k_it, number); in mapFields() 2075 } while (skAggBagFieldIterNext(&k_it) == SK_ITERATOR_OK); in mapFields()
|
/dports/graphics/blender/blender-2.91.0/source/blender/blenkernel/intern/ |
H A D | kelvinlet.c | 141 float k[4][3], k_it[4][3]; in sculpt_kelvinet_integrate() local 143 copy_v3_v3(k_it[0], k[0]); in sculpt_kelvinet_integrate() 144 mul_v3_fl(k_it[0], 0.5f); in sculpt_kelvinet_integrate() 145 add_v3_v3v3(k_it[0], vertex_co, k_it[0]); in sculpt_kelvinet_integrate() 146 kelvinlet(k[1], k_it[0], location, normal, p); in sculpt_kelvinet_integrate() 147 copy_v3_v3(k_it[1], k[1]); in sculpt_kelvinet_integrate() 148 mul_v3_fl(k_it[1], 0.5f); in sculpt_kelvinet_integrate() 149 add_v3_v3v3(k_it[1], vertex_co, k_it[1]); in sculpt_kelvinet_integrate() 151 copy_v3_v3(k_it[2], k[2]); in sculpt_kelvinet_integrate() 152 add_v3_v3v3(k_it[2], vertex_co, k_it[2]); in sculpt_kelvinet_integrate() [all …]
|
/dports/math/libmesh/libmesh-1.6.2/contrib/eigen/3.2.9/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 45 typename FactorType::InnerIterator k_it(m_lu,i); in compute() 46 for(; k_it && k_it.index()<i; ++k_it) in compute() 48 int k = k_it.index(); in compute() 49 k_it.valueRef() /= diag(k); in compute() 51 typename FactorType::InnerIterator j_it(k_it); in compute() 58 j_it.valueRef() -= k_it.value() * kj_it.value(); in compute() 66 if(k_it && k_it.index()==i) diag(i) = k_it.value(); in compute()
|
/dports/graphics/wdune/wdune-1.926/vcglib/eigenlib/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 45 typename FactorType::InnerIterator k_it(m_lu,i); in compute() 46 for(; k_it && k_it.index()<i; ++k_it) in compute() 48 int k = k_it.index(); in compute() 49 k_it.valueRef() /= diag(k); in compute() 51 typename FactorType::InnerIterator j_it(k_it); in compute() 58 j_it.valueRef() -= k_it.value() * kj_it.value(); in compute() 66 if(k_it && k_it.index()==i) diag(i) = k_it.value(); in compute()
|
/dports/graphics/scantailor/scantailor-advanced-1.0.16/ |
H A D | ThumbnailPixmapCache.cpp | 370 if (k_it != m_itemsByKey.end()) { in request() 372 pixmap = k_it->pixmap; in request() 380 pixmap = k_it->pixmap; in request() 406 if (k_it != m_itemsByKey.end()) { in request() 407 assert(k_it->status == Item::QUEUED || k_it->status == Item::IN_PROGRESS); in request() 512 if (k_it == m_itemsByKey.end()) { in recreateThumbnail() 516 switch (k_it->status) { in recreateThumbnail() 820 if (k_it == m_itemsByKey.end()) { in cachePixmapLocked() 842 switch (k_it->status) { in cachePixmapLocked() 872 k_it->status = new_status; in cachePixmapLocked() [all …]
|
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/bvpl/kernels/ |
H A D | bvpl_gauss3d_kernel_factory.cxx | 101 auto k_it = canonical_kernel_.begin(); in create_canonical() local 103 for(; k_it != canonical_kernel_.end(); k_it++) in create_canonical() 105 k_it->second.c_ = k_it->second.c_ / l1_norm; in create_canonical() 106 norm+=k_it->second.c_; in create_canonical()
|
H A D | bvpl_gauss3d_x_kernel_factory.cxx | 110 auto k_it = canonical_kernel_.begin(); in create_canonical() local 112 for(; k_it != canonical_kernel_.end(); k_it++) in create_canonical() 114 k_it->second.c_ = k_it->second.c_ / l1_norm; in create_canonical() 115 norm+=std::abs(k_it->second.c_); in create_canonical()
|
/dports/math/polymake/polymake-4.5/apps/graph/include/ |
H A D | max_cliques.tcc | 79 Set<Int>::const_iterator k_it = K.begin(); in operator ++() local 82 while (!k_it.at_end()) { in operator ++() 83 if (*k_it > i) break; in operator ++() 84 neighbors_of_K_i += G->adjacent_nodes(*k_it) - K; in operator ++() 85 ++k_it; in operator ++()
|
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Filtering/ImageFeature/include/ |
H A D | itkBilateralImageFilter.hxx | 279 KernelConstIteratorType k_it; in DynamicThreadedGenerateData() local 298 for ( i = 0, k_it = m_GaussianKernel.Begin(); k_it < kernelEnd; in DynamicThreadedGenerateData() 299 ++k_it, ++i ) in DynamicThreadedGenerateData() 319 gaussianProduct = ( *k_it ) * rangeGaussian; in DynamicThreadedGenerateData()
|
/dports/x11-wm/pekwm/pekwm-release-0.2.0/src/ |
H A D | KeyGrabber.cc | 256 std::vector<ActionEvent>::const_iterator k_it = keys.begin(); in grabKeys() local 257 for (; k_it != keys.end(); ++k_it) { in grabKeys() 258 grabKey(win, k_it->mod, k_it->sym); in grabKeys()
|
/dports/math/stp/stp-2.3.3/tools/test_constantbitprop/ |
H A D | test_cbitp.cpp | 641 for (int k_it = 0; k_it < totalLength; k_it++) in exhaustively_check() local 643 if (k_it < resultLength) in exhaustively_check() 645 setV(output, k_it, current % 3); in exhaustively_check() 649 int working = (k_it - resultLength - usedUp); in exhaustively_check()
|
/dports/audio/musescore/MuseScore-3.6.1/fonts/ |
H A D | FreeSerif.sfd | 225972 StartChar: k_it
|