/external/icu4c/data/unidata/ |
D | EastAsianWidth.txt | 15 # "N", "A", "H", "W", "F", "Na" 17 # explicitly are given the value "N". 38 # @missing: 0000..10FFFF; N 39 0000..001F;N 41 007F..00A0;N 47 00A9;N 49 00AB;N 54 00B5;N 56 00BB;N 58 00C0..00C5;N [all …]
|
D | UnicodeData.txt | 1 0000;<control>;Cc;0;BN;;;;;N;NULL;;;; 2 0001;<control>;Cc;0;BN;;;;;N;START OF HEADING;;;; 3 0002;<control>;Cc;0;BN;;;;;N;START OF TEXT;;;; 4 0003;<control>;Cc;0;BN;;;;;N;END OF TEXT;;;; 5 0004;<control>;Cc;0;BN;;;;;N;END OF TRANSMISSION;;;; 6 0005;<control>;Cc;0;BN;;;;;N;ENQUIRY;;;; 7 0006;<control>;Cc;0;BN;;;;;N;ACKNOWLEDGE;;;; 8 0007;<control>;Cc;0;BN;;;;;N;BELL;;;; 9 0008;<control>;Cc;0;BN;;;;;N;BACKSPACE;;;; 10 0009;<control>;Cc;0;S;;;;;N;CHARACTER TABULATION;;;; [all …]
|
/external/chromium/sdch/open-vcdiff/src/ |
D | codetable.cc | 78 { N, // opcode 0 79 N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, // opcodes 1-18 80 N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, // opcodes 19-34 81 N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, // opcodes 35-50 82 N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, // opcodes 51-66 83 N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, // opcodes 67-82 84 N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, // opcodes 83-98 85 N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, // opcodes 99-114 86 N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, // opcodes 115-130 87 N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, // opcodes 131-146 [all …]
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
D | LegalizeTypes.h | 77 bool IgnoreNodeResults(SDNode *N) const { in IgnoreNodeResults() argument 78 return N->getOpcode() == ISD::TargetConstant; in IgnoreNodeResults() 139 SDNode *AnalyzeNewNode(SDNode *N); 141 void ExpungeNode(SDNode *N); 143 void RemapValue(SDValue &N); 149 bool CustomLowerNode(SDNode *N, EVT VT, bool LegalizeResult); 150 bool CustomWidenLowerNode(SDNode *N, EVT VT); 153 SDValue LibCallify(RTLIB::Libcall LC, SDNode *N, bool isSigned); 208 void PromoteIntegerResult(SDNode *N, unsigned ResNo); 209 SDValue PromoteIntRes_AssertSext(SDNode *N); [all …]
|
D | LegalizeFloatTypes.cpp | 45 void DAGTypeLegalizer::SoftenFloatResult(SDNode *N, unsigned ResNo) { in SoftenFloatResult() argument 46 DEBUG(dbgs() << "Soften float result " << ResNo << ": "; N->dump(&DAG); in SoftenFloatResult() 50 switch (N->getOpcode()) { in SoftenFloatResult() 54 N->dump(&DAG); dbgs() << "\n"; in SoftenFloatResult() 58 case ISD::BITCAST: R = SoftenFloatRes_BITCAST(N); break; in SoftenFloatResult() 59 case ISD::BUILD_PAIR: R = SoftenFloatRes_BUILD_PAIR(N); break; in SoftenFloatResult() 61 R = SoftenFloatRes_ConstantFP(cast<ConstantFPSDNode>(N)); in SoftenFloatResult() 64 R = SoftenFloatRes_EXTRACT_VECTOR_ELT(N); break; in SoftenFloatResult() 65 case ISD::FABS: R = SoftenFloatRes_FABS(N); break; in SoftenFloatResult() 66 case ISD::FADD: R = SoftenFloatRes_FADD(N); break; in SoftenFloatResult() [all …]
|
D | LegalizeIntegerTypes.cpp | 36 void DAGTypeLegalizer::PromoteIntegerResult(SDNode *N, unsigned ResNo) { in PromoteIntegerResult() argument 37 DEBUG(dbgs() << "Promote integer result: "; N->dump(&DAG); dbgs() << "\n"); in PromoteIntegerResult() 41 if (CustomLowerNode(N, N->getValueType(ResNo), true)) in PromoteIntegerResult() 44 switch (N->getOpcode()) { in PromoteIntegerResult() 48 N->dump(&DAG); dbgs() << "\n"; in PromoteIntegerResult() 51 case ISD::AssertSext: Res = PromoteIntRes_AssertSext(N); break; in PromoteIntegerResult() 52 case ISD::AssertZext: Res = PromoteIntRes_AssertZext(N); break; in PromoteIntegerResult() 53 case ISD::BITCAST: Res = PromoteIntRes_BITCAST(N); break; in PromoteIntegerResult() 54 case ISD::BSWAP: Res = PromoteIntRes_BSWAP(N); break; in PromoteIntegerResult() 55 case ISD::BUILD_PAIR: Res = PromoteIntRes_BUILD_PAIR(N); break; in PromoteIntegerResult() [all …]
|
D | LegalizeVectorTypes.cpp | 34 void DAGTypeLegalizer::ScalarizeVectorResult(SDNode *N, unsigned ResNo) { in ScalarizeVectorResult() argument 36 N->dump(&DAG); in ScalarizeVectorResult() 40 switch (N->getOpcode()) { in ScalarizeVectorResult() 44 N->dump(&DAG); in ScalarizeVectorResult() 49 case ISD::BITCAST: R = ScalarizeVecRes_BITCAST(N); break; in ScalarizeVectorResult() 50 case ISD::BUILD_VECTOR: R = N->getOperand(0); break; in ScalarizeVectorResult() 51 case ISD::CONVERT_RNDSAT: R = ScalarizeVecRes_CONVERT_RNDSAT(N); break; in ScalarizeVectorResult() 52 case ISD::EXTRACT_SUBVECTOR: R = ScalarizeVecRes_EXTRACT_SUBVECTOR(N); break; in ScalarizeVectorResult() 53 case ISD::FP_ROUND: R = ScalarizeVecRes_FP_ROUND(N); break; in ScalarizeVectorResult() 54 case ISD::FP_ROUND_INREG: R = ScalarizeVecRes_InregOp(N); break; in ScalarizeVectorResult() [all …]
|
D | LegalizeTypesGeneric.cpp | 35 void DAGTypeLegalizer::ExpandRes_BITCAST(SDNode *N, SDValue &Lo, SDValue &Hi) { in ExpandRes_BITCAST() argument 36 EVT OutVT = N->getValueType(0); in ExpandRes_BITCAST() 38 SDValue InOp = N->getOperand(0); in ExpandRes_BITCAST() 40 DebugLoc dl = N->getDebugLoc(); in ExpandRes_BITCAST() 145 void DAGTypeLegalizer::ExpandRes_BUILD_PAIR(SDNode *N, SDValue &Lo, in ExpandRes_BUILD_PAIR() argument 148 Lo = N->getOperand(0); in ExpandRes_BUILD_PAIR() 149 Hi = N->getOperand(1); in ExpandRes_BUILD_PAIR() 152 void DAGTypeLegalizer::ExpandRes_EXTRACT_ELEMENT(SDNode *N, SDValue &Lo, in ExpandRes_EXTRACT_ELEMENT() argument 154 GetExpandedOp(N->getOperand(0), Lo, Hi); in ExpandRes_EXTRACT_ELEMENT() 155 SDValue Part = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue() ? in ExpandRes_EXTRACT_ELEMENT() [all …]
|
D | DAGCombiner.cpp | 76 void AddUsersToWorkList(SDNode *N) { in AddUsersToWorkList() argument 77 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end(); in AddUsersToWorkList() 84 SDValue visit(SDNode *N); 89 void AddToWorkList(SDNode *N) { in AddToWorkList() argument 90 removeFromWorkList(N); in AddToWorkList() 91 WorkList.push_back(N); in AddToWorkList() 96 void removeFromWorkList(SDNode *N) { in removeFromWorkList() argument 97 WorkList.erase(std::remove(WorkList.begin(), WorkList.end(), N), in removeFromWorkList() 101 SDValue CombineTo(SDNode *N, const SDValue *To, unsigned NumTo, 104 SDValue CombineTo(SDNode *N, SDValue Res, bool AddTo = true) { in CombineTo() argument [all …]
|
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/de-DE/ |
D | de-DE_lexpos.utf | 448 ADJ^ADV^CARD^N "weniger" "'ve:nIg6" 449 ADJ^ADV^N "fest" "'fEst" 450 ADJ^ADV^N "gerne" "'gE^6n@" 451 ADJ^ADV^N "nahe" "'na:@" 452 ADJ^ADV^N "später" "'SpE:t6" 458 ADJ^CARD^N "einigen" "'?a_inIg=n" 459 ADJ^CARD^N "wenige" "'ve:nIg@" 460 ADJ^CARD^N^V "einige" "'?a_inIg@" 461 ADJ^DET^N "mancher" "'manC6" 462 ADJ^DET^N "manches" "'manC@s" [all …]
|
D | de-DE_kdt_posd.utf | 14 …N,DET^N^PRO,DET^N^V,DET^PREF_V,DET^V node_yes = 2 subset = 0,ADJ^ADV^V,ADJ^DET^N,ADJ^POSTP,ADJ^POS… 15 node_num = 2 quest_num = 4 subset = ADJ,N^POSTP,N^V_PART,N^PREP,V_PART,DET^N,N,ADJ^N,ADV^N node_yes… 16 node_num = 3 quest_num = 3 subset = ADJ^ADV^PREP,ADV^CONJ_SUB,ADV^N^PREP,ADV^PREP,CONJ_SUB^PREP,CON… 17 node_num = 4 quest_num = 3 subset = DET^N node_yes = 8 node_no = 9 20 …st_num = 3 subset = ADJ^ADV,ADJ^ADV^CARD^N,ADJ^ADV^N,ADJ^CARD^N^V,ADJ^N^V,ADJ^CARD,ADJ^CARD^N,ADJ^… 23 …N,CONJ_SUB^PREF_V^PREP,N^Q_PTCL,PREF_V,DET^V,DET^PREF_V node_yes = 22 subset = CONJ_SUB^N,V^V_PART… 24 node_num = 11 quest_num = 3 subset = DET^N^V,DET^V node_yes = 26 subset = DET^PREF_V node_yes = 27 … 25 …N,POSTP^PREF_V^PREP,POSTP^PREP,PREF_V^PREP,PREP,PRO_REL^Q_DET^Q_PTCL,ADV^PREP,CONJ_CO^PTCL^Q_PTCL,… 27 …num = 3 subset = ADJ^ADV node_yes = 33 subset = ADJ^ADV^CARD^N,ADJ^ADV^N,ADJ^CARD^N^V,ADJ^N^V node… 29 …_num = 16 quest_num = 3 subset = ADV^N^V,DET^N^V_INF,N^V,N^V^V_INF,N^V_INF,V^V_INF node_yes = 39 s… [all …]
|
D | de-DE_kdt_posp.utf | 4203 node_num = 4190 decision = N 4205 node_num = 4192 decision = N 4206 node_num = 4193 decision = N 4208 node_num = 4195 decision = N 4210 node_num = 4197 decision = N 4211 node_num = 4198 decision = N 4213 node_num = 4200 decision = N 4214 node_num = 4201 decision = N 4215 node_num = 4202 decision = N 4216 node_num = 4203 decision = N [all …]
|
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/en-US/ |
D | en-US_lexpos.utf | 459 ADJ "strongest" "str'O:N@st" 546 ADJ^ADV "headlong" "h'edlO:N" 556 ADJ^ADV^N "just" "d_Z'Vst" 557 ADJ^ADV^N "second" "s'ek@nd" 558 ADJ^ADV^N "then" "D'en" 559 ADJ^ADV^N^V "right" "r'a_It" 568 ADJ^CONJ_SUB^N^PREP^V "like" "l'a_Ik" 572 ADJ^N "abolition" :G2P 573 ADJ^N "acid" :G2P 574 ADJ^N "acute" :G2P [all …]
|
D | en-US_kdt_posd.utf | 14 …N^PREP,N^PREP,N^PREP^V,ADV^PREP,ADJ^N_ING^PREP,N_ING^PREP,ADJ^CONJ_SUB^N^PREP^V,ADJ^N^PREP,ADJ^N^P… 16 node_num = 3 quest_num = 3 subset = N^V node_yes = 7 node_no = 8 17 node_num = 4 quest_num = 3 subset = ADJ^N^V_PAST,CONJ_CO^PREP,N^PRO,N^V_MODAL,N_GEN^PRO,N_GEN^PRO^P… 22 node_num = 9 quest_num = 3 subset = CONJ_CO^PREP node_yes = 21 subset = N^V_MODAL node_yes = 22 nod… 26 …ADJ^N_ING^PREP,ADJ^CONJ_SUB^PREP,ADJ^PREP node_yes = 34 subset = ADV^N^PREP,N^PREP,N^PREP^V node_y… 27 node_num = 14 quest_num = 3 subset = ADV^N^PREP,N^PREP,N^PREP^V node_yes = 37 subset = CONJ_INF^PRE… 34 …N^PREP,ADJ^N_ING^PREP^V,ADJ^PREP,CONJ_INF^PREP,PREP,ADJ^CONJ_SUB^N^PREP^V,ADJ^ADV^PREP,CONJ_SUB^PR… 35 node_num = 22 quest_num = 2 subset = 0,PRO_V,PRO,CONJ_INF,Q_PTCL node_yes = 3052 subset = N,ADJ,ADV… 36 node_num = 23 quest_num = 3 subset = ADJ^N^V_PAST node_yes = 56 subset = N_GEN^PRO_V node_yes = 57 … 37 …N,ADJ^N^PREP,ADJ^N_ING,CARD,N,N_ING^V_AUX,ADJ^ADV,N^V,ADJ^N^V,ADJ^ADV^N,ADJ^N_ING^V,ADJ^V_PAST,ADJ… [all …]
|
/external/iptables/utils/ |
D | pf.os | 140 # N - NOP option 203 16384:64:0:60:M512,N,W%2,N,N,T: AIX:4.3:3:AIX 4.3.3-5.2 204 16384:64:0:60:M512,N,W%2,N,N,T: AIX:5.1-5.2::AIX 4.3.3-5.2 205 32768:64:0:60:M512,N,W%2,N,N,T: AIX:4.3:3:AIX 4.3.3-5.2 206 32768:64:0:60:M512,N,W%2,N,N,T: AIX:5.1-5.2::AIX 4.3.3-5.2 207 65535:64:0:60:M512,N,W%2,N,N,T: AIX:4.3:3:AIX 4.3.3-5.2 208 65535:64:0:60:M512,N,W%2,N,N,T: AIX:5.1-5.2::AIX 4.3.3-5.2 209 65535:64:0:64:M*,N,W1,N,N,T,N,N,S: AIX:5.3:ML1:AIX 5.3 ML1 222 S4:64:1:60:M1360,S,T,N,W0: Linux:google::Linux (Google crawlbot) 224 S2:64:1:60:M*,S,T,N,W0: Linux:2.4::Linux 2.4 (big boy) [all …]
|
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/en-GB/ |
D | en-GB_lexpos.utf | 724 ADJ^ADV^N "just" "d_Z'Vst" 725 ADJ^ADV^N "second" "s'ek@nd" 726 ADJ^ADV^N "then" "D'en" 727 ADJ^ADV^N^V "right" "r'a_It" 735 ADJ^CONJ_SUB^N^PREP^V "like" "l'a_Ik" 739 ADJ^N "aberdeen" :G2P 740 ADJ^N "able" :G2P 741 ADJ^N "abolition" :G2P 742 ADJ^N "academic" :G2P 743 ADJ^N "acid" :G2P [all …]
|
D | en-GB_kdt_posd.utf | 14 …N^PREP,ADV^PREP,ADJ^CONJ_SUB^N^PREP^V,ADJ^N^PREP,ADJ^N^PREP^V,ADJ^CONJ_SUB^PREP,ADJ^N_ING^PREP,ADJ… 16 node_num = 3 quest_num = 3 subset = ADJ^N,ADJ^N^V node_yes = 7 subset = N^V node_yes = 8 node_no = … 17 node_num = 4 quest_num = 3 subset = CONJ_CO^PREP,N^PRO,N^V_MODAL,N_GEN^PRO,N_GEN^PRO^PRO_V,N_GEN^PR… 23 node_num = 10 quest_num = 3 subset = CONJ_CO^PREP node_yes = 24 subset = N^V_MODAL node_yes = 25 no… 28 …NJ_INF^PREP,CONJ_SUB^PREP,CONJ_SUB^PREP^V node_yes = 41 subset = ADV^N^PREP,N^PREP,N^PREP^V node_y… 31 node_num = 18 quest_num = 3 subset = ADJ^N^V node_yes = 48 node_no = 49 37 …N^PREP^V,ADJ^N^PREP,ADJ^ADV^PREP,ADJ^N_ING^PREP^V,ADJ^PREP,CONJ_INF^PREP,PREP,N^PREP,CONJ_CO^PREP,… 40 …DV,CARD,ADJ^ADV^N,ADJ^N_ING,ADJ^N^V,ADJ^ADV^N^V,N^V,ADJ^V,ADJ^N,N,ADJ^N^PREP,ADJ^N_ING^V,N_GEN,N_I… 43 …N^PREP^V,N,ADJ^N^PREP,ADJ^N_ING^V_AUX,ADJ^PREP,N_GEN,PREP,N_ING,N_GEN^PRO,N_GEN^PRO^PRO_V,N_GEN^PR… 44 …ONJ_SUB node_yes = 78 subset = ADV^V,CONJ_SUB^PREP^V,N^N_ING,PRO^PRO_V^V_AUX,V^V_PAST,ADJ^N^PREP^V… [all …]
|
D | en-GB_kdt_posp.utf | 3988 node_num = 3975 decision = N 3990 node_num = 3977 decision = N 3994 node_num = 3981 decision = N 3996 node_num = 3983 decision = N 3997 node_num = 3984 decision = N 3999 node_num = 3986 decision = N 4002 node_num = 3989 decision = N 4003 node_num = 3990 decision = N 4004 node_num = 3991 decision = N 4006 node_num = 3993 decision = N [all …]
|
/external/libpcap/ |
D | scanner.l | 80 N ([0-9]+|(0X|0x)[0-9A-Fa-f]+) 137 V6604 {W}:{W}:{W}:{W}:{W}:{W}:{N}\.{N}\.{N}\.{N} 139 V6504 ::{W}:{W}:{W}:{W}:{W}:{N}\.{N}\.{N}\.{N} 140 V6514 {W}::{W}:{W}:{W}:{W}:{N}\.{N}\.{N}\.{N} 141 V6524 {W}:{W}::{W}:{W}:{W}:{N}\.{N}\.{N}\.{N} 142 V6534 {W}:{W}:{W}::{W}:{W}:{N}\.{N}\.{N}\.{N} 143 V6544 {W}:{W}:{W}:{W}::{W}:{N}\.{N}\.{N}\.{N} 144 V6554 {W}:{W}:{W}:{W}:{W}::{N}\.{N}\.{N}\.{N} 146 V6404 ::{W}:{W}:{W}:{W}:{N}\.{N}\.{N}\.{N} 147 V6414 {W}::{W}:{W}:{W}:{N}\.{N}\.{N}\.{N} [all …]
|
/external/flac/libFLAC/ |
D | window.c | 51 const FLAC__int32 N = L - 1; in FLAC__window_bartlett() local 55 for (n = 0; n <= N/2; n++) in FLAC__window_bartlett() 56 window[n] = 2.0f * n / (float)N; in FLAC__window_bartlett() 57 for (; n <= N; n++) in FLAC__window_bartlett() 58 window[n] = 2.0f - 2.0f * n / (float)N; in FLAC__window_bartlett() 62 window[n] = 2.0f * n / (float)N; in FLAC__window_bartlett() 63 for (; n <= N; n++) in FLAC__window_bartlett() 64 window[n] = 2.0f - 2.0f * (N-n) / (float)N; in FLAC__window_bartlett() 70 const FLAC__int32 N = L - 1; in FLAC__window_bartlett_hann() local 74 …FLAC__real)(0.62f - 0.48f * fabs((float)n/(float)N+0.5f) + 0.38f * cos(2.0f * M_PI * ((float)n/(fl… in FLAC__window_bartlett_hann() [all …]
|
/external/llvm/lib/Target/ARM/ |
D | ARMISelDAGToDAG.cpp | 87 SDNode *Select(SDNode *N); 90 bool hasNoVMLxHazardUse(SDNode *N) const; 93 bool SelectShifterOperandReg(SDValue N, SDValue &A, 96 bool SelectShiftShifterOperandReg(SDValue N, SDValue &A, in SelectShiftShifterOperandReg() argument 99 return SelectShifterOperandReg(N, A, B, C, false); in SelectShiftShifterOperandReg() 102 bool SelectAddrModeImm12(SDValue N, SDValue &Base, SDValue &OffImm); 103 bool SelectLdStSOReg(SDValue N, SDValue &Base, SDValue &Offset, SDValue &Opc); 105 AddrMode2Type SelectAddrMode2Worker(SDValue N, SDValue &Base, 107 bool SelectAddrMode2Base(SDValue N, SDValue &Base, SDValue &Offset, in SelectAddrMode2Base() argument 109 return SelectAddrMode2Worker(N, Base, Offset, Opc) == AM2_BASE; in SelectAddrMode2Base() [all …]
|
/external/llvm/utils/TableGen/ |
D | DAGISelMatcherGen.cpp | 112 void EmitMatchCode(const TreePatternNode *N, TreePatternNode *NodeNoTypes); 113 void EmitLeafMatchCode(const TreePatternNode *N); 114 void EmitOperatorMatchCode(const TreePatternNode *N, 127 const TreePatternNode *N); 129 void EmitResultOperand(const TreePatternNode *N, 131 void EmitResultOfNamedOperand(const TreePatternNode *N, 133 void EmitResultLeafAsOperand(const TreePatternNode *N, 135 void EmitResultInstructionAsOperand(const TreePatternNode *N, 137 void EmitResultSDNodeXFormAsOperand(const TreePatternNode *N, 202 void MatcherGen::EmitLeafMatchCode(const TreePatternNode *N) { in EmitLeafMatchCode() argument [all …]
|
/external/clang/test/CXX/expr/expr.unary/expr.unary.noexcept/ |
D | sema.cpp | 4 #define N(e) static_assert(!noexcept(e), "expected throw") macro 14 N(throw 0); in simple() 15 N((throw 0, 0)); in simple() 27 N(nospec()); in call() 28 N(allspec()); in call() 29 N(intspec()); in call() 33 N(noexcept_false()); in call() 42 N(pnospec()); in callptr() 43 N((*pnospec)()); in callptr() 44 N(pallspec()); in callptr() [all …]
|
/external/srec/config/en.us/dictionary/ |
D | c0.6 | 50 "!EXCLAMATION-POINT EH2 K S K L AH0 M EY1 SH AH0 N P OY2 N T 53 "END-OF-QUOTE EH1 N D AH0 V K W OW1 T 54 "END-QUOTE EH1 N D K W OW1 T 55 "IN-QUOTES IH1 N K W OW1 T S 57 "UNQUOTE AH1 N K W OW1 T 58 #SHARP-SIGN SH AA1 R P S AY1 N 59 %PERCENT P ER0 S EH1 N T 60 &ERSAND AE1 M P ER0 S AE2 N D 64 'END-INNER-QUOTE EH1 N D IH1 N ER0 K W OW1 T 65 'END-QUOTE EH1 N D K W OW1 T [all …]
|
/external/clang/utils/ABITest/ |
D | Enumeration.py | 53 def getNthPairInfo(N): argument 55 if N==0: 61 while base(next)<=N: 71 if base(mid)<=N: 77 return line, N - base(line) 79 def getNthPair(N): argument 80 line,index = getNthPairInfo(N) 83 def getNthPairBounded(N,W=aleph0,H=aleph0,useDivmod=False): argument 90 elif N >= W*H: 95 return getNthPair(N) [all …]
|