| /third_party/nghttp2/src/ |
| D | shrpx_log.cc | 618 std::tie(p, last) = copy(lf.value, p, last); in upstream_accesslog()
621 std::tie(p, last) = copy(lgsp.remote_addr, p, last); in upstream_accesslog()
624 std::tie(p, last) = copy(tstamp->time_local, p, last); in upstream_accesslog()
627 std::tie(p, last) = copy(tstamp->time_iso8601, p, last); in upstream_accesslog()
630 std::tie(p, last) = copy(method, p, last); in upstream_accesslog()
631 std::tie(p, last) = copy(' ', p, last); in upstream_accesslog()
632 std::tie(p, last) = copy_escape(path, p, last); in upstream_accesslog()
633 std::tie(p, last) = copy_l(" HTTP/", p, last); in upstream_accesslog()
634 std::tie(p, last) = copy(req.http_major, p, last); in upstream_accesslog()
636 std::tie(p, last) = copy('.', p, last); in upstream_accesslog()
[all …]
|
| /third_party/skia/third_party/externals/angle2/src/libANGLE/ |
| D | Version.inc | 31 return std::tie(a.major, a.minor) == std::tie(b.major, b.minor);
36 return std::tie(a.major, a.minor) != std::tie(b.major, b.minor);
41 return std::tie(a.major, a.minor) >= std::tie(b.major, b.minor);
46 return std::tie(a.major, a.minor) <= std::tie(b.major, b.minor);
51 return std::tie(a.major, a.minor) < std::tie(b.major, b.minor);
56 return std::tie(a.major, a.minor) > std::tie(b.major, b.minor);
|
| /third_party/flutter/skia/third_party/externals/angle2/src/libANGLE/ |
| D | Version.inc | 31 return std::tie(a.major, a.minor) == std::tie(b.major, b.minor);
36 return std::tie(a.major, a.minor) != std::tie(b.major, b.minor);
41 return std::tie(a.major, a.minor) >= std::tie(b.major, b.minor);
46 return std::tie(a.major, a.minor) <= std::tie(b.major, b.minor);
51 return std::tie(a.major, a.minor) < std::tie(b.major, b.minor);
56 return std::tie(a.major, a.minor) > std::tie(b.major, b.minor);
|
| /third_party/flutter/skia/third_party/externals/angle2/util/ |
| D | EGLPlatformParameters.h | 48 auto tie() const in tie() function
50 return std::tie(renderer, majorVersion, minorVersion, deviceType, presentPath, in tie()
66 return a.tie() < b.tie();
71 return a.tie() == b.tie();
76 return a.tie() != b.tie();
|
| /third_party/skia/third_party/externals/angle2/util/ |
| D | EGLPlatformParameters.h | 59 auto tie() const in tie() function
61 return std::tie(renderer, majorVersion, minorVersion, deviceType, presentPath, in tie()
107 return a.tie() < b.tie();
112 return a.tie() == b.tie();
117 return a.tie() != b.tie();
|
| /third_party/boost/libs/graph/example/ |
| D | modify_graph.cpp | 92 boost::tie(e, added) = add_edge(u, v, g); in modify_demo()
109 boost::tie(e, exists) = edge(u, v, g); in modify_demo()
116 boost::tie(u, v) = incident(e, g); in modify_demo()
128 boost::tie(iter, iter_end) = out_edges(u, g); in modify_demo()
138 boost::tie(e1, added) = add_edge(u, v, g); in modify_demo()
139 boost::tie(e2, added) = add_edge(v, w, g); in modify_demo()
144 boost::tie(iter, iter_end) = out_edges(u, g); in modify_demo()
159 boost::tie(e1, added) = add_edge(u, v, g); in modify_demo()
160 boost::tie(e2, added) = add_edge(u, w, g); in modify_demo()
170 boost::tie(e1, added) = add_edge(u, v, g); in modify_demo()
[all …]
|
| D | bfs-name-printer.cpp | 34 boost::tie(ed, inserted) = add_edge(a, b, g); in build_router_network()
36 boost::tie(ed, inserted) = add_edge(a, d, g); in build_router_network()
38 boost::tie(ed, inserted) = add_edge(b, d, g); in build_router_network()
40 boost::tie(ed, inserted) = add_edge(c, a, g); in build_router_network()
42 boost::tie(ed, inserted) = add_edge(c, e, g); in build_router_network()
44 boost::tie(ed, inserted) = add_edge(d, c, g); in build_router_network()
46 boost::tie(ed, inserted) = add_edge(d, e, g); in build_router_network()
|
| D | quick-tour.cpp | 49 for (boost::tie(first, last) = edges(g); first != last; ++first) in print_trans_delays()
75 boost::tie(ed, inserted) = add_edge(a, b, g); in build_router_network()
77 boost::tie(ed, inserted) = add_edge(a, d, g); in build_router_network()
79 boost::tie(ed, inserted) = add_edge(b, d, g); in build_router_network()
81 boost::tie(ed, inserted) = add_edge(c, a, g); in build_router_network()
83 boost::tie(ed, inserted) = add_edge(c, e, g); in build_router_network()
85 boost::tie(ed, inserted) = add_edge(d, c, g); in build_router_network()
87 boost::tie(ed, inserted) = add_edge(d, e, g); in build_router_network()
|
| D | parallel-compile-time.cpp | 63 for (boost::tie(ei, ei_end) = out_edges(u, g); ei != ei_end; ++ei) in dfs_v2()
83 for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi) in generic_dfs_v2()
85 for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi) in generic_dfs_v2()
135 boost::tie(i, j) = *input_begin++; in main()
153 for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi) in main()
167 for (boost::tie(i, i_end) = vertices(g); i != i_end; ++i) in main()
169 for (boost::tie(i, i_end) = vertices(g); i != i_end; ++i) in main()
170 for (boost::tie(vi, vi_end) = adjacent_vertices(*i, g); vi != vi_end; in main()
175 for (boost::tie(i, i_end) = vertices(g); i != i_end; ++i) in main()
185 for (boost::tie(vi, vi_end) = adjacent_vertices(u, g); vi != vi_end; in main()
[all …]
|
| D | knights_tour.cpp | 127 boost::tie(time_stamp, x) = S.top(); in backtracking_search()
135 for (boost::tie(i, end) = adjacent_vertices(x, g); i != end; ++i) in backtracking_search()
146 boost::tie(time_stamp, x) = S.top(); in backtracking_search()
151 boost::tie(time_stamp, x) = S.top(); in backtracking_search()
164 for (boost::tie(i, end) = adjacent_vertices(x, g); i != end; ++i) in number_of_successors()
183 boost::tie(time_stamp, x) = S.top(); in warnsdorff()
193 for (boost::tie(i, end) = adjacent_vertices(x, g); i != end; ++i) in warnsdorff()
203 boost::tie(num_succ, x) = Q.top(); in warnsdorff()
210 boost::tie(time_stamp, x) = S.top(); in warnsdorff()
215 boost::tie(time_stamp, x) = S.top(); in warnsdorff()
|
| D | undirected_adjacency_list.cpp | 29 for (boost::tie(out, out_end) = out_edges(zero, undigraph); out != out_end; in undirected_graph_demo1()
33 for (boost::tie(in, in_end) = in_edges(zero, undigraph); in != in_end; ++in) in undirected_graph_demo1()
53 boost::tie(e1, found) = edge(u, v, digraph); in directed_graph_demo()
54 boost::tie(e2, found) = edge(v, u, digraph); in directed_graph_demo()
81 boost::tie(e1, found) = edge(u, v, undigraph); in undirected_graph_demo2()
82 boost::tie(e2, found) = edge(v, u, undigraph); in undirected_graph_demo2()
97 for (boost::tie(e, e_end) = out_edges(s, undigraph); e != e_end; ++e) in undirected_graph_demo2()
|
| /third_party/boost/boost/fusion/tuple/detail/preprocessed/ |
| D | tuple_tie10.hpp | 14 tie(T0 & arg0) in tie() function
22 tie(T0 & arg0 , T1 & arg1) in tie() function
30 tie(T0 & arg0 , T1 & arg1 , T2 & arg2) in tie() function
38 tie(T0 & arg0 , T1 & arg1 , T2 & arg2 , T3 & arg3) in tie() function
46 tie(T0 & arg0 , T1 & arg1 , T2 & arg2 , T3 & arg3 , T4 & arg4) in tie() function
54 tie(T0 & arg0 , T1 & arg1 , T2 & arg2 , T3 & arg3 , T4 & arg4 , T5 & arg5) in tie() function
62 tie(T0 & arg0 , T1 & arg1 , T2 & arg2 , T3 & arg3 , T4 & arg4 , T5 & arg5 , T6 & arg6) in tie() function
70 … tie(T0 & arg0 , T1 & arg1 , T2 & arg2 , T3 & arg3 , T4 & arg4 , T5 & arg5 , T6 & arg6 , T7 & arg7) in tie() function
78 …tie(T0 & arg0 , T1 & arg1 , T2 & arg2 , T3 & arg3 , T4 & arg4 , T5 & arg5 , T6 & arg6 , T7 & arg7 … in tie() function
86 …tie(T0 & arg0 , T1 & arg1 , T2 & arg2 , T3 & arg3 , T4 & arg4 , T5 & arg5 , T6 & arg6 , T7 & arg7 … in tie() function
|
| D | tuple_tie20.hpp | 14 tie(T0 & arg0) in tie() function
22 tie(T0 & arg0 , T1 & arg1) in tie() function
30 tie(T0 & arg0 , T1 & arg1 , T2 & arg2) in tie() function
38 tie(T0 & arg0 , T1 & arg1 , T2 & arg2 , T3 & arg3) in tie() function
46 tie(T0 & arg0 , T1 & arg1 , T2 & arg2 , T3 & arg3 , T4 & arg4) in tie() function
54 tie(T0 & arg0 , T1 & arg1 , T2 & arg2 , T3 & arg3 , T4 & arg4 , T5 & arg5) in tie() function
62 tie(T0 & arg0 , T1 & arg1 , T2 & arg2 , T3 & arg3 , T4 & arg4 , T5 & arg5 , T6 & arg6) in tie() function
70 … tie(T0 & arg0 , T1 & arg1 , T2 & arg2 , T3 & arg3 , T4 & arg4 , T5 & arg5 , T6 & arg6 , T7 & arg7) in tie() function
78 …tie(T0 & arg0 , T1 & arg1 , T2 & arg2 , T3 & arg3 , T4 & arg4 , T5 & arg5 , T6 & arg6 , T7 & arg7 … in tie() function
86 …tie(T0 & arg0 , T1 & arg1 , T2 & arg2 , T3 & arg3 , T4 & arg4 , T5 & arg5 , T6 & arg6 , T7 & arg7 … in tie() function
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | floyd_warshall_test.cpp | 39 for (boost::tie(firstv, lastv) = boost::vertices(g); firstv != lastv; in acceptance_test()
55 for (boost::tie(first, last) = boost::edges(g); first != last; first++) in acceptance_test()
76 for (boost::tie(firstv, lastv) = boost::vertices(g); firstv != lastv; in acceptance_test()
82 for (boost::tie(firstv, lastv) = boost::vertices(g); firstv != lastv; in acceptance_test()
87 for (boost::tie(firstv, lastv) = boost::vertices(g); firstv != lastv; in acceptance_test()
94 for (boost::tie(first, last) = boost::edges(g); first != last; first++) in acceptance_test()
115 for (boost::tie(first, last) = boost::edges(g); first != last; in acceptance_test()
148 for (boost::tie(firstv, lastv) = vertices(g); firstv != lastv; firstv++) in acceptance_test()
156 for (boost::tie(firstv2, lastv2) = vertices(g); firstv2 != lastv2; in acceptance_test()
184 for (boost::tie(first1, last1) = boost::vertices(g); in acceptance_test()
[all …]
|
| D | subgraph.cpp | 30 boost::tie(e1_i, e1_i_end) = edges(g1); in sub_cmp()
31 boost::tie(e2_i, e2_i_end) = edges(g2); in sub_cmp()
38 boost::tie(g1_i, g1_i_end) = g1.children(); in sub_cmp()
39 boost::tie(g2_i, g2_i_end) = g2.children(); in sub_cmp()
135 for (boost::tie(ei, ee) = edges(sub); ei != ee; ++ei) in main()
156 for (tie(vi, vi_end) = vertices(g1); vi != vi_end; ++vi) in main()
158 for (tie(vj, vj_end) = vertices(g1); vj != vj_end; ++vj) in main()
166 tie(vi_start, vi_end) = vertices(g1); in main()
177 tie(vi_start, vi_end) = vertices(*gi1); in main()
179 tie(vj_start, vj_end) = vertices(*gi2); in main()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/TextAPI/MachO/ |
| D | Target.h | 41 return std::tie(LHS.Arch, LHS.Platform) == std::tie(RHS.Arch, RHS.Platform);
45 return std::tie(LHS.Arch, LHS.Platform) != std::tie(RHS.Arch, RHS.Platform);
49 return std::tie(LHS.Arch, LHS.Platform) < std::tie(RHS.Arch, RHS.Platform);
|
| /third_party/flutter/skia/third_party/externals/angle2/src/libANGLE/renderer/ |
| D | driver_utils.cpp | 167 return std::tie(a.majorVersion, a.minorVersion, a.patchVersion) == in operator ==()
168 std::tie(b.majorVersion, b.minorVersion, b.patchVersion); in operator ==()
172 return std::tie(a.majorVersion, a.minorVersion, a.patchVersion) != in operator !=()
173 std::tie(b.majorVersion, b.minorVersion, b.patchVersion); in operator !=()
177 return std::tie(a.majorVersion, a.minorVersion, a.patchVersion) < in operator <()
178 std::tie(b.majorVersion, b.minorVersion, b.patchVersion); in operator <()
182 return std::tie(a.majorVersion, a.minorVersion, a.patchVersion) >= in operator >=()
183 std::tie(b.majorVersion, b.minorVersion, b.patchVersion); in operator >=()
|
| /third_party/gettext/libtextstyle/doc/ |
| D | libtextstyle.texi | 753 @deftypevr Variable {enum@tie{}color_option} color_mode
757 @deftypevr Variable {const@tie{}char@tie{}*} style_file_name
766 @deftypefn Function bool handle_color_option (const@tie{}char@tie{}*@var{option})
772 @deftypefn Function void handle_style_option (const@tie{}char@tie{}*@var{option})
782 …tie{}char@tie{}*@var{style_file_envvar}, const@tie{}char@tie{}*@var{stylesdir_envvar}, const@tie{}…
848 …n Function void ostream_write_mem (ostream_t@tie{}@var{stream}, const@tie{}void@tie{}*@var{data}, …
852 @deftypefn Function void ostream_write_str (ostream_t@tie{}@var{stream}, const@tie{}char@tie{}*@var…
856 @deftypefn Function ptrdiff_t ostream_printf (ostream_t@tie{}@var{stream}, const@tie{}char@tie{}*@v…
857 @deftypefnx Function ptrdiff_t ostream_vprintf (ostream_t@tie{}@var{stream}, const@tie{}char@tie{}*…
864 @deftypefn Function void ostream_flush (ostream_t@tie{}@var{stream}, ostream_flush_scope_t@tie{}@va…
[all …]
|
| /third_party/boost/boost/graph/ |
| D | edge_connectivity.hpp | 38 for (boost::tie(i, iend) = vertices(g); i != iend; ++i) in min_degree_vertex()
53 for (boost::tie(ai, aend) = adjacent_vertices(u, g); ai != aend; ++ai) in neighbors()
115 for (boost::tie(ei, ei_end) = edges(g); ei != ei_end; ++ei) in edge_connectivity()
118 boost::tie(e1, inserted) = add_edge(u, v, flow_g); in edge_connectivity()
120 boost::tie(e2, inserted) = add_edge(v, u, flow_g); in edge_connectivity()
129 boost::tie(p, delta) = detail::min_degree_vertex(g); in edge_connectivity()
137 boost::tie(vi, vi_end) = vertices(g); in edge_connectivity()
152 for (boost::tie(vi, vi_end) = vertices(flow_g); vi != vi_end; ++vi) in edge_connectivity()
160 boost::tie(vi, vi_end) = vertices(g); in edge_connectivity()
175 for (boost::tie(ei, ei_end) = out_edges(*si, g); ei != ei_end; ++ei) in edge_connectivity()
|
| D | graph_utility.hpp | 152 for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in print_in_edges()
156 for (boost::tie(ei, ei_end) = in_edges(*ui, G); ei != ei_end; ++ei) in print_in_edges()
167 for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in print_graph_dispatch()
171 for (boost::tie(ei, ei_end) = out_edges(*ui, G); ei != ei_end; ++ei) in print_graph_dispatch()
181 for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in print_graph_dispatch()
185 for (boost::tie(ei, ei_end) = out_edges(*ui, G); ei != ei_end; ++ei) in print_graph_dispatch()
208 for (boost::tie(ei, ei_end) = edges(G); ei != ei_end; ++ei) in print_edges()
219 for (boost::tie(ei, ei_end) = edges(G); ei != ei_end; ++ei) in print_edges2()
230 for (boost::tie(vi, vi_end) = vertices(G); vi != vi_end; ++vi) in print_vertices()
239 boost::tie(vi, viend) = adjacent_vertices(a, g); in is_adj_dispatch()
[all …]
|
| D | johnson_all_pairs_shortest.hpp | 76 for (boost::tie(v, v_end) = vertices(g1); v != v_end; ++v, ++i) in johnson_all_pairs_shortest_paths()
80 boost::tie(e, z) = add_edge(s, get(id1, *v) + 1, g2); in johnson_all_pairs_shortest_paths()
85 for (boost::tie(e, e_end) = edges(g1); e != e_end; ++e) in johnson_all_pairs_shortest_paths()
89 boost::tie(e2, z) = add_edge( in johnson_all_pairs_shortest_paths()
94 boost::tie(e2, z) = add_edge(get(id1, target(*e, g1)) + 1, in johnson_all_pairs_shortest_paths()
104 for (boost::tie(v, v_end) = vertices(g2); v != v_end; ++v) in johnson_all_pairs_shortest_paths()
115 for (boost::tie(v, v_end) = vertices(g2); v != v_end; ++v) in johnson_all_pairs_shortest_paths()
118 for (boost::tie(e, e_end) = edges(g2); e != e_end; ++e) in johnson_all_pairs_shortest_paths()
124 for (boost::tie(u, u_end) = vertices(g2); u != u_end; ++u) in johnson_all_pairs_shortest_paths()
129 for (boost::tie(v, v_end) = vertices(g2); v != v_end; ++v) in johnson_all_pairs_shortest_paths()
|
| D | push_relabel_max_flow.hpp | 162 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
164 for (boost::tie(ei, e_end) = out_edges(*u_iter, g); ei != e_end; in push_relabel()
170 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
182 for (boost::tie(a_iter, a_end) = out_edges(src, g); a_iter != a_end; in push_relabel()
195 for (boost::tie(a_iter, a_end) = out_edges(src, g); in push_relabel()
217 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
250 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in global_distance_update()
276 for (boost::tie(ai, a_end) = out_edges(u, g); ai != a_end; ++ai) in global_distance_update()
309 for (boost::tie(ai, ai_end) = current[u]; ai != ai_end; ++ai) in discharge()
392 for (boost::tie(ai, a_end) = out_edges(u, g); ai != a_end; ++ai) in relabel_distance()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/ExecutionEngine/RuntimeDyld/ |
| D | RuntimeDyldChecker.cpp | 46 std::tie(LHSResult, RemainingExpr) = in evaluate()
56 std::tie(RHSResult, RemainingExpr) = in evaluate()
118 std::tie(Token, Remaining) = parseSymbol(Expr); in getTokenForError()
120 std::tie(Token, Remaining) = parseNumberString(Expr); in getTokenForError()
227 std::tie(Symbol, RemainingExpr) = parseSymbol(RemainingExpr); in evalDecodeOperand()
240 std::tie(OpIdxExpr, RemainingExpr) = evalNumberExpr(RemainingExpr); in evalDecodeOperand()
295 std::tie(Symbol, RemainingExpr) = parseSymbol(RemainingExpr); in evalNextPC()
346 std::tie(Symbol, RemainingExpr) = parseSymbol(RemainingExpr); in evalStubOrGOTAddr()
355 std::tie(StubAddr, ErrorMsg) = Checker.getStubOrGOTAddrFor( in evalStubOrGOTAddr()
383 std::tie(SectionName, RemainingExpr) = parseSymbol(RemainingExpr); in evalSectionAddr()
[all …]
|
| /third_party/python/Tools/pynche/ |
| D | DetailsViewer.py | 150 tie = self.__rvar.get() + self.__gvar.get() + self.__bvar.get()
151 if tie in (0, 1, 2, 4):
157 7: 'Grey'}[tie]
188 tie = []
191 tie.append(red)
196 tie.append(green)
201 tie.append(blue)
211 elif atbound == WRAP or (atbound == RATIO and len(tie) < 2):
227 for c in tie:
233 delta = max(tie)
[all …]
|
| /third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/ |
| D | driver_utils.cpp | 196 return std::tie(a.majorVersion, a.minorVersion, a.patchVersion) == in operator ==()
197 std::tie(b.majorVersion, b.minorVersion, b.patchVersion); in operator ==()
201 return std::tie(a.majorVersion, a.minorVersion, a.patchVersion) != in operator !=()
202 std::tie(b.majorVersion, b.minorVersion, b.patchVersion); in operator !=()
206 return std::tie(a.majorVersion, a.minorVersion, a.patchVersion) < in operator <()
207 std::tie(b.majorVersion, b.minorVersion, b.patchVersion); in operator <()
211 return std::tie(a.majorVersion, a.minorVersion, a.patchVersion) >= in operator >=()
212 std::tie(b.majorVersion, b.minorVersion, b.patchVersion); in operator >=()
|