OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:linear
(Results
926 - 950
of
1643
) sorted by null
<<
31
32
33
34
35
36
37
38
39
40
>>
/external/llvm/lib/VMCore/
ConstantsContext.h
629
// FIXME: This should not use a
linear
scan. If this gets to be a
Value.cpp
121
/// is a
linear
time operation. Use hasOneUse or hasNUses to check for specific
/external/llvm/utils/unittest/googletest/
gtest-port.cc
357
// but usually it's must faster (often close to
linear
).
/external/opencv/cvaux/src/
cvlcm.cpp
42
/* Hybrid
linear
-contour model reconstruction */
/external/opencv/cxcore/src/
cxarray.cpp
[
all
...]
/external/openssl/crypto/
cryptlib.c
446
*
linear
function over the bytes in 'ptr', the co-efficients of which
/external/openssl/crypto/objects/
obj_dat.c
710
* I don't have perl (yet), we revert to a *
LINEAR
* search
/external/oprofile/pp/
opannotate.cpp
343
// ! complexity:
linear
in number of symbol must use sorted
/external/ppp/pppd/plugins/radius/etc/
dictionary.ascend
202
VALUE Ascend-History-Weigh-Type History-
Linear
1
/external/protobuf/gtest/src/
gtest-port.cc
346
// but usually it's must faster (often close to
linear
).
/external/qemu/distrib/sdl-1.2.12/src/joystick/darwin/
SDL_sysjoystick.c
64
Boolean nonLinear; /* are the values reported non-
linear
relative to element movement */
/external/qemu/hw/
goldfish_fb.c
269
* This function assumes that the framebuffers are in
linear
memory.
/external/qemu/slirp/
socket.c
315
* we must copy all data to a
linear
buffer then
/external/qemu/slirp-android/
socket.c
323
* we must copy all data to a
linear
buffer then
/external/quake/quake/src/QW/dxsdk/sdk/inc/
d3dtypes.h
485
D3DVALUE dvAttenuation1; /*
Linear
attenuation */
/external/quake/quake/src/WinQuake/dxsdk/SDK/INC/
D3DTYPES.H
485
D3DVALUE dvAttenuation1; /*
Linear
attenuation */
/external/skia/src/utils/
SkParseColor.cpp
33
// offset is 27-entry table of bytes(?) that trims
linear
search to at most 21 entries ('d')
/external/speex/libspeex/
lsp.c
10
This file contains functions for converting
Linear
Prediction
/external/stlport/stlport/stl/
_tree.h
43
begin(), and to the rightmost node of the tree, to enable
linear
time
/external/svox/pico/compat/jni/
com_android_tts_compat_SynthProxy.cpp
40
#define FILTER_GAIN 5.5f //
linear
gain
/external/svox/pico/lib/
picoktab.c
[
all
...]
/external/tinyxml/docs/
classTiXmlHandle.html
116
It seems reasonable, but it is in fact two embedded while loops. The Child method is a
linear
walk to find the element, so this code would iterate much more than it needs to. Instead, prefer:<p>
/external/v8/src/
scopeinfo.cc
175
// - searching the
linear
list of names is fast and yields an index into the
spaces.cc
[
all
...]
spaces.h
393
//
linear
allocation (with a LinearAllocationScope and an AlwaysAllocateScope)
[
all
...]
Completed in 997 milliseconds
<<
31
32
33
34
35
36
37
38
39
40
>>