/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/sample_consensus/include/pcl/sample_consensus/impl/ |
H A D | sac_model_normal_plane.hpp | 73 inliers.reserve (indices_->size ()); in selectWithinDistance() 74 error_sqr_dists_.reserve (indices_->size ()); in selectWithinDistance() 77 for (std::size_t i = 0; i < indices_->size (); ++i) in selectWithinDistance() 79 const PointT &pt = (*input_)[(*indices_)[i]]; in selectWithinDistance() 80 const PointNT &nt = (*normals_)[(*indices_)[i]]; in selectWithinDistance() 98 inliers.push_back ((*indices_)[i]); in selectWithinDistance() 140 for (; i < indices_->size (); ++i) in countWithinDistanceStandard() 142 const PointT &pt = (*input_)[(*indices_)[i]]; in countWithinDistanceStandard() 180 for (; (i + 4) <= indices_->size (); i += 4) in countWithinDistanceSSE() 233 for (; (i + 8) <= indices_->size (); i += 8) in countWithinDistanceAVX() [all …]
|
H A D | sac_model_normal_sphere.hpp | 72 inliers.reserve (indices_->size ()); in selectWithinDistance() 73 error_sqr_dists_.reserve (indices_->size ()); in selectWithinDistance() 76 for (std::size_t i = 0; i < indices_->size (); ++i) in selectWithinDistance() 80 Eigen::Vector4f p ((*input_)[(*indices_)[i]].x, in selectWithinDistance() 81 (*input_)[(*indices_)[i]].y, in selectWithinDistance() 82 (*input_)[(*indices_)[i]].z, in selectWithinDistance() 102 inliers.push_back ((*indices_)[i]); in selectWithinDistance() 135 Eigen::Vector4f p ((*input_)[(*indices_)[i]].x, in countWithinDistance() 136 (*input_)[(*indices_)[i]].y, in countWithinDistance() 137 (*input_)[(*indices_)[i]].z, in countWithinDistance() [all …]
|
H A D | sac_model_registration_2d.hpp | 70 if (indices_->size () != indices_tgt_->size ()) in getDistancesToModel() 82 distances.resize (indices_->size ()); in getDistancesToModel() 91 for (std::size_t i = 0; i < indices_->size (); ++i) in getDistancesToModel() 93 Eigen::Vector4f pt_src ((*input_)[(*indices_)[i]].x, in getDistancesToModel() 123 if (indices_->size () != indices_tgt_->size ()) in selectWithinDistance() 139 inliers.reserve (indices_->size ()); in selectWithinDistance() 140 error_sqr_dists_.reserve (indices_->size ()); in selectWithinDistance() 148 for (std::size_t i = 0; i < indices_->size (); ++i) in selectWithinDistance() 173 inliers.push_back ((*indices_)[i]); in selectWithinDistance() 184 if (indices_->size () != indices_tgt_->size ()) in countWithinDistance() [all …]
|
/dports/graphics/blender/blender-2.91.0/source/blender/blenlib/ |
H A D | BLI_index_mask.hh | 48 Span<int64_t> indices_; member in blender::IndexMask 99 return indices_; in operator Span<int64_t>() 104 return indices_.begin(); in begin() 109 return indices_.end(); in end() 118 return indices_[n]; in operator []() 127 if (indices_.size() == 0) { in min_array_size() 137 return indices_; in indices() 145 return indices_.size() > 0 && indices_.last() - indices_.first() == indices_.size() - 1; in is_range() 155 return IndexRange{indices_.first(), indices_.size()}; in as_range() 197 return indices_.last(); in last() [all …]
|
/dports/math/clingo/clingo-5.5.1/clasp/clasp/util/ |
H A D | indexed_priority_queue.h | 61 indices_ = other.indices_; 75 indices_.reserve(n); in reserve() 81 if (indices_.capacity() <= k) { indices_.reserve(((k+1)*3)>>1); } in push() 86 siftup(indices_[k]); in push() 101 indices_.clear(); in clear() 109 indices_.swap(o.indices_); in swapMem() 142 return k < (key_type)indices_.size() && indices_[k] != detail::noKey; in is_in_queue() 178 indices_[x] = n; in siftup() 194 indices_[x] = n; in siftdown() 207 : indices_() in indexed_priority_queue() [all …]
|
/dports/math/clingo/clingo-5.5.1/clasp/clasp-da10954/clasp/util/ |
H A D | indexed_priority_queue.h | 61 indices_ = other.indices_; 75 indices_.reserve(n); in reserve() 81 if (indices_.capacity() <= k) { indices_.reserve(((k+1)*3)>>1); } in push() 86 siftup(indices_[k]); in push() 101 indices_.clear(); in clear() 109 indices_.swap(o.indices_); in swapMem() 142 return k < (key_type)indices_.size() && indices_[k] != detail::noKey; in is_in_queue() 178 indices_[x] = n; in siftup() 194 indices_[x] = n; in siftdown() 207 : indices_() in indexed_priority_queue() [all …]
|
/dports/math/clasp/clasp-3.3.5/clasp/util/ |
H A D | indexed_priority_queue.h | 61 indices_ = other.indices_; 75 indices_.reserve(n); in reserve() 81 if (indices_.capacity() <= k) { indices_.reserve(((k+1)*3)>>1); } in push() 86 siftup(indices_[k]); in push() 101 indices_.clear(); in clear() 109 indices_.swap(o.indices_); in swapMem() 142 return k < (key_type)indices_.size() && indices_[k] != detail::noKey; in is_in_queue() 178 indices_[x] = n; in siftup() 194 indices_[x] = n; in siftdown() 207 : indices_() in indexed_priority_queue() [all …]
|
/dports/math/ogdf/OGDF/src/coin/Clp/ |
H A D | ClpNetworkMatrix.cpp | 36 indices_ = NULL; in ClpNetworkMatrix() 59 indices_[j] = iRow; in ClpNetworkMatrix() 74 indices_ = NULL; in ClpNetworkMatrix() 80 CoinMemcpyN(rhs.indices_, 2 * numberColumns_, indices_); in ClpNetworkMatrix() 96 indices_ = NULL; in ClpNetworkMatrix() 175 indices_ = NULL; in ClpNetworkMatrix() 191 delete [] indices_; in ~ClpNetworkMatrix() 207 indices_ = NULL; in operator =() 213 CoinMemcpyN(rhs.indices_, 2 * numberColumns_, indices_); in operator =() 771 delete [] indices_; in deleteCols() [all …]
|
/dports/math/clp/Clp-1.17.3/Clp/src/ |
H A D | ClpNetworkMatrix.cpp | 35 indices_ = NULL; in ClpNetworkMatrix() 59 indices_[j] = iRow; in ClpNetworkMatrix() 74 indices_ = NULL; in ClpNetworkMatrix() 80 CoinMemcpyN(rhs.indices_, 2 * numberColumns_, indices_); in ClpNetworkMatrix() 96 indices_ = NULL; in ClpNetworkMatrix() 172 delete[] indices_; in ClpNetworkMatrix() 175 indices_ = NULL; in ClpNetworkMatrix() 191 delete[] indices_; in ~ClpNetworkMatrix() 207 indices_ = NULL; in operator =() 213 CoinMemcpyN(rhs.indices_, 2 * numberColumns_, indices_); in operator =() [all …]
|
/dports/math/blaze/blaze-3.8/blaze/util/ |
H A D | Indices.h | 142 indices_.reserve( number ); in Indices() 144 while( indices_.size() < number ) in Indices() 148 const auto pos = std::lower_bound( indices_.begin(), indices_.end(), value ); in Indices() 157 indices_.resize( maxNumber ); in Indices() 158 std::iota( indices_.begin(), indices_.end(), min ); in Indices() 160 while( indices_.size() > number ) in Indices() 164 const auto pos = std::lower_bound( indices_.begin(), indices_.end(), value ); in Indices() 167 indices_.erase( pos ); in Indices() 191 return indices_.size(); in size() 204 return indices_.begin(); in begin() [all …]
|
/dports/math/ogdf/OGDF/src/coin/CoinUtils/ |
H A D | CoinIndexedVector.cpp | 54 indices_=NULL; in empty() 148 indices_=NULL; in returnVector() 441 indices_[i] = indices_[j]; in swap() 587 indices_(NULL), in CoinIndexedVector() 598 indices_(NULL), in CoinIndexedVector() 627 indices_(NULL), in CoinIndexedVector() 640 indices_(NULL), in CoinIndexedVector() 653 indices_(NULL), in CoinIndexedVector() 667 indices_(NULL), in CoinIndexedVector() 683 indices_(NULL), in CoinIndexedVector() [all …]
|
/dports/math/dune-fem/dune-fem-d1c625e6d51167d0cce57de6adcef21f548a8f82/dune/fem/space/common/ |
H A D | commindexmap.hh | 19 DynamicArray< IndexType > indices_; member in Dune::Fem::CommunicationIndexMap 24 : indices_( 0 ) in CommunicationIndexMap() 26 indices_.setMemoryFactor( 1.1 ); in CommunicationIndexMap() 35 return indices_[ i ]; in operator []() 60 indices_[ count ] = idx[ i ]; in insert() 77 indices_[count] = *it; in set() 84 return indices_.size(); in size() 118 indices_.resize( idxSize ); in readFromBuffer() 121 buffer.read( indices_[i] ); in readFromBuffer() 130 indices_.resize( size ); in resize() [all …]
|
/dports/graphics/opengv/opengv-91f4b19/include/opengv/sac/implementation/ |
H A D | MultiSampleConsensusProblem.hpp | 137 return indices_; in getIndices() 155 indices_->resize(N.size()); in setUniformIndices() 158 (*indices_)[j].resize(N[j]); in setUniformIndices() 160 (*indices_)[j][i] = i; in setUniformIndices() 162 shuffled_indices_ = *indices_; in setUniformIndices() 171 shuffled_indices_ = *indices_; in setIndices() 191 dist.resize(indices_->size()); in selectWithinDistance() 193 inliers.resize(indices_->size()); in selectWithinDistance() 196 dist[j].reserve((*indices_)[j].size()); in selectWithinDistance() 218 dist.resize(indices_->size()); in countWithinDistance() [all …]
|
/dports/databases/percona57-server/percona-server-5.7.36-39/storage/rocksdb/rocksdb/util/ |
H A D | vector_iterator.h | 26 indices_.reserve(keys_.size()); in VectorIterator() 28 indices_.push_back(i); in VectorIterator() 30 std::sort(indices_.begin(), indices_.end(), indexed_cmp_); in VectorIterator() 34 return !indices_.empty() && current_ < indices_.size(); in Valid() 41 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in Seek() 43 indices_.begin(); in Seek() 47 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in SeekForPrev() 49 indices_.begin(); in SeekForPrev() 61 return Slice(keys_[indices_[current_]]); in key() 64 return Slice(values_[indices_[current_]]); in value() [all …]
|
/dports/databases/percona57-client/percona-server-5.7.36-39/storage/rocksdb/rocksdb/util/ |
H A D | vector_iterator.h | 26 indices_.reserve(keys_.size()); in VectorIterator() 28 indices_.push_back(i); in VectorIterator() 30 std::sort(indices_.begin(), indices_.end(), indexed_cmp_); in VectorIterator() 34 return !indices_.empty() && current_ < indices_.size(); in Valid() 41 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in Seek() 43 indices_.begin(); in Seek() 47 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in SeekForPrev() 49 indices_.begin(); in SeekForPrev() 61 return Slice(keys_[indices_[current_]]); in key() 64 return Slice(values_[indices_[current_]]); in value() [all …]
|
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/rocksdb/rocksdb/util/ |
H A D | vector_iterator.h | 26 indices_.reserve(keys_.size()); in VectorIterator() 28 indices_.push_back(i); in VectorIterator() 30 std::sort(indices_.begin(), indices_.end(), indexed_cmp_); in VectorIterator() 34 return !indices_.empty() && current_ < indices_.size(); in Valid() 41 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in Seek() 43 indices_.begin(); in Seek() 47 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in SeekForPrev() 49 indices_.begin(); in SeekForPrev() 61 return Slice(keys_[indices_[current_]]); in key() 64 return Slice(values_[indices_[current_]]); in value() [all …]
|
/dports/textproc/sonic/sonic-1.3.0/cargo-crates/librocksdb-sys-6.7.4/rocksdb/util/ |
H A D | vector_iterator.h | 26 indices_.reserve(keys_.size()); in VectorIterator() 28 indices_.push_back(i); in VectorIterator() 30 std::sort(indices_.begin(), indices_.end(), indexed_cmp_); in VectorIterator() 34 return !indices_.empty() && current_ < indices_.size(); in Valid() 41 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in Seek() 43 indices_.begin(); in Seek() 47 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in SeekForPrev() 49 indices_.begin(); in SeekForPrev() 61 return Slice(keys_[indices_[current_]]); in key() 64 return Slice(values_[indices_[current_]]); in value() [all …]
|
/dports/databases/mariadb104-server/mariadb-10.4.24/storage/rocksdb/rocksdb/util/ |
H A D | vector_iterator.h | 26 indices_.reserve(keys_.size()); in VectorIterator() 28 indices_.push_back(i); in VectorIterator() 30 std::sort(indices_.begin(), indices_.end(), indexed_cmp_); in VectorIterator() 34 return !indices_.empty() && current_ < indices_.size(); in Valid() 41 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in Seek() 43 indices_.begin(); in Seek() 47 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in SeekForPrev() 49 indices_.begin(); in SeekForPrev() 61 return Slice(keys_[indices_[current_]]); in key() 64 return Slice(values_[indices_[current_]]); in value() [all …]
|
/dports/databases/mariadb104-client/mariadb-10.4.24/storage/rocksdb/rocksdb/util/ |
H A D | vector_iterator.h | 26 indices_.reserve(keys_.size()); in VectorIterator() 28 indices_.push_back(i); in VectorIterator() 30 std::sort(indices_.begin(), indices_.end(), indexed_cmp_); in VectorIterator() 34 return !indices_.empty() && current_ < indices_.size(); in Valid() 41 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in Seek() 43 indices_.begin(); in Seek() 47 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in SeekForPrev() 49 indices_.begin(); in SeekForPrev() 61 return Slice(keys_[indices_[current_]]); in key() 64 return Slice(values_[indices_[current_]]); in value() [all …]
|
/dports/databases/mariadb105-client/mariadb-10.5.15/storage/rocksdb/rocksdb/util/ |
H A D | vector_iterator.h | 26 indices_.reserve(keys_.size()); in VectorIterator() 28 indices_.push_back(i); in VectorIterator() 30 std::sort(indices_.begin(), indices_.end(), indexed_cmp_); in VectorIterator() 34 return !indices_.empty() && current_ < indices_.size(); in Valid() 41 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in Seek() 43 indices_.begin(); in Seek() 47 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in SeekForPrev() 49 indices_.begin(); in SeekForPrev() 61 return Slice(keys_[indices_[current_]]); in key() 64 return Slice(values_[indices_[current_]]); in value() [all …]
|
/dports/databases/mariadb103-client/mariadb-10.3.34/storage/rocksdb/rocksdb/util/ |
H A D | vector_iterator.h | 26 indices_.reserve(keys_.size()); in main() 28 indices_.push_back(i); in main() 30 std::sort(indices_.begin(), indices_.end(), indexed_cmp_); in main() 34 return !indices_.empty() && current_ < indices_.size(); in main() 41 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in main() 43 indices_.begin(); in main() 47 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in main() 49 indices_.begin(); in main() 61 return Slice(keys_[indices_[current_]]); in main() 64 return Slice(values_[indices_[current_]]); in main() [all …]
|
/dports/databases/mariadb103-server/mariadb-10.3.34/storage/rocksdb/rocksdb/util/ |
H A D | vector_iterator.h | 26 indices_.reserve(keys_.size()); in VectorIterator() 28 indices_.push_back(i); in VectorIterator() 30 std::sort(indices_.begin(), indices_.end(), indexed_cmp_); in VectorIterator() 34 return !indices_.empty() && current_ < indices_.size(); in Valid() 41 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in Seek() 43 indices_.begin(); in Seek() 47 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in SeekForPrev() 49 indices_.begin(); in SeekForPrev() 61 return Slice(keys_[indices_[current_]]); in key() 64 return Slice(values_[indices_[current_]]); in value() [all …]
|
/dports/databases/mariadb105-server/mariadb-10.5.15/storage/rocksdb/rocksdb/util/ |
H A D | vector_iterator.h | 26 indices_.reserve(keys_.size()); in VectorIterator() 28 indices_.push_back(i); in VectorIterator() 30 std::sort(indices_.begin(), indices_.end(), indexed_cmp_); in VectorIterator() 34 return !indices_.empty() && current_ < indices_.size(); in Valid() 41 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in Seek() 43 indices_.begin(); in Seek() 47 current_ = std::lower_bound(indices_.begin(), indices_.end(), target, in SeekForPrev() 49 indices_.begin(); in SeekForPrev() 61 return Slice(keys_[indices_[current_]]); in key() 64 return Slice(values_[indices_[current_]]); in value() [all …]
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/common/include/pcl/impl/ |
H A D | pcl_base.hpp | 57 , indices_ (base.indices_) in PCLBase() 74 indices_ = indices; in setIndices() 83 indices_.reset (new Indices (*indices)); in setIndices() 92 indices_.reset (new Indices (indices->indices)); in setIndices() 127 indices_.reset (new Indices); in setIndices() 128 indices_->reserve (nb_cols * nb_rows); in setIndices() 148 if (!indices_) in initCompute() 151 indices_.reset (new Indices); in initCompute() 157 const auto indices_size = indices_->size (); in initCompute() 160 indices_->resize (input_->size ()); in initCompute() [all …]
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/surface/include/pcl/surface/impl/ |
H A D | convex_hull.hpp | 61 compute3DCentroid (*input_, *indices_, xyz_centroid); in calculateInputDimension() 85 PointInT p0 = (*input_)[(*indices_)[0]]; in performReconstruction2D() 86 PointInT p1 = (*input_)[(*indices_)[indices_->size () - 1]]; in performReconstruction2D() 87 PointInT p2 = (*input_)[(*indices_)[indices_->size () / 2]]; in performReconstruction2D() 91 p0 = (*input_)[(*indices_)[rand () % indices_->size ()]]; in performReconstruction2D() 92 p1 = (*input_)[(*indices_)[rand () % indices_->size ()]]; in performReconstruction2D() 93 p2 = (*input_)[(*indices_)[rand () % indices_->size ()]]; in performReconstruction2D() 154 for (std::size_t i = 0; i < indices_->size (); ++i, j+=dimension) in performReconstruction2D() 162 for (std::size_t i = 0; i < indices_->size (); ++i, j+=dimension) in performReconstruction2D() 273 hull[j] = (*input_)[(*indices_)[idx_points[j].first]]; in performReconstruction2D() [all …]
|