Home
last modified time | relevance | path

Searched refs:iter_pair (Results 1 – 25 of 70) sorted by relevance

123

/dports/www/grafana8/grafana-8.3.6/vendor/github.com/apache/arrow/cpp/src/arrow/flight/
H A Dtest_integration.cc131 const std::pair<CallHeaders::const_iterator, CallHeaders::const_iterator>& iter_pair = in StartCall() local
134 if (iter_pair.first != iter_pair.second) { in StartCall()
135 const util::string_view& value = (*iter_pair.first).second; in StartCall()
158 const std::pair<CallHeaders::const_iterator, CallHeaders::const_iterator>& iter_pair = in ReceivedHeaders() local
160 if (iter_pair.first != iter_pair.second) { in ReceivedHeaders()
161 const util::string_view& value = (*iter_pair.first).second; in ReceivedHeaders()
/dports/databases/arrow/apache-arrow-6.0.1/cpp/src/arrow/flight/
H A Dtest_integration.cc131 const std::pair<CallHeaders::const_iterator, CallHeaders::const_iterator>& iter_pair = in StartCall() local
134 if (iter_pair.first != iter_pair.second) { in StartCall()
135 const util::string_view& value = (*iter_pair.first).second; in StartCall()
158 const std::pair<CallHeaders::const_iterator, CallHeaders::const_iterator>& iter_pair = in ReceivedHeaders() local
160 if (iter_pair.first != iter_pair.second) { in ReceivedHeaders()
161 const util::string_view& value = (*iter_pair.first).second; in ReceivedHeaders()
/dports/devel/thrust/thrust-1.9.5/testing/backend/cuda/
H A Dunique_by_key.cu72 typedef thrust::pair<typename Vector::iterator, typename Vector::iterator> iter_pair; in TestUniqueByKeyDevice() typedef
73 thrust::device_vector<iter_pair> new_last_vec(1); in TestUniqueByKeyDevice()
74 iter_pair new_last; in TestUniqueByKeyDevice()
145 typedef thrust::pair<Vector::iterator, Vector::iterator> iter_pair; in TestUniqueByKeyCudaStreams() typedef
146 iter_pair new_last; in TestUniqueByKeyCudaStreams()
216 typedef thrust::pair<typename Vector::iterator, typename Vector::iterator> iter_pair; in TestUniqueCopyByKeyDevice() typedef
217 thrust::device_vector<iter_pair> new_last_vec(1); in TestUniqueCopyByKeyDevice()
218 iter_pair new_last; in TestUniqueCopyByKeyDevice()
293 typedef thrust::pair<Vector::iterator, Vector::iterator> iter_pair; in TestUniqueCopyByKeyCudaStreams() typedef
294 iter_pair new_last; in TestUniqueCopyByKeyCudaStreams()
H A Dset_symmetric_difference_by_key.cu42 typedef thrust::pair<Iterator,Iterator> iter_pair; in TestSetSymmetricDifferenceByKeyDevice() typedef
43 thrust::device_vector<iter_pair> end_vec(1); in TestSetSymmetricDifferenceByKeyDevice()
56 iter_pair end = end_vec[0]; in TestSetSymmetricDifferenceByKeyDevice()
/dports/devel/nextpnr/nextpnr-48cd407/common/
H A Dpycontainers.h77 template <typename Ta, typename Tb> struct iter_pair struct
79 iter_pair(){}; in iter_pair() function
80 iter_pair(const Ta &first, const Tb &second) : first(first), second(second){}; in iter_pair() function
199 static py::object next(iter_pair<T &, int> &iter) in next()
238 static iter_pair<T &, int> iter(T &x) { return iter_pair<T &, int>(boost::ref(x), 0); }; in iter()
264 static py::object next(iter_pair<wrapped_pair &, int> &iter) in next()
296 static iter_pair<wrapped_pair &, int> iter(wrapped_pair &x) in iter()
298 return iter_pair<wrapped_pair &, int>(boost::ref(x), 0); in iter()
391 static py::object next(iter_pair<wrapped_pair &, int> &iter) in next()
424 static iter_pair<wrapped_pair &, int> iter(wrapped_pair &x) in iter()
[all …]
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/algo/seqqa/
H A Dseqtest.cpp205 pair<TTests::iterator, TTests::iterator> iter_pair = in RunTests() local
207 for ( ; iter_pair.first != iter_pair.second; ++iter_pair.first) { in RunTests()
208 TTests::iterator iter = iter_pair.first; in RunTests()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() function
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() argument
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() argument
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/devel/llvm11/llvm-11.0.1.src/tools/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() function
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/devel/llvm12/llvm-project-12.0.1.src/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() argument
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/devel/llvm90/llvm-9.0.1.src/tools/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() function
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() argument
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/devel/llvm10/llvm-10.0.1.src/tools/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() argument
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() argument
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() argument
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/lang/clang-mesa/clang-13.0.1.src/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() function
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() argument
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() argument
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/devel/llvm13/llvm-project-13.0.1.src/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() function
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/devel/llvm80/llvm-8.0.1.src/tools/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() argument
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/devel/llvm70/llvm-7.0.1.src/tools/clang/test/SemaCXX/
H A Dfor-range-examples.cpp93 struct iter_pair { struct
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair() function
97 template<typename T> T begin(iter_pair<T> p) { return p.begin_; } in begin()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
112 auto map(const F &f, T &t) -> iter_pair<map_iter<F, decltype(t.begin())>> { in map()
114 return iter_pair<iter>(iter(f, t.begin()), iter(f, t.end())); in map()
/dports/www/chromium-legacy/chromium-88.0.4324.182/chrome/browser/extensions/
H A Dextension_garbage_collector.cc83 std::pair<Iter, Iter> iter_pair = extension_paths.equal_range(extension_id); in CheckExtensionDirectory() local
88 if (iter_pair.first == iter_pair.second) { in CheckExtensionDirectory()
100 for (auto iter = iter_pair.first; iter != iter_pair.second; ++iter) { in CheckExtensionDirectory()
/dports/editors/libreoffice/libreoffice-7.2.6.2/sal/osl/w32/
H A Dprocimpl.cxx136 auto iter_pair = std::equal_range( in create_merged_environment() local
144 merged_env->erase(iter_pair.first, iter_pair.second); in create_merged_environment()
148 if (iter_pair.first != iter_pair.second) // found in create_merged_environment()
149 *iter_pair.first = env_var; in create_merged_environment()
151 merged_env->insert(iter_pair.first, env_var); in create_merged_environment()
/dports/editors/libreoffice6/libreoffice-6.4.7.2/sal/osl/w32/
H A Dprocimpl.cxx136 auto iter_pair = std::equal_range( in create_merged_environment() local
144 merged_env->erase(iter_pair.first, iter_pair.second); in create_merged_environment()
148 if (iter_pair.first != iter_pair.second) // found in create_merged_environment()
149 *iter_pair.first = env_var; in create_merged_environment()
151 merged_env->insert(iter_pair.first, env_var); in create_merged_environment()

123