Home
last modified time | relevance | path

Searched refs:N (Results 1 – 25 of 2345) sorted by relevance

12345678910>>...94

/external/mesa3d/src/glx/
Dglxextensions.c46 #define N 0 macro
74 { GLX(ARB_create_context), VER(0,0), Y, N, N, N },
75 { GLX(ARB_create_context_profile), VER(0,0), Y, N, N, N },
76 { GLX(ARB_create_context_robustness), VER(0,0), Y, N, N, N },
77 { GLX(ARB_get_proc_address), VER(1,4), Y, N, Y, N },
78 { GLX(ARB_multisample), VER(1,4), Y, Y, N, N },
79 { GLX(ATI_pixel_format_float), VER(0,0), N, N, N, N },
80 { GLX(EXT_import_context), VER(0,0), Y, Y, N, N },
81 { GLX(EXT_visual_info), VER(0,0), Y, Y, N, N },
82 { GLX(EXT_visual_rating), VER(0,0), Y, Y, N, N },
[all …]
/external/llvm/include/llvm/IR/
DDebugInfo.h62 MDNode *N; variable
65 DIDescriptor(const MDNode *N = nullptr) : N(const_cast<MDNode *>(N)) {} in N() argument
67 operator MDNode *() const { return N; }
68 MDNode *operator->() const { return N; }
69 MDNode &operator*() const { return *N; }
108 MDSubrange *N; variable
111 DISubrange(const MDSubrange *N = nullptr) : N(const_cast<MDSubrange *>(N)) {} in N() function
113 operator MDSubrange *() const { return N; }
114 MDSubrange *operator->() const { return N; }
115 MDSubrange &operator*() const { return *N; }
[all …]
/external/llvm/lib/CodeGen/SelectionDAG/
DLegalizeTypes.h80 bool IgnoreNodeResults(SDNode *N) const { in IgnoreNodeResults() argument
81 return N->getOpcode() == ISD::TargetConstant; in IgnoreNodeResults()
149 SDNode *AnalyzeNewNode(SDNode *N);
151 void ExpungeNode(SDNode *N);
153 void RemapValue(SDValue &N);
159 bool CustomLowerNode(SDNode *N, EVT VT, bool LegalizeResult);
160 bool CustomWidenLowerNode(SDNode *N, EVT VT);
165 SDValue DisintegrateMERGE_VALUES(SDNode *N, unsigned ResNo);
169 SDValue LibCallify(RTLIB::Libcall LC, SDNode *N, bool isSigned);
222 void PromoteIntegerResult(SDNode *N, unsigned ResNo);
[all …]
DLegalizeFloatTypes.cpp49 void DAGTypeLegalizer::SoftenFloatResult(SDNode *N, unsigned ResNo) { in SoftenFloatResult() argument
50 DEBUG(dbgs() << "Soften float result " << ResNo << ": "; N->dump(&DAG); in SoftenFloatResult()
54 switch (N->getOpcode()) { in SoftenFloatResult()
58 N->dump(&DAG); dbgs() << "\n"; in SoftenFloatResult()
62 case ISD::MERGE_VALUES:R = SoftenFloatRes_MERGE_VALUES(N, ResNo); break; in SoftenFloatResult()
63 case ISD::BITCAST: R = SoftenFloatRes_BITCAST(N); break; in SoftenFloatResult()
64 case ISD::BUILD_PAIR: R = SoftenFloatRes_BUILD_PAIR(N); break; in SoftenFloatResult()
66 R = SoftenFloatRes_ConstantFP(cast<ConstantFPSDNode>(N)); in SoftenFloatResult()
69 R = SoftenFloatRes_EXTRACT_VECTOR_ELT(N); break; in SoftenFloatResult()
70 case ISD::FABS: R = SoftenFloatRes_FABS(N); break; in SoftenFloatResult()
[all …]
DLegalizeIntegerTypes.cpp37 void DAGTypeLegalizer::PromoteIntegerResult(SDNode *N, unsigned ResNo) { in PromoteIntegerResult() argument
38 DEBUG(dbgs() << "Promote integer result: "; N->dump(&DAG); dbgs() << "\n"); in PromoteIntegerResult()
42 if (CustomLowerNode(N, N->getValueType(ResNo), true)) in PromoteIntegerResult()
45 switch (N->getOpcode()) { in PromoteIntegerResult()
49 N->dump(&DAG); dbgs() << "\n"; in PromoteIntegerResult()
52 case ISD::MERGE_VALUES:Res = PromoteIntRes_MERGE_VALUES(N, ResNo); break; in PromoteIntegerResult()
53 case ISD::AssertSext: Res = PromoteIntRes_AssertSext(N); break; in PromoteIntegerResult()
54 case ISD::AssertZext: Res = PromoteIntRes_AssertZext(N); break; in PromoteIntegerResult()
55 case ISD::BITCAST: Res = PromoteIntRes_BITCAST(N); break; in PromoteIntegerResult()
56 case ISD::BSWAP: Res = PromoteIntRes_BSWAP(N); break; in PromoteIntegerResult()
[all …]
DLegalizeVectorTypes.cpp35 void DAGTypeLegalizer::ScalarizeVectorResult(SDNode *N, unsigned ResNo) { in ScalarizeVectorResult() argument
37 N->dump(&DAG); in ScalarizeVectorResult()
41 switch (N->getOpcode()) { in ScalarizeVectorResult()
45 N->dump(&DAG); in ScalarizeVectorResult()
51 case ISD::MERGE_VALUES: R = ScalarizeVecRes_MERGE_VALUES(N, ResNo);break; in ScalarizeVectorResult()
52 case ISD::BITCAST: R = ScalarizeVecRes_BITCAST(N); break; in ScalarizeVectorResult()
53 case ISD::BUILD_VECTOR: R = ScalarizeVecRes_BUILD_VECTOR(N); break; in ScalarizeVectorResult()
54 case ISD::CONVERT_RNDSAT: R = ScalarizeVecRes_CONVERT_RNDSAT(N); break; in ScalarizeVectorResult()
55 case ISD::EXTRACT_SUBVECTOR: R = ScalarizeVecRes_EXTRACT_SUBVECTOR(N); break; in ScalarizeVectorResult()
56 case ISD::FP_ROUND: R = ScalarizeVecRes_FP_ROUND(N); break; in ScalarizeVectorResult()
[all …]
/external/eigen/bench/btl/libs/BLAS/
Dblas_interface_impl.hh17 …static inline void matrix_vector_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N){ in matrix_vector_product() argument
18 BLAS_FUNC(gemv)(&notrans,&N,&N,&fone,A,&N,B,&intone,&fzero,X,&intone); in matrix_vector_product()
21 static inline void symv(gene_matrix & A, gene_vector & B, gene_vector & X, int N){ in symv() argument
22 BLAS_FUNC(symv)(&lower, &N,&fone,A,&N,B,&intone,&fzero,X,&intone); in symv()
25 static inline void syr2(gene_matrix & A, gene_vector & B, gene_vector & X, int N){ in syr2() argument
26 BLAS_FUNC(syr2)(&lower,&N,&fone,B,&intone,X,&intone,A,&N); in syr2()
29 static inline void ger(gene_matrix & A, gene_vector & X, gene_vector & Y, int N){ in ger() argument
30 BLAS_FUNC(ger)(&N,&N,&fone,X,&intone,Y,&intone,A,&N); in ger()
33 static inline void rot(gene_vector & A, gene_vector & B, SCALAR c, SCALAR s, int N){ in rot() argument
34 BLAS_FUNC(rot)(&N,A,&intone,B,&intone,&c,&s); in rot()
[all …]
/external/ceres-solver/include/ceres/
Djet.h169 template <typename T, int N>
171 enum { DIMENSION = N };
207 Jet<T, N>& operator+=(const Jet<T, N> &y) {
212 Jet<T, N>& operator-=(const Jet<T, N> &y) {
217 Jet<T, N>& operator*=(const Jet<T, N> &y) {
222 Jet<T, N>& operator/=(const Jet<T, N> &y) {
245 Eigen::Matrix<T, N, 1, Eigen::DontAlign> v;
249 template<typename T, int N> inline
250 Jet<T, N> const& operator+(const Jet<T, N>& f) {
258 template<typename T, int N> inline
[all …]
/external/icu/icu4c/source/data/unidata/
DUnicodeData.txt1 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/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/data/unicode/
DUnicodeData.txt1 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/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/de-DE/
Dde-DE_lexpos.utf448 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 …]
Dde-DE_kdt_posd.utf14 …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 …]
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/en-US/
Den-US_lexpos.utf459 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 …]
Den-US_kdt_posd.utf14 …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/
Dpf.os140 # 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/
Den-GB_lexpos.utf724 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 …]
Den-GB_kdt_posd.utf14 …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 …]
/external/clang/test/Parser/
Dcxx1z-fold-expressions.cpp12 template<int ...N> void bad1() { (N + ... + N); } // expected-error {{unexpanded parameter packs in… in bad1()
14 template<int ...N> void bad2() { (2 * N + ... + 1); } // expected-error {{expression not permitted … in bad2()
15 template<int ...N> void bad3() { (2 + N * ... * 1); } // expected-error {{expression not permitted … in bad3()
16 template<int ...N, int ...M> void bad4(int (&...x)[N]) { (N + M * ... * 1); } // expected-error {{e… in bad4() argument
17 template<int ...N, int ...M> void fixed4(int (&...x)[N]) { ((N + M) * ... * 1); } in fixed4() argument
20 template<int ...N> void bad5() { N + ...; } // expected-error {{expected expression}} expected-erro… in bad5()
21 template<int ...N> void bad6() { ... + N; } // expected-error {{expected expression}} in bad6()
22 template<int ...N> void bad7() { N + ... + N; } // expected-error {{expected expression}} expected-… in bad7()
25 template<int ...N> int bad8() { return (N + ... * 3); } // expected-error {{operators in fold expre… in bad8()
26 template<int ...N> int bad9() { return (3 + ... * N); } // expected-error {{operators in fold expre… in bad9()
[all …]
/external/aac/libAACdec/src/
Dldfiltbank.cpp102 …_fdk(INT_PCM *output, FIXP_DBL* x, const FIXP_WTB* fb, FIXP_DBL* z, const int N, const int stride) in multE2_DinvF_fdk() argument
109 for(i=0;i<N/4;i++) in multE2_DinvF_fdk()
113 z2 = x[N/2+i]; in multE2_DinvF_fdk()
114 z0 = z2 + ( fMultDiv2(z[N/2+i], fb[2*N + i]) >> (-WTS2-1) ); in multE2_DinvF_fdk()
116 z[N/2+i] = x[N/2-1-i] + ( fMultDiv2(z[N + i], fb[2*N + N/2 + i]) >> (-WTS2-1) ); in multE2_DinvF_fdk()
118 tmp = ( fMultDiv2(z[N/2+i], fb[N+N/2-1-i]) + fMultDiv2(z[i], fb[N+N/2+i]) ) ; in multE2_DinvF_fdk()
122 output[(N*3/4-1-i)*stride] = (INT_PCM)SATURATE_RIGHT_SHIFT(tmp, -WTS1-1 + scale, SAMPLE_BITS); in multE2_DinvF_fdk()
125 output[(N*3/4-1-i)*stride] = (INT_PCM)SATURATE_LEFT_SHIFT(tmp, WTS1+1 - scale, SAMPLE_BITS); in multE2_DinvF_fdk()
129 z[N + i] = z2; in multE2_DinvF_fdk()
132 for(i=N/4;i<N/2;i++) in multE2_DinvF_fdk()
[all …]
/external/ceres-solver/google3/
Djet_traits.h26 template<typename T, int N>
27 struct MathLimits<ceres::Jet<T, N> > {
28 typedef ceres::Jet<T, N> Type;
29 typedef ceres::Jet<T, N> UnsignedType;
51 for (int i = 0; i < N && !found_inf; ++i) {
58 for (int i = 0; i < N && !found_inf; ++i) {
67 template<typename T, int N> const ceres::Jet<T, N> MathLimits<ceres::Jet<T, N> >::kPosMin …
68 template<typename T, int N> const ceres::Jet<T, N> MathLimits<ceres::Jet<T, N> >::kPosMax …
69 template<typename T, int N> const ceres::Jet<T, N> MathLimits<ceres::Jet<T, N> >::kMin …
70 template<typename T, int N> const ceres::Jet<T, N> MathLimits<ceres::Jet<T, N> >::kMax …
[all …]
/external/skia/tests/
DPathOpsCubicIntersectionTestData.cpp14 static const double N = -FLT_EPSILON / 2; variable
35 {{{0, 0}, {0, N}, {1, 0}, {0, 0}}},
36 {{{0, 0}, {1, 0}, {0, N}, {0, 0}}},
37 {{{0, 0}, {N, 0}, {0, 1}, {0, 0}}},
38 {{{0, 0}, {0, 1}, {N, 0}, {0, 0}}},
39 {{{0, 0}, {1, 1}, {N, 0}, {0, 0}}},
42 {{{0, 0}, {N, 0}, {1, 1}, {0, 0}}},
43 {{{1, 1}, {2, 2}, {2, 2+N}, {1, 1}}},
242 {{{0, N}, {0, 0}, {0, 0}, {1, 0}}}, // horizontal
243 {{{1, 0}, {0, 0}, {0, 0}, {0, N}}},
[all …]
/external/libcxx/test/std/utilities/template.bitset/bitset.members/
Dto_string.pass.cpp31 template <std::size_t N>
32 std::bitset<N>
35 std::bitset<N> v; in make_bitset()
36 for (std::size_t i = 0; i < N; ++i) in make_bitset()
41 template <std::size_t N>
45 std::bitset<N> v = make_bitset<N>(); in test_to_string()
48 for (std::size_t i = 0; i < N; ++i) in test_to_string()
50 assert(s[N - 1 - i] == '1'); in test_to_string()
52 assert(s[N - 1 - i] == '0'); in test_to_string()
56 for (std::size_t i = 0; i < N; ++i) in test_to_string()
[all …]
/external/libcxx/test/std/algorithms/alg.sorting/alg.nth.element/
Dnth_element.pass.cpp22 test_one(unsigned N, unsigned M) in test_one() argument
24 assert(N != 0); in test_one()
25 assert(M < N); in test_one()
26 int* array = new int[N]; in test_one()
27 for (int i = 0; i < N; ++i) in test_one()
29 std::random_shuffle(array, array+N); in test_one()
30 std::nth_element(array, array+M, array+N); in test_one()
32 std::nth_element(array, array+N, array+N); // begin, end, end in test_one()
37 test(unsigned N) in test() argument
39 test_one(N, 0); in test()
[all …]
/external/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/
Dsort.pass.cpp75 test_larger_sorts(unsigned N, unsigned M) in test_larger_sorts() argument
77 assert(N != 0); in test_larger_sorts()
80 int* array = new int[N]; in test_larger_sorts()
82 for (int i = 0; i < N; ++i) in test_larger_sorts()
89 std::sort(array, array+N); in test_larger_sorts()
90 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
92 std::random_shuffle(array, array+N); in test_larger_sorts()
93 std::sort(array, array+N); in test_larger_sorts()
94 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
96 std::sort(array, array+N); in test_larger_sorts()
[all …]
/external/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/
Dstable_sort.pass.cpp75 test_larger_sorts(unsigned N, unsigned M) in test_larger_sorts() argument
77 assert(N != 0); in test_larger_sorts()
80 int* array = new int[N]; in test_larger_sorts()
82 for (int i = 0; i < N; ++i) in test_larger_sorts()
89 std::stable_sort(array, array+N); in test_larger_sorts()
90 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
92 std::random_shuffle(array, array+N); in test_larger_sorts()
93 std::stable_sort(array, array+N); in test_larger_sorts()
94 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
96 std::stable_sort(array, array+N); in test_larger_sorts()
[all …]

12345678910>>...94