| /third_party/flutter/skia/third_party/externals/harfbuzz/src/ |
| D | hb-ot-shape-complex-arabic-win1256.hh | 187 #define G OT_GLYPHID macro
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),
247 G(28) G(31) G(129) G(138) G(149)
250 G(194) G(195) G(197) G(198) G(199) G(201) G(204) G(205) G(206)
[all …]
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| D | hb-ot-shape-complex-arabic-win1256.hh | 187 #define G OT_GLYPHID macro
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),
247 G(28) G(31) G(129) G(138) G(149)
250 G(194) G(195) G(197) G(198) G(199) G(201) G(204) G(205) G(206)
[all …]
|
| /third_party/harfbuzz/src/ |
| D | hb-ot-shape-complex-arabic-win1256.hh | 187 #define G OT_GLYPHID macro
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),
247 G(28) G(31) G(129) G(138) G(149)
250 G(194) G(195) G(197) G(198) G(199) G(201) G(204) G(205) G(206)
[all …]
|
| 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 …]
|
| /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/geometry/test/algorithms/envelope_expand/ |
| D | envelope_on_spheroid.cpp | 533 typedef point_type G; in test_envelope_point() typedef
535 typedef test_envelope_on_sphere_or_spheroid<G, B> tester; in test_envelope_point()
538 from_wkt<G>("POINT(10 10)"), in test_envelope_point()
542 from_wkt<G>("POINT(370 10)"), in test_envelope_point()
547 from_wkt<G>("POINT(370 -350)"), in test_envelope_point()
553 from_wkt<G>("POINT(0 90)"), in test_envelope_point()
557 from_wkt<G>("POINT(10 90)"), in test_envelope_point()
561 from_wkt<G>("POINT(270 90)"), in test_envelope_point()
566 from_wkt<G>("POINT(270 450)"), in test_envelope_point()
571 from_wkt<G>("POINT(190 90)"), in test_envelope_point()
[all …]
|
| D | expand_on_spheroid.cpp | 414 typedef point_type G; in test_expand_point() typedef
419 from_wkt<G>("POINT(10 10)"), in test_expand_point()
424 from_wkt<G>("POINT(370 10)"), in test_expand_point()
429 from_wkt<G>("POINT(20 20)"), in test_expand_point()
434 from_wkt<G>("POINT(10 20)"), in test_expand_point()
441 from_wkt<G>("POINT(190 20)"), in test_expand_point()
448 from_wkt<G>("POINT(-170 20)"), in test_expand_point()
454 from_wkt<G>("POINT(-170 15)"), in test_expand_point()
459 from_wkt<G>("POINT(-170 -6)"), in test_expand_point()
464 from_wkt<G>("POINT(-170 36)"), in test_expand_point()
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | constEnumPropertyAccess1.types | 6 const enum G {
7 >G : G
10 >A : G
14 >B : G
18 >C : G
20 >A : G
21 >B : G
24 >D : G
26 >A : G
45 var a = G.A;
[all …]
|
| D | constEnumPropertyAccess2.types | 6 const enum G {
7 >G : G
10 >A : G
14 >B : G
18 >C : G
20 >A : G
21 >B : G
24 >D : G
26 >A : G
31 var z = G;
[all …]
|
| D | constEnumPropertyAccess1.symbols | 6 const enum G {
7 >G : Symbol(G, Decl(constEnumPropertyAccess1.ts, 0, 0))
10 >A : Symbol(G.A, Decl(constEnumPropertyAccess1.ts, 4, 14))
13 >B : Symbol(G.B, Decl(constEnumPropertyAccess1.ts, 5, 10))
16 >C : Symbol(G.C, Decl(constEnumPropertyAccess1.ts, 6, 10))
17 >A : Symbol(G.A, Decl(constEnumPropertyAccess1.ts, 4, 14))
18 >B : Symbol(G.B, Decl(constEnumPropertyAccess1.ts, 5, 10))
21 >D : Symbol(G.D, Decl(constEnumPropertyAccess1.ts, 7, 14))
22 >A : Symbol(G.A, Decl(constEnumPropertyAccess1.ts, 4, 14))
37 var a = G.A;
[all …]
|
| D | constEnumPropertyAccess2.symbols | 6 const enum G {
7 >G : Symbol(G, Decl(constEnumPropertyAccess2.ts, 0, 0))
10 >A : Symbol(G.A, Decl(constEnumPropertyAccess2.ts, 4, 14))
13 >B : Symbol(G.B, Decl(constEnumPropertyAccess2.ts, 5, 10))
16 >C : Symbol(G.C, Decl(constEnumPropertyAccess2.ts, 6, 10))
17 >A : Symbol(G.A, Decl(constEnumPropertyAccess2.ts, 4, 14))
18 >B : Symbol(G.B, Decl(constEnumPropertyAccess2.ts, 5, 10))
21 >D : Symbol(G.D, Decl(constEnumPropertyAccess2.ts, 7, 14))
22 >A : Symbol(G.A, Decl(constEnumPropertyAccess2.ts, 4, 14))
26 var z = G;
[all …]
|
| D | genericFunctionsNotContextSensitive.types | 4 const f = <F extends (...args: any[]) => <G>(x: G) => void>(_: F): F => _;
5 >f : <F extends (...args: any[]) => <G>(x: G) => void>(_: F) => F
6 ><F extends (...args: any[]) => <G>(x: G) => void>(_: F): F => _ : <F extends (...args: any[]) => <…
8 >x : G
12 const a = f(<K extends string>(_: K) => _ => ({})); // <K extends string>(_: K) => <G>(_: G) => {}
13 >a : <K extends string>(_: K) => <G>(_: G) => {}
14 >f(<K extends string>(_: K) => _ => ({})) : <K extends string>(_: K) => <G>(_: G) => {}
15 >f : <F extends (...args: any[]) => <G>(x: G) => void>(_: F) => F
16 ><K extends string>(_: K) => _ => ({}) : <K extends string>(_: K) => <G>(_: G) => {}
18 >_ => ({}) : <G>(_: G) => {}
[all …]
|
| /third_party/boost/libs/geometry/test/algorithms/ |
| D | is_simple.cpp | 44 typedef point_type G; in BOOST_AUTO_TEST_CASE() typedef
46 test_simple(from_wkt<G>("POINT(0 0)"), true); in BOOST_AUTO_TEST_CASE()
58 typedef multi_point_type G; in BOOST_AUTO_TEST_CASE() typedef
60 test_simple(from_wkt<G>("MULTIPOINT(0 0)"), true); in BOOST_AUTO_TEST_CASE()
61 test_simple(from_wkt<G>("MULTIPOINT(0 0,1 0,1 1,0 1)"), true); in BOOST_AUTO_TEST_CASE()
62 test_simple(from_wkt<G>("MULTIPOINT(0 0,1 0,1 1,1 0,0 1)"), false); in BOOST_AUTO_TEST_CASE()
65 test_simple(from_wkt<G>("MULTIPOINT()"), true); in BOOST_AUTO_TEST_CASE()
77 typedef segment_type G; in BOOST_AUTO_TEST_CASE() typedef
79 test_simple(from_wkt<G>("SEGMENT(0 0,1 0)"), true); in BOOST_AUTO_TEST_CASE()
91 typedef linestring_type G; in BOOST_AUTO_TEST_CASE() typedef
[all …]
|
| D | is_simple_geo.cpp | 40 typedef multi_point_type G; in BOOST_AUTO_TEST_CASE() typedef
44 test_simple_s(from_wkt<G>("MULTIPOINT(0 90, 0 90)"), s, false); in BOOST_AUTO_TEST_CASE()
45 test_simple_s(from_wkt<G>("MULTIPOINT(0 90, 1 90)"), s, false); in BOOST_AUTO_TEST_CASE()
46 test_simple_s(from_wkt<G>("MULTIPOINT(0 -90, 0 -90)"), s, false); in BOOST_AUTO_TEST_CASE()
47 test_simple_s(from_wkt<G>("MULTIPOINT(0 -90, 1 -90)"), s, false); in BOOST_AUTO_TEST_CASE()
48 test_simple_s(from_wkt<G>("MULTIPOINT(0 80, 1 80)"), s, true); in BOOST_AUTO_TEST_CASE()
53 typedef linestring_type G; in BOOST_AUTO_TEST_CASE() typedef
66 test_simple_s(from_wkt<G>("LINESTRING(0 0, -90 0, 90 0)"), s, true); in BOOST_AUTO_TEST_CASE()
67 test_simple_s(from_wkt<G>("LINESTRING(0 0, 90 0, -90 0)"), s, true); in BOOST_AUTO_TEST_CASE()
71 test_simple_s(from_wkt<G>("LINESTRING(0 0, -80 0, 80 0)"), s, false); in BOOST_AUTO_TEST_CASE()
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | core_numbers_test.cpp | 22 Graph G(21); in test_1() local
23 add_edge(0, 1, G); in test_1()
24 add_edge(1, 2, G); in test_1()
25 add_edge(1, 3, G); in test_1()
26 add_edge(2, 3, G); in test_1()
27 add_edge(1, 4, G); in test_1()
28 add_edge(3, 4, G); in test_1()
29 add_edge(4, 5, G); in test_1()
30 add_edge(4, 6, G); in test_1()
31 add_edge(5, 6, G); in test_1()
[all …]
|
| /third_party/boost/libs/callable_traits/test/ |
| D | function_type.cpp | 11 using G = decltype(g); in main() typedef
13 CT_ASSERT(std::is_same<TRAIT(function_type, G), F>::value); in main()
14 CT_ASSERT(std::is_same<function_type_t<G const &>, F>::value); in main()
15 CT_ASSERT(std::is_same<function_type_t<G const &&>, F>::value); in main()
16 CT_ASSERT(std::is_same<function_type_t<G volatile &>, F>::value); in main()
17 CT_ASSERT(std::is_same<function_type_t<G &>, F>::value); in main()
18 CT_ASSERT(std::is_same<function_type_t<G &&>, F>::value); in main()
20 decltype(&G::operator())>, void(G const &, int, char)>::value); in main()
25 using G = void (int, char, ...) const LREF; in main() typedef
27 CT_ASSERT(std::is_same<TRAIT(function_type, G), F>::value); in main()
[all …]
|
| /third_party/boost/boost/graph/ |
| D | graph_concepts.hpp | 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;
75 BOOST_concept(IncidenceGraph, (G)) : Graph< G >
77 typedef typename graph_traits< G >::edge_descriptor edge_descriptor;
78 typedef typename graph_traits< G >::out_edge_iterator out_edge_iterator;
[all …]
|
| D | subgraph.hpp | 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()
413 typename subgraph< G >::vertex_descriptor u_local; in add_vertex()
419 typename subgraph< G >::vertex_descriptor v_global; in add_vertex()
420 typename subgraph< G >::edge_descriptor e_global; in add_vertex()
429 subgraph< G >& r = g.root(); in add_vertex()
433 typename subgraph< G >::out_edge_iterator ei, ei_end; in add_vertex()
446 typename subgraph< G >::vertex_iterator vi, vi_end; in add_vertex()
447 typename subgraph< G >::out_edge_iterator ei, ei_end; in add_vertex()
[all …]
|
| D | filtered_graph.hpp | 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()
147 const G& m_g;
306 template < typename G, typename EP, typename VP >
307 std::pair< typename filtered_graph< G, EP, VP >::vertex_iterator,
308 typename filtered_graph< G, EP, VP >::vertex_iterator >
309 vertices(const filtered_graph< G, EP, VP >& g) in vertices() argument
311 typedef filtered_graph< G, EP, VP > Graph; in vertices()
312 typename graph_traits< G >::vertex_iterator f, l; in vertices()
[all …]
|
| D | edge_list.hpp | 48 template < class G, class EdgeIter, class T, class D > class edge_list_impl
102 template < class G, class EI, class T, class D >
103 std::pair< typename edge_list_impl< G, EI, T, D >::edge_iterator,
104 typename edge_list_impl< G, EI, T, D >::edge_iterator >
105 edges(const edge_list_impl< G, EI, T, D >& g_) in edges() argument
107 const G& g = static_cast< const G& >(g_); in edges()
108 typedef typename edge_list_impl< G, EI, T, D >::edge_iterator edge_iterator; in edges()
111 template < class G, class EI, class T, class D >
112 typename edge_list_impl< G, EI, T, D >::vertex_descriptor source( in source() argument
113 typename edge_list_impl< G, EI, T, D >::edge_descriptor e, in source()
[all …]
|
| /third_party/boost/libs/graph/example/ |
| D | dfs.cpp | 59 template < class Edge, class Graph > void tree_edge(Edge e, Graph& G) in tree_edge()
61 cout << "Tree edge: " << source(e, G) << " --> " << target(e, G) in tree_edge()
63 Base::tree_edge(e, G); in tree_edge()
65 template < class Edge, class Graph > void back_edge(Edge e, Graph& G) in back_edge()
67 cout << "Back edge: " << source(e, G) << " --> " << target(e, G) in back_edge()
69 Base::back_edge(e, G); in back_edge()
72 void forward_or_cross_edge(Edge e, Graph& G) in forward_or_cross_edge()
74 cout << "Forward or cross edge: " << source(e, G) << " --> " in forward_or_cross_edge()
75 << target(e, G) << endl; in forward_or_cross_edge()
76 Base::forward_or_cross_edge(e, G); in forward_or_cross_edge()
[all …]
|
| D | reverse_graph.cpp | 24 Graph G(5); in main() local
25 add_edge(0, 2, G); in main()
26 add_edge(1, 1, G); in main()
27 add_edge(1, 3, G); in main()
28 add_edge(1, 4, G); in main()
29 add_edge(2, 1, G); in main()
30 add_edge(2, 3, G); in main()
31 add_edge(2, 4, G); in main()
32 add_edge(3, 1, G); in main()
33 add_edge(3, 4, G); in main()
[all …]
|
| /third_party/boost/libs/mp11/test/ |
| D | mp_with_index.cpp | 39 struct G struct
59 G()( mp_size_t<1>{} ); in main() argument
60 G()( mp_size_t<2>{} ); in main()
61 G()( mp_size_t<3>{} ); in main()
62 G()( mp_size_t<4>{} ); in main()
63 G()( mp_size_t<5>{} ); in main()
64 G()( mp_size_t<6>{} ); in main()
65 G()( mp_size_t<7>{} ); in main()
66 G()( mp_size_t<8>{} ); in main()
67 G()( mp_size_t<9>{} ); in main()
[all …]
|
| /third_party/boost/boost/graph/distributed/ |
| D | concepts.hpp | 38 template <class G>
41 typedef typename graph_traits<G>::vertex_iterator vertex_iterator;
42 typedef typename graph_traits<G>::vertices_size_type vertices_size_type;
43 typedef typename graph_traits<G>::traversal_category
46 BOOST_CONCEPT_ASSERT(( GraphConcept<G> )); in constraints()
63 void const_constraints(const G& cg) { in const_constraints()
78 typename graph_traits<G>::vertex_descriptor v;
79 G g;
83 template <class G>
86 typedef typename graph_traits<G>::edge_descriptor edge_descriptor;
[all …]
|
| /third_party/pcre2/pcre2/src/ |
| D | pcre2test.c | 194 #define G(a,b) glue(a,b) macro
309 #define PCRE2_SUFFIX(a) G(a,8)
318 #define PCRE2_SUFFIX(a) G(a,16)
327 #define PCRE2_SUFFIX(a) G(a,32)
1040 #define CASTFLD(t,a,b) ((test_mode == PCRE8_MODE)? (t)(G(a,8)->b) : \
1041 (test_mode == PCRE16_MODE)? (t)(G(a,16)->b) : (t)(G(a,32)->b))
1044 (test_mode == PCRE8_MODE)? (t)G(x,8) : \
1045 (test_mode == PCRE16_MODE)? (t)G(x,16) : (t)G(x,32))
1054 memcpy(G(a,8),G(b,8),sizeof(pcre2_convert_context_8)); \
1056 memcpy(G(a,16),G(b,16),sizeof(pcre2_convert_context_16)); \
[all …]
|