| /external/icu4c/common/ |
| uprops.c | 447 * For each two consecutive characters (start, limit) in the set,
469 * repetitive values, so that the value of only each start code point
480 * that are precise for each of some 50 properties.
485 * Each range contains the same values for a whole group of properties.
498 * - Alternatively, a UnicodeSet could hold each even-numbered range.
499 * All ranges could be enumerated by using each start code point
500 * (for the even-numbered ranges) as well as each limit (end+1) code point
|
| /external/icu4c/i18n/ |
| olsontz.h | 39 * "Asia/Shanghai". Each resource describes the behavior of the given
54 * Otherwise each transtion indicates a time after which (inclusive)
62 * transitions vector, so length may be zero. Each unsigned byte
92 * with an underscore prepended, e.g., "_EU". Each resource describes
104 * country codes, with a percent sign prepended, e.g., "%US". Each
307 * Time of each transition in seconds from 1970 epoch.
313 * Offset from GMT in seconds for each type.
|
| /external/icu4c/layout/ |
| LEGlyphStorage.h | 23 * For each glyph it holds the glyph ID, the index of the backing store character
97 * will call this method once for each insertion.
158 * @param extraBits - this value will be ORed with each glyph index
168 * character index for each glyph.
180 * character index for each glyph.
183 * @param indexBase - an offset which will be added to each index
193 * X and Y position for each glyph, plus an extra X and Y for the
|
| /external/iproute2/man/man8/ |
| tc-cbq.8 | 99 Within the one CBQ instance many classes may exist. Each of these classes
107 At each node we look for an instruction, and then go to the class the
112 The following actions are performed, in order at each node we visit, until one
139 in which each class with packets gets a chance to send in turn. The WRR process
211 have more traffic to offer during each round, so it makes sense to allow
218 during each round of the process. This parameter is weighted using the
299 CBQ can measure how much bandwidth each class is using, which tc filters
|
| /external/qemu/distrib/zlib-1.2.3/ |
| inftrees.c | 58 unsigned short count[MAXBITS+1]; /* number of codes of each length */
59 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */
77 code lengths are lens[0..codes-1]. Each length corresponds to the
93 The codes are sorted by computing a count of codes for each length,
94 creating from that a table of starting indices for each length in the
140 /* generate offsets into symbol table for each length for sorting */
145 /* sort symbols by length, by symbol order within each length */
|
| /external/svox/pico/lib/ |
| picokdt.h | 102 /* number of attributes (= input vector size) for each tree type */
235 tree input vector: 0-2 POS or POSgroup for each of the three previous words
237 4-6 POS or POSgroup (can be history) for each of
329 tree input vector: 0-1 POS for each of the two previous words
331 3-4 POS for each of the two following words
376 tree input vector: 0-1 POS for each of the two previous words
378 3-4 POS for each of the two following words
|
| /external/zlib/contrib/infback9/ |
| inftree9.c | 58 unsigned short count[MAXBITS+1]; /* number of codes of each length */
59 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */
79 code lengths are lens[0..codes-1]. Each length corresponds to the
95 The codes are sorted by computing a count of codes for each length,
96 creating from that a table of starting indices for each length in the
134 /* generate offsets into symbol table for each length for sorting */
139 /* sort symbols by length, by symbol order within each length */
|
| /external/zlib/ |
| inftrees.c | 58 unsigned short count[MAXBITS+1]; /* number of codes of each length */
59 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */
77 code lengths are lens[0..codes-1]. Each length corresponds to the
93 The codes are sorted by computing a count of codes for each length,
94 creating from that a table of starting indices for each length in the
140 /* generate offsets into symbol table for each length for sorting */
145 /* sort symbols by length, by symbol order within each length */
|
| /frameworks/base/docs/html/guide/developing/tools/ |
| traceview.jd | 107 <li>A <a href="#timelinepanel">timeline panel</a> -- describes when each thread
116 <p>The image below shows a close up of the timeline panel. Each thread’s
117 execution is shown in its own row, with time increasing to the right. Each method
197 <p>The key file is a plain text file divided into three sections. Each
228 <dd>One line per thread. Each line consists of two parts: the thread ID, followed
263 <p>The dmtracedump tool generates the call stack data as a tree diagram, with each call
269 <p style="margin-top:1em;">For each node, dmtracedump shows <code><ref> <em>callname</em> (<inc-ms>,
|
| /frameworks/base/docs/html/videos/ |
| index.jd | 12 /* This 'playlist' object defines the playlist IDs for each tab.
13 * Each name inside 'playlist' corresponds to class names for the tab that the playlists belong to (eg: "googleioTab" and "googleioBox" divs).
14 * Each string in 'ids' is the ID of a YouTube playlist that belongs in the corresponding tab.
37 * Each playlist ID is paired with a custom video description.
88 // Loop through each entry (each video) and add it to the 'videoPreviews' list
214 $("a." + videoId).addClass("selected").each( function (i) {
|
| /frameworks/base/services/java/com/android/server/ |
| PackageManagerBackupAgent.java | 46 * We back up the signatures of each package so that during a system restore,
63 // version & signature info of each app in a restore set
65 // The version info of each backed-up app as read from the state file
119 // The backed up data is the signature block for each app, keyed by
160 // For each app we have on device, see if we've backed it up yet. If not,
200 * Metadata for each package:
251 // set of app signatures associated with each backed-up app in this restore
|
| /system/wlan/ti/sta_dk_4_0_4_32/common/src/hal/FirmwareApi/ |
| public_descriptors.h | 47 The Tx path uses a double buffer and a TxControl structure, each located at a
52 The size of each of the two buffers is large enough to hold the longest 802.3
71 2. For each packet with a Tx Complete field set, the firmware adds the transmit
231 The Rx path uses a double buffer and an RxControl structure, each located at
236 The size of each of the two buffers is large enough to hold the longest 802.3
242 1. The device generates an interrupt each time a new packet is received and
244 interrupt sources, one for each buffer. It is possible that both interrupt
|
| /frameworks/base/docs/html/guide/topics/ui/ |
| menus.jd | 81 for each item you'd like in the menu. This method adds a {@link android.view.MenuItem}, and returns the
148 called each time the menu is opened. This will pass you the Menu object, just like the
184 to add a context menu for each note in the list:</p>
229 object used in the Notepad application's {@link android.app.ListActivity}. As such, each item
312 Each element also supports all the necessary attributes to control features like shortcut keys,
321 <p>When adding new items to a menu, you can optionally include each item in a group.
346 each time the state changes between on and off.</p>
372 assign the same group ID to each menu item
375 on each menu items, because the group as a whole is set checkable. Here's an example of
385 to be checkable. The last one is whether we want each item to be exclusively checkable
[all...] |
| /frameworks/base/docs/html/guide/topics/providers/ |
| content-providers.jd | 82 at all. Typically, there's just a single instance of each type of
93 where each row is a record and each column is data of a particular type
150 record to record and column to column to read the contents of each field.
151 It has specialized methods for reading each type of data. So, to read a field,
160 Each content provider exposes a public URI (wrapped as a {@link android.net.Uri}
162 multiple data sets (multiple tables) exposes a separate URI for each one. All
326 each contact. It also reports the number of records that are returned as
327 the {@code _COUNT} field of each record.
336 each of these interfaces, which is why the code example above could refer
[all...] |
| /external/jpeg/ |
| jquant2.c | 35 * usage count of each possible color. To keep the histogram to a reasonable
42 * have as many boxes as desired colors. Then the mean color in each
45 * The second pass over the image maps each input pixel to the closest output
105 * We recommend keeping 6 bits for G and 5 each for R and B.
110 * (preferably unsigned long) for each cell. In practice this is overkill;
116 * in that capacity, each cell must be able to store zero to the number of
120 * of a true 3-D array, we use a row of pointers to 2-D arrays. Each
122 * each 2-D array has 2^6*2^5 = 2048 or 2^6*2^6 = 4096 entries. Note that
173 * each end saves us from special-casing the first and last pixels.
174 * Each entry is three values long, one value for each color component
[all...] |
| jcsample.c | 11 * is defined to be max_v_samp_factor pixel rows of each component,
13 * A single row group is processed in each call to the downsampler module.
42 * enabled, each input pixel P is replaced by a weighted sum of itself and its
43 * eight neighbors. P's weight is 1-8*SF and each neighbor's weight is SF,
110 * In this version we simply downsample each component independently.
310 * smoothed values. Each of the four member pixels contributes a fraction
311 * (1-8*SF) to its own smoothed image and a fraction SF to each of the three
315 * eight edge-adjacent neighbors contribute SF to each of two smoothed
409 /* Each of the eight neighbor pixels contributes a fraction SF to the
460 * Note that we must select a routine for each component
[all...] |
| /external/webkit/SunSpider/tests/parse-only/ |
| jquery-1.3.2.js | 154 each: function( callback, args ) {
155 return jQuery.each( this, callback, args );
182 return this.each(function(i){
207 jQuery.each( text || this, function(){
208 jQuery.each( this.childNodes, function(){
241 return this.each(function(){
247 return this.each(function(){
329 ret.find("*").andSelf().each(function(){
459 return this.each(function(){
470 jQuery( "option", this ).each(function()
[all...] |
| /external/guava/src/com/google/common/collect/ |
| Iterables.java | 45 * of type {@code Iterable}. Except as noted, each method has a corresponding
385 * has an iterator that traverses the elements of each iterable in
399 * has an iterator that traverses the elements of each iterable in
452 * @param size the desired size of each partition (the last may be smaller)
473 * two inner lists of three elements each, all in the original order.
479 * @param size the desired size of each partition
581 * Returns an iterable that applies {@code function} to each element of {@code
653 * Returns a view of the supplied iterable that wraps each generated
657 * @return a view of the supplied iterable that wraps each generated iterator
727 * <p>This method iterates over the iterable, checking each element returne
[all...] |
| /external/opencore/codecs_v2/audio/aac/dec/src/ |
| ms_synt.cpp | 62 q_formatLeft = Array containing the q-format used to encode each
65 q_formatRight = Array containing the q-format used to encode each
80 formula for M/S stereo on each scalefactor band where
84 formula for M/S stereo on each scalefactor band where
209 stack usage for each subroutine called]
219 used to represent cycle count for each subroutine
308 * shift_left_chan and shift_right_chan each have an offset
310 * q-format, we must shift each by 1 to guard against
345 * shift_left_chan and shift_right_chan each have an offset
347 * q-format, we must shift each by 1 to guard agains
[all...] |
| /external/strace/ |
| strace.1 | 113 The name of each system call, its arguments and its return value
132 Each line in the trace contains the system call name, followed
170 Notice how the `struct stat' argument is dereferenced and how each member is
221 Count time, calls, and errors for each system call and report a summary on
254 option is in effect, each processes trace is written to
256 where pid is the numeric process id of each process.
282 Print a relative timestamp upon entry to each system call. This
287 Prefix each line of the trace with the time of day.
299 difference between the beginning and the end of each system call.
400 Abbreviate the output from printing each member of large structures
[all...] |
| /frameworks/base/core/java/android/widget/ |
| TableLayout.java | 33 * each defining a row (actually, you can have other children, which will be
35 * their rows, columns, or cells. Each row has zero or more cells; each cell can
469 * <p>Finds the largest cell in each column. For each column, the width of
477 // find the maximum width for each column
480 // the array is reused for each layout operation; the array can grow
521 // rows, so we find the maximum width for each column
659 * <p>This set of layout parameters enforces the width of each child to be
660 * {@link #MATCH_PARENT} and the height of each child to b
[all...] |
| /frameworks/base/media/libstagefright/codecs/aacdec/ |
| ms_synt.cpp | 62 q_formatLeft = Array containing the q-format used to encode each
65 q_formatRight = Array containing the q-format used to encode each
80 formula for M/S stereo on each scalefactor band where
84 formula for M/S stereo on each scalefactor band where
209 stack usage for each subroutine called]
219 used to represent cycle count for each subroutine
308 * shift_left_chan and shift_right_chan each have an offset
310 * q-format, we must shift each by 1 to guard against
345 * shift_left_chan and shift_right_chan each have an offset
347 * q-format, we must shift each by 1 to guard agains
[all...] |
| /dalvik/libcore/ |
| NOTICE | 111 b) in the case of each subsequent Contributor:
141 a) Subject to the terms of this Agreement, each Contributor
148 b) Subject to the terms of this Agreement, each Contributor
161 c) Recipient understands that although each Contributor grants
165 any other entity. Each Contributor disclaims any liability to
169 hereunder, each Recipient hereby assumes sole responsibility to
176 d) Each Contributor represents that to its knowledge it has
212 b) a copy of this Agreement must be included with each copy of
218 Each Contributor must identify itself as the originator of its
264 OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solel
[all...] |
| /frameworks/base/tests/CoreTests/android/core/ |
| SSLSocketTest.java | 73 * @param innerLoop The number of times we do the request for each
75 * @param delay The delay after each request (in seconds).
188 * Does a single request for each of the hosts. Consumes the response.
200 * Does repeated requests for each of the hosts, with the connection being
213 * Does repeated requests for each of the hosts, with the connection being
228 * Does repeated requests for each of the hosts, with the connection being
229 * closed in between. Waits a couple of seconds after each request, but
245 * Does repeated requests for each of the hosts, with the connection being
246 * kept alive in between. Waits a longer time after each request.
267 * Does repeated requests for each of the hosts, with the connection bein
[all...] |
| /external/zlib/contrib/puff/ |
| puff.c | 183 * each length, which for a canonical code are stepped through in order.
189 short *count; /* number of symbols of each length */
290 * codes. Those tables are the number of codes of each length, and the symbols
291 * sorted by length, retaining their original order within each length. The
324 short offs[MAXBITS+1]; /* offsets in symbol table for each length */
326 /* count number of codes of each length */
342 /* generate offsets into symbol table for each length for sorting */
348 * put symbols in table sorted by length, by symbol order within each
487 * codes and distance codes are fixed. The specific lengths for each symbol
550 * from the number of bits in each code. Therefore the code description
[all...] |
