| /third_party/python/Lib/test/ |
| D | pstats.pck | 1 {(���u'���/home/gbr/devel/python/Lib/sre_parse.pyi����u ���__getitem__(���i5��i5��g��+ٱQ?g˶�ֈ`…
2 …�_compile_info(���i���i���g�h㈵��>g�����>(���u'���/home/gbr/devel/python/Lib/sre_parse.pyi���u…
3 …g��6�4DE?(���u)���/home/gbr/devel/python/Lib/sre_compile.pyic��u���_simple(���ir���ir���g?�̔��…
4 …g����}r?g�q�@H?0(���u4���/home/gbr/devel/python/Lib/distutils/fancy_getopt.pyip���u���_check_…
|
| /third_party/libxml2/result/ |
| D | svg3.rde | 4 1 1 g 0 0
10 1 15 g 0 0
13 1 1 g 0 0
19 1 15 g 0 0
22 1 1 g 0 0
28 1 15 g 0 0
31 1 1 g 0 0
37 1 15 g 0 0
40 1 1 g 0 0
46 1 15 g 0 0
[all …]
|
| D | svg3.rdr | 4 1 1 g 0 0
10 1 15 g 0 0
13 1 1 g 0 0
19 1 15 g 0 0
22 1 1 g 0 0
28 1 15 g 0 0
31 1 1 g 0 0
37 1 15 g 0 0
40 1 1 g 0 0
46 1 15 g 0 0
[all …]
|
| /third_party/boost/libs/geometry/test/cs_undefined/ |
| D | distance.cpp | 16 geom g; in test_main() local
18 bg::distance(g.pt, g.pt, bg::strategy::distance::pythagoras<>()); in test_main()
19 bg::distance(g.pt, g.pt, bg::strategy::distance::haversine<>()); in test_main()
20 bg::distance(g.pt, g.pt, bg::strategy::distance::geographic<>()); in test_main()
21 bg::distance(g.pt, g.mpt, bg::strategy::distance::pythagoras<>()); in test_main()
22 bg::distance(g.pt, g.mpt, bg::strategy::distance::haversine<>()); in test_main()
23 bg::distance(g.pt, g.mpt, bg::strategy::distance::geographic<>()); in test_main()
24 bg::distance(g.mpt, g.mpt, bg::strategy::distance::pythagoras<>()); in test_main()
25 bg::distance(g.mpt, g.mpt, bg::strategy::distance::haversine<>()); in test_main()
26 bg::distance(g.mpt, g.mpt, bg::strategy::distance::geographic<>()); in test_main()
[all …]
|
| D | setops.cpp | 175 geom g; in test_main() local
178 ::set_idsu_pp(g.pt, g.pt, g.mpt); in test_main()
179 ::set_idsu_pp(g.pt, g.mpt, g.mpt); in test_main()
180 ::set_idsu_pp(g.mpt, g.mpt, g.mpt); in test_main()
183 ::set_id_ps(g.pt, g.s, g.mpt); in test_main()
184 ::set_id_ps(g.pt, g.ls, g.mpt); in test_main()
185 ::set_id_ps(g.pt, g.mls, g.mpt); in test_main()
186 ::set_id_ps(g.mpt, g.s, g.mpt); in test_main()
187 ::set_id_ps(g.mpt, g.ls, g.mpt); in test_main()
188 ::set_id_ps(g.mpt, g.mls, g.mpt); in test_main()
[all …]
|
| D | relops2.cpp | 14 geom g; in test_main() local
17 //::rel_ss(g.s, g.s); // relate not implemented in test_main()
18 //::rel_ss(g.s, g.ls); // relate not implemented in test_main()
19 //::rel_ss(g.s, g.mls); // relate not implemented in test_main()
20 //::rel_ss(g.ls, g.s); // relate not implemented in test_main()
21 ::rel_ss(g.ls, g.ls); in test_main()
22 ::rel_ss(g.ls, g.mls); in test_main()
23 //::rel_ss(g.mls, g.s); // relate not implemented in test_main()
24 ::rel_ss(g.mls, g.ls); in test_main()
25 ::rel_ss(g.mls, g.mls); in test_main()
[all …]
|
| D | relops1.cpp | 14 geom g; in test_main() local
16 bg::disjoint(g.pt, g.b, bg::strategy::covered_by::cartesian_point_box()); in test_main()
17 bg::disjoint(g.pt, g.b, bg::strategy::covered_by::spherical_point_box()); in test_main()
18 bg::disjoint(g.b, g.b, bg::strategy::disjoint::cartesian_box_box()); in test_main()
19 bg::disjoint(g.b, g.b, bg::strategy::disjoint::spherical_box_box()); in test_main()
20 bg::within(g.pt, g.b, bg::strategy::within::cartesian_point_box()); in test_main()
21 bg::within(g.pt, g.b, bg::strategy::within::spherical_point_box()); in test_main()
22 bg::within(g.b, g.b, bg::strategy::within::cartesian_box_box()); in test_main()
23 bg::within(g.b, g.b, bg::strategy::within::spherical_box_box()); in test_main()
24 bg::covered_by(g.pt, g.b, bg::strategy::covered_by::cartesian_point_box()); in test_main()
[all …]
|
| D | envelope_expand.cpp | 17 geom g; in test_main() local
19 bg::expand(g.b, g.pt, bg::strategy::expand::cartesian_point()); in test_main()
20 bg::expand(g.b, g.pt, bg::strategy::expand::spherical_point()); in test_main()
21 bg::expand(g.b, g.b, bg::strategy::expand::cartesian_box()); in test_main()
22 bg::expand(g.b, g.b, bg::strategy::expand::spherical_box()); in test_main()
23 bg::expand(g.b, g.s, bg::strategy::expand::cartesian_segment()); in test_main()
24 bg::expand(g.b, g.s, bg::strategy::expand::spherical_segment<>()); in test_main()
25 bg::expand(g.b, g.s, bg::strategy::expand::geographic_segment<>()); in test_main()
27 bg::envelope(g.pt, g.b, bg::strategy::envelope::cartesian_point()); in test_main()
28 bg::envelope(g.pt, g.b, bg::strategy::envelope::spherical_point()); in test_main()
[all …]
|
| /third_party/harfbuzz/src/ |
| D | hb-ot-shape-complex-use-table.hh | 45 #define G USE(G) /* HIEROGLYPH */ macro
878 …/* 13000 */ G, G, G, G, G, G, G, G, G, G, G, G, …
879 …/* 13010 */ G, G, G, G, G, G, G, G, G, G, G, G, …
880 …/* 13020 */ G, G, G, G, G, G, G, G, G, G, G, G, …
881 …/* 13030 */ G, G, G, G, G, G, G, G, G, G, G, G, …
882 …/* 13040 */ G, G, G, G, G, G, G, G, G, G, G, G, …
883 …/* 13050 */ G, G, G, G, G, G, G, G, G, G, G, G, …
884 …/* 13060 */ G, G, G, G, G, G, G, G, G, G, G, G, …
885 …/* 13070 */ G, G, G, G, G, G, G, G, G, G, G, G, …
886 …/* 13080 */ G, G, G, G, G, G, G, G, G, G, G, G, …
[all …]
|
| D | hb-ot-shape-complex-arabic-win1256.hh | 187 #define G OT_GLYPHID macro
199 MANIFEST_LOOKUP(OT_TAG('r','l','i','g'), rligLookup)
203 MANIFEST_LOOKUP(OT_TAG('r','l','i','g'), rligMarksLookup)
236 G(198) G(200) G(201) G(202) G(203) G(204) G(205) G(206) G(211)
237 G(212) G(213) G(214) G(223) G(225) G(227) G(228) G(236) G(237),
238 G(162) G(4) G(5) G(5) G(6) G(7) G(9) G(11) G(13)
239 G(14) G(15) G(26) G(140) G(141) G(142) G(143) G(154) G(154)
242 G(218) G(219) G(221) G(222) G(229),
243 G(27) G(30) G(128) G(131) G(144)
246 G(218) G(219) G(221) G(222) G(229),
[all …]
|
| /third_party/gstreamer/gstplugins_bad/gst/bayer/ |
| D | gstbayerorc.orc | 54 .temp 2 g
58 x2 avgub g, g0, g2
60 x2 avgub g, g, t
61 andw g, g, 255
63 orw g, t, g
64 x2 mergebw bg, b1, g
80 .temp 2 g
84 x2 avgub g, g0, g2
86 x2 avgub g, g, t
87 andw g, g, 65280
[all …]
|
| /third_party/ffmpeg/libavcodec/ |
| D | gif_parser.c | 56 static int gif_find_frame_end(GIFParseContext *g, const uint8_t *buf, in gif_find_frame_end() argument
62 if (!g->state) { in gif_find_frame_end()
65 g->state = GIF_HEADER; in gif_find_frame_end()
66 g->found_sig++; in gif_find_frame_end()
68 g->state = GIF_EXTENSION; in gif_find_frame_end()
69 g->found_start = 1; in gif_find_frame_end()
71 g->state = GIF_IMAGE; in gif_find_frame_end()
73 g->state = 0; in gif_find_frame_end()
74 g->found_end = 1; in gif_find_frame_end()
75 g->found_sig = 0; in gif_find_frame_end()
[all …]
|
| /third_party/boost/boost/graph/ |
| D | graph_concepts.hpp | 4 // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
57 BOOST_concept(Graph, (G))
59 typedef typename graph_traits< G >::vertex_descriptor vertex_descriptor;
60 typedef typename graph_traits< G >::edge_descriptor edge_descriptor;
61 typedef typename graph_traits< G >::directed_category directed_category;
62 typedef typename graph_traits< G >::edge_parallel_category
64 typedef typename graph_traits< G >::traversal_category traversal_category;
72 G g; variable
75 BOOST_concept(IncidenceGraph, (G)) : Graph< G >
77 typedef typename graph_traits< G >::edge_descriptor edge_descriptor;
[all …]
|
| D | filtered_graph.hpp | 3 // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
74 out_edge_predicate(EdgePredicate ep, VertexPredicate vp, const Graph& g) in out_edge_predicate()
75 : m_edge_pred(ep), m_vertex_pred(vp), m_g(&g) in out_edge_predicate()
93 in_edge_predicate(EdgePredicate ep, VertexPredicate vp, const Graph& g) in in_edge_predicate()
94 : m_edge_pred(ep), m_vertex_pred(vp), m_g(&g) in in_edge_predicate()
112 edge_predicate(EdgePredicate ep, VertexPredicate vp, const Graph& g) in edge_predicate()
113 : m_edge_pred(ep), m_vertex_pred(vp), m_g(&g) in edge_predicate()
140 template < class G > struct filtered_graph_base
142 typedef graph_traits< G > Traits;
145 filtered_graph_base(const G& g) : m_g(g) {} in filtered_graph_base()
[all …]
|
| D | subgraph.hpp | 3 // Authors: Jeremy G. Siek and Lie-Quan Lee
71 // - If vertex u is in subgraph g, then u must be in g.parent().
72 // - If edge e is in subgraph g, then e must be in g.parent().
408 template < typename G >
409 typename subgraph< G >::vertex_descriptor add_vertex( in add_vertex()
410 typename subgraph< G >::vertex_descriptor u_global, subgraph< G >& g) in add_vertex()
412 BOOST_ASSERT(!g.is_root()); in add_vertex()
413 typename subgraph< G >::vertex_descriptor u_local; in add_vertex()
415 boost::tie(u_local, exists_local) = g.find_vertex(u_global); in add_vertex()
419 typename subgraph< G >::vertex_descriptor v_global; in add_vertex()
[all …]
|
| /third_party/boost/libs/histogram/doc/ |
| D | iteration_performance.svg | 11 <g id="figure_1">
12 <g id="patch_1">
19 </g>
20 <g id="axes_1">
21 <g id="patch_2">
28 </g>
29 <g id="matplotlib.axis_1">
30 <g id="xtick_1">
31 <g id="line2d_1">
37 <g>
[all …]
|
| /third_party/flutter/skia/third_party/externals/harfbuzz/src/ |
| D | hb-ot-shape-complex-arabic-win1256.hh | 187 #define G OT_GLYPHID macro
199 MANIFEST_LOOKUP(OT_TAG('r','l','i','g'), rligLookup)
203 MANIFEST_LOOKUP(OT_TAG('r','l','i','g'), rligMarksLookup)
236 G(198) G(200) G(201) G(202) G(203) G(204) G(205) G(206) G(211)
237 G(212) G(213) G(214) G(223) G(225) G(227) G(228) G(236) G(237),
238 G(162) G(4) G(5) G(5) G(6) G(7) G(9) G(11) G(13)
239 G(14) G(15) G(26) G(140) G(141) G(142) G(143) G(154) G(154)
242 G(218) G(219) G(221) G(222) G(229),
243 G(27) G(30) G(128) G(131) G(144)
246 G(218) G(219) G(221) G(222) G(229),
[all …]
|
| /third_party/boost/libs/math/doc/equations/ |
| D | bessel_derivatives1.svg | 2 …g transform="translate(0.000000, -3.984375)"><svg:g transform="translate(2.091797, -49.710021)"><s…
|
| D | bessel_derivatives4.svg | 2 …g transform="translate(0.000000, -3.984375)"><svg:g transform="translate(1.031250, -45.155190)"><s…
|
| D | bessel_derivatives5.svg | 2 …g transform="translate(0.000000, -3.984375)"><svg:g transform="translate(1.693359, -8.970957)"><sv…
|
| D | ellint14.svg | 2 …g transform="translate(0.000000, -3.984375)"><svg:g transform="translate(14.699215, -15.953572)"><…
|
| D | bernoulli_numbers2.svg | 2 …g transform="translate(0.000000, -3.984375)"><svg:g transform="translate(0.000000, -6.056484)"><sv…
|
| D | ibeta10.svg | 2 …g transform="translate(0.000000, -3.984375)"><svg:g transform="translate(0.000000, -15.162756)"><s…
|
| /third_party/ffmpeg/tests/ref/fate/ |
| D | parseutils | 29 bikeshed -> R(80) G(64) B(140) A(59)
30 RaNdOm -> R(185) G(88) B(148) A(94)
32 red -> R(255) G(0) B(0) A(255)
34 RED -> R(255) G(0) B(0) A(255)
35 Violet -> R(238) G(130) B(238) A(255)
36 Yellow -> R(255) G(255) B(0) A(255)
37 Red -> R(255) G(0) B(0) A(255)
38 0x000000 -> R(0) G(0) B(0) A(255)
40 0xff000000 -> R(255) G(0) B(0) A(0)
41 0x3e34ff -> R(62) G(52) B(255) A(255)
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | layout_test.cpp | 43 const Graph& g, PositionMap position, const Topology& topology) in print_graph_layout() argument
47 Point min_point = position[*vertices(g).first], max_point = min_point; in print_graph_layout()
48 BGL_FORALL_VERTICES_T(v, g, Graph) in print_graph_layout()
61 for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; in print_graph_layout()
78 void dump_graph_layout(std::string name, const Graph& g, PositionMap position) in dump_graph_layout() argument
84 for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi) in dump_graph_layout()
86 out << " n" << get(vertex_index, g, *vi) << "[ pos=\"" in dump_graph_layout()
92 for (boost::tie(ei, ei_end) = edges(g); ei != ei_end; ++ei) in dump_graph_layout()
94 out << " n" << get(vertex_index, g, source(*ei, g)) << " -- n" in dump_graph_layout()
95 << get(vertex_index, g, target(*ei, g)) << ";\n"; in dump_graph_layout()
[all …]
|
![[all …]](/OpenHarmony-v3.0.8-LTS/more/third_party/boost/libs/histogram/doc/iteration_performance.svg?full=g){kind=link}
