Searched defs:objects (Results 1 - 3 of 3) sorted by relevance
/libcore/benchmarks/src/benchmarks/regression/ |
H A D | StringEqualsBenchmark.java | 43 + "live objects from garbage objects. The second is reclaiming the rage of garbage object" 45 + "closure of all reachable objects in a process known as tracing from theoots. After the" 46 + "trace has completed, garbage objects are reclaimed. Each of these operations can be" 52 + "all reachable objects. When the application is paused, the object graph cannot change." 53 + "The GC can therefore walk this structure and assume that all reachable objects live." 55 + "may be changed. These changes may cause live objects to be hidden and falsely recla by" 57 + "to objects in a separate structure. After performing its walk, the GC will revisit the" 58 + "updated objects and re-validate its assumptions. Without a card table, the garbage" 59 + "collector would have to visit all objects reache 167 private final Object[] objects = new Object[] { field in class:StringEqualsBenchmark [all...] |
/libcore/support/src/test/java/org/apache/harmony/testframework/serialization/ |
H A D | SerializationTest.java | 46 * returns array of objects to be de/serialized in tests, and the second 47 * compares reference and deserialized objects (needed only if tested objects do 56 * serialized objects. This mode should be run on a pure 74 * override it to provide actual objects for testing. 76 * @return array of objects to be de/serialized in tests. 81 * Tests that data objects can be serialized and deserialized without 83 * objects. 96 * Tests that data objects can be deserialized from golden files, to verify 123 * Working method for files generation mode. Serializes test objects 336 verifyGolden(TestCase test, Object[] objects) argument 356 verifyGolden(TestCase test, Object[] objects, SerializableAssert comparator) argument 400 verifySelf(Object[] objects) argument 415 verifySelf(Object[] objects, SerializableAssert comparator) argument [all...] |
/libcore/ojluni/src/main/java/java/text/ |
H A D | Bidi.java | 48 * all left-to-right or all right-to-left. Such objects are very lightweight and 354 * Reorder the objects in the array into visual order based on their levels. 355 * This is a utility function to use when you have a collection of objects 359 * in the objects array will be reordered into visual order assuming 365 * @param objects the array of objects to be reordered into visual order 366 * @param objectStart the start position in the objects array 367 * @param count the number of objects to reorder 369 public static void reorderVisually(byte[] levels, int levelStart, Object[] objects, int objectStart, int count) { argument 375 if (0 > objectStart || objects [all...] |
Completed in 938 milliseconds