OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:many
(Results
376 - 400
of
4181
) sorted by null
<<
11
12
13
14
15
16
17
18
19
20
>>
/frameworks/base/docs/html/resources/articles/
speech-input.jd
9
Google's Voice Search application, which is pre-installed on
many
Android devices,
63
many
Android devices, responds to a <em>RecognizerIntent</em> by displaying the
track-mem.jd
11
many
allocations, the garbage collector will kick in and stop your application
57
common mistake I have seen in
many
applications is to create a new
/frameworks/base/services/java/com/android/server/am/
EventLogTags.logtags
69
# A process has crashed too
many
times, it is being cleared
73
# A service has crashed too
many
times, it is being stopped
/frameworks/base/test-runner/src/android/test/
InstrumentationCoreTestRunner.java
42
* for
many
core tests to run. This is needed because there are some core tests
125
* Binder can't handle too
many
operations in a very
/libcore/luni/src/main/java/java/math/
Primality.java
56
// * It encodes how
many
iterations of Miller-Rabin test are need to get an
68
// * It encodes how
many
i-bit primes there are in the table for
/ndk/docs/
SYSTEM-ISSUES.html
91
The Android dynamic linker in 1.5 has
many
important limitations:
93
- No support for LD_LIBRARY_PATH, LD_PRELOAD, RTLD_LOCAL and
many
/external/protobuf/src/google/protobuf/io/
zero_copy_stream_impl_lite.h
39
// streams. Of course,
many
users will probably want to write their own
82
const int block_size_; // How
many
bytes to return at a time.
85
int last_returned_size_; // How
many
bytes we returned last time Next()
114
const int block_size_; // How
many
bytes to return at a time.
117
int last_returned_size_; // How
many
bytes we returned last time Next()
/external/tinyxml/
changes.txt
156
- Fixed
many
,
many
bugs.
162
-
Many
fixes and input from John-Philip Leonard Johansson (JP) and Ellers,
198
-
Many
thanks to marlonism for finding an infinite loop in bad xml.
204
- First pass at switching to the "safe" stdlib functions.
Many
people have suggested and
/libcore/luni/src/test/java/tests/api/java/util/
ScannerTest.java
[
all
...]
/external/zlib/examples/
enough.c
29
We build a code from shorter to longer lengths, determining how
many
symbols
30
are coded at each length. At each step, we have how
many
symbols remain to
31
be coded, what the last code length used was, and how
many
bit patterns of
222
/* we need to use at least this
many
bit patterns so that the code won't be
228
/* we can use at most this
many
bit patterns, lest there not be enough
358
/* we need to use at least this
many
bit patterns so that the code won't be
364
/* we can use at most this
many
bit patterns, lest there not be enough
/external/chromium/base/
tracked_objects.h
69
// The amount of memory used in the above data structures depends on how
many
70
// threads there are, and how
many
Locations of construction there are.
73
// instance at a Location. In
many
cases, instances (such as Tasks) are only
136
// need to be sorted, and possibly aggregated (example: how
many
threads are in
247
// gathered (carefully) from
many
threads. Instances are held in arrays and
249
// The source of this data was collected on
many
threads, and is asynchronously
292
// Construct with a list of how
many
threads should contribute. This helps us
311
// following counter tracks how
many
more threads will contribute. When it is
661
// chooses to try to re-run the browser
many
times, we maintain global state and
/external/dbus/
NEWS
100
-
Many
memleaks and bugs fixed
149
-
Many
bugfixes
253
-
many
symbols are no longer exported as part of the public API
323
-
many
,
many
major bug fixes
545
and fixed
many
bugs exposed by that
572
-
many
,
many
bugfixes
573
-
many
API changes/fixes
HACKING
35
Regular expressions are just too complicated, and there are
many
166
Many
of the D-Bus tests will run over and over, once for each malloc
225
not
many
unrelated changes
/external/bluetooth/glib/docs/reference/glib/tmpl/
fileutils.sgml
88
@G_FILE_ERROR_LOOP: Too
many
levels of symbolic links were encountered
95
@G_FILE_ERROR_MFILE: The current process has too
many
files open and
98
@G_FILE_ERROR_NFILE: There are too
many
distinct file openings in the
/external/chromium/third_party/icu/public/i18n/unicode/
format.h
55
*
Many
of the concrete subclasses of Format employ the notion of
64
* Even though
many
subclasses use patterns, the notion of a pattern
72
* "one file", and any number greater than 1 as "
many
files".
/external/e2fsprogs/lib/ext2fs/
initialize.c
232
* There should be at least as
many
inodes as the user
233
* requested. Figure out how
many
inodes per group that
312
/* This can only happen if the user requested too
many
inodes */
/external/expat/
Changes
47
- Fixed enum XML_Status issue (reported on SourceForge
many
117
- Fixed
many
bugs; see SF bug reports 231864, 461380, 464837,
164
o
Many
paired handler setters (like XML_SetElementHandler)
/external/grub/stage2/
start.S
103
/* how
many
do we really want to read? */
185
/* do we need too
many
cylinders? */
195
/* how
many
do we really want to read? */
/external/gtest/include/gtest/
gtest-death-test.h
97
// death tests; though it lacks
many
features you can find in PCRE
124
// A* matches 0 or
many
occurrences of A
125
// A+ matches 1 or
many
occurrences of A
/external/iptables/extensions/
libip6t_multiport.c
86
if (cp) exit_error(PARAMETER_PROBLEM, "too
many
ports specified");
113
"too
many
ports specified");
127
if (cp) exit_error(PARAMETER_PROBLEM, "too
many
ports specified");
libipt_multiport.c
89
if (cp) exit_error(PARAMETER_PROBLEM, "too
many
ports specified");
116
"too
many
ports specified");
130
if (cp) exit_error(PARAMETER_PROBLEM, "too
many
ports specified");
/external/jpeg/
change.log
49
on
many
flavors of Unix (all the ones that GNU libtool knows how to
147
Repair bug in jquant1.c: sometimes didn't use as
many
colors as it could.
202
This can save a copying step in
many
programs.
jidctflt.c
28
* possible to arrange the computation so that
many
of the multiplies are
90
/* Due to quantization, we will usually find that
many
of the input
183
* However, the column calculation has created
many
nonzero AC terms, so
rdswitch.c
98
fprintf(stderr, "Too
many
tables in file %s\n", filename);
191
fprintf(stderr, "Too
many
scans defined in file %s\n", filename);
199
fprintf(stderr, "Too
many
components in one scan in file %s\n",
/external/kernel-headers/original/linux/
if_vlan.h
71
* it gives constant time look-up, but in
many
cases it wastes memory.
117
unsigned long cnt_inc_headroom_on_tx; /* How
many
times did we have to grow the skb on TX. */
118
unsigned long cnt_encap_on_xmit; /* How
many
times did we have to encapsulate the skb on TX. */
Completed in 767 milliseconds
<<
11
12
13
14
15
16
17
18
19
20
>>