HomeSort by relevance Sort by last modified time
    Searched refs:inserts (Results 1 - 25 of 107) sorted by null

1 2 3 4 5

  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/d10v/
instruction_packing-007.s 2 ;; -gstabs --no-gstabs-packing inserts nop's so gdb will have the
  /prebuilts/go/darwin-x86/src/runtime/
norace_linux_test.go 24 // Can't be run with -race because it inserts calls into newOSProcCreated()
  /prebuilts/go/linux-x86/src/runtime/
norace_linux_test.go 24 // Can't be run with -race because it inserts calls into newOSProcCreated()
  /prebuilts/go/darwin-x86/src/container/list/
list.go 91 // insert inserts e after at, increments l.len, and returns e.
130 // PushFront inserts a new element e with value v at the front of list l and returns e.
136 // PushBack inserts a new element e with value v at the back of list l and returns e.
142 // InsertBefore inserts a new element e with value v immediately before mark and returns e.
152 // InsertAfter inserts a new element e with value v immediately after mark and returns e.
200 // PushBackList inserts a copy of an other list at the back of list l.
209 // PushFrontList inserts a copy of an other list at the front of list l.
  /prebuilts/go/linux-x86/src/container/list/
list.go 91 // insert inserts e after at, increments l.len, and returns e.
130 // PushFront inserts a new element e with value v at the front of list l and returns e.
136 // PushBack inserts a new element e with value v at the back of list l and returns e.
142 // InsertBefore inserts a new element e with value v immediately before mark and returns e.
152 // InsertAfter inserts a new element e with value v immediately after mark and returns e.
200 // PushBackList inserts a copy of an other list at the back of list l.
209 // PushFrontList inserts a copy of an other list at the front of list l.
  /external/robolectric/v1/src/test/java/com/xtremelabs/robolectric/shadows/
CursorAdapterTest.java 42 String[] inserts = { local
50 for (String insert : inserts) {
SQLiteCursorTest.java 328 String[] inserts = { local
334 for (String insert : inserts) {
  /prebuilts/go/darwin-x86/src/container/heap/
example_intheap_test.go 34 // This example inserts several ints into an IntHeap, checks the minimum,
  /prebuilts/go/darwin-x86/src/go/types/
objset.go 20 // Otherwise it inserts obj and returns nil.
  /prebuilts/go/linux-x86/src/container/heap/
example_intheap_test.go 34 // This example inserts several ints into an IntHeap, checks the minimum,
  /prebuilts/go/linux-x86/src/go/types/
objset.go 20 // Otherwise it inserts obj and returns nil.
  /prebuilts/go/darwin-x86/src/regexp/syntax/
simplify_test.go 60 // The next three are illegible because Simplify inserts (?:)
120 // interesting than they might otherwise be. String inserts
  /prebuilts/go/linux-x86/src/regexp/syntax/
simplify_test.go 60 // The next three are illegible because Simplify inserts (?:)
120 // interesting than they might otherwise be. String inserts
  /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...]
  /prebuilts/go/darwin-x86/test/
maplinear.go 59 panic(fmt.Sprintf("%s: too slow: %d inserts: %v; %d inserts: %v\n",
  /prebuilts/go/linux-x86/test/
maplinear.go 59 panic(fmt.Sprintf("%s: too slow: %d inserts: %v; %d inserts: %v\n",
  /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/
TokenRewriteStream.as 258 // should be included (they will be inserts).
269 * overlapping replaces that are not completed nested). Inserts to
296 * Then we can deal with inserts:
298 * 1. for any inserts to same index, combine even if not adjacent.
322 // Wipe prior inserts within range
323 var inserts:Array = getKindOfOps(rewrites, InsertBeforeOp, i);
324 for (var j:int = 0; j < inserts.length; j++) {
325 var iop:InsertBeforeOp = InsertBeforeOp(inserts[j]);
350 // WALK INSERTS
  /prebuilts/gdb/darwin-x86/lib/python2.7/
argparse.py 385 inserts = {}
397 if start in inserts:
398 inserts[start] += ' ['
400 inserts[start] = '['
401 inserts[end] = ']'
403 if start in inserts:
404 inserts[start] += ' ('
406 inserts[start] = '('
407 inserts[end] = ')'
409 inserts[i] = '|
    [all...]
  /prebuilts/gdb/linux-x86/lib/python2.7/
argparse.py 385 inserts = {}
397 if start in inserts:
398 inserts[start] += ' ['
400 inserts[start] = '['
401 inserts[end] = ']'
403 if start in inserts:
404 inserts[start] += ' ('
406 inserts[start] = '('
407 inserts[end] = ')'
409 inserts[i] = '|
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
argparse.py 385 inserts = {}
397 if start in inserts:
398 inserts[start] += ' ['
400 inserts[start] = '['
401 inserts[end] = ']'
403 if start in inserts:
404 inserts[start] += ' ('
406 inserts[start] = '('
407 inserts[end] = ')'
409 inserts[i] = '|
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
argparse.py 385 inserts = {}
397 if start in inserts:
398 inserts[start] += ' ['
400 inserts[start] = '['
401 inserts[end] = ']'
403 if start in inserts:
404 inserts[start] += ' ('
406 inserts[start] = '('
407 inserts[end] = ')'
409 inserts[i] = '|
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
TokenRewriteStream.cs 436 // should be included (they will be inserts).
446 * overlapping replaces that are not completed nested). Inserts to
473 * Then we can deal with inserts:
475 * 1. for any inserts to same index, combine even if not adjacent.
501 // Wipe prior inserts within range
502 var inserts = GetKindOfOps(rewrites, typeof(InsertBeforeOp), i);
503 for (int j = 0; j < inserts.Count; j++) {
504 InsertBeforeOp iop = (InsertBeforeOp)inserts[j];
531 // WALK INSERTS
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/
TokenRewriteStream.cs 506 // should be included (they will be inserts).
517 * overlapping replaces that are not completed nested). Inserts to
548 * Then we can deal with inserts:
550 * 1. for any inserts to same index, combine even if not adjacent.
578 // Wipe prior inserts within range
579 var inserts = GetKindOfOps( rewrites, typeof( InsertBeforeOp ), i );
580 for ( int j = 0; j < inserts.Count; j++ )
582 InsertBeforeOp iop = (InsertBeforeOp)inserts[j];
630 // WALK INSERTS
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/
TokenRewriteStream.java 397 // should be included (they will be inserts).
408 * overlapping replaces that are not completed nested). Inserts to
439 * Then we can deal with inserts:
441 * 1. for any inserts to same index, combine even if not adjacent.
465 // Wipe prior inserts within range
466 List inserts = getKindOfOps(rewrites, InsertBeforeOp.class, i); local
467 for (int j = 0; j < inserts.size(); j++) {
468 InsertBeforeOp iop = (InsertBeforeOp) inserts.get(j);
510 // WALK INSERTS
  /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/
racewalk.go 17 // 1. It inserts a call to racefuncenter at the beginning of each function.
18 // 2. It inserts a call to racefuncexit at the end of each function.
19 // 3. It inserts a call to raceread before each memory read.
20 // 4. It inserts a call to racewrite before each memory write.

Completed in 778 milliseconds

1 2 3 4 5