Home
last modified time | relevance | path

Searched refs:abs (Results 1 – 25 of 419) sorted by relevance

12345678910>>...17

/external/v8/test/mjsunit/
Dmath-abs.js36 assertEquals(0, Math.abs(0));
37 assertEquals(0, Math.abs(zero()));
38 assertEquals(1/0, 1/Math.abs(-0)); // 0 == -0, so we use reciprocals.
39 assertEquals(Infinity, Math.abs(Infinity));
40 assertEquals(Infinity, Math.abs(-Infinity));
41 assertNaN(Math.abs(NaN));
42 assertNaN(Math.abs(-NaN));
43 assertEquals('Infinity', Math.abs(Number('+Infinity').toString()));
44 assertEquals('Infinity', Math.abs(Number('-Infinity').toString()));
45 assertEquals('NaN', Math.abs(NaN).toString());
[all …]
/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Math/
D15.8.2.1.js49 …tem++] = new TestCase( SECTION, "Math.abs.length", 1, Math.abs.length );
51 …ray[item++] = new TestCase( SECTION, "Math.abs()", Number.NaN, Math.abs() );
52 …em++] = new TestCase( SECTION, "Math.abs( void 0 )", Number.NaN, Math.abs(void 0) );
53 …item++] = new TestCase( SECTION, "Math.abs( null )", 0, Math.abs(null) );
54 …item++] = new TestCase( SECTION, "Math.abs( true )", 1, Math.abs(true) );
55 …tem++] = new TestCase( SECTION, "Math.abs( false )", 0, Math.abs(false) );
56 …w TestCase( SECTION, "Math.abs( string primitive)", Number.NaN, Math.abs("a string primitive…
57 …w TestCase( SECTION, "Math.abs( string object )", Number.NaN, Math.abs(new String( 'a Stri…
58 …] = new TestCase( SECTION, "Math.abs( Number.NaN )", Number.NaN, Math.abs(Number.NaN) );
60 …w TestCase( SECTION, "Math.abs(0)", 0, Math.abs( 0 ) …
[all …]
/external/webkit/Source/JavaScriptCore/wtf/
DAVLTree.h144 Abstractor& abstractor() { return abs; } in abstractor()
156 void purge() { abs.root = null(); } in purge()
158 bool is_empty() { return abs.root == null(); } in is_empty()
160 AVLTree() { abs.root = null(); } in AVLTree()
179 handle h = tree_->abs.root;
225 handle h = tree_->abs.root; in start_iter_least()
243 handle h = tree_->abs.root; in start_iter_greatest()
262 return depth == 0 ? tree_->abs.root : path_h[depth - 1];
337 int cmp_k_n(key k, handle h) { return tree_->abs.compare_key_node(k, h); } in cmp_k_n()
338 int cmp_n_n(handle h1, handle h2) { return tree_->abs.compare_node_node(h1, h2); } in cmp_n_n()
[all …]
/external/mesa3d/src/glsl/builtins/ir/
Dasin15 (expression float abs (var_ref x))))
19 (expression float abs (var_ref x))
24 (expression float abs (var_ref x))))))))))))
39 (expression vec2 abs (var_ref x))))
43 (expression vec2 abs (var_ref x))
48 (expression vec2 abs (var_ref x))))))))))))
63 (expression vec3 abs (var_ref x))))
67 (expression vec3 abs (var_ref x))
72 (expression vec3 abs (var_ref x))))))))))))
87 (expression vec4 abs (var_ref x))))
[all …]
Dfwidth6 (expression float abs (expression float dFdx (var_ref p)))
7 (expression float abs (expression float dFdy (var_ref p)))))))
13 (expression vec2 abs (expression vec2 dFdx (var_ref p)))
14 (expression vec2 abs (expression vec2 dFdy (var_ref p)))))))
20 (expression vec3 abs (expression vec3 dFdx (var_ref p)))
21 (expression vec3 abs (expression vec3 dFdy (var_ref p)))))))
27 (expression vec4 abs (expression vec4 dFdx (var_ref p)))
28 (expression vec4 abs (expression vec4 dFdy (var_ref p)))))))
Dabs1 ((function abs
5 ((return (expression float abs (var_ref arg0)))))
10 ((return (expression vec2 abs (var_ref arg0)))))
15 ((return (expression vec3 abs (var_ref arg0)))))
20 ((return (expression vec4 abs (var_ref arg0)))))
/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Expressions/
D11.4.8.js86 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
89 return ( sign * Math.floor(Math.abs(n)) );
95 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
99 n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
108 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
111 n = sign * Math.floor( Math.abs(n) )
124 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
128 n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
D11.7.1.js93 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
96 return ( sign * Math.floor(Math.abs(n)) );
102 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
106 n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
115 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
118 n = sign * Math.floor( Math.abs(n) )
131 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
135 n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
D11.7.3.js98 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
101 return ( sign * Math.floor(Math.abs(n)) );
107 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
111 n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
120 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
123 n = sign * Math.floor( Math.abs(n) )
136 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
140 n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
D11.7.2.js107 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
110 return ( sign * Math.floor(Math.abs(n)) );
116 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
120 n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
129 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
132 n = sign * Math.floor( Math.abs(n) )
145 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
149 n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
D11.10-1.js95 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
98 return ( sign * Math.floor(Math.abs(n)) );
104 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
108 n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
117 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
120 n = sign * Math.floor( Math.abs(n) )
133 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
137 n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
D11.10-2.js94 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
97 return ( sign * Math.floor(Math.abs(n)) );
103 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
107 n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
116 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
119 n = sign * Math.floor( Math.abs(n) )
132 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
136 n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
D11.10-3.js94 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
97 return ( sign * Math.floor(Math.abs(n)) );
103 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
107 n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
116 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
119 n = sign * Math.floor( Math.abs(n) )
132 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
136 n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
/external/stlport/stlport/stl/
D_cstdlib.h113 inline int abs(int __x) { return _STLP_VENDOR_CSTD::abs(__x); } in abs() function
121 # pragma function (abs)
131 inline long abs(long __x) { return _STLP_VENDOR_CSTD::labs(__x); } in abs() function
143 # pragma intrinsic (abs)
151 inline _STLP_LONG_LONG abs(_STLP_LONG_LONG __x) { return _STLP_VENDOR_CSTD::llabs(__x); } in abs() function
154 inline _STLP_LONG_LONG abs(_STLP_LONG_LONG __x) { return ::llabs(__x); } in abs() function
158 inline _STLP_LONG_LONG abs(_STLP_LONG_LONG __x) { return __x < 0 ? -__x : __x; } in abs() function
175 using ::abs;
/external/libvpx/vp8/common/x86/
Dloopfilter_mmx.asm55 por mm1, mm2 ; abs(q3-q2)
63 por mm4, mm6 ; abs(q2-q1)
72 por mm4, mm3 ; abs(q0-q1)
85 por mm4, mm2 ; abs(p3 - p2)
94 por mm4, mm5 ; abs(p2 - p1)
104 por mm4, mm3 ; abs(p1 - p0)
113 por mm2, mm3 ; abs(p1-q1)
115 psrlw mm2, 1 ; abs(p1-q1)/2
121 por mm5, mm3 ; abs(p0 - q0)
122 paddusb mm5, mm5 ; abs(p0-q0)*2
[all …]
Dloopfilter_sse2.asm51 por xmm4, xmm6 ; abs(q2-q1)
52 por xmm1, xmm2 ; abs(q3-q2)
60 por xmm5, xmm3 ; abs(q0-q1)
89 pmaxub xmm1, xmm4 ; abs(p3 - p2)
92 pmaxub xmm1, xmm2 ; abs(p3 - p2)
94 pmaxub xmm1, xmm5 ; abs(p2 - p1)
97 pmaxub xmm1, xmm3 ; abs(p2 - p1)
112 por xmm6, xmm4 ; abs(p1 - p0)
124 por xmm2, xmm3 ; abs(p1-q1)
134 psrlw xmm2, 1 ; abs(p1-q1)/2
[all …]
/external/libvpx/vp8/common/
Dloopfilter_filters.c31 mask |= (abs(p3 - p2) > limit) * -1; in vp8_filter_mask()
32 mask |= (abs(p2 - p1) > limit) * -1; in vp8_filter_mask()
33 mask |= (abs(p1 - p0) > limit) * -1; in vp8_filter_mask()
34 mask |= (abs(q1 - q0) > limit) * -1; in vp8_filter_mask()
35 mask |= (abs(q2 - q1) > limit) * -1; in vp8_filter_mask()
36 mask |= (abs(q3 - q2) > limit) * -1; in vp8_filter_mask()
37 mask |= (abs(p0 - q0) * 2 + abs(p1 - q1) / 2 > flimit * 2 + limit) * -1; in vp8_filter_mask()
46 hev |= (abs(p1 - p0) > thresh) * -1; in vp8_hevmask()
47 hev |= (abs(q1 - q0) > thresh) * -1; in vp8_hevmask()
287 signed char mask = (abs(p0 - q0) * 2 + abs(p1 - q1) / 2 <= flimit * 2 + limit) * -1; in vp8_simple_filter_mask()
/external/libvpx/vpx_scale/generic/
Dbicubic_scaler.c202 if ((abs(fixed0) > (abs(real0) + 1)) || (abs(fixed0) < (abs(real0) - 1)))
208 if ((abs(fixed1) > (abs(real1) + 1)) || (abs(fixed1) < (abs(real1) - 1)))
214 if ((abs(fixed2) > (abs(real2) + 1)) || (abs(fixed2) < (abs(real2) - 1)))
220 if ((abs(fixed3) > (abs(real3) + 1)) || (abs(fixed3) < (abs(real3) - 1)))
/external/dropbear/libtomcrypt/testprof/
Dpkcs_1_test.c31 lparamlen = abs(rand()) % 17; in pkcs_1_test()
34 saltlen = abs(rand()) % 17; in pkcs_1_test()
37 modlen = 800 + (abs(rand()) % 224); in pkcs_1_test()
66 buf[0][i1 = abs(rand()) % l3] ^= 1; in pkcs_1_test()
70 buf[1][i2 = abs(rand()) % (l1 - 1)] ^= 1; in pkcs_1_test()
/external/libvpx/vp8/common/arm/neon/
Dloopfiltersimplehorizontaledge_neon.asm42 vabd.u8 q15, q6, q7 ; abs(p0 - q0)
43 vabd.u8 q14, q5, q8 ; abs(p1 - q1)
44 vqadd.u8 q15, q15, q15 ; abs(p0 - q0) * 2
45 vshr.u8 q14, q14, #1 ; abs(p1 - q1) / 2
46 vqadd.u8 q15, q15, q14 ; abs(p0 - q0) * 2 + abs(p1 - q1) / 2
56 vcge.u8 q15, q1, q15 ; (abs(p0 - q0)*2 + abs(p1-q1)/2 > flimit*2 + limit)*-1
Dloopfiltersimpleverticaledge_neon.asm62 vabd.u8 q15, q5, q4 ; abs(p0 - q0)
63 vabd.u8 q14, q3, q6 ; abs(p1 - q1)
64 vqadd.u8 q15, q15, q15 ; abs(p0 - q0) * 2
65 vshr.u8 q14, q14, #1 ; abs(p1 - q1) / 2
66 vqadd.u8 q15, q15, q14 ; abs(p0 - q0) * 2 + abs(p1 - q1) / 2
75 vcge.u8 q15, q1, q15 ; abs(p0 - q0)*2 + abs(p1-q1)/2 > flimit*2 + limit)*-1
/external/webrtc/src/modules/audio_processing/aec/main/matlab/
Dfullaec.m230 %if sum(abs(ekfb)) < sum(abs(dk))
247 absEf = max(abs(Ek2), threshold);
262 %WFbEn = sum(abs(WFb));
265 WFbD = sum(abs(WFb(:, dIdx)),2);
359 % mutInf(j) = 0.9*mutInf(j) + 0.1*information(abs(xfm(j,:)), abs(dfm(j,:)));
686 %od = ovrdSm*ones(N+1,1).*abs(WFb(:,dIdx))/(max(abs(WFb(:,dIdx)))+1e-10);
780 %divergeIdx = find(abs(Ek) > abs(DD));
784 %if sum(abs(Ek)) > sum(abs(DD))
787 %Ek2(divergeIdx) = Ek2(divergeIdx) .* abs(DD(divergeIdx))./(abs(Ek(divergeIdx))+1e-10);
790 …%threshMod(divergeIdx) = threshMod(divergeIdx) .* abs(DD(divergeIdx))./(abs(Ek(divergeIdx))+1e-10);
[all …]
/external/stlport/test/unit/
Dvalarray_test.cpp33 using std::abs; in transcendentals()
38 tmp = abs(darray); in transcendentals()
64 tmp = abs(farray); in transcendentals()
91 tmp = abs(ldarray); in transcendentals()
/external/libvpx/vp8/common/arm/armv6/
Dloopfilter_v6.asm94 orr r6, r6, r7 ; abs (p3-p2)
95 orr r8, r8, r10 ; abs (p2-p1)
103 orr r6, r6, r7 ; abs (p1-p0)
112 orr r6, r6, r7 ; abs (p1-q1)
114 orr r12, r11, r12 ; abs (p0-q0)
116 uqadd8 r12, r12, r12 ; abs (p0-q0) * 2
117 and r6, r7, r6, lsr #1 ; abs (p1-q1) / 2
119 uqadd8 r12, r12, r6 ; abs (p0-q0)*2 + abs (p1-q1)/2
128 orr r6, r7, r6 ; abs (q1-q0)
129 orr r10, r9, r10 ; abs (q2-q1)
[all …]
/external/opencv/cvaux/src/
Dcvbgfg_acmmm2003.cpp258 int diff = abs( int(*rowStart1) - int(*rowStart2) ); in cvChangeDetection()
302 int diff = abs( int(*rowStart1) - int(*rowStart2) ); in cvChangeDetection()
386 if ( abs( V_CC(k,0) - prev_data[0]) <= deltaCC && in icvUpdateFGDStatModel()
387 abs( V_CC(k,1) - prev_data[1]) <= deltaCC && in icvUpdateFGDStatModel()
388 abs( V_CC(k,2) - prev_data[2]) <= deltaCC && in icvUpdateFGDStatModel()
389 abs( V_CC(k,3) - curr_data[0]) <= deltaCC && in icvUpdateFGDStatModel()
390 abs( V_CC(k,4) - curr_data[1]) <= deltaCC && in icvUpdateFGDStatModel()
391 abs( V_CC(k,5) - curr_data[2]) <= deltaCC) in icvUpdateFGDStatModel()
406 if ( abs( V_C(k,0) - curr_data[0]) <= deltaC && in icvUpdateFGDStatModel()
407 abs( V_C(k,1) - curr_data[1]) <= deltaC && in icvUpdateFGDStatModel()
[all …]

12345678910>>...17