HomeSort by relevance Sort by last modified time
    Searched full:each (Results 401 - 425 of 7153) sorted by null

<<11121314151617181920>>

  /external/opencore/fileformats/mp4/composer/src/
atomutils.cpp 249 else if (sizeOfClass <= 0x3fff) return sizeOfClass - 3; // _sizeOfClass fp 2 bytes (7 LS bits each)
250 else if (sizeOfClass <= 0x1fffff) return sizeOfClass - 4; // _sizeOfClass fp 3 bytes (7 LS bits each)
251 else if (sizeOfClass <= 0x0fffffff) return sizeOfClass - 5; // _sizeOfClass fp 4 bytes (7 LS bits each)
263 else if (contentSize <= 0x3ffd) return 2; // _sizeOfClass field can be rendered in 2 bytes (7 LS bits each)
264 else if (contentSize <= 0x1ffffc) return 3; // _sizeOfClass field can be rendered in 3 bytes (7 LS bits each)
265 else if (contentSize <= 0xfffffffb) return 4; // _sizeOfClass field can be rendered in 4 bytes (7 LS bits each)
  /external/jdiff/src/jdiff/
DiffMyers.java 45 /** Prepare to find differences between two arrays. Each element of
133 /* Extend the top-down search by an edit step in each diagonal. */
278 which are known, as a whole, to match each other.
281 storing a 1 in the element for each line that is an insertion or deletion.
376 /* Find # lines changed here in each file. */
384 /* We have reached lines in the two files that match each other. */
410 /* Find # lines changed here in each file. */
418 /* We have reached lines in the two files that match each other. */
468 Each change represents one place where some lines are deleted
514 /* Allocate a flag for each line of each file, saying whether that lin
    [all...]
  /dalvik/docs/
dalvik-constraints.html 59 For each of the link, string_ids, type_ids, proto_ids, field_ids, method_ids, class_defs
69 and data sections must overlap each other or the header.
71 If a map exists, then each map entry must have a valid type. Each type may
74 If a map exists, then each map entry must have a nonzero offset and size. The
89 For each string_id_item, the string_data_off field must contain a valid
94 For each type_id_item, the desciptor_idx field must contain a valid reference
97 For each proto_id_item, the shorty_idx field must contain a valid reference
104 For each field_id_item, both the class_idx and type_idx fields must be a valid
111 For each method_id_item, the class_idx field must be a valid index into th
    [all...]
  /external/openssl/crypto/rand/
rand_win.c 125 a maximum of 1000 miliseconds each, unless CryptoGenRandom failed */
261 * contains 17 fields. We treat each field as a source of
316 * byte of each DWORD is random.
491 * each entry. Consider each field a source of 1 byte
494 * each entry. Consider each field a source of 1 byte
569 * with each entry. Consider each field a source of
582 * with each entry. Consider each field a source o
    [all...]
  /frameworks/base/core/java/com/android/internal/view/menu/
IconMenuView.java 56 /** Height of each row */
87 /** Background of each item (should contain the selected and focused states) */
109 * mode between each's title and its shortcut. This is the last caption mode
115 * The layout to use for menu items. Each index is the row number (0 is the
116 * top-most). Each value contains the number of items in that row.
223 * The bottom rows will each get a leftover item. Rows (indexed at 0)
234 // Fill the bottom rows with a leftover item each
244 * Checks whether each item's title is fully visible using the current
247 * @return True if the items fit (each item's text is fully visible), false
378 * just computes positions for each child, and then stores them in the child's layout params
    [all...]
  /build/tools/apriori/
source.h 84 This array is parallel to relocation_sections, and for each entry
98 /* This is an array that contains one element for each library dependency
  /cts/tests/tests/graphics/src/android/graphics/cts/
DiscretePathEffectTest.java 70 // draw guide line into red channel (each segment should cross this once)
78 // draw guide rectangle into blue channel (each segment must be completely inside this)
  /cts/tools/dx-tests/src/dxc/junit/opcodes/ret/
Test_ret.java 67 * @title each returnAddress can be returned only
133 * @title each returnAddress can be returned only
  /cts/tools/signature-tools/src/signature/model/
IClassDefinition.java 51 * Returns a list containing each package fragment.
58 * @return a list containing each package fragment
  /dalvik/dx/etc/
opcode-gen 22 # opcodes: static final ints for each opcode
23 # dops: static final objects for each opcode
  /dalvik/dx/src/com/android/dx/dex/file/
UniformItemSection.java 26 * {@link Item} objects. Each of the items must have the same size in
53 // Since each item has to be the same size, we can pick any.
  /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/
CyclicBarrier.java 12 * each other to reach a common barrier point. CyclicBarriers are
14 * must occasionally wait for each other. The barrier is called
66 * Here, each worker thread processes a row of the matrix then waits at the
71 * <tt>true</tt> and each worker will terminate.
75 * action when it is released. To facilitate this, each invocation of
105 * Each use of the barrier is represented as a generation instance.
132 * on each generation. It is reset to parties on each new
  /dalvik/libcore/dom/src/test/java/org/w3c/domts/level2/core/
namednodemapgetnameditemns06.java 36 * Since NamedNodeMaps are live each one should get updated, using the getNamedItemNS retreive
37 * the newly created attribute from each node map.
  /dalvik/libcore/luni/src/main/java/java/util/
AbstractCollection.java 47 * iterates over the given {@code Collection} and calls {@code add} for each
87 * remove} method on each element. If the iterator does not support removal
112 * {@code object.equals(e)} is called for each element {@code e} returned by
114 * each element {@code e} returned by the iterator is compared with the test
204 * {@code Collection} and tests for each element {@code e} returned by the iterator,
246 * Removes all occurrences in this {@code Collection} of each object in the
251 * This implementation iterates over this {@code Collection} and tests for each
292 * This implementation iterates over this {@code Collection} and tests for each
Comparator.java 22 * respect to each other. On a given {@code Collection}, a {@code Comparator} can be used to
25 * method has to return zero for each pair of elements (a,b) where a.equals(b)
  /dalvik/libcore/security/src/main/java/org/apache/harmony/security/utils/
Array.java 81 // Add additional delimiter for each 8 values
85 // Add character representation for each line
  /dalvik/libcore/xml/src/main/java/javax/xml/parsers/
FilePathToURI.java 74 // for each character in the path
105 // for each byte
  /dalvik/libcore/xml/src/main/java/javax/xml/transform/stream/
FilePathToURI.java 74 // for each character in the path
105 // for each byte
  /dalvik/libcore/xml/src/main/java/org/apache/xalan/extensions/
ExtensionNamespaceSupport.java 28 * During styleseet composition, an ExtensionNamespaceSupport object is created for each extension
30 * an ExtensionHandler for each of these objects and adds an entry to the ExtensionsTable hashtable.
  /dalvik/libcore/xml/src/test/java/tests/xml/
DeclarationTest.java 73 * each of these winds up in the correct location in the document model, we
74 * supply different names for each. This is only safe because for the subset
  /dalvik/tools/gdbjithelper/
gdbjithelper.c 22 /* Currently debuggerd dumps 20 words each around PC and LR */
77 /* Each points to a two-page buffer */
  /development/simulator/app/
Shmem.h 18 * Platform-independent shared memory. Each object can be used to
21 * For convenience, a semaphore is associated with each segment.
  /development/tools/findunused/
findunusedresources 57 # and try to find a reference to each constant.
63 # Now look for each of the constants in the contatenated file.
  /external/bison/lib/
timevar.h 23 portions of the compiler. Each measures elapsed user, system, and
28 timevar.def. Each has an enumeral identifier, used when referring
  /external/blktrace/doc/
btt.1 79 option is specified. The display will display each IO generated, with the time
135 period of each other. The default values is 0.1 seconds; with this option
147 are the major and minor number of each device, and each device identifier is
190 name for each device.
222 "sequences" \- showing the parts of each IO (Q, A, I/M, D, & C).
240 name for each device.
339 name for each device.

Completed in 214 milliseconds

<<11121314151617181920>>