Searched refs:start_index1 (Results 1 – 2 of 2) sorted by relevance
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/ |
| H A D | dakota_data_util.hpp | 879 OrdinalType2 start_index1, OrdinalType2 num_items, in copy_data_partial() argument
883 if (start_index1 + num_items > sdv1.length()) { in copy_data_partial()
893 sdv2[i] = sdv1[start_index1+i]; in copy_data_partial()
922 OrdinalType2 start_index1, OrdinalType2 num_items, in copy_data_partial() argument
929 if (start_index1 + num_items > sdv1.length() || in copy_data_partial()
938 sdv2[start_index2+i] = sdv1[start_index1+i]; in copy_data_partial()
962 void copy_data_partial(const std::vector<T>& da1, size_t start_index1, in copy_data_partial() argument
966 if (start_index1 + num_items > da1.size()) { in copy_data_partial()
974 da2[i] = da1[start_index1+i]; in copy_data_partial()
|
| /dports/cad/repsnapper/repsnapper-2.5a4/libraries/vmmlib/include/vmmlib/ |
| H A D | tucker3_tensor.hpp | 182 const size_t& start_index1, const size_t& end_index1,
643 const size_t& start_index1, const size_t& end_index1, in region_of_interest() argument
649 assert(start_index1 < end_index1); in region_of_interest()
659 for (size_t i1 = start_index1, i = 0; i1 < end_index1; ++i1, ++i) { in region_of_interest()
|