Searched refs:least (Results 1 - 25 of 127) sorted by relevance

123456

/external/fio/compiler/
H A Dcompiler.h9 #error Compiler too old, need gcc at least gcc 3.x
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DConvexHull.cpp76 int least = yMin ^ mask; local
79 order[1] = least;
81 // see if mid value is on same side of line (least, most) as yMin
83 if (!rotate(cubic, least, most, midPath)) { // ! if cbc[least]==cbc[most]
87 int midSides = side(midPath[yMin].y - midPath[least].y);
88 midSides ^= side(midPath[midX].y - midPath[least].y);
/external/skia/experimental/Intersection/
H A DConvexHull.cpp76 int least = yMin ^ mask; local
79 order[1] = least;
81 // see if mid value is on same side of line (least, most) as yMin
83 if (!rotate(cubic, least, most, midPath)) { // ! if cbc[least]==cbc[most]
87 int midSides = side(midPath[yMin].y - midPath[least].y);
88 midSides ^= side(midPath[midX].y - midPath[least].y);
/external/llvm/test/MC/AsmParser/
H A Dfloating-literals.s60 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one exponent digit
64 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one exponent digit
68 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one exponent digit
72 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one significand digit
76 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one significand digit
/external/zlib/src/examples/
H A Denough.c207 int least; /* least number of syms to use at this juncture */ local
225 /* we need to use at least this many bit patterns so that the code won't be
227 least = (left << 1) - syms;
228 if (least < 0)
229 least = 0;
239 for (use = least; use <= most; use++) {
324 int least; /* least number of syms to use at this juncture */ local
361 /* we need to use at least thi
[all...]
/external/chromium_org/third_party/leveldatabase/src/issues/
H A Dissue178_test.cc68 leveldb::Slice least(start_key.data(), start_key.size());
72 db->CompactRange(&least, &greatest);
/external/libvorbis/vq/
H A Dbookutil.c350 long least=-1; local
356 if(least==-1 || hist[j]<=least){
357 least=hist[j];
360 least=-1;
362 if((least==-1 || hist[j]<=least) && membership[j]!=first){
363 least=hist[j];
372 least=hist[first]+hist[second];
376 hist[j]=least;
[all...]
/external/ceres-solver/scripts/
H A Dceres-solver.spec7 Summary: A non-linear least squares minimizer
35 large complicated nonlinear least squares problems. Features include:
55 Summary: A non-linear least squares minimizer
/external/libvorbis/doc/
H A D02-bitpacking.tex41 A byte has a well-defined 'least significant' bit (LSb), which is the
55 first), 0-1-2-3 ('little endian' or 'least significant byte first' in
76 integer to the logical bitstream first, followed by next least
79 placing the LSb of the integer to be written into the least
81 the next-least significant bit of the source integer and so on up to
/external/libhevc/common/arm/
H A Dihevc_intra_pred_luma_mode_3_to_9.s162 ldr r12, idx_neg_idx_3_9_addr_1 @load least idx table
178 vdup.8 d26, r9 @least idx added to final idx values
183 vld1.8 {d0,d1}, [r6] @stores the 32 values reqd based on indices values (from least idx)
337 vld1.8 {d0,d1}, [r6] @stores the 32 values reqd based on indices values (from least idx)
485 ldr r12, idx_neg_idx_3_9_addr_2 @load least idx table
497 vdup.8 d26, r9 @least idx added to final idx values
504 vld1.8 {d0,d1}, [r6] @stores the 32 values reqd based on indices values (from least idx)
H A Dihevc_intra_pred_filters_luma_mode_11_to_17.s271 ldr r12, idx_neg_idx_11_17_addr_1 @load least idx table
288 vdup.8 d26, r9 @least idx added to final idx values
293 vld1.8 {d0,d1}, [r6] @stores the 32 values reqd based on indices values (from least idx)
447 vld1.8 {d0,d1}, [r6] @stores the 32 values reqd based on indices values (from least idx)
602 ldr r12, idx_neg_idx_11_17_addr_2 @load least idx table
614 vdup.8 d26, r9 @least idx added to final idx values
621 vld1.8 {d0,d1}, [r6] @stores the 32 values reqd based on indices values (from least idx)
/external/libunwind/doc/
H A Dunw_get_proc_name.tex22 that is at least \Var{len} bytes long. This buffer is used to return
30 the procedure is at least 0x80 bytes long).
H A Dunw_getcontext.tex22 platform-specific, but, in general, at least all preserved
H A Dunw_set_caching_policy.tex41 \Func{unw\_flush\_cache}() would have to be called (at least) for the
/external/llvm/include/llvm/Support/
H A DCompiler.h48 /// \brief Is the compiler MSVC of at least the specified version?
55 // We require at least MSVC 2012.
57 #error LLVM requires at least MSVC 2012.
/external/ceres-solver/jni/
H A DApplication.mk1 # Ceres Solver - A fast non-linear least squares minimizer
H A DAndroid.mk1 # Ceres Solver - A fast non-linear least squares minimizer
77 # Ceres requires at least NDK version r9d to compile.
/external/libpng/
H A DAndroid.mk29 # BUG: http://llvm.org/PR19472 - SLP vectorization (on ARM at least) crashes
/external/chromium_org/third_party/skia/tools/lua/
H A Dbbh_filter.lua8 -- have most commands, and the names of the files that use the least popular commands.
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/
H A Derrwarn.pxi38 # Order matters here. Go from most to least specific within a class
/external/llvm/examples/OCaml-Kaleidoscope/Chapter2/
H A Dparser.ml57 (* If this is a binop that binds at least as tightly as the current binop,
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/
H A Dparser.ml57 (* If this is a binop that binds at least as tightly as the current binop,
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/
H A Dparser.ml57 (* If this is a binop that binds at least as tightly as the current binop,
/external/skia/tools/lua/
H A Dbbh_filter.lua8 -- have most commands, and the names of the files that use the least popular commands.
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/
H A Dparser.ml88 (* At least one variable name is required. *)
118 (* If this is a binop that binds at least as tightly as the current binop,

Completed in 1009 milliseconds

123456