Searched refs:inv (Results 1 - 25 of 217) sorted by relevance

123456789

/external/guava/guava-testlib/src/com/google/common/collect/testing/google/
H A DBiMapClearTester.java34 BiMap<V, K> inv = getMap().inverse();
37 assertTrue(inv.isEmpty());
42 BiMap<V, K> inv = getMap().inverse();
45 assertTrue(inv.isEmpty());
50 BiMap<V, K> inv = getMap().inverse();
53 assertTrue(inv.isEmpty());
58 BiMap<V, K> inv = getMap().inverse();
59 inv.clear();
61 assertTrue(inv.isEmpty());
66 BiMap<V, K> inv
[all...]
H A DAbstractBiMapTester.java65 BiMap<V, K> inv = getMap().inverse();
67 inv.entrySet().contains(entry));
69 inv.containsKey(entry.getValue()));
71 inv.containsValue(entry.getKey()));
/external/google-breakpad/src/third_party/libdisasm/
H A Dia32_invariant.h7 x86_invariant_t *inv);
H A Dia32_invariant.c142 unsigned int prefixes, x86_invariant_t *inv) {
160 inv->operands[x].access = (enum x86_op_access)
162 inv->operands[x].flags = (enum x86_op_flags)
209 mode_16, &inv->operands[x]);
214 inv->operands[x].type = op_register;
222 inv->operands[x].type = op_offset;
224 inv->operands[x].flags |= op_signed |
242 inv->operands[x].type =
245 inv->operands[x].type =
248 inv
140 ia32_decode_invariant( unsigned char *buf, size_t buf_len, ia32_insn_t *t, unsigned char *out, unsigned int prefixes, x86_invariant_t *inv) argument
311 x86_invariant_t inv = { {0} }; local
[all...]
/external/python/cpython2/Tools/scripts/
H A Dpdeps.py44 inv = inverse(table)
45 printresults(inv)
124 inv = {}
126 if not inv.has_key(key):
127 inv[key] = []
129 store(inv, item, key)
130 return inv
/external/python/cpython3/Tools/scripts/
H A Dpdeps.py44 inv = inverse(table)
45 printresults(inv)
124 inv = {}
126 if key not in inv:
127 inv[key] = []
129 store(inv, item, key)
130 return inv
/external/apache-commons-math/src/main/java/org/apache/commons/math/special/
H A DGamma.java303 double inv = 1 / (x * x);
307 return FastMath.log(x) - 0.5 / x - inv * ((1.0 / 12) + inv * (1.0 / 120 - inv / 252));
329 double inv = 1 / (x * x);
334 return 1 / x + inv / 2 + inv / x * (1.0 / 6 - inv * (1.0 / 30 + inv / 42));
/external/flatbuffers/samples/
H A Dsample_binary.cpp80 auto inv = monster->inventory(); local
81 assert(inv);
82 assert(inv->Get(9) == 9);
83 (void)inv;
/external/skia/src/core/
H A DSkBitmapController.h45 State* requestBitmap(const SkBitmapProvider& bp, const SkMatrix& inv, SkFilterQuality quality) { argument
46 return this->requestBitmap(bp, inv, quality, nullptr, 0);
50 virtual State* onRequestBitmap(const SkBitmapProvider&, const SkMatrix& inv, SkFilterQuality,
H A DSkBitmapController.cpp19 const SkMatrix& inv,
22 State* state = this->onRequestBitmap(provider, inv, quality, storage, storageSize);
36 SkDefaultBitmapControllerState(const SkBitmapProvider&, const SkMatrix& inv, SkFilterQuality);
133 const SkMatrix& inv,
135 fInvMatrix = inv;
18 requestBitmap(const SkBitmapProvider& provider, const SkMatrix& inv, SkFilterQuality quality, void* storage, size_t storageSize) argument
132 SkDefaultBitmapControllerState(const SkBitmapProvider& provider, const SkMatrix& inv, SkFilterQuality qual) argument
/external/skqp/src/core/
H A DSkBitmapController.h45 State* requestBitmap(const SkBitmapProvider& bp, const SkMatrix& inv, SkFilterQuality quality) { argument
46 return this->requestBitmap(bp, inv, quality, nullptr, 0);
50 virtual State* onRequestBitmap(const SkBitmapProvider&, const SkMatrix& inv, SkFilterQuality,
H A DSkBitmapController.cpp19 const SkMatrix& inv,
22 State* state = this->onRequestBitmap(provider, inv, quality, storage, storageSize);
36 SkDefaultBitmapControllerState(const SkBitmapProvider&, const SkMatrix& inv, SkFilterQuality);
133 const SkMatrix& inv,
135 fInvMatrix = inv;
18 requestBitmap(const SkBitmapProvider& provider, const SkMatrix& inv, SkFilterQuality quality, void* storage, size_t storageSize) argument
132 SkDefaultBitmapControllerState(const SkBitmapProvider& provider, const SkMatrix& inv, SkFilterQuality qual) argument
/external/tensorflow/tensorflow/python/kernel_tests/
H A Dmatrix_inverse_op_test.py41 inv = linalg_ops.matrix_inverse(y, adjoint=adjoint)
42 tf_ans = math_ops.matmul(inv, y, adjoint_b=adjoint)
148 inv = sess.run(all_ops)
149 self.assertAllEqual(inv[0], inv[1])
150 self.assertAllEqual(inv[2], inv[3])
185 inv = linalg_ops.matrix_inverse(matrix, adjoint=adjoint)
189 control_flow_ops.group(inv),
199 inv
[all...]
/external/ltp/testcases/kernel/syscalls/epoll_ctl/
H A Depoll_ctl02.c49 static int inv = -1; variable
63 {&inv, EPOLL_CTL_ADD, &fd[1], &events[1], EBADF},
64 {&epfd, EPOLL_CTL_ADD, &inv, &events[1], EBADF},
/external/eigen/test/
H A Dprec_inverse_4x4.cpp21 MatrixType inv = m.inverse(); local
22 double error = double( (m*inv-MatrixType::Identity()).norm() / NumTraits<Scalar>::epsilon() );
43 MatrixType inv = m.inverse(); local
44 double error = double( (m*inv-MatrixType::Identity()).norm() * absdet / NumTraits<Scalar>::epsilon() );
/external/skia/src/opts/
H A DSkXfermode_opts.h27 XFERMODE(SrcOut) { return s.approxMulDiv255(d.alphas().inv()); }
28 XFERMODE(SrcOver) { return s + d.approxMulDiv255(s.alphas().inv()); }
34 XFERMODE(SrcATop) { return (s * d.alphas() + d * s.alphas().inv()).div255(); }
37 XFERMODE(Xor) { return (s * d.alphas().inv() + d * s.alphas().inv()).div255(); }
45 // in 8-bit space without overflow. S + (1-S)*D is a touch faster because inv() is cheap.
46 return s + d.approxMulDiv255(s.inv());
48 XFERMODE(Multiply) { return (s * d.alphas().inv() + d * s.alphas().inv() + s*d).div255(); }
73 auto srcover = s + (d * sa.inv())
[all...]
/external/skqp/src/opts/
H A DSkXfermode_opts.h27 XFERMODE(SrcOut) { return s.approxMulDiv255(d.alphas().inv()); }
28 XFERMODE(SrcOver) { return s + d.approxMulDiv255(s.alphas().inv()); }
34 XFERMODE(SrcATop) { return (s * d.alphas() + d * s.alphas().inv()).div255(); }
37 XFERMODE(Xor) { return (s * d.alphas().inv() + d * s.alphas().inv()).div255(); }
45 // in 8-bit space without overflow. S + (1-S)*D is a touch faster because inv() is cheap.
46 return s + d.approxMulDiv255(s.inv());
48 XFERMODE(Multiply) { return (s * d.alphas().inv() + d * s.alphas().inv() + s*d).div255(); }
73 auto srcover = s + (d * sa.inv())
[all...]
/external/iptables/extensions/
H A Dlibip6t_ah.c65 const char *inv = invert ? "!" : ""; local
69 printf("%s:%s%u", name, inv, min);
71 printf("%ss:%s%u:%u", name, inv, min, max);
78 const char *inv = invert ? "!" : ""; local
81 printf("%s:%s%u", name, inv, len);
H A Dlibipt_ah.c46 const char *inv = invert ? "!" : ""; local
51 printf(":%s", inv);
54 printf("s:%s", inv);
H A Dlibxt_esp.c46 const char *inv = invert ? "!" : ""; local
50 printf(" %s:%s%u", name, inv, min);
52 printf(" %ss:%s%u:%u", name, inv, min, max);
H A Dlibxt_ipcomp.c49 const char *inv = invert ? "!" : ""; local
53 printf("%s:%s%u", name, inv, min);
55 printf("%ss:%s%u:%u", name, inv, min, max);
/external/eigen/unsupported/Eigen/src/FFT/
H A Dei_fftw_impl.h65 void inv(complex_type * dst,complex_type * src,int nfft) { function in struct:Eigen::internal::fftw_plan
75 void inv(scalar_type * dst,complex_type * src,int nfft) { function in struct:Eigen::internal::fftw_plan
108 void inv(complex_type * dst,complex_type * src,int nfft) { function in struct:Eigen::internal::fftw_plan
118 void inv(scalar_type * dst,complex_type * src,int nfft) { function in struct:Eigen::internal::fftw_plan
149 void inv(complex_type * dst,complex_type * src,int nfft) { function in struct:Eigen::internal::fftw_plan
159 void inv(scalar_type * dst,complex_type * src,int nfft) { function in struct:Eigen::internal::fftw_plan
211 void inv(Complex * dst,const Complex *src,int nfft) function in struct:Eigen::internal::fftw_impl
213 get_plan(nfft,true,dst,src).inv(fftw_cast(dst), fftw_cast(src),nfft );
218 void inv( Scalar * dst,const Complex * src,int nfft) function in struct:Eigen::internal::fftw_impl
220 get_plan(nfft,true,dst,src).inv(fftw_cas
[all...]
/external/skia/src/shaders/gradients/
H A DSkLinearGradient.cpp18 SkScalar inv = mag ? SkScalarInvert(mag) : 0; local
20 vec.scale(inv);
24 matrix.postScale(inv, inv);
200 SkMatrix inv; local
201 if (!args.fLocalMatrix->invert(&inv)) {
204 matrix.postConcat(inv);
/external/skqp/src/shaders/gradients/
H A DSkLinearGradient.cpp18 SkScalar inv = mag ? SkScalarInvert(mag) : 0; local
20 vec.scale(inv);
24 matrix.postScale(inv, inv);
196 SkMatrix inv; local
197 if (!args.fLocalMatrix->invert(&inv)) {
200 matrix.postConcat(inv);
/external/harfbuzz_ng/util/
H A Dansi-print.cc357 bool inv = false;
359 case 1: c = "▟"; inv = true; break;
360 case 2: c = "▙"; inv = true; break;
361 case 4: c = "▖"; inv = false; break;
362 case 8: c = "▗"; inv = false; break;
363 case 9: c = "▚"; inv = false; break;
364 case 6: c = "▞"; inv = false; break;
365 case 7: c = "▜"; inv = true; break;
366 case 11: c = "▜"; inv = true; break;
367 case 13: c = "▙"; inv
[all...]

Completed in 759 milliseconds

123456789