HomeSort by relevance Sort by last modified time
    Searched defs:inserts (Results 1 - 10 of 10) sorted by null

  /external/robolectric-shadows/robolectric/src/test/java/org/robolectric/shadows/
ShadowSimpleCursorAdapterTest.java 65 String[] inserts = { local
73 for (String insert : inserts) {
ShadowCursorAdapterTest.java 28 String[] inserts = { local
36 for (String insert : inserts) {
SQLiteCursorTest.java 464 String[] inserts = { local
470 for (String insert : inserts) {
  /device/google/bonito/json-c/
linkhash.h 111 * Number of inserts.
113 int inserts; member in struct:lh_table
  /device/google/crosshatch/json-c/
linkhash.h 111 * Number of inserts.
113 int inserts; member in struct:lh_table
  /external/jdiff/src/jdiff/
Diff.java 127 int inserts = hunk.inserted; local
129 if (deletes == 1 && inserts == 1) {
137 if (deletes == 1 && inserts == 1 &&
183 int inserts = hunk.inserted; local
184 if (deletes == 0 && inserts == 0) {
194 // Index of last inserted word, invalid if inserts == 0
199 System.out.println("inserts: " + inserts);
238 if (inserts != 0) {
    [all...]
  /external/antlr/runtime/Java/src/main/java/org/antlr/runtime/
TokenRewriteStream.java 403 // should be included (they will be inserts).
412 * overlapping replaces that are not completed nested). Inserts to
443 * Then we can deal with inserts:
445 * 1. for any inserts to same index, combine even if not adjacent.
469 // Wipe prior inserts within range
470 List<? extends InsertBeforeOp> inserts = getKindOfOps(rewrites, InsertBeforeOp.class, i); local
471 for (int j = 0; j < inserts.size(); j++) {
472 InsertBeforeOp iop = inserts.get(j);
514 // WALK INSERTS
  /external/Reactive-Extensions/RxCpp/Rx/v2/src/rxcpp/
rx-util.hpp 465 bool inserts[] = {(os << tn, true)...}; local
466 inserts[0] = *reinterpret_cast<bool*>(inserts); // silence warning
  /external/guava/guava/lib/
jdiff.jar 
  /external/guice/lib/build/jdiff/
jdiff.jar 

Completed in 4070 milliseconds