/frameworks/av/media/libstagefright/codecs/amrwb/src/ |
synthesis_amr_wb.cpp | 63 Synthesis of signal at 16kHz with HF extension 165 int16 *HF = &synth[L_SUBFR]; 166 int16 *Ap = &HF[L_SUBFR16k]; /* High Frequency vector */ 214 * HF noise synthesis 215 * - Generate HF noise between 5.5 and 7.5 kHz. 223 pt_tmp = HF; 255 tmp = extract_h(Dot_product12(HF, HF, L_SUBFR16k, &exp)); 271 pt_tmp = HF; 344 /* HF correction gain * [all...] |
/external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
allocator.pass.cpp | 72 typedef test_hash<std::hash<T>> HF; 74 typedef std::unordered_map<T, T, HF, Comp, A> C; 79 assert(c.hash_function() == HF()); 91 typedef test_hash<std::hash<T>> HF; 93 typedef std::unordered_map<T, T, HF, Comp, A> C; 96 HF hf(12); 97 C c(2, hf, a); 99 assert(c.hash_function() == hf); 100 assert(!(c.hash_function() == HF())); [all...] |
range.pass.cpp | 104 typedef test_hash<std::hash<int>> HF; 106 typedef std::unordered_map<int, std::string, HF, Comp, A> C; 124 assert(c.hash_function() == HF()); 136 typedef test_hash<std::hash<int>> HF; 138 typedef std::unordered_map<int, std::string, HF, Comp, A> C; 149 HF hf(42); 151 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14, hf, a); 158 assert(c.hash_function() == hf); 159 assert(!(c.hash_function() == HF())); [all...] |
init.pass.cpp | 98 typedef test_hash<std::hash<int>> HF; 100 typedef std::unordered_map<int, std::string, HF, Comp, A> C; 129 typedef test_hash<std::hash<int>> HF; 131 typedef std::unordered_map<int, std::string, HF, Comp, A> C; 133 HF hf(42); 142 }, 12, hf, a); 149 assert(c.hash_function() == hf);
|
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
allocator.pass.cpp | 72 typedef test_hash<std::hash<T>> HF; 74 typedef std::unordered_multimap<T, T, HF, Comp, A> C; 79 assert(c.hash_function() == HF()); 91 typedef test_hash<std::hash<T>> HF; 93 typedef std::unordered_multimap<T, T, HF, Comp, A> C; 96 HF hf(12); 97 C c(2, hf, a); 99 assert(c.hash_function() == hf); 100 assert(!(c.hash_function() == HF())); [all...] |
init.pass.cpp | 142 typedef test_hash<std::hash<int>> HF; 144 typedef std::unordered_multimap<int, std::string, HF, Comp, A> C; 189 assert(c.hash_function() == HF()); 197 typedef test_hash<std::hash<int>> HF; 199 typedef std::unordered_multimap<int, std::string, HF, Comp, A> C; 201 HF hf(42); 210 }, 12, hf, a ); 245 assert(c.hash_function() == hf); 246 assert(!(c.hash_function() == HF())); [all...] |
range.pass.cpp | 148 typedef test_hash<std::hash<int>> HF; 150 typedef std::unordered_multimap<int, std::string, HF, Comp, A> C; 197 assert(c.hash_function() == HF()); 205 typedef test_hash<std::hash<int>> HF; 207 typedef std::unordered_multimap<int, std::string, HF, Comp, A> C; 219 HF hf (43); 220 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 12, hf, a ); 255 assert(c.hash_function() == hf); 256 assert(!(c.hash_function() == HF())); [all...] |
/external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
allocator.pass.cpp | 67 typedef test_hash<std::hash<T>> HF; 70 typedef std::unordered_multiset<T, HF, Comp, A> C; 75 assert(c.hash_function() == HF()); 87 typedef test_hash<std::hash<T>> HF; 90 typedef std::unordered_multiset<T, HF, Comp, A> C; 92 HF hf(42); 94 C c(4, hf, a); 96 assert(c.hash_function() == hf); 97 assert(!(c.hash_function() == HF())); [all...] |
init.pass.cpp | 94 typedef test_hash<std::hash<T>> HF; 97 typedef std::unordered_multiset<T, HF, Comp, A> C; 115 assert(c.hash_function() == HF()); 127 typedef test_hash<std::hash<T>> HF; 130 typedef std::unordered_multiset<T, HF, Comp, A> C; 133 HF hf(43); 141 }, 12, hf, a); 149 assert(c.hash_function() == hf); 150 assert(!(c.hash_function() == HF())); [all...] |
range.pass.cpp | 99 typedef test_hash<std::hash<T>> HF; 102 typedef std::unordered_multiset<T, HF, Comp, A> C; 120 assert(c.hash_function() == HF()); 132 typedef test_hash<std::hash<T>> HF; 135 typedef std::unordered_multiset<T, HF, Comp, A> C; 145 HF hf(43); 147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 16, hf, a); 154 assert(c.hash_function() == hf); 155 assert(!(c.hash_function() == HF())); [all...] |
/external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
allocator.pass.cpp | 67 typedef test_hash<std::hash<T>> HF; 70 typedef std::unordered_set<T, HF, Comp, A> C; 75 assert(c.hash_function() == HF()); 87 typedef test_hash<std::hash<T>> HF; 90 typedef std::unordered_set<T, HF, Comp, A> C; 92 HF hf(42); 94 C c(4, hf, a); 96 assert(c.hash_function() == hf); 97 assert(!(c.hash_function() == HF())); [all...] |
init.pass.cpp | 94 typedef test_hash<std::hash<T>> HF; 97 typedef std::unordered_set<T, HF, Comp, A> C; 115 assert(c.hash_function() == HF()); 127 typedef test_hash<std::hash<T>> HF; 130 typedef std::unordered_set<T, HF, Comp, A> C; 133 HF hf(43); 141 }, 12, hf, a); 149 assert(c.hash_function() == hf); 150 assert(!(c.hash_function() == HF())); [all...] |
range.pass.cpp | 99 typedef test_hash<std::hash<T>> HF; 102 typedef std::unordered_set<T, HF, Comp, A> C; 120 assert(c.hash_function() == HF()); 132 typedef test_hash<std::hash<T>> HF; 135 typedef std::unordered_set<T, HF, Comp, A> C; 145 HF hf(43); 147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 16, hf, a); 154 assert(c.hash_function() == hf); 155 assert(!(c.hash_function() == HF())); [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.cnstr/ |
allocator.pass.cpp | 72 typedef test_hash<std::hash<T>> HF; 74 typedef std::unordered_map<T, T, HF, Comp, A> C; 79 assert(c.hash_function() == HF()); 91 typedef test_hash<std::hash<T>> HF; 93 typedef std::unordered_map<T, T, HF, Comp, A> C; 96 HF hf(12); 97 C c(2, hf, a); 99 assert(c.hash_function() == hf); 100 assert(!(c.hash_function() == HF())); [all...] |
range.pass.cpp | 104 typedef test_hash<std::hash<int>> HF; 106 typedef std::unordered_map<int, std::string, HF, Comp, A> C; 124 assert(c.hash_function() == HF()); 136 typedef test_hash<std::hash<int>> HF; 138 typedef std::unordered_map<int, std::string, HF, Comp, A> C; 149 HF hf(42); 151 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14, hf, a); 158 assert(c.hash_function() == hf); 159 assert(!(c.hash_function() == HF())); [all...] |
init.pass.cpp | 98 typedef test_hash<std::hash<int>> HF; 100 typedef std::unordered_map<int, std::string, HF, Comp, A> C; 129 typedef test_hash<std::hash<int>> HF; 131 typedef std::unordered_map<int, std::string, HF, Comp, A> C; 133 HF hf(42); 142 }, 12, hf, a); 149 assert(c.hash_function() == hf);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
allocator.pass.cpp | 72 typedef test_hash<std::hash<T>> HF; 74 typedef std::unordered_multimap<T, T, HF, Comp, A> C; 79 assert(c.hash_function() == HF()); 91 typedef test_hash<std::hash<T>> HF; 93 typedef std::unordered_multimap<T, T, HF, Comp, A> C; 96 HF hf(12); 97 C c(2, hf, a); 99 assert(c.hash_function() == hf); 100 assert(!(c.hash_function() == HF())); [all...] |
init.pass.cpp | 142 typedef test_hash<std::hash<int>> HF; 144 typedef std::unordered_multimap<int, std::string, HF, Comp, A> C; 189 assert(c.hash_function() == HF()); 197 typedef test_hash<std::hash<int>> HF; 199 typedef std::unordered_multimap<int, std::string, HF, Comp, A> C; 201 HF hf(42); 210 }, 12, hf, a ); 245 assert(c.hash_function() == hf); 246 assert(!(c.hash_function() == HF())); [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
allocator.pass.cpp | 67 typedef test_hash<std::hash<T>> HF; 70 typedef std::unordered_multiset<T, HF, Comp, A> C; 75 assert(c.hash_function() == HF()); 87 typedef test_hash<std::hash<T>> HF; 90 typedef std::unordered_multiset<T, HF, Comp, A> C; 92 HF hf(42); 94 C c(4, hf, a); 96 assert(c.hash_function() == hf); 97 assert(!(c.hash_function() == HF())); [all...] |
init.pass.cpp | 94 typedef test_hash<std::hash<T>> HF; 97 typedef std::unordered_multiset<T, HF, Comp, A> C; 115 assert(c.hash_function() == HF()); 127 typedef test_hash<std::hash<T>> HF; 130 typedef std::unordered_multiset<T, HF, Comp, A> C; 133 HF hf(43); 141 }, 12, hf, a); 149 assert(c.hash_function() == hf); 150 assert(!(c.hash_function() == HF())); [all...] |
range.pass.cpp | 99 typedef test_hash<std::hash<T>> HF; 102 typedef std::unordered_multiset<T, HF, Comp, A> C; 120 assert(c.hash_function() == HF()); 132 typedef test_hash<std::hash<T>> HF; 135 typedef std::unordered_multiset<T, HF, Comp, A> C; 145 HF hf(43); 147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 16, hf, a); 154 assert(c.hash_function() == hf); 155 assert(!(c.hash_function() == HF())); [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
allocator.pass.cpp | 67 typedef test_hash<std::hash<T>> HF; 70 typedef std::unordered_set<T, HF, Comp, A> C; 75 assert(c.hash_function() == HF()); 87 typedef test_hash<std::hash<T>> HF; 90 typedef std::unordered_set<T, HF, Comp, A> C; 92 HF hf(42); 94 C c(4, hf, a); 96 assert(c.hash_function() == hf); 97 assert(!(c.hash_function() == HF())); [all...] |
init.pass.cpp | 94 typedef test_hash<std::hash<T>> HF; 97 typedef std::unordered_set<T, HF, Comp, A> C; 115 assert(c.hash_function() == HF()); 127 typedef test_hash<std::hash<T>> HF; 130 typedef std::unordered_set<T, HF, Comp, A> C; 133 HF hf(43); 141 }, 12, hf, a); 149 assert(c.hash_function() == hf); 150 assert(!(c.hash_function() == HF())); [all...] |
range.pass.cpp | 99 typedef test_hash<std::hash<T>> HF; 102 typedef std::unordered_set<T, HF, Comp, A> C; 120 assert(c.hash_function() == HF()); 132 typedef test_hash<std::hash<T>> HF; 135 typedef std::unordered_set<T, HF, Comp, A> C; 145 HF hf(43); 147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 16, hf, a); 154 assert(c.hash_function() == hf); 155 assert(!(c.hash_function() == HF())); [all...] |
/external/v8/benchmarks/ |
regexp.js | 83 var str0 = 'Zbmvyyn/5.0 (Jvaqbjf; H; Jvaqbjf AG 5.1; ra-HF) NccyrJroXvg/528.9 (XUGZY, yvxr Trpxb) Puebzr/2.0.157.0 Fnsnev/528.9'; 104 var s11 = computeInputVariants('VCPhygher=ra-HF', 156); 105 var s12 = computeInputVariants('CersreerqPhygher=ra-HF', 156); 195 var str3 = '{"anzr":"ra-HF","ahzoreSbezng":{"PheeraplQrpvznyQvtvgf":2,"PheeraplQrpvznyFrcnengbe":".","VfErnqBayl":snyfr,"PheeraplTebhcFvmrf":[3],"AhzoreTebhcFvmrf":[3],"CrepragTebhcFvmrf":[3],"PheeraplTebhcFrcnengbe":",","PheeraplFlzoby":"$","AnAFlzoby":"AnA","PheeraplArtngvirCnggrea":0,"AhzoreArtngvirCnggrea":1,"CrepragCbfvgvirCnggrea":0,"CrepragArtngvirCnggrea":0,"ArtngvirVasvavglFlzoby":"-Vasvavgl","ArtngvirFvta":"-","AhzoreQrpvznyQvtvgf":2,"AhzoreQrpvznyFrcnengbe":".","AhzoreTebhcFrcnengbe":",","PheeraplCbfvgvirCnggrea":0,"CbfvgvirVasvavglFlzoby":"Vasvavgl","CbfvgvirFvta":"+","CrepragQrpvznyQvtvgf":2,"CrepragQrpvznyFrcnengbe":".","CrepragTebhcFrcnengbe":",","CrepragFlzoby":"%","CreZvyyrFlzoby":"\u2030","AngvirQvtvgf":["0","1","2","3","4","5","6","7","8","9"],"QvtvgFhofgvghgvba":1},"qngrGvzrSbezng":{"NZQrfvtangbe":"NZ","Pnyraqne":{"ZvaFhccbegrqQngrGvzr":"@-62135568000000@","ZnkFhccbegrqQngrGvzr":"@253402300799999@","NytbevguzGlcr":1,"PnyraqneGlcr":1,"Renf":[1],"GjbQvtvgLrneZnk":2029,"VfErnqBayl":snyfr},"QngrFrcnengbe":"/","SvefgQnlBsJrrx":0,"PnyraqneJrrxEhyr":0,"ShyyQngrGvzrCnggrea":"qqqq, ZZZZ qq, llll u:zz:ff gg","YbatQngrCnggrea":"qqqq, ZZZZ qq, llll","YbatGvzrCnggrea":"u:zz:ff gg","ZbaguQnlCnggrea":"ZZZZ qq","CZQrfvtangbe":"CZ","ESP1123Cnggrea":"qqq, qq ZZZ llll UU\':\'zz\':\'ff \'TZG\'","FubegQngrCnggrea":"Z/q/llll","FubegGvzrCnggrea":"u:zz gg","FbegnoyrQngrGvzrCnggrea":"llll\'-\'ZZ\'-\'qq\'G\'UU\':\'zz\':\'ff","GvzrFrcnengbe":":","HavirefnyFbegnoyrQngrGvzrCnggrea":"llll\'-\'ZZ\'-\'qq UU\':\'zz\':\'ff\'M\'","LrneZbaguCnggrea":"ZZZZ, llll","NooerivngrqQnlAnzrf":["Fha","Zba","Ghr","Jrq","Guh","Sev","Fng"],"FubegrfgQnlAnzrf":["Fh","Zb","Gh","Jr","Gu","Se","Fn"],"QnlAnzrf":["Fhaqnl","Zbaqnl","Ghrfqnl","Jrqarfqnl","Guhefqnl","Sevqnl","Fngheqnl"],"NooerivngrqZbaguAnzrf":["Wna","Sro","Zne","Nce","Znl","Wha","Why","Nht","Frc","Bpg","Abi","Qrp",""],"ZbaguAnzrf":["Wnahnel","Sroehnel","Znepu","Ncevy","Znl","Whar","Whyl","Nhthfg","Frcgrzore","Bpgbore","Abirzore","Qrprzore",""],"VfErnqBayl":snyfr,"AngvirPnyraqneAnzr":"Tertbevna Pnyraqne","NooerivngrqZbaguTravgvirAnzrf":["Wna","Sro","Zne","Nce","Znl","Wha","Why","Nht","Frc","Bpg","Abi","Qrp",""],"ZbaguTravgvirAnzrf":["Wnahnel","Sroehnel","Znepu","Ncevy","Znl","Whar","Whyl","Nhthfg","Frcgrzore","Bpgbore","Abirzore","Qrprzore",""]}}'; 384 var str10 = 'FrffvbaQQS2=111soqs57qo8o8480qo18sor2011r3n591q7s6s37r120904; ZFPhygher=VC=74.125.75.1&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669315660164980&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R='; 385 var str11 = 'FrffvbaQQS2=111soqs57qo8o8480qo18sor2011r3n591q7s6s37r120904; __hgzm=144631658.1231363570.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar); __hgzn=144631658.3426875219718084000.1231363570.1231363570.1231363570.1; __hgzo=144631658.0.10.1231363570; __hgzp=144631658; ZFPhygher=VC=74.125.75.1&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669315660164980&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q'; [all...] |