Home
last modified time | relevance | path

Searched refs:G (Results 1 – 25 of 3734) sorted by relevance

12345678910>>...150

/external/harfbuzz_ng/src/
Dhb-ot-shape-complex-arabic-win1256.hh187 #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 …]
/external/llvm-project/llvm/unittests/XRay/
DGraphTest.cpp37 std::remove_const_t<T> G; in getTestGraph() local
38 G.insert(make_pair(1u, VAttr({3u}))); in getTestGraph()
39 G.insert(make_pair(2u, VAttr({5u}))); in getTestGraph()
40 G.insert(make_pair(3u, VAttr({7u}))); in getTestGraph()
41 G.insert(make_pair(4u, VAttr({11u}))); in getTestGraph()
42 G.insert(make_pair(5u, VAttr({13u}))); in getTestGraph()
43 G.insert(make_pair(6u, VAttr({17u}))); in getTestGraph()
45 G.insert(std::make_pair(EI(1u, 2u), EAttr({3u * 5u}))); in getTestGraph()
46 G.insert(std::make_pair(EI(2u, 3u), EAttr({5u * 7u}))); in getTestGraph()
47 G.insert(std::make_pair(EI(6u, 3u), EAttr({2u * 7u * 17u}))); in getTestGraph()
[all …]
/external/rust/crates/ring/src/ec/suite_b/ops/
Dp256_point_sum_tests.txt7 # inf (n*G) + inf (n*G) == 2 * inf == inf
12 # inf (n*G) + inf == 2 * inf == inf
17 # inf + inf (n*G) == 2 * inf == inf
22 # G + inf == G
27 # G + inf (n*G) == G
32 # inf + G == G
37 # inf (n*G) + G == G
42 # G + G == 2*G
47 # (n-1)*G + G == inf; note that -G is (n-1)*G
52 # G + (n-1)*G == inf; note that -G is (n-1)*G
[all …]
Dp384_point_sum_tests.txt7 # inf (n*G) + inf (n*G) == 2 * inf == inf
12 # inf (n*G) + inf == 2 * inf == inf
17 # inf + inf (n*G) == 2 * inf == inf
22 # G + inf == G
27 # G + inf (n*G) == G
32 # inf + G == G
37 # inf (n*G) + G == G
42 # G + G == 2*G
47 # (n-1)*G + G == inf; note that -G is (n-1)*G
52 # G + (n-1)*G == inf; note that -G is (n-1)*G
[all …]
Dp256_point_sum_mixed_tests.txt7 # inf (n*G) + inf (n*G) == 2 * inf == inf
12 # inf (n*G) + inf == 2 * inf == inf
17 # inf + inf (n*G) == 2 * inf == inf
22 # G + inf == G
27 # G + inf (n*G) == G
32 # inf + G == G
37 # inf (n*G) + G == G
42 # G + (n-1)*G == inf; note that -G is (n-1)*G
47 # (n-1)*G + -(n-1)*G == inf
52 # -(n-1)*G + (n-1)*G == inf
[all …]
/external/exoplayer/tree/testdata/src/test/assets/ts/
Dsample_eac3.ts1 G`�1����
2Gl�>|���ϟ>|���ϟ>|���ϟ>|���ϟ>|���ϟ>|���ϟ>?�Wϟ>|���ϟ>|���ϟ>|���ϟ>|���ϟ>|���ϟ>|���ϟ>|���ϟ>|���ϟ>|��…
Dbbb_2500ms.ts1 G@�B�%���������HFFmpeg Service01w|C�������������������������������������������������������…
3 …�)H���".R���JR"�)H���".R���JR"�)H���".R���JR"�)H���".R���JR"���})H��`@��`@�7G���2`Q4��
34 ��d4��`` 0Ҋ@����$wsN�G����A�� �� �k�]����#,@Ҁ5H�
43 �܎G�k(kh���"g�6��0հ�VaP���d��aPUfE;l� Z� nvX����`��C�ZY�i�x��4`��;� �����{�NS尡�ή�…
47 …p�@&p��p�@&p��p�@&p�� p�@&p��!p�@&p��"p�@&p��#pG��@&p��$p�@&p�…
63 v�x�� �����p�@&p��G�p�@&p��p�@&p��p�@&p��p�@&p�� p�@&p��
70 …&�rt&s:M,R��ˁ�1/r9S���Kr�Q4��C�b|�N�l�V��.�}*�6�~h�Z��'���_��E�j���������G &���[�����A�
76 …�g�2��`�5=�}-��P8=+���dX�6����:F���d1Bs&Sǒ�Բ��w�����{������6hr���z�z���3G2��qդU�9gQ�y�t3…
82 x�Å~��P������5��G�������z�.&�F�Jq�9n�榪�#Y�]͊Dw�ⷂ��x=$�yt��"煵�aqƘ.c�}�Z�s8�n����5f��������;(I…
84 …]�:N��YWw�k���@ᲊ�d_����Q�.{�s�U=!�m7tmhd�^�x��"w��������k�������\Xp�����N��c�e^9 (�G@����
Dsample_ac4.ts1 G`�1���� ������f���_�
5 …����������������������������������������������������������������������������G`�@�(������@DOLBY…
7Gl2���<t'��������������������������������������������������������������������������������������…
13 …����������������������������������������������������������������������������G`�@�(������@DOLBY…
14 …����������������������������������������������������������������������������G�������������������…
21 …����������������������������������������������������������������������������G`�@�(������@DOLBY…
31G�����������������������������������������������������������������������������������������������…
33G�����������������������������������������������������������������������������������������������…
40G�����������������������������������������������������������������������������������������������…
43G�����������������������������������������������������������������������������������������������…
/external/ImageMagick/PerlMagick/t/reference/read/
Dinput_gray_lsb_double_mat.miff13 :?в22?�ܿ����?������?ιUYUYU?ַ?���@�@�?�5c�c�d?ȋ++?���s�s�?���`�`�?�xGGG?ڣNCNCN?��..…
16G!G!G?дN4N4N?� j�j�k?�K�K�K�?�s1�1�2?ѝ�����?ҞGGG?�444?�t8�8�9?�އ��?��x�x�y?ѳ�S�S�?�!q�q�r?�…
21GG�?�r1�1�2?�H���?�r�ұҲ?�G�'�'�?ώ�n�n�?ӟ�߸߹?Ջ�����?�c�c�d?�������?�#�����?�K���?�_�����?����…
24 …i?�[�����?�222?Ӳ\r\r\?�Ǹ��?�GGG�?�GGG?�1���?�r?�r22?�����?Ҝ���?Ҳ*�*�+?������?…
25GG�?�r�2�2�?Ӳ�����?ӝN=N=N?��c�c�d?��]]?�ݎ=�=�?�2���?чUGUGU?����?���ոչ?��q�q�r?��*�*�+?�_��…
26 G
27 G?�I�����?�J�
/external/tensorflow/tensorflow/cc/saved_model/testdata/CyclicModule/debug/
Dsaved_model_debug_info.pb11 GW
18 GO
25 GL
32 GQ
39 GN
46 GQ
53 Gj
60 GV
67 GK
74 Ga
[all …]
/external/llvm-project/clang/test/CXX/class/class.compare/class.compare.default/
Dp3.cpp167 struct G;
168 bool operator==(const G&, const G&);
169 bool operator!=(const G&, const G&);
170 std::strong_ordering operator<=>(const G&, const G&);
171 bool operator<(const G&, const G&);
172 bool operator<=(const G&, const G&);
173 bool operator>(const G&, const G&);
174 bool operator>=(const G&, const G&);
175 struct G { struct
176 friend bool operator==(const G&, const G&) = default;
[all …]
/external/llvm-project/llvm/unittests/ADT/
DBreadthFirstIteratorTest.cpp20 Graph<4> G; in TEST() local
21 G.AddEdge(0, 1); in TEST()
22 G.AddEdge(0, 2); in TEST()
23 G.AddEdge(1, 3); in TEST()
25 auto It = BFIter::begin(G); in TEST()
26 auto End = BFIter::end(G); in TEST()
28 EXPECT_EQ(*It, G.AccessNode(0)); in TEST()
31 EXPECT_EQ(*It, G.AccessNode(1)); in TEST()
34 EXPECT_EQ(*It, G.AccessNode(2)); in TEST()
37 EXPECT_EQ(*It, G.AccessNode(3)); in TEST()
[all …]
/external/rust/crates/lock_api/src/
Dremutex.rs60 pub struct RawReentrantMutex<R, G> {
64 get_thread_id: G,
67 unsafe impl<R: RawMutex + Send, G: GetThreadId + Send> Send for RawReentrantMutex<R, G> {}
68 unsafe impl<R: RawMutex + Sync, G: GetThreadId + Sync> Sync for RawReentrantMutex<R, G> {}
70 impl<R: RawMutex, G: GetThreadId> RawReentrantMutex<R, G> {
77 get_thread_id: G::INIT,
140 impl<R: RawMutexFair, G: GetThreadId> RawReentrantMutex<R, G> {
178 impl<R: RawMutexTimed, G: GetThreadId> RawReentrantMutex<R, G> {
203 pub struct ReentrantMutex<R, G, T: ?Sized> {
204 raw: RawReentrantMutex<R, G>,
[all …]
/external/llvm-project/llvm/unittests/ExecutionEngine/JITLink/
DLinkGraphTests.cpp23 LinkGraph G("foo", 8, support::little); in TEST() local
24 EXPECT_EQ(G.getName(), "foo"); in TEST()
25 EXPECT_EQ(G.getPointerSize(), 8U); in TEST()
26 EXPECT_EQ(G.getEndianness(), support::little); in TEST()
27 EXPECT_TRUE(llvm::empty(G.external_symbols())); in TEST()
28 EXPECT_TRUE(llvm::empty(G.absolute_symbols())); in TEST()
29 EXPECT_TRUE(llvm::empty(G.defined_symbols())); in TEST()
30 EXPECT_TRUE(llvm::empty(G.blocks())); in TEST()
41 LinkGraph G("foo", 8, support::little); in TEST() local
42 auto &Sec1 = G.createSection("__data.1", RWFlags); in TEST()
[all …]
/external/pdfium/core/fpdfapi/page/
Dcpdf_devicecs_unittest.cpp14 float G; in TEST() local
20 ASSERT_TRUE(device_gray->GetRGB(buf, &R, &G, &B)); in TEST()
22 EXPECT_FLOAT_EQ(0.43f, G); in TEST()
25 ASSERT_TRUE(device_gray->GetRGB(buf, &R, &G, &B)); in TEST()
27 EXPECT_FLOAT_EQ(0.872f, G); in TEST()
32 ASSERT_TRUE(device_gray->GetRGB(buf, &R, &G, &B)); in TEST()
34 EXPECT_FLOAT_EQ(0.0f, G); in TEST()
37 ASSERT_TRUE(device_gray->GetRGB(buf, &R, &G, &B)); in TEST()
39 EXPECT_FLOAT_EQ(1.0f, G); in TEST()
44 ASSERT_TRUE(device_gray->GetRGB(buf, &R, &G, &B)); in TEST()
[all …]
/external/pcre/dist2/src/
Dpcre2test.c192 #define G(a,b) glue(a,b) macro
307 #define PCRE2_SUFFIX(a) G(a,8)
316 #define PCRE2_SUFFIX(a) G(a,16)
325 #define PCRE2_SUFFIX(a) G(a,32)
1037 #define CASTFLD(t,a,b) ((test_mode == PCRE8_MODE)? (t)(G(a,8)->b) : \
1038 (test_mode == PCRE16_MODE)? (t)(G(a,16)->b) : (t)(G(a,32)->b))
1041 (test_mode == PCRE8_MODE)? (t)G(x,8) : \
1042 (test_mode == PCRE16_MODE)? (t)G(x,16) : (t)G(x,32))
1051 memcpy(G(a,8),G(b,8),sizeof(pcre2_convert_context_8)); \
1053 memcpy(G(a,16),G(b,16),sizeof(pcre2_convert_context_16)); \
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/
DReductionRules.h30 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1() argument
37 assert(G.getNodeDegree(NId) == 1 && in applyR1()
40 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1()
41 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
43 const Matrix &ECosts = G.getEdgeCosts(EId); in applyR1()
44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
48 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()
69 G.setNodeCosts(MId, YCosts); in applyR1()
70 G.disconnectEdge(EId, MId); in applyR1()
[all …]
/external/llvm-project/llvm/include/llvm/CodeGen/PBQP/
DReductionRules.h30 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1() argument
37 assert(G.getNodeDegree(NId) == 1 && in applyR1()
40 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1()
41 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
43 const Matrix &ECosts = G.getEdgeCosts(EId); in applyR1()
44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
48 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()
69 G.setNodeCosts(MId, YCosts); in applyR1()
70 G.disconnectEdge(EId, MId); in applyR1()
[all …]
/external/llvm/include/llvm/CodeGen/PBQP/
DReductionRules.h29 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1() argument
36 assert(G.getNodeDegree(NId) == 1 && in applyR1()
39 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1()
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
42 const Matrix &ECosts = G.getEdgeCosts(EId); in applyR1()
43 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
44 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
47 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()
68 G.setNodeCosts(MId, YCosts); in applyR1()
69 G.disconnectEdge(EId, MId); in applyR1()
[all …]
/external/icu/icu4c/source/data/locales/
Dmk.txt226 "EEEE, dd MMMM y 'г'. G",
227 "dd MMMM y 'г'. G",
228 "dd.M.y G",
239 Gy{"y 'г'. G"}
240 GyMMM{"MMM y 'г'. G"}
241 GyMMMEd{"E, dd MMM y 'г'. G"}
242 GyMMMd{"dd MMM y 'г'. G"}
249 y{"y 'г'. G"}
250 yyyy{"y 'г'. G"}
251 yyyyM{"M.y G"}
[all …]
Dis.txt15 …ExemplarCharactersIndex{"[A Á B C D Ð E É F G H I Í J K L M N O Ó P Q R S T U Ú V W X Y Ý Z Þ Æ Ö]…
232 "EEEE, d. MMMM y G",
233 "d. MMMM y G",
234 "d.M.y G",
245 Gy{"y G"}
246 GyMMM{"MMM y G"}
247 GyMMMEd{"E, d. MMM y G"}
248 GyMMMd{"d. MMM y G"}
258 y{"y G"}
259 yyyy{"y G"}
[all …]
/external/libcxx/test/std/thread/thread.threads/thread.thread.class/thread.thread.constr/
DF.pass.cpp56 class G class
63 G() : alive_(1) {++n_alive;} in G() function in G
64 G(const G& g) : alive_(g.alive_) {++n_alive;} in G() function in G
65 ~G() {alive_ = 0; --n_alive;} in ~G()
84 int G::n_alive = 0;
85 bool G::op_run = false;
158 assert(G::n_alive == 0); in main()
159 assert(!G::op_run); in main()
161 G g; in main()
165 assert(G::n_alive == 0); in main()
[all …]
/external/llvm-project/libcxx/test/std/thread/thread.threads/thread.thread.class/thread.thread.constr/
DF.pass.cpp57 class G class
64 G() : alive_(1) {++n_alive;} in G() function in G
65 G(const G& g) : alive_(g.alive_) {++n_alive;} in G() function in G
66 ~G() {alive_ = 0; --n_alive;} in ~G()
85 int G::n_alive = 0;
86 bool G::op_run = false;
163 assert(G::n_alive == 0); in main()
164 assert(!G::op_run); in main()
166 G g; in main()
170 assert(G::n_alive == 0); in main()
[all …]
Dmove.pass.cpp25 class G class
32 G() : alive_(1) {++n_alive;} in G() function in G
33 G(const G& g) : alive_(g.alive_) {++n_alive;} in G() function in G
34 ~G() {alive_ = 0; --n_alive;} in ~G()
44 int G::n_alive = 0;
45 bool G::op_run = false;
49 assert(G::n_alive == 0); in main()
50 assert(!G::op_run); in main()
52 G g; in main()
53 assert(G::n_alive == 1); in main()
[all …]
/external/llvm-project/libcxx/test/std/thread/thread.threads/thread.thread.class/thread.thread.assign/
Dmove.pass.cpp24 class G class
31 G() : alive_(1) {++n_alive;} in G() function in G
32 G(const G& g) : alive_(g.alive_) {++n_alive;} in G() function in G
33 ~G() {alive_ = 0; --n_alive;} in ~G()
43 int G::n_alive = 0;
44 bool G::op_run = false;
48 assert(G::n_alive == 0); in main()
49 assert(!G::op_run); in main()
51 G g; in main()
52 assert(G::n_alive == 1); in main()
[all …]

12345678910>>...150