OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:each
(Results
1401 - 1425
of
7153
) sorted by null
<<
51
52
53
54
55
56
57
58
59
60
>>
/dalvik/libcore/luni/src/main/java/java/util/
Arrays.java
396
* implement {@code Comparable}, or cannot be compared to
each
other.
[
all
...]
/dalvik/libcore/text/src/main/java/java/text/
BreakIterator.java
42
* a boundary position at the beginning and end of
each
legal word (numbers
94
* don't create and destroy a new {@code BreakIterator} for
each
line. Create
107
* //print
each
word in order
111
* //print
each
sentence in reverse order
123
* Print
each
element in order:
137
* Print
each
element in reverse order:
217
* breaks that
each
represent the end of one sentence and the beginning of the
/external/bluetooth/glib/docs/reference/gobject/
tut_gsignal.xml
33
each
separate runtime which wants to use the GObject type system.
182
Each
signal is registered in the type system together with the type on which
237
accumulator: this is a function pointer which is invoked after
each
closure
243
accumulator_data: this pointer will be passed down to
each
invocation of the
257
param_types: this is an array of GTypes which indicate the type of
each
parameter
279
system-wide operation. i.e.: the class_closure will be invoked during
each
emission
409
of
each
closure (except in EMISSION_HOOK and CLEANUP). It accumulates
/external/icu4c/test/threadtest/
threadtest.cpp
171
// One of these is set up for
each
thread in the test.
178
bool fHeartBeat; // Set true by the thread
each
time it finishes
306
// threadMain The main function for
each
of the swarm of test threads.
307
// Run in a loop, executing the runOnce() test function
each
time.
428
//
Each
second,
431
//
Each
"ctime" seconds,
514
// Tally up the total number of cycles completed by
each
of the threads.
/external/jpeg/
jdcoefct.c
41
* and let the entropy decoder write into that workspace
each
time.
51
/* In multi-pass modes, we need a virtual block array for
each
component. */
142
* NB: output_buf contains a plane for
each
component in image,
239
* ie, v_samp_factor block rows for
each
component in the scan.
311
* NB: output_buf contains a plane for
each
component in image.
693
/* Allocate a full-image virtual array for
each
component, */
694
/* padded to a multiple of samp_factor DCT blocks in
each
direction. */
/external/opencore/codecs_v2/audio/aac/dec/src/
apply_ms_synt.cpp
38
pFrameInfo = Pointer to structure that holds information about
each
group.
48
each
grouped scalefactor band.
52
the encoding of
each
grouped scalefactor band.
232
stack usage for
each
subroutine called]
242
used to represent cycle count for
each
subroutine
341
*
Each
window in the frame should have the same number of coef's,
348
* constant for
each
frame, sfb_per_win can be determined outside
get_tns.cpp
66
Pointer to structure that holds information about
each
block.
92
pTnsFrameInfo->filt[]->order = The order of
each
individual TNS filter.
100
pTnsFrameInfo->filt[]->coef[] =
Each
filter's coefficients are filled with
103
pTnsFrameInfo->filt[]->direction = A flag is set for
each
TNS filter.
174
stack usage for
each
subroutine called]
184
used to represent cycle count for
each
subroutine
230
* number of scalefactor bands for
each
TNS filter. This value is effected
pns_intensity_right.cpp
29
pFrameInfo = Pointer to structure that holds information about
each
group.
39
each
grouped scalefactor band.
43
the encoding of
each
grouped scalefactor band.
323
stack usage for
each
subroutine called]
333
used to represent cycle count for
each
subroutine
445
*
Each
window in the frame should have the same number of coef's,
452
* constant for
each
frame, sfb_per_win can be determined outside
493
* to that sfb in
each
window in the group
541
* replacing this band in
each
window's
/external/proguard/docs/manual/
gui.html
90
entries. The results of
each
consecutive list of input entries will be
100
Each
of these lists can be edited by means of a couple of buttons on the
135
program list only make sense when combined with filters;
each
output file is
142
The order of the entries in
each
list may matter, as the first occurrence of
166
applications.
Each
of these entries can be toggled by means of a check box.
167
The text field following
each
entry allows to constrain the applicable classes
309
fully-qualified method arguments.
Each
of these arguments can contain
/external/qemu/distrib/sdl-1.2.12/src/hermes/
COPYING.LIB
48
Also, for
each
distributor's protection, we want to make certain
110
General Public License (also called "this License").
Each
licensee is
141
you conspicuously and appropriately publish on
each
copy an
188
entire whole, and thus to
each
and every part regardless of who wrote
270
You must give prominent notice with
each
copy of the work that the
351
10.
Each
time you redistribute the Library (or any work based on the
404
Each
version is given a distinguishing version number. If the Library
/external/webkit/WebCore/icu/unicode/
ubrk.h
89
* Print
each
element in order:
101
* Print
each
element in reverse order:
156
* //print
each
sentence in forward and reverse order
164
* //print
each
word in order
219
* getRuleStatus(). A range of values is defined for
each
category of
252
* A range of values is defined for
each
category of
274
* A range of values is defined for
each
category of
/external/webkit/WebCore/rendering/
RenderFrameSet.cpp
214
// First we need to investigate how many columns of
each
type we have and
258
// over all percentage columns/rows. IMPORTANT: the size of
each
column/row is not relative
259
// to 100%, but to the total percentage. For example, if there are three columns,
each
of 75%,
260
// and the available space is 300px,
each
column will become 100px in width.
303
// columns will
each
be 50px in width.
317
// For example if we have 100px of space and two column of
each
40px, both
576
// Compute a new width and height according to the positioning of
each
expanded child frame.
/frameworks/base/docs/html/guide/topics/ui/
declaring-layout.jd
86
<p>
Each
layout file must contain exactly one root element, which must be a View or ViewGroup object. Once you've defined the root element, you can add additional layout objects or widgets as child elements to gradually build a View hierarchy that defines your layout. For example, here's an XML layout that uses a vertical {@link android.widget.LinearLayout}
108
<p>We'll discuss
each
of the attributes shown here a little later.</p>
112
<p>When you compile your application,
each
XML layout file is compiled into a
193
contains property types that define the size and position for
each
child view, as
195
view group defines layout parameters for
each
child view (including the child view group).</p>
200
values.
Each
child element must define LayoutParams that are appropriate for its parent,
204
<code>layout_height</code>), and
each
view is required to define them. Many
themes.jd
67
style is applied as a theme, every View in the Activity or application will apply
each
style
81
<p>For
each
style you want to create, add a {@code <style>} element to the file
83
Then add an {@code <item>} element for
each
property of that style, with a
102
<p>
Each
child of the {@code <resources>} element is converted into an application resource
227
<p class="note"><strong>Note:</strong> Don't forget to prefix the property names in
each
254
application will apply
each
property that it supports. For example, if you apply the {@code
367
themes will give you a better understanding of what style properties
each
one provides.
/frameworks/base/media/libstagefright/codecs/aacdec/
apply_ms_synt.cpp
38
pFrameInfo = Pointer to structure that holds information about
each
group.
48
each
grouped scalefactor band.
52
the encoding of
each
grouped scalefactor band.
232
stack usage for
each
subroutine called]
242
used to represent cycle count for
each
subroutine
341
*
Each
window in the frame should have the same number of coef's,
348
* constant for
each
frame, sfb_per_win can be determined outside
get_tns.cpp
66
Pointer to structure that holds information about
each
block.
92
pTnsFrameInfo->filt[]->order = The order of
each
individual TNS filter.
100
pTnsFrameInfo->filt[]->coef[] =
Each
filter's coefficients are filled with
103
pTnsFrameInfo->filt[]->direction = A flag is set for
each
TNS filter.
174
stack usage for
each
subroutine called]
184
used to represent cycle count for
each
subroutine
230
* number of scalefactor bands for
each
TNS filter. This value is effected
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/
Exchanger.java
14
* within pairs.
Each
thread presents some object on entry to the
65
* <p>Memory consistency effects: For
each
pair of threads that
67
* prior to the {@code exchange()} in
each
thread
87
* occupying thread if it is blocked. In
each
case CAS'es may
132
* contention failures in
each
of three tried slots. Requiring
147
* Hashing:
Each
thread picks its initial slot to use in accord
148
* with a simple hashcode. The sequence is the same on
each
174
* to
each
other, which can cause much thrashing of cache lines on
419
// Three forms of waiting.
Each
just different enough not to merge
/external/bluetooth/bluez/
COPYING.LIB
52
To protect
each
distributor, we want to make it very clear that
122
Each
licensee is addressed as "you".
152
you conspicuously and appropriately publish on
each
copy an
198
entire whole, and thus to
each
and every part regardless of who wrote
278
You must give prominent notice with
each
copy of the work that the
366
10.
Each
time you redistribute the Library (or any work based on the
418
Each
version is given a distinguishing version number. If the Library
469
safest to attach them to the start of
each
source file to most effectively
470
convey the exclusion of warranty; and
each
file should have at least the
/external/bluetooth/glib/
COPYING
48
Also, for
each
distributor's protection, we want to make certain
110
General Public License (also called "this License").
Each
licensee is
141
you conspicuously and appropriately publish on
each
copy an
188
entire whole, and thus to
each
and every part regardless of who wrote
270
You must give prominent notice with
each
copy of the work that the
351
10.
Each
time you redistribute the Library (or any work based on the
404
Each
version is given a distinguishing version number. If the Library
457
safest to attach them to the start of
each
source file to most effectively
458
convey the exclusion of warranty; and
each
file should have at least the
/external/bluetooth/glib/gmodule/
COPYING
48
Also, for
each
distributor's protection, we want to make certain
110
General Public License (also called "this License").
Each
licensee is
141
you conspicuously and appropriately publish on
each
copy an
188
entire whole, and thus to
each
and every part regardless of who wrote
270
You must give prominent notice with
each
copy of the work that the
351
10.
Each
time you redistribute the Library (or any work based on the
404
Each
version is given a distinguishing version number. If the Library
457
safest to attach them to the start of
each
source file to most effectively
458
convey the exclusion of warranty; and
each
file should have at least the
/external/icu4c/i18n/unicode/
choicfmt.h
47
* or more contiguous ranges.
Each
range is mapped to a
72
* vertical bar after the last range.
Each
range specifier is of the
116
* <li><code>double limits[]</code> gives the start of
each
119
* <li><code>UBool closures[]</code> determines whether
each
limit
128
* associated with
each
interval.</li>
291
* default,
each
limit in the array specifies the inclusive lower
297
* @param closures Array of booleans specifying whether
each
393
* @param formatsToCopy The format strings you want to use for
each
limit.
679
*
Each
ChoiceFormat divides the range -Inf..+Inf into fCount
/external/jdiff/
NOTICE.txt
52
To protect
each
distributor, we want to make it very clear that
124
Each
licensee is addressed as "you".
154
you conspicuously and appropriately publish on
each
copy an
201
entire whole, and thus to
each
and every part regardless of who wrote
283
You must give prominent notice with
each
copy of the work that the
372
10.
Each
time you redistribute the Library (or any work based on the
425
Each
version is given a distinguishing version number. If the Library
478
safest to attach them to the start of
each
source file to most effectively
479
convey the exclusion of warranty; and
each
file should have at least the
/external/libpng/
libpng-1.2.44.txt
94
instances of the structures.
Each
thread should have its own
134
of
each
one. See example.c and png.h for more detail. While
310
called after
each
row has been read, which you can use to control
477
where row_pointers is an array of pointers to the pixel data for
each
row:
647
(PNG_INFO_sBIT)
each
of the gray,
780
(
Each
of these returns 0 [signifying "unknown"] if
[
all
...]
/external/qemu/
COPYING.LIB
52
To protect
each
distributor, we want to make it very clear that
124
Each
licensee is addressed as "you".
154
you conspicuously and appropriately publish on
each
copy an
201
entire whole, and thus to
each
and every part regardless of who wrote
283
You must give prominent notice with
each
copy of the work that the
372
10.
Each
time you redistribute the Library (or any work based on the
425
Each
version is given a distinguishing version number. If the Library
478
safest to attach them to the start of
each
source file to most effectively
479
convey the exclusion of warranty; and
each
file should have at least the
/external/webkit/JavaScriptCore/
COPYING.LIB
56
Also, for
each
distributor's protection, we want to make certain
116
General Public License (also called "this License").
Each
licensee is
147
you conspicuously and appropriately publish on
each
copy an
193
entire whole, and thus to
each
and every part regardless of who wrote
273
You must give prominent notice with
each
copy of the work that the
353
10.
Each
time you redistribute the Library (or any work based on the
405
Each
version is given a distinguishing version number. If the Library
455
safest to attach them to the start of
each
source file to most effectively
456
convey the exclusion of warranty; and
each
file should have at least the
Completed in 383 milliseconds
<<
51
52
53
54
55
56
57
58
59
60
>>