/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/de-DE/ |
D | de-DE_gl0_kpdf_phs.pkb | 11 R��*r�JK������G��g��+… 16 …G�H�|������8�9�:������3�l���˗������@���И�`�a�b… 29 …�����IJK��#k������G����!… 34 �U����-�u����M���ݍ%�m�������F�G���͏�]��������… 37 …��4�w����J�������0�x�y�z�������������G���������… 42 +8AB>5+#!%)+G�����������r]VRG7+)09=944;HTXRG;0' 43 "0>HKF;.!- #'+G����鱣>&!'2<:+(264/( !! 48 $),,+)$""G����f9 !'$ 55 G������lP>62.)!!*157:?FKI@2$ 56 (7DMPNJC>8520.-*'# [all …]
|
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/en-US/ |
D | en-US_lh0_kpdf_phs.pkb | 21 …G���צ�g�������������C���Ө�c��������������@����… 66 …X�X�X�X,Y-Y.YvY�YZNZ�Z�Z&[n[�[�[)\]\G���ԟwW;( $)-15<CGE… 75 G������n=)&)+)# %-27;?@=2% 76 77 78 79 275/$.!G����Ӝ�6 *& "$&(*,/231+" 80 G���亖tU?8>GF;-$ (483)!$&#G������̭sH9<HVh�… 82 #%#G������c4"",42*" $3FZlx{wk]M=0$ 99 G���踉^9 %*17;<70' [all …]
|
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/it-IT/ |
D | it-IT_cm0_kpdf_phs.pkb | 1 � 01y��%&Z��-u��DEFG{��56… 14 …C�C)DqD�DEEEELE�E�EFSFTFUF�F�F(GpG�GHHH�H�H… 80 *����v;G��������… 83 …'(*+,G��﹄dO6 !'**)*/7@GLPTZ`ca[QHA?@EMV\`^YQHA<98:<@CEFED@<840G�������tF0*-8CB3##… 91 G������mdgquqjhotqdULIHC8* " 92 93 G���ĝ�y\;$ 94 95 96 $$ [all …]
|
/external/harfbuzz_ng/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 …]
|
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/en-GB/ |
D | en-GB_kh0_kpdf_phs.pkb | 22 …��F�G�H�I�J��������M�N���ޱ&�'�o�����G���׳س �h�… 23 …����)�q������K���������%�m���������G������g���… 24 �U�����-�u�v����N�����&�n�����F�G�H�I�����!�U�V�… 25 �R�����*�c�d�����<����������^�����'�o�����G�����… 36 …�=>J>K>L>M>�>�>�>�>'?(?p?q?r?s?t?�?�?G@H@I@�@�@�@… 66 %'&"G������ʿ���}m`ZZ_dc]RG<3,% 86 G�����κ���÷���}}�{tkaTE7+! 87 #$" 88 G���ӡzcXRKFCFKOOJC=988<BHLLD9-#!%).267751,&!!$&'''%# *������Ҿ���p[QNKB80+'$$(3D… 90 =������Ƭ�ykd`YOF?:620/.-*&" =������ƫ�{lda^WG3" [all …]
|
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/fr-FR/ |
D | fr-FR_nk0_kpdf_phs.pkb | 13 T��,-.v�N�������!U���… 14 GRG�G�G�G&HnH�H�H�H�H9I�I�IJYJ�J�J,K-K.KqK�K�K+L… 20 �C�D�E�F�G�H���ئ�^���̧������A���ѨҨ�b�c�d�����… 35 …�BCeC�C�C=D�D�DEXE�E�E&FnF�F�FAG�G�G�G�GHcH�H�… 39 …�T���߂'�o�����G���ׄ� �!�i����-�u����M���݇%�…
|
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/es-ES/ |
D | es-ES_zl0_kpdf_phs.pkb | 21 …G�H���د �h�i�j�k���������������I�J�K�L���ܱݱޱ߱… 39 …DD`D�D�D�D�DE`E�E�E8F�F�F�F�FGZG[G\G�G�GHH… 47 G����������hPJLLE8+ 48 &5IYZO;)!+5<=90% G�������ҧ�oicWJ>3&'1?RdnhVA1&$&-6>DC=2&… 68 G����ɌY@@O\ZRNMH>5110,'$&*,( 77 (/6;>?>>=>?BFLRY`gnty~��3�����ԫ�uu�������pXJFM_y��~X3 78 79 80 #.9AFE?7G����״��ǿ��ldb_VF3&!'8Rm{sY;$
|
/external/ImageMagick/PerlMagick/t/reference/read/ |
D | input_gray_lsb_double_mat.miff | 13 :?в22?�ܿ����?������?ιUYUYU?ַ?���@�@�?�5c�c�d?ȋ++?���s�s�?���`�`�?�xGGG?ڣNCNCN?��..… 16 …G!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?�… 21 …G�G�?�r1�1�2?�H?�r�ұҲ?�G�'�'�?ώ�n�n�?ӟ�߸߹?Ջ�����?�c�c�d?������?�#�����?�K���?�_�����?����… 24 …i?�[�����?�222?Ӳ\r\r\?�Ǹ��?�G�G�G�?�GGG?�1���?�r?�r22?�����?Ҝ���?Ҳ*�*�+?������?… 25 …G�G�?�r�2�2�?Ӳ�����?ӝN=N=N?��c�c�d?��]]?�ݎ=�=�?�2���?чUGUGU?����?���ոչ?��q�q�r?��*�*�+?�_��… 26 G 27 G?�I�����?�J�
|
/external/pcre/dist2/src/ |
D | pcre2test.c | 166 #define G(a,b) glue(a,b) macro 272 #define PCRE2_SUFFIX(a) G(a,8) 281 #define PCRE2_SUFFIX(a) G(a,16) 290 #define PCRE2_SUFFIX(a) G(a,32) 897 #define CASTFLD(t,a,b) ((test_mode == PCRE8_MODE)? (t)(G(a,8)->b) : \ 898 (test_mode == PCRE16_MODE)? (t)(G(a,16)->b) : (t)(G(a,32)->b)) 901 (test_mode == PCRE8_MODE)? (t)G(x,8) : \ 902 (test_mode == PCRE16_MODE)? (t)G(x,16) : (t)G(x,32)) 911 memcpy(G(a,8),G(b,8),sizeof(pcre2_match_context_8)); \ 913 memcpy(G(a,16),G(b,16),sizeof(pcre2_match_context_16)); \ [all …]
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
D | ReductionRules.h | 29 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/libcxx/test/std/thread/thread.threads/thread.thread.class/thread.thread.constr/ |
D | F.pass.cpp | 56 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() 160 std::thread t((G())); in main() 162 assert(G::n_alive == 0); in main() [all …]
|
D | move.pass.cpp | 23 class G class 30 G() : alive_(1) {++n_alive;} in G() function in G 31 G(const G& g) : alive_(g.alive_) {++n_alive;} in G() function in G 32 ~G() {alive_ = 0; --n_alive;} in ~G() 51 int G::n_alive = 0; 52 bool G::op_run = false; 57 G g; in main() 58 assert(G::n_alive == 1); in main() 59 assert(!G::op_run); in main() 66 assert(G::n_alive == 1); in main() [all …]
|
D | copy.fail.cpp | 21 class G class 28 G() : alive_(1) {++n_alive;} in G() function in G 29 G(const G& g) : alive_(g.alive_) {++n_alive;} in G() function in G 30 ~G() {alive_ = 0; --n_alive;} in ~G() 49 int G::n_alive = 0; 50 bool G::op_run = false; 55 assert(G::n_alive == 0); in main() 56 assert(!G::op_run); in main() 57 std::thread t0(G(), 5, 5.5); in main() 63 assert(G::n_alive == 0); in main() [all …]
|
/external/icu/icu4c/source/test/testdata/ |
D | regextst.txt | 37 # G Only check match / no match. Do not check capture group… 779 …[\074c\]V[|b\fu\r\0175\<\07f\066s[^D-\x5D]]])(?xx:^{5,}+)(?d)(?=^\D)|(?!\G)(?>\G)(?![^|\]\070\ne\{… 980 "[abcd-\N{LATIN SMALL LETTER G}]+" "xyz-<0>abcdefg</0>hij-" 1358 "^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$" G "<0>G1 1AA</0>" 1359 "^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$" G "<0>EH10 2QQ</0>" 1360 "^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$" G "<0>SW1 1ZZ</0>" 1365 #"^[\w-]+(?:\.[\w-]+)*@(?:[\w-]+\.)+[a-zA-Z]{2,7}$" G "<0>jack_rabbit@slims.com</0>" # TODO: \… 1366 #"^[\w-]+(?:\.[\w-]+)*@(?:[\w-]+\.)+[a-zA-Z]{2,7}$" G "<0>foo99@foo.co.uk</0>" # TODO: \w in p… 1369 …3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\]?)$" G "<0>asmith@mactec.co… 1370 …3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\]?)$" G "<0>foo12@foo.edu</0… [all …]
|
/external/mesa3d/src/gallium/drivers/nouveau/nv50/ |
D | nv50_formats.c | 126 C4(A, B8G8R8A8_UNORM, BGRA8_UNORM, B, G, R, A, UNORM, A8B8G8R8, ID), 127 F3(A, B8G8R8X8_UNORM, BGRX8_UNORM, B, G, R, xx, UNORM, A8B8G8R8, TD), 128 C4(A, B8G8R8A8_SRGB, BGRA8_SRGB, B, G, R, A, UNORM, A8B8G8R8, TD), 129 F3(A, B8G8R8X8_SRGB, BGRX8_SRGB, B, G, R, xx, UNORM, A8B8G8R8, TD), 130 C4(A, R8G8B8A8_UNORM, RGBA8_UNORM, R, G, B, A, UNORM, A8B8G8R8, IB), 131 F3(A, R8G8B8X8_UNORM, RGBX8_UNORM, R, G, B, xx, UNORM, A8B8G8R8, TB), 132 C4(A, R8G8B8A8_SRGB, RGBA8_SRGB, R, G, B, A, UNORM, A8B8G8R8, TB), 133 F3(A, R8G8B8X8_SRGB, RGBX8_SRGB, R, G, B, xx, UNORM, A8B8G8R8, TB), 138 SZ(A, X8Z24_UNORM, S8_Z24_UNORM, G, G, G, xx, UNORM, Z24S8, TZ), 140 SZ(A, S8_UINT_Z24_UNORM, S8_Z24_UNORM, G, G, G, xx, UNORM, Z24S8, TZ), [all …]
|
/external/llvm/include/llvm/ADT/ |
D | DepthFirstIterator.h | 133 static df_iterator begin(const GraphT &G) { in begin() argument 134 return df_iterator(GT::getEntryNode(G)); in begin() 136 static df_iterator end(const GraphT &G) { return df_iterator(); } in end() argument 139 static df_iterator begin(const GraphT &G, SetType &S) { in begin() argument 140 return df_iterator(GT::getEntryNode(G), S); in begin() 142 static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); } in end() argument 201 df_iterator<T> df_begin(const T& G) { in df_begin() argument 202 return df_iterator<T>::begin(G); in df_begin() 206 df_iterator<T> df_end(const T& G) { in df_end() argument 207 return df_iterator<T>::end(G); in df_end() [all …]
|
D | PostOrderIterator.h | 137 static po_iterator begin(GraphT G) { in begin() argument 138 return po_iterator(GT::getEntryNode(G)); in begin() 140 static po_iterator end(GraphT G) { return po_iterator(); } in end() argument 142 static po_iterator begin(GraphT G, SetType &S) { in begin() argument 143 return po_iterator(GT::getEntryNode(G), S); in begin() 145 static po_iterator end(GraphT G, SetType &S) { return po_iterator(S); } in end() argument 178 po_iterator<T> po_begin(const T &G) { return po_iterator<T>::begin(G); } in po_begin() argument 180 po_iterator<T> po_end (const T &G) { return po_iterator<T>::end(G); } in po_end() argument 182 template <class T> iterator_range<po_iterator<T>> post_order(const T &G) { in post_order() argument 183 return make_range(po_begin(G), po_end(G)); in post_order() [all …]
|
/external/llvm/include/llvm/CodeGen/ |
D | RegAllocPBQP.h | 348 RegAllocSolverImpl(Graph &G) : G(G) {} in RegAllocSolverImpl() argument 351 G.setSolver(*this); in solve() 354 S = backpropagate(G, reduce()); in solve() 355 G.unsetSolver(); in solve() 360 assert(G.getNodeCosts(NId).getLength() > 1 && in handleAddNode() 362 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); in handleAddNode() 368 handleReconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleAddEdge() 369 handleReconnectEdge(EId, G.getEdgeNode2Id(EId)); in handleAddEdge() 373 handleDisconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleRemoveEdge() 374 handleDisconnectEdge(EId, G.getEdgeNode2Id(EId)); in handleRemoveEdge() [all …]
|
/external/doclava/res/assets/templates/assets/ |
D | jquery-resizable.min.js | 12 …G=D.exec(E);if(G&&(G[1]||!H)){if(G[1]){E=o.clean([G[1]],H)}else{var I=document.getElementById(G[3]… argument 19 …G){hasDuplicate=false;ab.sort(G);if(hasDuplicate){for(var aa=1;aa<ab.length;aa++){if(ab[aa]===ab[a… argument
|
/external/ImageMagick/PerlMagick/t/ |
D | input_gray_lsb_double.mat | 1 … IM@fG.Pg f… 4 …?�q�1��?�qG��?�8��8d�?�8��1�?UUUUH�?UUUU�5�?����*^�?UUUUU��?9��8���?��8�c3�?q�q��?�q�q��?�8… 5 …G�?�b�?q�q��?�8��x��?�qDZI�?�8��8_�?UUUU���?�;�?UUUUU��?8��8�!�?����*��?�8�㸢�?����*��?U… 7 …G��?s�q���?UUUUU��?�8��_�?������?����� �?9��8� �?r�q\��?9��8_�?������?UUUU��?�q�g�?s�q���?… 9 …G��?9��8N��?�qlj�?UUUUU��?s�q��?8��8���?�8����?����j�?�q�15�?�8��x��?�8��x��?s�q���?���?…
|
/external/icu/icu4c/source/data/locales/ |
D | th.txt | 182 "EEEEที่ d MMMM G y", 195 Gy{"G y"} 196 GyMMM{"MMM G y"} 197 GyMMMEEEEd{"EEEEที่ d MMM G y"} 198 GyMMMEd{"E d MMM G y"} 199 GyMMMd{"d MMM G y"} 218 y{"G y"} 219 yyyy{"G y"} 999 "EEEEที่ d MMMM G y", 1000 "d MMMM G y", [all …]
|
D | en_IN.txt | 22 "EEEE d MMMM y G", 23 "d MMMM y G", 24 "dd-MMM-y G", 33 yyyyMEd{"E d/M/y G"} 34 yyyyMMMEd{"E d MMM, y G"} 35 yyyyMd{"d/M/y G"} 39 M{"MM/y – MM/y G"} 40 y{"MM/y – MM/y G"} 43 M{"E dd/MM/y – E dd/MM/y G"} 44 d{"E dd/MM/y – E dd/MM/y G"} [all …]
|
D | bs_Cyrl.txt | 219 "EEEE, dd. MMMM y. G", 220 "dd. MMMM y. G", 221 "dd.MM.y. G", 231 Gy{"y. G"} 232 GyMMM{"MMM y. G"} 233 GyMMMEd{"E, dd. MMM y. G"} 234 GyMMMd{"dd. MMM y. G"} 248 y{"y. G"} 249 yyyy{"y. G"} 250 yyyyM{"MM.y. G"} [all …]
|
/external/libcxx/test/std/thread/thread.threads/thread.thread.class/thread.thread.assign/ |
D | move.pass.cpp | 21 class G class 28 G() : alive_(1) {++n_alive;} in G() function in G 29 G(const G& g) : alive_(g.alive_) {++n_alive;} in G() function in G 30 ~G() {alive_ = 0; --n_alive;} in ~G() 42 int G::n_alive = 0; 43 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() 60 assert(G::n_alive == 0); in main() [all …]
|
/external/llvm/lib/CodeGen/ |
D | RegAllocPBQP.cpp | 136 void initializeGraph(PBQPRAGraph &G, VirtRegMap &VRM, Spiller &VRegSpiller); 145 bool mapPBQPToRegAlloc(const PBQPRAGraph &G, 163 void apply(PBQPRAGraph &G) override { in apply() argument 164 LiveIntervals &LIS = G.getMetadata().LIS; in apply() 170 for (auto NId : G.nodeIds()) { in apply() 172 LIS.getInterval(G.getNodeMetadata(NId).getVReg()).weight; in apply() 177 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId)); in apply() 179 G.setNodeCosts(NId, std::move(NodeCosts)); in apply() 195 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs() argument 198 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs(); in haveDisjointAllowedRegs() [all …]
|