Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:each (Results 301 - 325 of 14595) sorted by null

<<11121314151617181920>>

/external/icu4c/i18n/
olsontz.h	39 * "Asia/Shanghai". Each resource describes the behavior of the given 60 * Each time is represented by a pair of 32bit integer. 64 * Array of bytes representing the mapping between each transition 87 * all zones including the zone itself. Each zone is referenced by 97 * with an underscore prepended, e.g., "_EU". Each resource describes 109 * Each item is either a 2-letter ISO country code or "001" 309 * Number of transitions in each time range 316 * Time of each transition in seconds from 1970 epoch before 32bit second range (<= 1900). 317 * Each transition in this range is represented by a pair of int32_t. 323 * Time of each transition in seconds from 1970 epoch in 32bit second range     [all...]
/external/webkit/Source/WebCore/platform/graphics/chromium/
UniscribeHelper.h	132 // each word in the input (beyond whatever whitespace character separates 220 // An array corresponding to each item in runs_ containing information 221 // on each of the glyphs that were generated. Like runs_, this is in 222 // reading order. However, for rtl text, the characters within each 252 // elements and the advance that should be used for each one. This is 274 // For each input character, this tells us the first glyph index it 283 // Flags and such for each glyph. 286 // Horizontal advances for each glyph listed above, this is basically 287 // how wide each glyph is. 293 // that they don't bump against each other and the base character     [all...]
/frameworks/media/libvideoeditor/vss/video_filters/src/
M4VFL_transition.c	236 * Set the increment of blendingfactor for each element in the image row by the factor, 239 * Loop on each(= i) row of output Y plane (steps of 2) 240 * Loop on each(= j) column of output Y plane (steps of 2) 336 /* Set the stride for the next row in each input1 YUV420 plane */ 341 /* Set the stride for the next row in each input2 YUV420 plane */ 346 /* Set the stride for the next row in each output YUV420 plane */ 381 /* Set the increment of blendingfactor for each element in the image row */ 391 /* Two YUV420 rows are computed at each pass */ 394 /* Set pointers to the beginning of the row for each input image1 plane */ 399 /* Set pointers to the beginning of the row for each input image2 plane *     [all...]
/external/chromium/base/
shared_memory_unittest.cc	22 // Each thread will open the shared memory. Each thread will take a different 4 24 // Verify that each thread's value in the shared memory is always correct. 71 // Each thread will open the shared memory. Each thread will take the memory, 73 // between. Verify that each thread's value in the shared memory is always 219 // Create a set of N threads to each open a shared memory segment and write to 261 // Create a set of threads to each open a shared memory segment and write to it 307 // zero out the first int in each except for i; for that one, make it 100.
/development/pdk/docs/compatibility/
overview.jd	9 <p>Each group depends on the others. Users want a wide selection of devices 14 <p>Our goals were designed to benefit each of these groups:</p> 53 <p>Just as each version of the Android platform exists in a separate branch in 54 the source code tree, there is a separate CTS and CDD for each version as 59 <p>For each release of the Android platform, a detailed Compatibility
/docs/source.android.com/src/compatibility/
overview.md	27 Each group depends on the others. Users want a wide selection of devices 33 Our goals were designed to benefit each of these groups: 76 Just as each version of the Android platform exists in a separate branch in 77 the source code tree, there is a separate CTS and CDD for each version as 83 For each release of the Android platform, a detailed Compatibility
/external/chromium/sdch/open-vcdiff/src/
codetable.h	55 // as described in Section 7 of RFC 3284. Each instruction code 57 // size, and mode each appear twice. Each of the two delta instructions 96 // Each instruction code entry contains six fields, each of which is a single
/external/dbus/test/data/sha-1/
Readme.txt	12 messages (and not messages of a non-byte length), the SHS tests each come in two flavors. For 26 can correctly generate digests for longer messages. A list of 100 messages, each of length > 1024, 59 during execution of the above procedure, and it ensures that messages will be of a byte length. Each 65 There are two files included for each test type (bit-oriented and byte-oriented). One file contains 71 where z>=0 that represents the number of n, b is either 0 or 1, and each n(i) is a decimal integer
/external/icu4c/common/
propsvec.h	34 * Logically, each row has a certain number of uint32_t values, 38 * In each internal row, 113 * - for each (non-unique) row, call the handler function 119 * In a first phase, only special values are delivered (each exactly once), 124 * Then, in the second phase, the handler is called for each row of real values.
/external/iptables/extensions/
libxt_recent.man	21 Match/save the source address of each packet in the recent list table. This 25 Match/save the destination address of each packet in the recent list table. 72 about each entry of each list. 74 Each file in \fB/proc/net/xt_recent/\fP can be read from to see the current
/external/valgrind/main/docs/lib/
line-wrap.xsl	62 <xsl:for-each select="ext:node-set($vResult)/line"> 63 <xsl:for-each select="word"> 65 </xsl:for-each> 67 </xsl:for-each> 97 <!-- which is a list of 'line' elements, each having a list of 'word' -->
/external/wpa_supplicant_8/src/wps/
wps_upnp_i.h	62 * supposed to send (via TCP) updates to each subscriber, trying each address 87 * and is then included with each event sent to the subscriber. 112 /* FIX: maintain separate structures for each UPnP peer */ 118 * multiple wireless interfaces sharing the same UPnP device instance. Each
/frameworks/base/docs/html/guide/topics/views/
intro.jd	24 <p>To attach the tree to the screen for rendering, your Activity calls its setContentView() method and passes a reference to the root node object. Once the Android system has the reference to the root node object, it can work directly with the node to invalidate, measure, and draw the tree. When your Activity becomes active and receives focus, the system notifies your activity and requests the root node to measure and draw the tree. The root node then requests that its child nodes draw themselves &mdash; in turn, each viewgroup node in the tree is responsible for drawing its direct children. </p> 26 <p>As mentioned previously, each view group has the responsibility of 28 each child to let it render itself. The children may request a size and location 30 each child can be.</p> 42 values. Each child element must define LayoutParams that are appropriate for its parent, although it may define different LayoutParams for its children. </p>
/frameworks/base/docs/html/resources/samples/
get.jd	27 components, each of which contains the samples for a specific Android platform 69 structure of each sample and look at the source code in each of its files. </p> 73 From there you can read a short summary of each sample application and what 75 to move through the directories and files of each sample. The browseable source
/external/oprofile/doc/
internals.xml	46 regularly sampling the current registers on each CPU (from an interrupt handler, the 56 the task's list of mapped memory areas. Each PC value is thus converted into a tuple 64 reflect reality. In common operation, the time between each sample interrupt is regulated 74 increment once per each event, and generate an interrupt on reaching some pre-defined 137 counters. For example, on x86, one numbered directory for each hardware 138 performance counter is added, with files in each for the event type, 184 they collate a subset of the available sample files, load and process each one 247 for each model type that programs the counter registers correctly 277 enable each configured counter. Again, the details of how this is 290 is forked for each CPU, which creates a perfmon context and sets th     [all...]
/dalvik/dexgen/src/com/android/dexgen/rop/code/
InsnList.java	68 * Visits each instruction in the list, in order. 82 * The blocks must have the same number of insns, and each Insn must 106 * the registers in each instruction are offset by the given
/dalvik/dx/src/com/android/dx/rop/code/
InsnList.java	68 * Visits each instruction in the list, in order. 82 * The blocks must have the same number of insns, and each Insn must 106 * the registers in each instruction are offset by the given
/dalvik/vm/alloc/
Verify.cpp	24 * Visitor applied to each reference field when searching for things 38 * Visitor applied to each bitmap element to search for things that 54 * Visitor applied to each root to search for things that point to an
/external/apache-xml/src/main/java/org/apache/xalan/templates/
ElemWhen.java	42 * Each xsl:when element has a single attribute, test, 50 * Each xsl:when element has a single attribute, test, 62 * Each xsl:when element has a single attribute, test,
/external/bison/lib/
bitsetv.c	26 /* Create a vector of N_VECS bitsets, each of N_BITS, and of 37 /* Determine number of bytes for each set. */ 62 /* Create a vector of N_VECS bitsets, each of N_BITS, and with
/external/chromium/base/debug/
leak_tracker.h	42 // then the allocation callstack for each leaked instances is dumped to 76 // Walk the allocation list and print each entry it contains. 122 // Each specialization of LeakTracker gets its own static storage.
/external/chromium/chrome/browser/
external_protocol_handler.h	48 // This is implemented separately on each platform. 73 // each extension API function. Note that each call to LaunchUrl resets
/external/chromium/chrome/browser/resources/net_internals/
spdyview.js	6 * This view displays a summary of the state of each SPDY sessions, and 41 * on each SPDY session. Otherwise, displays "None". 72 * with information on each alternate protocol enabled server. Otherwise,
/external/chromium/net/base/
ssl_false_start_blacklist.h	82 // kHashTable contains an offset into |kHashData| for each bucket. The 86 // into this array. Each bucket consists of zero or more, 8-bit length 87 // prefixed strings. Each string is a DNS name in dotted form. For a given
/external/chromium/net/proxy/
multi_threaded_proxy_resolver.h	56 // For each new thread that we spawn, a corresponding new ProxyResolver is 72 // multi-threaded model, each thread may have a different value for this 80 // For each thread that is created, an accompanying synchronous ProxyResolver

Completed in 853 milliseconds

<<11121314151617181920>>