| /third_party/boost/boost/geometry/util/ |
| D | combine_if.hpp | 58 struct combine struct
61 struct apply
|
| /third_party/typescript/tests/cases/compiler/ |
| D | genericsAndHigherOrderFunctions.ts | 3 var combine: <T, S>(f: (_: T) => S) => variable
|
| D | recursiveTypeComparison2.ts | 12 combine<U, V>(other: Observable<U>, f: (a: T, b: U) => V): Property<V>; method
|
| /third_party/boost/boost/range/detail/ |
| D | combine_cxx11.hpp | 24 auto combine(Ranges&&... rngs) -> in combine() function
|
| /third_party/boost/boost/graph/ |
| D | dijkstra_shortest_paths.hpp | 332 Combine combine, DistZero zero, DijkstraVisitor vis) in dijkstra_shortest_paths_no_init()
349 IndexMap index_map, Compare compare, Combine combine, DistZero zero, in dijkstra_shortest_paths_no_init()
363 Combine combine, DistZero zero, DijkstraVisitor vis, ColorMap color) in dijkstra_shortest_paths_no_init()
397 IndexMap index_map, Compare compare, Combine combine, DistZero zero, in dijkstra_shortest_paths_no_init()
412 Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis, in dijkstra_shortest_paths()
429 IndexMap index_map, Compare compare, Combine combine, DistInf inf, in dijkstra_shortest_paths()
446 Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis, in dijkstra_shortest_paths()
475 IndexMap index_map, Compare compare, Combine combine, DistInf inf, in dijkstra_shortest_paths()
489 Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis) in dijkstra_shortest_paths()
502 IndexMap index_map, Compare compare, Combine combine, DistInf inf, in dijkstra_shortest_paths()
|
| D | prim_minimum_spanning_tree.hpp | 42 detail::_project2nd< W, W > combine; in prim_mst_impl() local
57 detail::_project2nd< W, W > combine; in prim_minimum_spanning_tree() local
|
| D | floyd_warshall_shortest.hpp | 55 const BinaryPredicate& compare, const BinaryFunction& combine, in floyd_warshall_dispatch()
81 const BinaryFunction& combine, const Infinity& inf, const Zero& zero) in floyd_warshall_initialized_all_pairs_shortest_paths()
93 const BinaryFunction& combine, const Infinity& inf, const Zero& zero) in floyd_warshall_all_pairs_shortest_paths()
|
| D | relax.hpp | 45 const BinaryFunction& combine, const BinaryPredicate& compare) in relax()
95 const BinaryFunction& combine, const BinaryPredicate& compare) in relax_target()
|
| /third_party/python/Tools/scripts/ |
| D | combinerefs.py | 124 def combine(fname): function
|
| /third_party/typescript/tests/cases/conformance/types/tuple/ |
| D | typeInferenceWithTupleType.ts | 1 function combine<T, U>(x: T, y: U): [T, U] { function
|
| /third_party/abseil-cpp/absl/hash/internal/ |
| D | spy_hash_state.h | 72 static SpyHashStateImpl combine(SpyHashStateImpl s, const A& a, in combine() function
81 static SpyHashStateImpl combine(SpyHashStateImpl s) { in combine() function
|
| D | hash.h | 164 static H combine(H state) { return state; } in combine() function
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/hash/internal/ |
| D | spy_hash_state.h | 72 static SpyHashStateImpl combine(SpyHashStateImpl s, const A& a, in combine() function
81 static SpyHashStateImpl combine(SpyHashStateImpl s) { in combine() function
|
| D | hash.h | 166 static H combine(H state) { return state; } in combine() function
|
| /third_party/typescript/tests/baselines/reference/ |
| D | typeInferenceWithTupleType.js | 37 function combine(x, y) { function
|
| D | genericsAndHigherOrderFunctions.js | 4 var combine: <T, S>(f: (_: T) => S) => variable
|
| /third_party/json/include/nlohmann/detail/ |
| D | hash.hpp | 12 inline std::size_t combine(std::size_t seed, std::size_t h) noexcept in combine() function
|
| /third_party/boost/libs/graph/example/ |
| D | dag_shortest_paths.cpp | 63 closed_plus< int > combine; in main() local
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Mips/ |
| D | MipsPreLegalizerCombiner.cpp | 37 bool MipsPreLegalizerCombinerInfo::combine(GISelChangeObserver &Observer, in combine() function in __anon50ac4b260111::MipsPreLegalizerCombinerInfo
|
| /third_party/boost/boost/graph/distributed/ |
| D | crauser_et_al_shortest_paths.hpp | 116 Combine combine; member
141 Combine combine; member
228 const Combine& combine, in crauser_et_al_dijkstra_queue()
540 Compare compare, Combine combine, DistInf inf, DistZero zero, in crauser_et_al_shortest_paths()
|
| /third_party/boost/libs/geometry/test/ |
| D | count_set.hpp | 73 set_type combine(const set_type& a, const set_type& b) const in combine() function
|
| /third_party/boost/boost/numeric/conversion/detail/ |
| D | converter.hpp | 230 struct combine struct
232 typedef applyBoth<PredA,PredB> Both ;
233 …edef void NNone ; // 'None' is defined as a macro in (/usr/X11R6/include/X11/X.h)
235 typedef typename PredA::do_apply do_applyA ;
236 typedef typename PredB::do_apply do_applyB ;
238 typedef typename for_both<do_applyA, do_applyB, Both, PredA, PredB, NNone>::type type ;
|
| /third_party/skia/src/core/ |
| D | SkEdgeBuilder.cpp | 122 Combine combine = is_vertical(edge) && !fList.empty() in addLine() local
137 Combine combine = is_vertical(edge) && !fList.empty() in addLine() local
|
| /third_party/flutter/skia/src/core/ |
| D | SkEdgeBuilder.cpp | 122 Combine combine = is_vertical(edge) && !fList.empty() in addLine() local
137 Combine combine = is_vertical(edge) && !fList.empty() in addLine() local
|
| /third_party/mindspore/mindspore/lite/java/java/fl_client/src/main/java/com/mindspore/flclient/cipher/ |
| D | ShareSecrets.java | 109 public BigInteger combine(final SecretShares[] shares, final byte[] primeByte) { in combine() method in ShareSecrets
|