/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
H A D | Antlr.Runtime.Tree.pas | 4136 I, N1, N2: Integer; 4151 N2 := Adaptor.GetChildCount(T2); 4152 if (N1 <> N2) then 4190 I, N1, N2: Integer; 4213 N2 := T2.ChildCount; 4214 if (N1 <> N2) then
|
/external/ceres-solver/include/ceres/ |
H A D | autodiff_cost_function.h | 158 int N2 = 0, // Number of parameters in block 2. 167 N0, N1, N2, N3, N4, 190 N0, N1, N2, N3, N4, 207 CostFunctor, double, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9> 211 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>::Differentiate( 215 N0, N1, N2, N3, N4,
|
H A D | cost_function_to_functor.h | 103 int N0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0, 115 CHECK((!N1 && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || 116 ((N1 > 0) && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || 117 ((N1 > 0) && (N2 > 0) && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || 118 ((N1 > 0) && (N2 > 0) && (N3 > 0) && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || 119 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && !N5 && !N6 && !N7 && !N8 && !N9) || 120 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && !N6 && !N7 && !N8 && !N9) || 121 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && !N7 && !N8 && !N9) || 122 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && !N8 && !N9) || 123 ((N1 > 0) && (N2 > [all...] |
H A D | gradient_checker.h | 65 int M = 0, int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0> 139 if (N2) { 140 CHECK_EQ(N2, block_sizes[2]); 178 NumericDiffCostFunction<CostFunctionToProbe, CENTRAL, M, N0, N1, N2, N3, N4>
|
H A D | numeric_diff_cost_function.h | 179 int N2 = 0, // Number of parameters in block 2. 189 N0, N1, N2, N3, N4, 201 N0, N1, N2, N3, N4, 219 const int kNumParameters = N0 + N1 + N2 + N3 + N4 + N5 + N6 + N7 + N8 + N9; 221 (N0 > 0) + (N1 > 0) + (N2 > 0) + (N3 > 0) + (N4 > 0) + 226 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>( 244 if (N2) parameters_reference_copy[2] = parameters_reference_copy[1] + N1; 245 if (N3) parameters_reference_copy[3] = parameters_reference_copy[2] + N2; 276 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9, \ 283 N0, N1, N2, N [all...] |
H A D | numeric_diff_functor.h | 114 int N0 = 0, int N1 = 0 , int N2 = 0, int N3 = 0, int N4 = 0, 125 N0, N1, N2, N3, N4, 136 N0, N1, N2, N3, N4, 345 N0, N1, N2, N3, N4,
|
H A D | sized_cost_function.h | 48 int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0, 57 CHECK((!N1 && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || 58 ((N1 > 0) && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || 59 ((N1 > 0) && (N2 > 0) && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || 60 ((N1 > 0) && (N2 > 0) && (N3 > 0) && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || 61 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && !N5 && !N6 && !N7 && !N8 && !N9) || 62 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && !N6 && !N7 && !N8 && !N9) || 63 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && !N7 && !N8 && !N9) || 64 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && !N8 && !N9) || 65 ((N1 > 0) && (N2 > [all...] |
/external/ceres-solver/include/ceres/internal/ |
H A D | autodiff.h | 206 int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0, 216 DCHECK((!N1 && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || 217 ((N1 > 0) && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || 218 ((N1 > 0) && (N2 > 0) && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || 219 ((N1 > 0) && (N2 > 0) && (N3 > 0) && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || 220 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && !N5 && !N6 && !N7 && !N8 && !N9) || 221 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && !N6 && !N7 && !N8 && !N9) || 222 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && !N7 && !N8 && !N9) || 223 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && !N8 && !N9) || 224 ((N1 > 0) && (N2 > [all...] |
H A D | numeric_diff.h | 53 int N0, int N1, int N2, int N3, int N4, 61 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>::Call( 68 int N0, int N1, int N2, int N3, int N4, 83 int N0, int N1, int N2, int N3, int N4, 143 if (!EvaluateImpl<CostFunctor, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>( 159 if (!EvaluateImpl<CostFunctor, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>( 183 int N0, int N1, int N2, int N3, int N4, 187 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9,
|
H A D | variadic_evaluate.h | 49 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4, 67 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4, 69 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, N6, N7, N8, 0> { 84 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4, 86 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, N6, N7, 0, 0> { 100 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4, 102 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, N6, 0, 0, 0> { 115 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4, 117 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, 0, 0, 0, 0> { 129 template<typename Functor, typename T, int N0, int N1, int N2, in [all...] |
/external/ceres-solver/internal/ceres/ |
H A D | evaluator_test.cc | 56 int N0 = 0, int N1 = 0, int N2 = 0, bool kSucceeds = true> 58 : public SizedCostFunction<kNumResiduals, N0, N1, N2> { 59 typedef SizedCostFunction<kNumResiduals, N0, N1, N2> Base;
|
H A D | parameter_block_ordering_test.cc | 51 template <int M, int N1 = 0, int N2 = 0, int N3 = 0> 52 class DummyCostFunction: public SizedCostFunction<M, N1, N2, N3> {
|
H A D | program_test.cc | 60 template <int kNumResiduals, int N0, int N1, int N2> 62 SizedCostFunction<kNumResiduals, N0, N1, N2> { 68 residuals[i] = kNumResiduals + N0 + N1 + N2;
|
H A D | reorder_program_test.cc | 45 template <int kNumResiduals, int N0, int N1, int N2> 47 SizedCostFunction<kNumResiduals, N0, N1, N2> {
|
/external/chromium_org/chrome/renderer/net/ |
H A D | renderer_predictor_unittest.cc | 21 const std::string N1("1.3."), N2("5.5.7.12"); 27 EXPECT_TRUE(TESTNAME(N2));
|
/external/chromium_org/third_party/android_platform/webview/ |
H A D | frameworks.jar | META-INF/ META-INF/MANIFEST.MF android/ android/location/ android/location/Address$1.class ... |
/external/chromium_org/third_party/boringssl/src/crypto/bn/asm/ |
H A D | armv4-mont.pl | 246 my ($N0,$N1,$N2,$N3)=map("d$_",(4..7)); 306 vmlal.u32 $A4xB,$Ni,${N2}[0] 308 vmlal.u32 $A5xB,$Ni,${N2}[1] 354 vmlal.u32 $A4xB,$Ni,${N2}[0] 356 vmlal.u32 $A5xB,$Ni,${N2}[1] 393 vmlal.u32 $A4xB,$Ni,${N2}[0] 395 vmlal.u32 $A5xB,$Ni,${N2}[1] 402 vld1.32 {$N2-$N3}, [$nptr]! 425 vmlal.u32 $A4xB,$Ni,${N2}[0] 427 vmlal.u32 $A5xB,$Ni,${N2}[ [all...] |
/external/chromium_org/third_party/libjingle/source/talk/media/testdata/ |
H A D | h264-svc-99-640x360.rtpdump | 4064 �c&������f�� f e�X�r b8 >����4� �Y�rJΠBB���SN��4h��~C�pޒ�s�`.�?��n�60�x�J·b%�.VĐ��
�Z��F�L~f:����Qظ��N��z<0:T�aŃ�|6�~R`%�����Wg`�Ӯ<=��'$xz��H�Q�<)J1��Ɗ!����Wr4����s����_���ʼ�*^�'b���FO�_;Yk�SK������]m�Txh Q�K�>^��t=�����*=�(hIU��dp�wÈZ�A�e�$xh�����X�H��^<�7���}a<�����o��ФL)��-5��>�E��f%�L��s�B� �~�0^/kd�Ŕ�=M""Tc�T�-+���l�$mNU=�ռ7$�Ȟ����~\_G�)��><��J��ॆ�&�<�j/�th��>`
[h�"�%���{�t�;x�ݳzM�@�&�m��-<0�_l��\k�o�yƎW�;A����,^�UM��'�A���x�.���[(��i�>���6�ݔ�d�(�Dѭ�s��6�
�A�P�?@k�/��B���Q[ءE�jU�4]�?�~�>h�~��me,n�J�H��7>,d�ݕY��3jN����,�N2���l�5��ŗ
̅%7#aS?h@4�����5s+;Śb<"ճ0@��;CO��g��.xo1!���m`b��#*h`Z uo�G�iC���:Hxv-T
v��78���8�$�A�Hc����ﶚ��A@q̽�����SԕC���)�P��3)���/�c�
�s7�~�
�������x�
������k��@�T�)=���b�c䇆S(���_IV³�.#���M����
��������zQ��ٔY���Le��z �����^��lQ+��=��}-L��;�S9כ\A��BX)A������}����=�E�Q�`?�f�1�oB"=��r#h�mA?&��@��'��x]�a��a���f�
���Z�nj����̓�Q(� �f�.����^��a�5@��� �m��%��-� 5520 �;=����N���'���� �˨����f@(�x�������G��}}{��]����QT�pj^��7���_���^�R���_c�}��G��E���״�ɞ�ѳ ���3�ǚ5��&���gS�8f���S�n<*5S��˵���/O'{@�c�N2�n<��J�U�p�3�6
F���5�7�ۯ��`;UL� Z������xq�j�V�Ǧ 8639 ��@ �9����w��q�r�=� >]�&L��X�$W���� %
�c(]�����f�� f x�X�lr �8 >�G�:��4�G��܁�^XxQ>���˂i�}P<8��
q?���;��&�zHyX����}+�^�¹�ض�猚�$�����=�ë�Fl��gOK�+�.��m�n����?4��*�=�6��3jӭ68e�� ��C=/nY(Ӝ��S�N2�7(����C���4z�����#��
�}�W���}u_��0���=��8���U^��O���X��&�an�ա�d�ў����K�f�p�o��ɥ�:�Hv�4���v�W4^ <����R{���q�
|
/external/chromium_org/third_party/opus/src/celt/ |
H A D | bands.c | 619 int N2 = 2*N-1; local 621 N2--; 625 qb = IMIN(b-pulse_cap-(4<<BITRES), (b+N2*offset)/N2);
|
H A D | mdct.c | 64 int N2=N>>1; local 86 trig[i] = TRIG_UPSCALE*celt_cos_norm(DIV32(ADD32(SHL32(EXTEND32(i),17),N2),N)); 109 int N, N2, N4; local 116 N2 = N>>1; 118 ALLOC(f, N2, kiss_fft_scalar); 119 ALLOC(f2, N2, kiss_fft_scalar); 122 sine = TRIG_UPSCALE*(QCONST16(0.7853981f, 15)+N2)/N; 132 const kiss_fft_scalar * OPUS_RESTRICT xp2 = in+N2-1+(overlap>>1); 139 *yp++ = MULT16_32_Q15(*wp2, xp1[N2]) + MULT16_32_Q15(*wp1,*xp2); 140 *yp++ = MULT16_32_Q15(*wp1, *xp1) - MULT16_32_Q15(*wp2, xp2[-N2]); 215 int N, N2, N4; local [all...] |
/external/chromium_org/third_party/opus/src/silk/ |
H A D | ana_filt_bank_1.c | 47 opus_int k, N2 = silk_RSHIFT( N, 1 ); local 51 for( k = 0; k < N2; k++ ) {
|
/external/chromium_org/third_party/opus/src/src/ |
H A D | analysis.c | 198 int N = 480, N2=240; local 253 for (i=0;i<N2;i++) 257 in[i].i = (kiss_fft_scalar)(w*tonal->inmem[N2+i]); 259 in[N-i-1].i = (kiss_fft_scalar)(w*tonal->inmem[N+N2-i-1]); 267 for (i=1;i<N2;i++)
|
H A D | opus_encoder.c | 1859 int N2, N4; local 1860 N2 = st->Fs/200; 1868 celt_encode_with_ec(celt_enc, pcm_buf+st->channels*(frame_size-N2-N4), N4, dummy, 2, NULL); 1870 err = celt_encode_with_ec(celt_enc, pcm_buf+st->channels*(frame_size-N2), N2, data+nb_compr_bytes, redundancy_bytes, NULL);
|
/external/chromium_org/third_party/skia/third_party/lua/src/ |
H A D | lundump.c | 187 #define N2 N1+2 macro 188 #define N3 N2+6 199 if (memcmp(h,s,N2)!=0) error(S,"version mismatch in");
|
/external/chromium_org/third_party/speex/libspeex/ |
H A D | filters.c | 483 int M2, N2; local 488 N2 = N>>1; 489 ALLOC(xx1, M2+N2, spx_word16_t); 490 ALLOC(xx2, M2+N2, spx_word16_t); 492 for (i = 0; i < N2; i++) 493 xx1[i] = x1[N2-1-i]; 495 xx1[N2+i] = mem1[2*i+1]; 496 for (i = 0; i < N2; i++) 497 xx2[i] = x2[N2-1-i]; 499 xx2[N2 [all...] |