/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/ |
H A D | get_param.pass.cpp | 27 const size_t Np = sizeof(p) / sizeof(p[0]); local 28 P pa(b, b+Np+1, p);
|
H A D | max.pass.cpp | 26 const size_t Np = sizeof(p) / sizeof(p[0]); local 27 D d(b, b+Np+1, p);
|
H A D | min.pass.cpp | 26 const size_t Np = sizeof(p) / sizeof(p[0]); local 27 D d(b, b+Np+1, p);
|
H A D | param_assign.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]); local 29 P p0(b, b+Np+1, p);
|
H A D | param_copy.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]); local 29 P p0(b, b+Np+1, p);
|
H A D | io.pass.cpp | 35 const size_t Np = sizeof(p) / sizeof(p[0]); local 36 D d1(b, b+Np+1, p);
|
H A D | eval_param.pass.cpp | 42 const size_t Np = sizeof(p) / sizeof(p[0]); local 44 P pa(b, b+Np+1, p); 58 for (int i = 0; i < Np; ++i)
|
H A D | eval.pass.cpp | 41 const size_t Np = sizeof(p) / sizeof(p[0]); local 42 D d(b, b+Np+1, p); 56 for (int i = 0; i < Np; ++i) 101 const size_t Np = sizeof(p) / sizeof(p[0]); 102 D d(b, b+Np+1, p); 116 for (int i = 0; i < Np; ++i) 161 const size_t Np = sizeof(p) / sizeof(p[0]); 162 D d(b, b+Np+1, p); 176 for (int i = 0; i < Np; ++i) 221 const size_t Np [all...] |
/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
H A D | get_param.pass.cpp | 27 const size_t Np = sizeof(p) / sizeof(p[0]); local 28 P pa(b, b+Np, p);
|
H A D | max.pass.cpp | 26 const size_t Np = sizeof(p) / sizeof(p[0]); local 27 D d(b, b+Np, p);
|
H A D | min.pass.cpp | 26 const size_t Np = sizeof(p) / sizeof(p[0]); local 27 D d(b, b+Np, p);
|
H A D | param_assign.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]); local 29 P p0(b, b+Np, p);
|
H A D | param_copy.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]); local 29 P p0(b, b+Np, p);
|
H A D | io.pass.cpp | 35 const size_t Np = sizeof(p) / sizeof(p[0]); local 36 D d1(b, b+Np, p);
|
H A D | eval.pass.cpp | 50 const size_t Np = sizeof(p) / sizeof(p[0]) - 1; local 51 D d(b, b+Np+1, p); 66 std::vector<double> areas(Np); 75 for (int i = 0; i < Np+1; ++i) 79 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; 100 const size_t Np = sizeof(p) / sizeof(p[0]) - 1; 101 D d(b, b+Np+1, p); 116 std::vector<double> areas(Np); 125 for (int i = 0; i < Np+1; ++i) 129 int k = std::lower_bound(b, b+Np [all...] |
H A D | eval_param.pass.cpp | 48 const size_t Np = sizeof(p) / sizeof(p[0]) - 1; local 50 P pa(b, b+Np+1, p); 65 std::vector<double> areas(Np); 74 for (int i = 0; i < Np+1; ++i) 78 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
|
/external/flac/libFLAC/ |
H A D | window.c | 196 const FLAC__int32 Np = (FLAC__int32)(p / 2.0f * L) - 1; local 201 if (Np > 0) { 202 for (n = 0; n <= Np; n++) { 203 window[n] = (FLAC__real)(0.5f - 0.5f * cos(M_PI * n / Np)); 204 window[L-Np-1+n] = (FLAC__real)(0.5f - 0.5f * cos(M_PI * (n+Np) / Np)); 215 FLAC__int32 Np, n, i; local 223 Np = (FLAC__int32)(p / 2.0f * N); 227 for (i = 1; n < (start_n+Np) [all...] |
/external/boringssl/src/crypto/md5/asm/ |
H A D | md5-586.pl | 25 %Ltmp1=("R0",&Np($C), "R1",&Np($C), "R2",&Np($C), "R3",&Np($D)); 36 sub Np subroutine 61 &mov($tmp1,&Np($c)) if $pos < 1; # next tmp1 for R0 62 &mov($tmp1,&Np($c)) if $pos == 1; # next tmp1 for R1 86 &mov($tmp1,&Np($c)) if $pos < 1; # G function - part 1 87 &mov($tmp1,&Np($c)) if $pos == 1; # G function - part 1 115 &mov($tmp1,&Np( [all...] |
/external/bison/src/ |
H A D | reduce.c | 89 bitset Np, Ns; 92 /* N is set as built. Np is set being built this iteration. P is 95 Np = bitset_create (nvars, BITSET_FIXED); 116 bitset_copy (Np, N); 121 bitset_set (Np, rules[r].lhs->number - ntokens); 124 if (bitset_equal_p (N, Np)) 126 Ns = Np; 127 Np = N; 131 N = Np; 88 bitset Np, Ns; local
|
/external/opencv3/modules/calib3d/src/ |
H A D | fisheye.cpp | 1200 int Np = m.cols; 1204 vconcat(m, Mat::ones(1, Np, CV_64FC1), m); 1208 vconcat(M, Mat::ones(1, Np, CV_64FC1), M); 1235 Mat L = Mat::zeros(2*Np, 9, CV_64FC1); 1237 for (int i = 0; i < Np; ++i) 1248 if (Np > 4) L = L.t() * L; 1254 if (Np > 4) 1260 Mat J = Mat::zeros(2 * Np, 8, CV_64FC1); 1270 for (int i = 0; i < Np; ++i) 1323 int Np [all...] |
/external/opencv3/modules/calib3d/test/ |
H A D | test_fisheye.cpp | 302 int Np = imagePointsNormalized.cols; local 313 cv::Mat X_new = R * _objectPoints + T * cv::Mat::ones(1, Np, CV_64FC1);
|
/external/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyTIL.h | 1042 auto Np = Vs.traverse(Ptr, Vs.subExprCtx(Ctx)); local 1043 return Vs.reduceLoad(*this, Np); 1073 auto Np = Vs.traverse(Dest, Vs.subExprCtx(Ctx)); local 1075 return Vs.reduceStore(*this, Np, Nv);
|
/external/webrtc/talk/media/testdata/ |
H A D | h264-svc-99-640x360.rtpdump | 2534 Z�����Np.Ӱ��o~{]p�m?Z^/2�nۿ�.�> 4193 Yԃݞ�e/��8�/@�blP:���o�����Ώ��[���A��8��~ �o�@v���b�k��!�P�KJ :���0 (�OQ�O���o���qZW�۷Npp<�(:���������b� 6012 �7u`u �5X:Ս�GS�{m�{:��m��!#���x�[ �u�1�o�1�͐L8��Z�R�P�2w��o�ݪ���1��\ma���w( �L������~6��[��W����PV�X~� �,�;;���{7��u���BC���=���ϋ��w�ik�����6��}�+�y�-o���) =;�k��F��`��e��c���Rڛ9r�>�]ɚ��{�tml�5��h���g��;[����n�P=��4iLC�;t�X#���)-�[c-|/��V�{�z�o�
?���Np�,� �=G_���`~��C��4`}.����X=Ic^&,�E�o|���H�u��q:� 6324 X �%�AJ)��`4Np��&� �3�P�����)��3������6�Q��%���éy�_��}x�o�l~�6v=�@�u�aS�m��_d������G��'��Q 6470 �E��V��O.eģ��7���2d�<�����ĺ&�It������Ǹ��q��p&= Í��|�?��D��6��n�AíW�a�֗}��T��AR�l���D�}~-��A4�h���J�����埂�2Ŷ��b��*��]}t��B�kA�V���axȇ�|hNp+����tw}m���/���x5*��z���^[:�y�� x�q��6���3��KBhՀtr1Bp%��xz�#�
2 �������e�Tm�����_Z^j���{��+3N>m6�)�&R�l3!6c3~{��z6(b�V�e�Oc���9Rs�頩`�v}����5��$�˒Ͻ��."e3�^��p��k.��ΐVW�^5�� d \ �c'������f�� f B�8�3r = ��g�+� ��g ҿh��B/�&an:_�� ��g /J���x�z�t�Q� S K ��'������f�� f B�8��r > �g�+� �gȯ� nc^Xx� �g �ȯ� nc^Xx6 f ^ �c'��̑��f�� f B�8�r ?8 >��G�+� .��G !ҿh�C! �˓0�7/�y .��G !/J��\ռG=}:p(� � � ��'��̑��f�� f B�8�r @8 >�G�+� >4�G A2+�� ya�G��rK�D�9��j��U�Խ˔%-A��{��\���>��ҹP &4�Gȯ� d%净���H��f\ @�(U@�ۉH���� � � �c'���I��f�� f B�8�r A ��g�+� ��g ��r ��|��A��I�4���X ��g 9/K�E͞�/'v�}X��|�f_����z��;�s������nz��r��r� b Z ��'���I��f�� f ۦ8�r B �g�+� �gȱ�����ŷ�"�p-��> |