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

12345

/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...]
H A Dx86_disasm.c197 x86_invariant_t *inv ){
198 if (! buf || ! buf_len || ! inv ) {
202 return ia32_disasm_invariant(buf, buf_len, 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/ceres-solver/internal/ceres/
H A Dloss_function.cc73 const double inv = 1.0 / sum; local
74 // 'sum' and 'inv' are always positive, assuming that 's' is.
76 rho[1] = std::max(std::numeric_limits<double>::min(), inv);
77 rho[2] = - c_ * (inv * inv);
82 const double inv = 1 / sum; local
83 // 'sum' and 'inv' are always positive.
85 rho[1] = std::max(std::numeric_limits<double>::min(), inv);
86 rho[2] = -2.0 * s * b_ * (inv * inv);
[all...]
/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/iptables/extensions/
H A Dlibip6t_ah.c57 const char *inv = invert ? "!" : ""; local
61 printf("%s:%s%u", name, inv, min);
63 printf("%ss:%s%u:%u", name, inv, min, max);
70 const char *inv = invert ? "!" : ""; local
73 printf("%s:%s%u", name, inv, len);
H A Dlibipt_ah.c39 const char *inv = invert ? "!" : ""; local
44 printf(":%s", inv);
47 printf("s:%s", inv);
H A Dlibxt_esp.c39 const char *inv = invert ? "!" : ""; local
43 printf(" %s:%s%u", name, inv, min);
45 printf(" %ss:%s%u:%u", name, inv, min, max);
/external/ceres-solver/examples/
H A Dfields_of_experts.cc81 const double inv = 1.0 / sum; local
82 // 'sum' and 'inv' are always positive, assuming that 's' is.
84 rho[1] = alpha_ * c * inv;
85 rho[2] = - alpha_ * c * c * inv * inv;
/external/eigen/test/eigen2/
H A Deigen2_prec_inverse_4x4.cpp41 MatrixType inv = m.inverse(); local
42 double error = double( (m*inv-MatrixType::Identity()).norm() / epsilon<Scalar>() );
61 MatrixType inv = m.inverse(); local
62 double error = double( (m*inv-MatrixType::Identity()).norm() * absdet / epsilon<Scalar>() );
/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/harfbuzz_ng/util/
H A Dansi-print.cc354 bool inv = false;
356 case 1: c = "▟"; inv = true; break;
357 case 2: c = "▙"; inv = true; break;
358 case 4: c = "▖"; inv = false; break;
359 case 8: c = "▗"; inv = false; break;
360 case 9: c = "▚"; inv = false; break;
361 case 6: c = "▞"; inv = false; break;
362 case 7: c = "▜"; inv = true; break;
363 case 11: c = "▜"; inv = true; break;
364 case 13: c = "▙"; inv
[all...]
/external/mesa3d/src/mesa/program/
H A Dprog_optimize.c856 append_interval(struct interval_list *list, const struct interval *inv) argument
858 list->Intervals[list->Num++] = *inv;
862 /** Insert interval inv into list, sorted by interval end */
864 insert_interval_by_end(struct interval_list *list, const struct interval *inv) argument
868 while (i >= 0 && list->Intervals[i].End > inv->End) {
872 list->Intervals[i + 1] = *inv;
888 remove_interval(struct interval_list *list, const struct interval *inv) argument
893 if (list->Intervals[k].Reg == inv->Reg) {
895 ASSERT(list->Intervals[k].Start == inv->Start);
896 ASSERT(list->Intervals[k].End == inv
1077 struct interval inv; local
1091 const struct interval *inv = liveIntervals->Intervals + i; local
1174 const struct interval *inv = activeIntervals.Intervals + j; local
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/geometry/
H A DRotation.java138 double inv = 1.0 / FastMath.sqrt(q0 * q0 + q1 * q1 + q2 * q2 + q3 * q3);
139 q0 *= inv;
140 q1 *= inv;
141 q2 *= inv;
142 q3 *= inv;
259 double inv = 0.25 / q0;
260 q1 = inv * (ort[1][2] - ort[2][1]);
261 q2 = inv * (ort[2][0] - ort[0][2]);
262 q3 = inv * (ort[0][1] - ort[1][0]);
268 double inv
[all...]
/external/libvpx/libvpx/vp8/common/
H A Dfindnearmv.c140 static void invert_and_clamp_mvs(int_mv *inv, int_mv *src, MACROBLOCKD *xd) argument
142 inv->as_mv.row = src->as_mv.row * -1;
143 inv->as_mv.col = src->as_mv.col * -1;
144 vp8_clamp_mv2(inv, xd);
/external/clang/test/Analysis/
H A Darray-struct.c156 void inv(struct s1 *);
162 inv(&t);
/external/mesa3d/src/mesa/main/
H A Dclip.c47 ctx->ProjectionMatrixStack.Top->inv);
82 ctx->ModelviewMatrixStack.Top->inv );
/external/valgrind/exp-sgcheck/
H A Dsg_main.c899 Invar* inv, Addr ea )
907 switch (inv->tag) {
912 block = inv->Inv.Stack0.addr;
913 szB = inv->Inv.Stack0.szB;
916 block = inv->Inv.StackN.nd->addr;
917 szB = inv->Inv.StackN.nd->szB;
920 block = inv->Inv.Global.nd->addr;
921 szB = inv->Inv.Global.nd->szB;
944 static void show_Invar( HChar* buf, Word nBuf, Invar* inv, Word depth ) argument
949 switch (inv
897 gen_delta_str( HChar* buf, UWord* absDelta, Invar* inv, Addr ea ) argument
1002 Invar inv; member in struct:__anon16295
1252 preen_global_Invar( Invar* inv, Addr a, SizeT len ) argument
1516 classify_address( Invar* inv, ThreadId tid, Addr ea, Addr sp, Addr fp, UWord szB, XArray* thisInstrBlocks ) argument
1778 Invar* inv; local
[all...]
/external/eigen/unsupported/test/
H A DFFTW.cpp107 fft.inv( tbuf2 , freqBuf);
115 fft.inv( tbuf3 , freqBuf);
128 fft.inv( tbuf2 , freqBuf);
156 fft.inv( buf3 , outbuf);
163 fft.inv( buf4 , outbuf);
170 fft.inv( buf3 , outbuf);
224 in1 = fft.inv(out1);
/external/valgrind/drd/tests/
H A Dmatinv.c268 elem_t* const inv = new_matrix(n, n); local
275 copy_matrix(tmp, n, 2*n, 0, n, n, 2*n, inv, n, n, 0, n, 0, n);
277 return inv;
316 elem_t *a, *inv, *prod; local
347 inv = invert_matrix(a, matrix_size);
349 inv, matrix_size, matrix_size);
362 delete_matrix(inv);
H A Domp_matinv.c232 elem_t* const inv = new_matrix(n, n); local
239 copy_matrix(tmp, n, 2*n, 0, n, n, 2*n, inv, n, n, 0, n, 0, n);
241 return inv;
292 elem_t *a, *inv, *prod; local
327 inv = invert_matrix(a, matrix_size);
329 inv, matrix_size, matrix_size);
342 delete_matrix(inv);
/external/skia/samplecode/
H A DSampleSkLayer.cpp19 SkMatrix44 inv; local
20 if (mat.invert(&inv)) {
21 inv.dump();
27 a.setConcat(mat, inv);
28 b.setConcat(inv, mat);

Completed in 762 milliseconds

12345