| /dports/science/axom/axom-0.6.1/src/axom/sidre/core/ |
| H A D | Array.hpp | 382 this->m_num_elements = getViewShape(0); in Array()
387 SLIC_ERROR_IF(this->m_num_elements < 0, in Array()
429 this->m_num_elements = buffer_size; in Array()
472 this->m_num_elements = num_elements; in Array()
474 if(real_capacity < this->m_num_elements) in Array()
476 real_capacity = this->m_num_elements; in Array()
486 SLIC_ASSERT(this->m_num_elements >= 0); in Array()
515 if(real_capacity < this->m_num_elements) in Array()
517 real_capacity = this->m_num_elements; in Array()
547 this->m_num_elements = new_num_elements; in updateNumElements()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | incremental_components.hpp | 127 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
129 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
138 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
140 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
170 component_iterator(m_num_elements))); in operator []()
184 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
211 while (index_list[parent_index] != m_num_elements) { in build_index_lists()
224 IndexType m_num_elements; member in boost::component_index
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | incremental_components.hpp | 128 : m_num_elements(std::distance(parent_start, parent_end)) in component_index()
130 , m_index_list(make_shared< IndexContainer >(m_num_elements)) in component_index()
139 : m_num_elements(std::distance(parent_start, parent_end)) in component_index()
141 , m_index_list(make_shared< IndexContainer >(m_num_elements)) in component_index()
167 component_iterator(m_num_elements))); in operator []()
181 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
213 while (index_list[parent_index] != m_num_elements) in build_index_lists()
227 IndexType m_num_elements; member in boost::component_index
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | incremental_components.hpp | 127 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
129 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
138 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
140 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
170 component_iterator(m_num_elements))); in operator []()
184 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
211 while (index_list[parent_index] != m_num_elements) { in build_index_lists()
224 IndexType m_num_elements; member in boost::component_index
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | incremental_components.hpp | 127 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
129 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
138 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
140 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
170 component_iterator(m_num_elements))); in operator []()
184 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
211 while (index_list[parent_index] != m_num_elements) { in build_index_lists()
224 IndexType m_num_elements; member in boost::component_index
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | incremental_components.hpp | 128 : m_num_elements(std::distance(parent_start, parent_end)) in component_index()
130 , m_index_list(make_shared< IndexContainer >(m_num_elements)) in component_index()
139 : m_num_elements(std::distance(parent_start, parent_end)) in component_index()
141 , m_index_list(make_shared< IndexContainer >(m_num_elements)) in component_index()
167 component_iterator(m_num_elements))); in operator []()
181 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
213 while (index_list[parent_index] != m_num_elements) in build_index_lists()
227 IndexType m_num_elements; member in boost::component_index
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | incremental_components.hpp | 128 : m_num_elements(std::distance(parent_start, parent_end)) in component_index()
130 , m_index_list(make_shared< IndexContainer >(m_num_elements)) in component_index()
139 : m_num_elements(std::distance(parent_start, parent_end)) in component_index()
141 , m_index_list(make_shared< IndexContainer >(m_num_elements)) in component_index()
167 component_iterator(m_num_elements))); in operator []()
181 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
213 while (index_list[parent_index] != m_num_elements) in build_index_lists()
227 IndexType m_num_elements; member in boost::component_index
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | incremental_components.hpp | 127 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
129 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
138 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
140 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
170 component_iterator(m_num_elements))); in operator []()
184 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
211 while (index_list[parent_index] != m_num_elements) { in build_index_lists()
224 IndexType m_num_elements; member in boost::component_index
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | incremental_components.hpp | 127 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
129 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
138 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
140 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
170 component_iterator(m_num_elements))); in operator []()
184 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
211 while (index_list[parent_index] != m_num_elements) { in build_index_lists()
224 IndexType m_num_elements; member in boost::component_index
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | incremental_components.hpp | 127 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
129 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
138 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
140 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
170 component_iterator(m_num_elements))); in operator []()
184 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
211 while (index_list[parent_index] != m_num_elements) { in build_index_lists()
224 IndexType m_num_elements; member in boost::component_index
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | incremental_components.hpp | 127 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
129 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
138 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
140 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
170 component_iterator(m_num_elements))); in operator []()
184 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
211 while (index_list[parent_index] != m_num_elements) { in build_index_lists()
224 IndexType m_num_elements; member in boost::component_index
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | incremental_components.hpp | 127 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
129 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
138 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
140 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
170 component_iterator(m_num_elements))); in operator []()
184 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
211 while (index_list[parent_index] != m_num_elements) { in build_index_lists()
224 IndexType m_num_elements; member in boost::component_index
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | incremental_components.hpp | 127 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
129 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
138 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
140 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
170 component_iterator(m_num_elements))); in operator []()
184 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
211 while (index_list[parent_index] != m_num_elements) { in build_index_lists()
224 IndexType m_num_elements; member in boost::component_index
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | incremental_components.hpp | 127 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
129 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
138 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
140 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
170 component_iterator(m_num_elements))); in operator []()
184 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
211 while (index_list[parent_index] != m_num_elements) { in build_index_lists()
224 IndexType m_num_elements; member in boost::component_index
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | incremental_components.hpp | 127 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
129 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
138 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
140 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
170 component_iterator(m_num_elements))); in operator []()
184 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
211 while (index_list[parent_index] != m_num_elements) { in build_index_lists()
224 IndexType m_num_elements; member in boost::component_index
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
| H A D | incremental_components.hpp | 127 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
129 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
138 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
140 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
170 component_iterator(m_num_elements))); in operator []()
184 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
211 while (index_list[parent_index] != m_num_elements) { in build_index_lists()
224 IndexType m_num_elements; member in boost::component_index
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
| H A D | incremental_components.hpp | 127 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
129 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
138 m_num_elements(std::distance(parent_start, parent_end)), in component_index()
140 m_index_list(make_shared<IndexContainer>(m_num_elements)) { in component_index()
170 component_iterator(m_num_elements))); in operator []()
184 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
211 while (index_list[parent_index] != m_num_elements) { in build_index_lists()
224 IndexType m_num_elements; member in boost::component_index
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | incremental_components.hpp | 128 : m_num_elements(std::distance(parent_start, parent_end)) in component_index()
130 , m_index_list(make_shared< IndexContainer >(m_num_elements)) in component_index()
139 : m_num_elements(std::distance(parent_start, parent_end)) in component_index()
141 , m_index_list(make_shared< IndexContainer >(m_num_elements)) in component_index()
167 component_iterator(m_num_elements))); in operator []()
181 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
197 index_list[element_index] = m_num_elements; in build_index_lists()
202 for (IndexType element_index = 0; element_index < m_num_elements; in build_index_lists()
213 while (index_list[parent_index] != m_num_elements) in build_index_lists()
227 IndexType m_num_elements; member in boost::component_index
|
| /dports/science/axom/axom-0.6.1/src/axom/core/ |
| H A D | Array.hpp | 198 m_num_elements = other.m_num_elements; in operator =()
204 other.m_num_elements = 0; in operator =()
575 IndexType m_num_elements = 0; member in axom::Array
669 m_num_elements = other.m_num_elements; in Array()
724 assert(pos + n <= m_num_elements); in set()
932 m_num_elements = other.m_num_elements; in swap()
964 assert(m_num_elements >= 0); in initialize()
965 assert(m_capacity >= m_num_elements); in initialize()
974 assert(pos <= m_num_elements); in reserveForInsert()
1004 m_num_elements = new_num_elements; in updateNumElements()
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/unittest/gunit/ |
| H A D | bounded_queue_std.h | 46 m_num_elements(0) in Bounded_queue_std()
62 if (m_num_elements == m_max_elements) in push()
65 --m_num_elements; in push()
70 ++m_num_elements; in push()
74 size_t num_elements() const { return m_num_elements; } in num_elements()
87 size_t m_num_elements; variable
|
| /dports/databases/xtrabackup/percona-xtrabackup-2.4.21/unittest/gunit/ |
| H A D | bounded_queue_std.h | 46 m_num_elements(0) in Bounded_queue_std()
62 if (m_num_elements == m_max_elements) in push()
65 --m_num_elements; in push()
70 ++m_num_elements; in push()
74 size_t num_elements() const { return m_num_elements; } in num_elements()
87 size_t m_num_elements; variable
|
| /dports/databases/percona57-client/percona-server-5.7.36-39/unittest/gunit/ |
| H A D | bounded_queue_std.h | 46 m_num_elements(0) in Bounded_queue_std()
62 if (m_num_elements == m_max_elements) in push()
65 --m_num_elements; in push()
70 ++m_num_elements; in push()
74 size_t num_elements() const { return m_num_elements; } in num_elements()
87 size_t m_num_elements; variable
|
| /dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/unittest/gunit/ |
| H A D | bounded_queue_std.h | 46 m_num_elements(0) in Bounded_queue_std()
62 if (m_num_elements == m_max_elements) in push()
65 --m_num_elements; in push()
70 ++m_num_elements; in push()
74 size_t num_elements() const { return m_num_elements; } in num_elements()
87 size_t m_num_elements; variable
|
| /dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/unittest/gunit/ |
| H A D | bounded_queue_std.h | 46 m_num_elements(0) in Bounded_queue_std()
62 if (m_num_elements == m_max_elements) in push()
65 --m_num_elements; in push()
70 ++m_num_elements; in push()
74 size_t num_elements() const { return m_num_elements; } in num_elements()
87 size_t m_num_elements; variable
|
| /dports/databases/percona57-server/percona-server-5.7.36-39/unittest/gunit/ |
| H A D | bounded_queue_std.h | 46 m_num_elements(0) in Bounded_queue_std()
62 if (m_num_elements == m_max_elements) in push()
65 --m_num_elements; in push()
70 ++m_num_elements; in push()
74 size_t num_elements() const { return m_num_elements; } in num_elements()
87 size_t m_num_elements; variable
|