/dports/math/armadillo/armadillo-10.7.1/include/armadillo_bits/ |
H A D | SpMat_iterators_meat.hpp | 30 SpMat<eT>::iterator_base::iterator_base() in iterator_base() function in SpMat::iterator_base 42 SpMat<eT>::iterator_base::iterator_base(const SpMat<eT>& in_M) in iterator_base() function in SpMat::iterator_base 100 while(iterator_base::M->col_ptrs[iterator_base::internal_col + 1] <= iterator_base::internal_pos) in const_iterator() 114 iterator_base::internal_pos = iterator_base::M->col_ptrs[iterator_base::internal_col]; in const_iterator() 117 while(iterator_base::M->col_ptrs[iterator_base::internal_col + 1] <= iterator_base::internal_pos) in const_iterator() 159 if(iterator_base::internal_pos == iterator_base::M->n_nonzero) in operator ++() 161 iterator_base::internal_col = iterator_base::M->n_cols; in operator ++() 166 while(iterator_base::M->col_ptrs[iterator_base::internal_col + 1] <= iterator_base::internal_pos) in operator ++() 200 while(iterator_base::internal_pos < iterator_base::M->col_ptrs[iterator_base::internal_col]) in operator --() 324 iterator_base::M->row_indices[iterator_base::internal_pos], in operator *() [all …]
|
H A D | SpSubview_iterators_meat.hpp | 29 SpSubview<eT>::iterator_base::iterator_base(const SpSubview<eT>& in_M) in iterator_base() function in SpSubview::iterator_base 114 : iterator_base(in_M, in_col, 0) in const_iterator() 211 skip_pos = iterator_base::M->m.n_nonzero - iterator_base::M->n_nonzero; in const_iterator() 276 return iterator_base::M->m.values[iterator_base::internal_pos + skip_pos]; in operator *() 313 lskip_pos = iterator_base::M->m.n_nonzero - iterator_base::M->n_nonzero; in operator ++() 373 skip_pos = iterator_base::M->m.col_ptrs[cur_col + aux_col] - iterator_base::internal_pos; in operator --() 526 iterator_base::col(), in operator *() 594 : iterator_base() in const_row_iterator() 673 iterator_base::internal_pos = iterator_base::M->n_nonzero; in const_row_iterator() 781 if(iterator_base::internal_pos >= iterator_base::M->n_nonzero) in operator ++() [all …]
|
/dports/math/R-cran-RcppArmadillo/RcppArmadillo/inst/include/armadillo_bits/ |
H A D | SpMat_iterators_meat.hpp | 30 SpMat<eT>::iterator_base::iterator_base() in iterator_base() function in SpMat::iterator_base 42 SpMat<eT>::iterator_base::iterator_base(const SpMat<eT>& in_M) in iterator_base() function in SpMat::iterator_base 100 while(iterator_base::M->col_ptrs[iterator_base::internal_col + 1] <= iterator_base::internal_pos) in const_iterator() 114 iterator_base::internal_pos = iterator_base::M->col_ptrs[iterator_base::internal_col]; in const_iterator() 117 while(iterator_base::M->col_ptrs[iterator_base::internal_col + 1] <= iterator_base::internal_pos) in const_iterator() 159 if(iterator_base::internal_pos == iterator_base::M->n_nonzero) in operator ++() 161 iterator_base::internal_col = iterator_base::M->n_cols; in operator ++() 166 while(iterator_base::M->col_ptrs[iterator_base::internal_col + 1] <= iterator_base::internal_pos) in operator ++() 200 while(iterator_base::internal_pos < iterator_base::M->col_ptrs[iterator_base::internal_col]) in operator --() 324 iterator_base::M->row_indices[iterator_base::internal_pos], in operator *() [all …]
|
H A D | SpSubview_iterators_meat.hpp | 29 SpSubview<eT>::iterator_base::iterator_base(const SpSubview<eT>& in_M) in iterator_base() function in SpSubview::iterator_base 114 : iterator_base(in_M, in_col, 0) in const_iterator() 211 skip_pos = iterator_base::M->m.n_nonzero - iterator_base::M->n_nonzero; in const_iterator() 276 return iterator_base::M->m.values[iterator_base::internal_pos + skip_pos]; in operator *() 313 lskip_pos = iterator_base::M->m.n_nonzero - iterator_base::M->n_nonzero; in operator ++() 373 skip_pos = iterator_base::M->m.col_ptrs[cur_col + aux_col] - iterator_base::internal_pos; in operator --() 526 iterator_base::col(), in operator *() 594 : iterator_base() in const_row_iterator() 673 iterator_base::internal_pos = iterator_base::M->n_nonzero; in const_row_iterator() 781 if(iterator_base::internal_pos >= iterator_base::M->n_nonzero) in operator ++() [all …]
|
/dports/science/tfel/tfel-3.4.0/include/TFEL/Math/General/ |
H A D | DifferenceRandomAccessIterator.hxx | 38 template<typename iterator_base> 55 using traits = std::iterator_traits<iterator_base>; 115 const iterator_base i2) in DifferenceRandomAccessIterator() 121 : first(iterator_base()), in DifferenceRandomAccessIterator() 122 second(iterator_base()) in DifferenceRandomAccessIterator() 191 iterator_base first; 193 iterator_base second; 196 template<typename iterator_base> 197 DifferenceRandomAccessIterator<iterator_base> 203 template<typename iterator_base> [all …]
|
H A D | StridedRandomAccessIterator.hxx | 40 template<typename iterator_base> 57 using traits = std::iterator_traits<iterator_base>; 126 explicit StridedRandomAccessIterator(const iterator_base c, in StridedRandomAccessIterator() 135 : current(iterator_base()), in StridedRandomAccessIterator() 212 iterator_base current; 217 template<typename iterator_base> 218 StridedRandomAccessIterator<iterator_base> 220 const StridedRandomAccessIterator<iterator_base> p){ in operator +() 224 template<typename iterator_base> 225 StridedRandomAccessIterator<iterator_base> [all …]
|
/dports/science/tfel-edf/tfel-3.2.1/include/TFEL/Math/General/ |
H A D | DifferenceRandomAccessIterator.hxx | 38 template<typename iterator_base> 55 using traits = std::iterator_traits<iterator_base>; 115 const iterator_base i2) 121 : first(iterator_base()), 122 second(iterator_base()) 191 iterator_base first; 193 iterator_base second; 196 template<typename iterator_base> 197 DifferenceRandomAccessIterator<iterator_base> 203 template<typename iterator_base> [all …]
|
H A D | StridedRandomAccessIterator.hxx | 40 template<typename iterator_base> 57 using traits = std::iterator_traits<iterator_base>; 126 explicit StridedRandomAccessIterator(const iterator_base c, 135 : current(iterator_base()), 212 iterator_base current; 217 template<typename iterator_base> 218 StridedRandomAccessIterator<iterator_base> 220 const StridedRandomAccessIterator<iterator_base> p){ 224 template<typename iterator_base> 225 StridedRandomAccessIterator<iterator_base> [all …]
|
/dports/games/wesnoth/wesnoth-1.14.17/src/units/ |
H A D | map.hpp | 143 struct iterator_base struct in unit_map 153 ~iterator_base() in ~iterator_base() argument 158 iterator_base() in iterator_base() function 172 iterator_base(const iterator_base& that) in iterator_base() argument 180 iterator_base& operator=(const iterator_base& that) in operator =() argument 232 iterator_base& operator++() in operator ++() argument 247 iterator_base operator++(int) in operator ++() argument 249 iterator_base temp(*this); in operator ++() 254 iterator_base& operator--() in operator --() argument 271 iterator_base temp(*this); in operator --() [all …]
|
/dports/math/octomap/octomap-1.9.7/octomap/include/octomap/ |
H A D | OcTreeIterator.hxx | 46 iterator_base() : tree(NULL), maxDepth(0){} in iterator_base() function in iterator_base 74 iterator_base(const iterator_base& other) in iterator_base() function in iterator_base 93 iterator_base& operator=(const iterator_base& other){ in operator =() 207 class tree_iterator : public iterator_base { 209 tree_iterator() : iterator_base(){} in tree_iterator() 263 class leaf_iterator : public iterator_base { 265 leaf_iterator() : iterator_base(){} in leaf_iterator() 335 class leaf_bbx_iterator : public iterator_base { 337 leaf_bbx_iterator() : iterator_base() {}; in leaf_bbx_iterator() 354 : iterator_base(ptree, depth) in leaf_bbx_iterator() [all …]
|
/dports/audio/ganv/ganv-1.8.0/ganv/ |
H A D | Module.hpp | 69 class iterator_base { class in Ganv::Module 71 iterator_base(GanvModule* m, guint i) : _module(m), _index(i) {} in iterator_base() function in Ganv::Module::iterator_base 73 explicit iterator_base(const iterator_base<T, U>& i) in iterator_base() function in Ganv::Module::iterator_base 83 iterator_base operator++(int) const { in operator ++() 84 return iterator_base<P, C>(_index + 1); in operator ++() 86 iterator_base& operator++() { in operator ++() 89 bool operator==(const iterator_base<P, C>& i) const { in operator ==() 92 bool operator!=(const iterator_base<P, C>& i) const { in operator !=() 96 template<typename T, typename U> friend class iterator_base; 101 using iterator = iterator_base<Port, GanvPort>; [all …]
|
/dports/science/yoda/YODA-1.9.1/src/yamlcpp/yaml-cpp/node/detail/ |
H A D | iterator.h | 22 class iterator_base : public std::iterator<std::forward_iterator_tag, V, 27 friend class iterator_base; 40 typedef typename iterator_base::value_type value_type; 43 iterator_base() : m_iterator(), m_pMemory() {} in iterator_base() function 44 explicit iterator_base(base_type rhs, shared_memory_holder pMemory) in iterator_base() function 48 iterator_base(const iterator_base<W>& rhs, 53 iterator_base<V>& operator++() { 58 iterator_base<V> operator++(int) { 59 iterator_base<V> iterator_pre(*this); 65 bool operator==(const iterator_base<W>& rhs) const { [all …]
|
/dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/yaml-cpp/include/yaml-cpp/node/detail/ |
H A D | iterator.h | 21 class iterator_base : public std::iterator<std::forward_iterator_tag, V, 26 friend class iterator_base; 39 typedef typename iterator_base::value_type value_type; 42 iterator_base() : m_iterator(), m_pMemory() {} in iterator_base() function 43 explicit iterator_base(base_type rhs, shared_memory_holder pMemory) in iterator_base() function 47 iterator_base(const iterator_base<W>& rhs, 52 iterator_base<V>& operator++() { 57 iterator_base<V> operator++(int) { 58 iterator_base<V> iterator_pre(*this); 64 bool operator==(const iterator_base<W>& rhs) { [all …]
|
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/yaml-cpp-0.6.2/include/yaml-cpp/node/detail/ |
H A D | iterator.h | 22 class iterator_base : public std::iterator<std::forward_iterator_tag, V, 27 friend class iterator_base; 40 typedef typename iterator_base::value_type value_type; 43 iterator_base() : m_iterator(), m_pMemory() {} in iterator_base() function 44 explicit iterator_base(base_type rhs, shared_memory_holder pMemory) in iterator_base() function 48 iterator_base(const iterator_base<W>& rhs, 53 iterator_base<V>& operator++() { 58 iterator_base<V> operator++(int) { 59 iterator_base<V> iterator_pre(*this); 65 bool operator==(const iterator_base<W>& rhs) const { [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/breakpad/breakpad/src/processor/ |
H A D | contained_range_map-inl.h | 75 MapIterator iterator_base = map_->lower_bound(base); in StoreRange() local 79 if (iterator_base == iterator_high && iterator_base != iterator_end && in StoreRange() 80 base >= iterator_base->second->base_) { in StoreRange() 87 if (iterator_base->second->base_ == base && iterator_base->first == high) { in StoreRange() 95 return iterator_base->second->StoreRange(base, size, entry); in StoreRange() 107 if ((iterator_base != iterator_end && base > iterator_base->second->base_) || in StoreRange() 130 if (iterator_base != iterator_high) { in StoreRange() 134 child_map = new AddressToRangeMap(iterator_base, iterator_high); in StoreRange() 137 map_->erase(iterator_base, iterator_high); in StoreRange()
|
/dports/games/openlierox/OpenLieroX/src/breakpad/external/src/processor/ |
H A D | contained_range_map-inl.h | 75 MapIterator iterator_base = map_->lower_bound(base); in StoreRange() local 79 if (iterator_base == iterator_high && iterator_base != iterator_end && in StoreRange() 80 base >= iterator_base->second->base_) { in StoreRange() 87 if (iterator_base->second->base_ == base && iterator_base->first == high) { in StoreRange() 95 return iterator_base->second->StoreRange(base, size, entry); in StoreRange() 107 if ((iterator_base != iterator_end && base > iterator_base->second->base_) || in StoreRange() 130 if (iterator_base != iterator_high) { in StoreRange() 134 child_map = new AddressToRangeMap(iterator_base, iterator_high); in StoreRange() 137 map_->erase(iterator_base, iterator_high); in StoreRange()
|
/dports/deskutils/owncloudclient/ownCloud-2.8.2.4246/src/3rdparty/libcrashreporter-qt/3rdparty/breakpad/processor/ |
H A D | contained_range_map-inl.h | 75 MapIterator iterator_base = map_->lower_bound(base); in StoreRange() local 79 if (iterator_base == iterator_high && iterator_base != iterator_end && in StoreRange() 80 base >= iterator_base->second->base_) { in StoreRange() 87 if (iterator_base->second->base_ == base && iterator_base->first == high) { in StoreRange() 95 return iterator_base->second->StoreRange(base, size, entry); in StoreRange() 107 if ((iterator_base != iterator_end && base > iterator_base->second->base_) || in StoreRange() 130 if (iterator_base != iterator_high) { in StoreRange() 134 child_map = new AddressToRangeMap(iterator_base, iterator_high); in StoreRange() 137 map_->erase(iterator_base, iterator_high); in StoreRange()
|
/dports/lang/spidermonkey78/firefox-78.9.0/toolkit/crashreporter/google-breakpad/src/processor/ |
H A D | contained_range_map-inl.h | 75 MapIterator iterator_base = map_->lower_bound(base); in StoreRange() local 79 if (iterator_base == iterator_high && iterator_base != iterator_end && in StoreRange() 80 base >= iterator_base->second->base_) { in StoreRange() 87 if (iterator_base->second->base_ == base && iterator_base->first == high) { in StoreRange() 95 return iterator_base->second->StoreRange(base, size, entry); in StoreRange() 107 if ((iterator_base != iterator_end && base > iterator_base->second->base_) || in StoreRange() 130 if (iterator_base != iterator_high) { in StoreRange() 134 child_map = new AddressToRangeMap(iterator_base, iterator_high); in StoreRange() 137 map_->erase(iterator_base, iterator_high); in StoreRange()
|
/dports/lang/spidermonkey60/firefox-60.9.0/toolkit/crashreporter/google-breakpad/src/processor/ |
H A D | contained_range_map-inl.h | 75 MapIterator iterator_base = map_->lower_bound(base); in StoreRange() local 79 if (iterator_base == iterator_high && iterator_base != iterator_end && in StoreRange() 80 base >= iterator_base->second->base_) { in StoreRange() 87 if (iterator_base->second->base_ == base && iterator_base->first == high) { in StoreRange() 95 return iterator_base->second->StoreRange(base, size, entry); in StoreRange() 107 if ((iterator_base != iterator_end && base > iterator_base->second->base_) || in StoreRange() 130 if (iterator_base != iterator_high) { in StoreRange() 134 child_map = new AddressToRangeMap(iterator_base, iterator_high); in StoreRange() 137 map_->erase(iterator_base, iterator_high); in StoreRange()
|
/dports/www/firefox-legacy/firefox-52.8.0esr/toolkit/crashreporter/google-breakpad/src/processor/ |
H A D | contained_range_map-inl.h | 75 MapIterator iterator_base = map_->lower_bound(base); in StoreRange() local 79 if (iterator_base == iterator_high && iterator_base != iterator_end && in StoreRange() 80 base >= iterator_base->second->base_) { in StoreRange() 87 if (iterator_base->second->base_ == base && iterator_base->first == high) { in StoreRange() 95 return iterator_base->second->StoreRange(base, size, entry); in StoreRange() 107 if ((iterator_base != iterator_end && base > iterator_base->second->base_) || in StoreRange() 130 if (iterator_base != iterator_high) { in StoreRange() 134 child_map = new AddressToRangeMap(iterator_base, iterator_high); in StoreRange() 137 map_->erase(iterator_base, iterator_high); in StoreRange()
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/breakpad/breakpad/src/processor/ |
H A D | contained_range_map-inl.h | 75 MapIterator iterator_base = map_->lower_bound(base); in StoreRange() local 79 if (iterator_base == iterator_high && iterator_base != iterator_end && in StoreRange() 80 base >= iterator_base->second->base_) { in StoreRange() 87 if (iterator_base->second->base_ == base && iterator_base->first == high) { in StoreRange() 95 return iterator_base->second->StoreRange(base, size, entry); in StoreRange() 107 if ((iterator_base != iterator_end && base > iterator_base->second->base_) || in StoreRange() 130 if (iterator_base != iterator_high) { in StoreRange() 134 child_map = new AddressToRangeMap(iterator_base, iterator_high); in StoreRange() 137 map_->erase(iterator_base, iterator_high); in StoreRange()
|
/dports/www/firefox/firefox-99.0/toolkit/crashreporter/google-breakpad/src/processor/ |
H A D | contained_range_map-inl.h | 75 MapIterator iterator_base = map_->lower_bound(base); in StoreRange() local 79 if (iterator_base == iterator_high && iterator_base != iterator_end && in StoreRange() 80 base >= iterator_base->second->base_) { in StoreRange() 87 if (iterator_base->second->base_ == base && iterator_base->first == high) { in StoreRange() 95 return iterator_base->second->StoreRange(base, size, entry); in StoreRange() 107 if ((iterator_base != iterator_end && base > iterator_base->second->base_) || in StoreRange() 130 if (iterator_base != iterator_high) { in StoreRange() 134 child_map = new AddressToRangeMap(iterator_base, iterator_high); in StoreRange() 137 map_->erase(iterator_base, iterator_high); in StoreRange()
|
/dports/mail/thunderbird/thunderbird-91.8.0/toolkit/crashreporter/google-breakpad/src/processor/ |
H A D | contained_range_map-inl.h | 75 MapIterator iterator_base = map_->lower_bound(base); in StoreRange() local 79 if (iterator_base == iterator_high && iterator_base != iterator_end && in StoreRange() 80 base >= iterator_base->second->base_) { in StoreRange() 87 if (iterator_base->second->base_ == base && iterator_base->first == high) { in StoreRange() 95 return iterator_base->second->StoreRange(base, size, entry); in StoreRange() 107 if ((iterator_base != iterator_end && base > iterator_base->second->base_) || in StoreRange() 130 if (iterator_base != iterator_high) { in StoreRange() 134 child_map = new AddressToRangeMap(iterator_base, iterator_high); in StoreRange() 137 map_->erase(iterator_base, iterator_high); in StoreRange()
|
/dports/www/firefox-esr/firefox-91.8.0/toolkit/crashreporter/google-breakpad/src/processor/ |
H A D | contained_range_map-inl.h | 75 MapIterator iterator_base = map_->lower_bound(base); in StoreRange() local 79 if (iterator_base == iterator_high && iterator_base != iterator_end && in StoreRange() 80 base >= iterator_base->second->base_) { in StoreRange() 87 if (iterator_base->second->base_ == base && iterator_base->first == high) { in StoreRange() 95 return iterator_base->second->StoreRange(base, size, entry); in StoreRange() 107 if ((iterator_base != iterator_end && base > iterator_base->second->base_) || in StoreRange() 130 if (iterator_base != iterator_high) { in StoreRange() 134 child_map = new AddressToRangeMap(iterator_base, iterator_high); in StoreRange() 137 map_->erase(iterator_base, iterator_high); in StoreRange()
|
/dports/games/wesnoth/wesnoth-1.14.17/src/serialization/ |
H A D | ucs4_iterator_base.hpp | 26 class iterator_base class 35 iterator_base(const string_type& str) in iterator_base() function in ucs4::iterator_base 43 …iterator_base(typename string_type::const_iterator const& begin, typename string_type::const_itera… in iterator_base() function in ucs4::iterator_base 51 static iterator_base begin(const string_type& str) in begin() 53 return iterator_base(str.begin(), str.end()); in begin() 56 static iterator_base end(const string_type& str) in end() 58 return iterator_base(str.end(), str.end()); in end() 61 bool operator==(const iterator_base& a) const in operator ==() 66 bool operator!=(const iterator_base& a) const in operator !=() 71 iterator_base& operator++() in operator ++()
|