/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 | 188 #define G OT_GLYPHID macro 237 G(198) G(200) G(201) G(202) G(203) G(204) G(205) G(206) G(211) 238 G(212) G(213) G(214) G(223) G(225) G(227) G(228) G(236) G(237), 239 G(162) G(4) G(5) G(5) G(6) G(7) G(9) G(11) G(13) 240 G(14) G(15) G(26) G(140) G(141) G(142) G(143) G(154) G(154) 243 G(218) G(219) G(221) G(222) G(229), 244 G(27) G(30) G(128) G(131) G(144) 247 G(218) G(219) G(221) G(222) G(229), 248 G(28) G(31) G(129) G(138) G(149) 251 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/libcxx/test/std/thread/thread.threads/thread.thread.class/thread.thread.constr/ |
D | F.pass.cpp | 47 class G class 54 G() : alive_(1) {++n_alive;} in G() function in G 55 G(const G& g) : alive_(g.alive_) {++n_alive;} in G() function in G 56 ~G() {alive_ = 0; --n_alive;} in ~G() 75 int G::n_alive = 0; 76 bool G::op_run = false; 116 assert(G::n_alive == 0); in main() 117 assert(!G::op_run); in main() 118 std::thread t((G())); in main() 120 assert(G::n_alive == 0); 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 …]
|
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; 58 assert(G::n_alive == 0); in main() 59 assert(!G::op_run); in main() 60 std::thread t0(G(), 5, 5.5); in main() 66 assert(G::n_alive == 0); in main() [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/icu/icu4c/source/test/testdata/ |
D | regextst.txt | 35 # G Only check match / no match. Do not check capture group… 777 …[\074c\]V[|b\fu\r\0175\<\07f\066s[^D-\x5D]]])(?xx:^{5,}+)(?d)(?=^\D)|(?!\G)(?>\G)(?![^|\]\070\ne\{… 978 "[abcd-\N{LATIN SMALL LETTER G}]+" "xyz-<0>abcdefg</0>hij-" 1327 "^[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>" 1328 "^[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>" 1329 "^[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>" 1334 #"^[\w-]+(?:\.[\w-]+)*@(?:[\w-]+\.)+[a-zA-Z]{2,7}$" G "<0>jack_rabbit@slims.com</0>" # TODO: \… 1335 #"^[\w-]+(?:\.[\w-]+)*@(?:[\w-]+\.)+[a-zA-Z]{2,7}$" G "<0>foo99@foo.co.uk</0>" # TODO: \w in p… 1338 …3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\]?)$" G "<0>asmith@mactec.co… 1339 …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/mesa/main/ |
D | colormac.h | 75 #define PACK_COLOR_5551( R, G, B, A ) \ argument 76 ((((R) & 0xf8) << 8) | (((G) & 0xf8) << 3) | (((B) & 0xf8) >> 2) | \ 79 #define PACK_COLOR_1555( A, B, G, R ) \ argument 80 ((((B) & 0xf8) << 7) | (((G) & 0xf8) << 2) | (((R) & 0xf8) >> 3) | \ 83 #define PACK_COLOR_1555_REV( A, B, G, R ) \ argument 84 ((((B) & 0xf8) >> 1) | (((G) & 0xc0) >> 6) | (((G) & 0x38) << 10) | (((R) & 0xf8) << 5) | \ 87 #define PACK_COLOR_2101010_UB( A, B, G, R ) \ argument 88 (((B) << 22) | ((G) << 12) | ((R) << 2) | \ 91 #define PACK_COLOR_2101010_US( A, B, G, R ) \ argument 92 ((((B) >> 6) << 20) | (((G) >> 6) << 10) | ((R) >> 6) | \ [all …]
|
/external/icu/icu4c/source/data/locales/ |
D | chr.txt | 48 "EEEE, MMMM d, y G", 49 "MMMM d, y G", 50 "MMM d, y G", 59 Gy{"y G"} 60 GyMMM{"MMM y G"} 61 GyMMMEd{"E, MMM d, y G"} 62 GyMMMd{"MMM d, y G"} 70 y{"y G"} 71 yyyy{"y G"} 72 yyyyM{"M/y G"} [all …]
|
D | be.txt | 38 "EEEE, d MMMM y G", 39 "d MMMM y G", 40 "d MMM y G", 50 Gy{"G y"} 62 y{"G y"} 65 yMMM{"MMM y G"} 66 yMMMEd{"E, d MMM y G"} 67 yMMMd{"d MMM y G"} 77 "EEEE, d MMMM y G", 78 "d MMMM y G", [all …]
|
D | th.txt | 150 "EEEEที่ d MMMM G y", 162 Gy{"G y"} 163 GyMMM{"MMM G y"} 164 GyMMMEEEEd{"EEEEที่ d MMM G y"} 165 GyMMMEd{"E d MMM G y"} 166 GyMMMd{"d MMM G y"} 185 y{"G y"} 186 yyyy{"G y"} 966 "EEEEที่ d MMMM G y", 967 "d MMMM G y", [all …]
|
D | bs_Cyrl.txt | 225 "EEEE, dd. MMMM y. G", 226 "dd. MMMM y. G", 227 "dd.MM.y. G", 237 Gy{"y. G"} 238 GyMMM{"MMM y. G"} 239 GyMMMEd{"E, dd. MMM y. G"} 240 GyMMMd{"dd. MMM y. G"} 254 y{"y. G"} 255 yyyy{"y. G"} 256 yyyyM{"MM.y. G"} [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 200 df_iterator<T> df_begin(const T& G) { in df_begin() argument 201 return df_iterator<T>::begin(G); in df_begin() 205 df_iterator<T> df_end(const T& G) { in df_end() argument 206 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/openfst/src/test/ |
D | fst_test.h | 62 template <class G> 63 void TestBase(const G &fst) const { in TestBase() 67 StateIterator<G> siter(fst); in TestBase() 68 Matcher<G> matcher(fst, MATCH_INPUT); in TestBase() 76 ArcIterator<G> aiter(fst, s); in TestBase() 110 template <class G> 111 void TestExpanded(const G &fst) const { in TestExpanded() 113 for (StateIterator<G> siter(fst); in TestExpanded() 125 template <class G> 126 void TestMutable(G *fst) const { in TestMutable() [all …]
|
/external/llvm/include/llvm/CodeGen/ |
D | RegAllocPBQP.h | 347 RegAllocSolverImpl(Graph &G) : G(G) {} in RegAllocSolverImpl() argument 350 G.setSolver(*this); in solve() 353 S = backpropagate(G, reduce()); in solve() 354 G.unsetSolver(); in solve() 359 assert(G.getNodeCosts(NId).getLength() > 1 && in handleAddNode() 361 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); in handleAddNode() 367 handleReconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleAddEdge() 368 handleReconnectEdge(EId, G.getEdgeNode2Id(EId)); in handleAddEdge() 372 handleDisconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleRemoveEdge() 373 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/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; 49 assert(G::n_alive == 0); in main() 50 assert(!G::op_run); in main() 51 std::thread t0(G(), 5, 5.5); in main() 58 assert(G::n_alive == 0); in main() [all …]
|
/external/llvm/lib/CodeGen/ |
D | RegAllocPBQP.cpp | 129 void initializeGraph(PBQPRAGraph &G, VirtRegMap &VRM, Spiller &VRegSpiller); 138 bool mapPBQPToRegAlloc(const PBQPRAGraph &G, 155 void apply(PBQPRAGraph &G) override { in apply() argument 156 LiveIntervals &LIS = G.getMetadata().LIS; in apply() 162 for (auto NId : G.nodeIds()) { in apply() 164 LIS.getInterval(G.getNodeMetadata(NId).getVReg()).weight; in apply() 169 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId)); in apply() 171 G.setNodeCosts(NId, std::move(NodeCosts)); in apply() 187 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs() argument 190 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs(); in haveDisjointAllowedRegs() [all …]
|
/external/llvm/lib/Analysis/ |
D | LazyCallGraph.cpp | 56 LazyCallGraph::Node::Node(LazyCallGraph &G, Function &F) in Node() argument 57 : G(&G), F(F), DFSNumber(0), LowLink(0) { in Node() 79 if (Node *N = G->lookup(Callee)) in insertEdgeInternal() 133 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G) in LazyCallGraph() argument 134 : BPA(std::move(G.BPA)), NodeMap(std::move(G.NodeMap)), in LazyCallGraph() 135 EntryNodes(std::move(G.EntryNodes)), in LazyCallGraph() 136 EntryIndexMap(std::move(G.EntryIndexMap)), SCCBPA(std::move(G.SCCBPA)), in LazyCallGraph() 137 SCCMap(std::move(G.SCCMap)), LeafSCCs(std::move(G.LeafSCCs)), in LazyCallGraph() 138 DFSStack(std::move(G.DFSStack)), in LazyCallGraph() 139 SCCEntryNodes(std::move(G.SCCEntryNodes)), in LazyCallGraph() [all …]
|