OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:lowest
(Results
1 - 14
of
14
) sorted by null
/frameworks/ex/variablespeed/jni/
macros.h
32
ForwardIterator
lowest
= first;
local
35
if (*first < *
lowest
)
36
lowest
= first;
37
return
lowest
;
/external/llvm/examples/OCaml-Kaleidoscope/Chapter2/
toy.ml
7
* 1 is the
lowest
precedence. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/
toy.ml
9
* 1 is the
lowest
precedence. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/
toy.ml
14
* 1 is the
lowest
precedence. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/
toy.ml
14
* 1 is the
lowest
precedence. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/
toy.ml
14
* 1 is the
lowest
precedence. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/
toy.ml
14
* 1 is the
lowest
precedence. *)
/external/libvpx/vp8/decoder/arm/neon/
idct_dequant_dc_full_2x_neon.asm
82
; compensate for this. in the case of sinpi8sqrt2, the
lowest
bit is 0,
85
; for cospi8sqrt2minus1 the
lowest
bit is 1, so we lose precision if we
203
; because the
lowest
bit in 0x8a8c is 0, we can pre-shift this
idct_dequant_full_2x_neon.asm
74
; compensate for this. in the case of sinpi8sqrt2, the
lowest
bit is 0,
77
; for cospi8sqrt2minus1 the
lowest
bit is 1, so we lose precision if we
195
; because the
lowest
bit in 0x8a8c is 0, we can pre-shift this
/external/qemu/
cpu-all.h
150
uint32_t
lowest
;
member in struct:__anon9564::__anon9565
158
uint32_t
lowest
;
member in struct:__anon9564::__anon9567
/external/yaffs2/yaffs2/
yaffs_guts.c
1489
int
lowest
= 999999;
local
3177
int
lowest
= -99; \/* Stop compiler whining. *\/
local
[
all
...]
/external/guava/src/com/google/common/primitives/
generate.sh
178
* <p>More formally, returns the
lowest
index {@code i} such that {@code
/external/v8/test/mjsunit/
unicode-test.js
[
all
...]
/prebuilt/common/jfreechart/
jfreechart-1.0.9.jar
Completed in 922 milliseconds