/dports/math/scilab/scilab-6.1.1/scilab/modules/core/src/cpp/ |
H A D | unrolled_algorithms.hxx | 33 template<typename It1, typename It2, int N> struct eq_n_t 37 return (*i1 == *i2) && eq_n_t < It1, It2, N - 1 > ()(++i1, ++i2) ; in operator ()() 40 template<typename It1, typename It2> struct eq_n_t<It1, It2, 0> 42 bool operator()(It1 i1, It2 i2) const /* partial specialization for N=0 */ in operator ()() 55 template<int N, typename It1, typename It2> bool eq_n(It1 i1, It2 i2) in eq_n() 57 return eq_n_t<It1, It2, N>()(i1, i2); in eq_n() 108 template<typename It1, typename It2, int N> struct less_n_t 110 bool operator()(It1 i1, It2 i2) const /*/ generic recursive case */ in operator ()() 116 template<typename It1, typename It2> struct less_n_t<It1, It2, 0> 132 template<int N, typename It1, typename It2> bool less_n(It1 i1, It2 i2) in less_n() [all …]
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | Concatenate_iterator.h | 33 template <class It1, class It2> 34 bool operator==(const Concatenate_iterator<It1,It2>&, 35 const Concatenate_iterator<It1,It2>&); 38 template <class It1, class It2> 42 typedef Concatenate_iterator<It1,It2> Self; 47 typedef It2 Iterator2; 57 Concatenate_iterator(It1 e1, It2 b2, It1 i1) in Concatenate_iterator() 59 Concatenate_iterator(It1 e1, It2 b2, It2 i2, int) in Concatenate_iterator() 119 It2 b2_, i2_; 124 template<class It1, class It2> [all …]
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/libcxx/test/std/iterators/iterator.requirements/indirectcallable/indirectinvocable/ |
H A D | indirect_binary_predicate.compile.pass.cpp | 22 using It2 = IndirectlyReadable<struct Token2>; typedef 34 static_assert(std::indirect_binary_predicate<GoodPredicate<It1, It2>, It1, It2>); 42 …:indirect_binary_predicate<GoodPredicate<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>); 49 static_assert(!std::indirect_binary_predicate<BadPredicate1, It1, It2>); 54 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete; 56 static_assert(!std::indirect_binary_predicate<BadPredicate2, It1, It2>); 61 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete; 63 static_assert(!std::indirect_binary_predicate<BadPredicate3, It1, It2>); 70 static_assert(!std::indirect_binary_predicate<BadPredicate4, It1, It2>); 77 static_assert(!std::indirect_binary_predicate<BadPredicate5, It1, It2>); [all …]
|
H A D | indirect_equivalence_relation.compile.pass.cpp | 22 using It2 = IndirectlyReadable<struct Token2>; typedef 49 static_assert(std::indirect_equivalence_relation<GoodRelation<It1, It2>, It1, It2>); 57 …direct_equivalence_relation<GoodRelation<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>); 64 static_assert(!std::indirect_equivalence_relation<BadRelation1, It1, It2>); 69 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete; 71 static_assert(!std::indirect_equivalence_relation<BadRelation2, It1, It2>); 76 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete; 78 static_assert(!std::indirect_equivalence_relation<BadRelation3, It1, It2>); 85 static_assert(!std::indirect_equivalence_relation<BadRelation4, It1, It2>); 92 static_assert(!std::indirect_equivalence_relation<BadRelation5, It1, It2>); [all …]
|
H A D | indirect_strict_weak_order.compile.pass.cpp | 22 using It2 = IndirectlyReadable<struct Token2>; typedef 49 static_assert(std::indirect_strict_weak_order<GoodOrder<It1, It2>, It1, It2>); 57 …td::indirect_strict_weak_order<GoodOrder<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>); 64 static_assert(!std::indirect_strict_weak_order<BadOrder1, It1, It2>); 69 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete; 71 static_assert(!std::indirect_strict_weak_order<BadOrder2, It1, It2>); 76 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete; 78 static_assert(!std::indirect_strict_weak_order<BadOrder3, It1, It2>); 85 static_assert(!std::indirect_strict_weak_order<BadOrder4, It1, It2>); 92 static_assert(!std::indirect_strict_weak_order<BadOrder5, It1, It2>); [all …]
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libcxx/test/std/iterators/iterator.requirements/indirectcallable/indirectinvocable/ |
H A D | indirect_binary_predicate.compile.pass.cpp | 21 using It2 = IndirectlyReadable<struct Token2>; typedef 33 static_assert(std::indirect_binary_predicate<GoodPredicate<It1, It2>, It1, It2>); 41 …:indirect_binary_predicate<GoodPredicate<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>); 48 static_assert(!std::indirect_binary_predicate<BadPredicate1, It1, It2>); 53 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete; 55 static_assert(!std::indirect_binary_predicate<BadPredicate2, It1, It2>); 60 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete; 62 static_assert(!std::indirect_binary_predicate<BadPredicate3, It1, It2>); 69 static_assert(!std::indirect_binary_predicate<BadPredicate4, It1, It2>); 76 static_assert(!std::indirect_binary_predicate<BadPredicate5, It1, It2>); [all …]
|
H A D | indirect_strict_weak_order.compile.pass.cpp | 21 using It2 = IndirectlyReadable<struct Token2>; typedef 48 static_assert(std::indirect_strict_weak_order<GoodOrder<It1, It2>, It1, It2>); 56 …td::indirect_strict_weak_order<GoodOrder<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>); 63 static_assert(!std::indirect_strict_weak_order<BadOrder1, It1, It2>); 68 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete; 70 static_assert(!std::indirect_strict_weak_order<BadOrder2, It1, It2>); 75 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete; 77 static_assert(!std::indirect_strict_weak_order<BadOrder3, It1, It2>); 84 static_assert(!std::indirect_strict_weak_order<BadOrder4, It1, It2>); 91 static_assert(!std::indirect_strict_weak_order<BadOrder5, It1, It2>); [all …]
|
H A D | indirect_equivalence_relation.compile.pass.cpp | 21 using It2 = IndirectlyReadable<struct Token2>; typedef 48 static_assert(std::indirect_equivalence_relation<GoodRelation<It1, It2>, It1, It2>); 56 …direct_equivalence_relation<GoodRelation<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>); 63 static_assert(!std::indirect_equivalence_relation<BadRelation1, It1, It2>); 68 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete; 70 static_assert(!std::indirect_equivalence_relation<BadRelation2, It1, It2>); 75 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete; 77 static_assert(!std::indirect_equivalence_relation<BadRelation3, It1, It2>); 84 static_assert(!std::indirect_equivalence_relation<BadRelation4, It1, It2>); 91 static_assert(!std::indirect_equivalence_relation<BadRelation5, It1, It2>); [all …]
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/libcxx/test/std/iterators/iterator.requirements/indirectcallable/indirectinvocable/ |
H A D | indirect_binary_predicate.compile.pass.cpp | 22 using It2 = IndirectlyReadable<struct Token2>; typedef 34 static_assert(std::indirect_binary_predicate<GoodPredicate<It1, It2>, It1, It2>); 42 …:indirect_binary_predicate<GoodPredicate<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>); 49 static_assert(!std::indirect_binary_predicate<BadPredicate1, It1, It2>); 54 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete; 56 static_assert(!std::indirect_binary_predicate<BadPredicate2, It1, It2>); 61 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete; 63 static_assert(!std::indirect_binary_predicate<BadPredicate3, It1, It2>); 70 static_assert(!std::indirect_binary_predicate<BadPredicate4, It1, It2>); 77 static_assert(!std::indirect_binary_predicate<BadPredicate5, It1, It2>); [all …]
|
H A D | indirect_equivalence_relation.compile.pass.cpp | 22 using It2 = IndirectlyReadable<struct Token2>; typedef 49 static_assert(std::indirect_equivalence_relation<GoodRelation<It1, It2>, It1, It2>); 57 …direct_equivalence_relation<GoodRelation<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>); 64 static_assert(!std::indirect_equivalence_relation<BadRelation1, It1, It2>); 69 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete; 71 static_assert(!std::indirect_equivalence_relation<BadRelation2, It1, It2>); 76 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete; 78 static_assert(!std::indirect_equivalence_relation<BadRelation3, It1, It2>); 85 static_assert(!std::indirect_equivalence_relation<BadRelation4, It1, It2>); 92 static_assert(!std::indirect_equivalence_relation<BadRelation5, It1, It2>); [all …]
|
H A D | indirect_strict_weak_order.compile.pass.cpp | 22 using It2 = IndirectlyReadable<struct Token2>; typedef 49 static_assert(std::indirect_strict_weak_order<GoodOrder<It1, It2>, It1, It2>); 57 …td::indirect_strict_weak_order<GoodOrder<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>); 64 static_assert(!std::indirect_strict_weak_order<BadOrder1, It1, It2>); 69 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete; 71 static_assert(!std::indirect_strict_weak_order<BadOrder2, It1, It2>); 76 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete; 78 static_assert(!std::indirect_strict_weak_order<BadOrder3, It1, It2>); 85 static_assert(!std::indirect_strict_weak_order<BadOrder4, It1, It2>); 92 static_assert(!std::indirect_strict_weak_order<BadOrder5, It1, It2>); [all …]
|
/dports/devel/llvm13/llvm-project-13.0.1.src/libcxx/test/std/iterators/iterator.requirements/indirectcallable/indirectinvocable/ |
H A D | indirect_binary_predicate.compile.pass.cpp | 22 using It2 = IndirectlyReadable<struct Token2>; typedef 34 static_assert(std::indirect_binary_predicate<GoodPredicate<It1, It2>, It1, It2>); 42 …:indirect_binary_predicate<GoodPredicate<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>); 49 static_assert(!std::indirect_binary_predicate<BadPredicate1, It1, It2>); 54 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete; 56 static_assert(!std::indirect_binary_predicate<BadPredicate2, It1, It2>); 61 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete; 63 static_assert(!std::indirect_binary_predicate<BadPredicate3, It1, It2>); 70 static_assert(!std::indirect_binary_predicate<BadPredicate4, It1, It2>); 77 static_assert(!std::indirect_binary_predicate<BadPredicate5, It1, It2>); [all …]
|
H A D | indirect_strict_weak_order.compile.pass.cpp | 22 using It2 = IndirectlyReadable<struct Token2>; typedef 49 static_assert(std::indirect_strict_weak_order<GoodOrder<It1, It2>, It1, It2>); 57 …td::indirect_strict_weak_order<GoodOrder<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>); 64 static_assert(!std::indirect_strict_weak_order<BadOrder1, It1, It2>); 69 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete; 71 static_assert(!std::indirect_strict_weak_order<BadOrder2, It1, It2>); 76 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete; 78 static_assert(!std::indirect_strict_weak_order<BadOrder3, It1, It2>); 85 static_assert(!std::indirect_strict_weak_order<BadOrder4, It1, It2>); 92 static_assert(!std::indirect_strict_weak_order<BadOrder5, It1, It2>); [all …]
|
H A D | indirect_equivalence_relation.compile.pass.cpp | 22 using It2 = IndirectlyReadable<struct Token2>; typedef 49 static_assert(std::indirect_equivalence_relation<GoodRelation<It1, It2>, It1, It2>); 57 …direct_equivalence_relation<GoodRelation<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>); 64 static_assert(!std::indirect_equivalence_relation<BadRelation1, It1, It2>); 69 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete; 71 static_assert(!std::indirect_equivalence_relation<BadRelation2, It1, It2>); 76 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete; 78 static_assert(!std::indirect_equivalence_relation<BadRelation3, It1, It2>); 85 static_assert(!std::indirect_equivalence_relation<BadRelation4, It1, It2>); 92 static_assert(!std::indirect_equivalence_relation<BadRelation5, It1, It2>); [all …]
|
/dports/devel/libarea/libarea-2752cd9/ |
H A D | AreaPocket.cpp | 92 …for(std::list<CurveTree*>::iterator It2 = curve_tree->inners.begin(); It2 != curve_tree->inners.en… in GetCurve() local 110 CurveTree *inner = *It2; in GetCurve() 115 It2 = inners_to_visit.erase(It2); in GetCurve() 119 It2++; in GetCurve() 125 …(std::multimap<double, CurveTree*>::iterator It2 = ordered_inners.begin(); It2 != ordered_inners.e… in GetCurve() local 147 …for(std::list<CurveTree*>::iterator It2 = inners_to_visit.begin(); It2 != inners_to_visit.end(); I… in GetCurve() local 277 if(added.find(*It2)==added.end() && ((*It2) != island_and_offset)) in MakeOffsets2() 280 added.insert(*It2); in MakeOffsets2() 288 for(std::set<const IslandAndOffset*>::iterator It2 = added.begin(); It2 != added.end(); It2++) in MakeOffsets2() local 409 It2++; in MarkOverlappingOffsetIslands() [all …]
|
/dports/science/qmcpack/qmcpack-3.11.0/external_codes/mpi_wrapper/mpi3/ |
H A D | communicator.hpp | 1511 It2 d_first, in all_to_all_n() 1788 It2 reduce_n( 1793 It2 d_first, 1873 It2 d_first, in all_reduce_n() 2315 It2 gather_n( 2470 It2 d_first in all_gather() 2473 It2 all_gather(It1 first, It1 last, It2 d_first){ in all_gather() 2814 It2 d_first in iall_gather() 2862 It2 d_first, It2 d_last, in gather() 2878 It2 d_first, It2 d_last, in gather() [all …]
|
/dports/cad/opencascade/opencascade-7.6.0/src/HLRBRep/ |
H A D | HLRBRep_EdgeIList.cxx | 86 HLRAlgo_ListIteratorOfInterferenceList It2(It1); in ProcessComplex() local 87 It2.Next(); in ProcessComplex() 88 if (It2.More()) { in ProcessComplex() 89 if (T.SameInterferences(It1.Value(),It2.Value()) in ProcessComplex() 91 || SimilarInterference(It1.Value(),It2.Value()) in ProcessComplex() 105 while (It2.More()) { in ProcessComplex() 106 if (!(T.SameInterferences(It1.Value(),It2.Value()) in ProcessComplex() 115 It2.Value().Orientation(), in ProcessComplex() 116 It2.Value().Transition(), in ProcessComplex() 117 It2.Value().BoundaryTransition()); in ProcessComplex() [all …]
|
/dports/x11-toolkits/gtkada3/gtkada-1688bb8/testgtk/ |
H A D | create_canvas_view_links.adb | 170 It1, It2, It3 : Rect_Item; variable 179 Model.Add (It2); 207 It1, It2 : Rect_Item; variable 216 Model.Add (It2); 228 It1, It2 : Rect_Item; variable 237 Model.Add (It2); 261 It1, It2 : Rect_Item; variable 270 Model.Add (It2); 284 It1, It2 : Rect_Item; variable 293 Model.Add (It2); [all …]
|
/dports/devel/boost-docs/boost_1_72_0/boost/fusion/view/zip_view/detail/ |
H A D | distance_impl.hpp | 41 template<typename It1, typename It2> 45 typename result_of::value_at_c<typename It2::iterators, 0>::type> 48 template<typename It1, typename It2> 56 detail::default_distance<It1, It2> , 57 detail::best_distance<typename finder::type, It2> >::type type; 69 template<typename It1, typename It2> 71 : detail::zip_view_iterator_distance<It1, It2>::type 74 static typename detail::zip_view_iterator_distance<It1, It2>::type 75 call(It1 const& /*it1*/, It2 const& /*it2*/) in call() 77 return typename detail::zip_view_iterator_distance<It1, It2>::type(); in call()
|
/dports/devel/boost-libs/boost_1_72_0/boost/fusion/view/zip_view/detail/ |
H A D | distance_impl.hpp | 41 template<typename It1, typename It2> 45 typename result_of::value_at_c<typename It2::iterators, 0>::type> 48 template<typename It1, typename It2> 56 detail::default_distance<It1, It2> , 57 detail::best_distance<typename finder::type, It2> >::type type; 69 template<typename It1, typename It2> 71 : detail::zip_view_iterator_distance<It1, It2>::type 74 static typename detail::zip_view_iterator_distance<It1, It2>::type 75 call(It1 const& /*it1*/, It2 const& /*it2*/) in call() 77 return typename detail::zip_view_iterator_distance<It1, It2>::type(); in call()
|
/dports/devel/hyperscan/boost_1_75_0/boost/fusion/view/zip_view/detail/ |
H A D | distance_impl.hpp | 41 template<typename It1, typename It2> 45 typename result_of::value_at_c<typename It2::iterators, 0>::type> 48 template<typename It1, typename It2> 56 detail::default_distance<It1, It2> , 57 detail::best_distance<typename finder::type, It2> >::type type; 69 template<typename It1, typename It2> 71 : detail::zip_view_iterator_distance<It1, It2>::type 74 static typename detail::zip_view_iterator_distance<It1, It2>::type 75 call(It1 const& /*it1*/, It2 const& /*it2*/) in call() 77 return typename detail::zip_view_iterator_distance<It1, It2>::type(); in call()
|
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/fusion/view/zip_view/detail/ |
H A D | distance_impl.hpp | 41 template<typename It1, typename It2> 45 typename result_of::value_at_c<typename It2::iterators, 0>::type> 48 template<typename It1, typename It2> 56 detail::default_distance<It1, It2> , 57 detail::best_distance<typename finder::type, It2> >::type type; 69 template<typename It1, typename It2> 71 : detail::zip_view_iterator_distance<It1, It2>::type 74 static typename detail::zip_view_iterator_distance<It1, It2>::type 75 call(It1 const& /*it1*/, It2 const& /*it2*/) in call() 77 return typename detail::zip_view_iterator_distance<It1, It2>::type(); in call()
|
/dports/devel/R-cran-BH/BH/inst/include/boost/fusion/view/zip_view/detail/ |
H A D | distance_impl.hpp | 41 template<typename It1, typename It2> 45 typename result_of::value_at_c<typename It2::iterators, 0>::type> 48 template<typename It1, typename It2> 56 detail::default_distance<It1, It2> , 57 detail::best_distance<typename finder::type, It2> >::type type; 69 template<typename It1, typename It2> 71 : detail::zip_view_iterator_distance<It1, It2>::type 74 static typename detail::zip_view_iterator_distance<It1, It2>::type 75 call(It1 const& /*it1*/, It2 const& /*it2*/) in call() 77 return typename detail::zip_view_iterator_distance<It1, It2>::type(); in call()
|
/dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/fusion/view/zip_view/detail/ |
H A D | distance_impl.hpp | 40 template<typename It1, typename It2> 44 typename result_of::value_at_c<typename It2::iterators, 0>::type> 47 template<typename It1, typename It2> 55 detail::default_distance<It1, It2> , 56 detail::best_distance<typename finder::type, It2> >::type type; 68 template<typename It1, typename It2> 70 : detail::zip_view_iterator_distance<It1, It2>::type 72 static typename detail::zip_view_iterator_distance<It1, It2>::type 73 call(It1 const& /*it1*/, It2 const& /*it2*/) in call() 75 return typename detail::zip_view_iterator_distance<It1, It2>::type(); in call()
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/fusion/view/zip_view/detail/ |
H A D | distance_impl.hpp | 41 template<typename It1, typename It2> 45 typename result_of::value_at_c<typename It2::iterators, 0>::type> 48 template<typename It1, typename It2> 56 detail::default_distance<It1, It2> , 57 detail::best_distance<typename finder::type, It2> >::type type; 69 template<typename It1, typename It2> 71 : detail::zip_view_iterator_distance<It1, It2>::type 74 static typename detail::zip_view_iterator_distance<It1, It2>::type 75 call(It1 const& /*it1*/, It2 const& /*it2*/) in call() 77 return typename detail::zip_view_iterator_distance<It1, It2>::type(); in call()
|