/external/icu4c/layout/ |
D | LEInsertionList.cpp | 60 …InsertionRecord *insertion = (InsertionRecord *) LE_NEW_ARRAY(char, sizeof(InsertionRecord) + (cou… in insert() local 61 if (insertion == NULL) { in insert() 66 insertion->position = position; in insert() 67 insertion->count = count; in insert() 73 insertion->next = NULL; in insert() 74 tail->next = insertion; in insert() 75 tail = insertion; in insert() 78 insertion->next = head; in insert() 79 head = insertion; in insert() 82 return insertion->glyphs; in insert()
|
/external/icu4c/i18n/ |
D | brktrans.h | 36 const UnicodeString &insertion); 61 virtual void setInsertion(const UnicodeString &insertion);
|
D | brktrans.cpp | 149 void BreakTransliterator::setInsertion(const UnicodeString &insertion) { in setInsertion() argument 150 this->fInsertion = insertion; in setInsertion()
|
D | translit.cpp | 282 const UnicodeString& insertion, in transliterate() argument 284 _transliterate(text, index, &insertion, status); in transliterate() 304 UChar32 insertion, in transliterate() argument 306 UnicodeString str(insertion); in transliterate() 355 const UnicodeString* insertion, in _transliterate() argument 367 if (insertion != 0) { in _transliterate() 368 text.handleReplaceBetween(index.limit, index.limit, *insertion); in _transliterate() 369 index.limit += insertion->length(); in _transliterate() 370 index.contextLimit += insertion->length(); in _transliterate()
|
/external/srtp/googlepatches/ |
D | google-11-srtp-replay-fix.patch | 41 * test sequential insertion 43 printf("\ttesting sequential insertion..."); 61 printf("\ttesting non-sequential insertion...");
|
/external/guava/guava-tests/test/com/google/common/hash/ |
D | AbstractStreamingHasherTest.java | 135 for (int insertion = 0; insertion < totalInsertions; insertion++) { in testExhaustive()
|
/external/protobuf/src/google/protobuf/compiler/ |
D | plugin.proto | 103 // content here is to be inserted into that file at a defined insertion 106 // insertion points by placing special annotations in the file that look 113 // immediately above the line containing the insertion point (thus multiple 116 // could contain things that look like insertion points by accident. 126 // Note that if the line containing the insertion point begins with 129 // indentation matters. In these languages, the insertion point comment
|
/external/icu4c/i18n/unicode/ |
D | translit.h | 468 const UnicodeString& insertion, 487 UChar32 insertion, 540 const UnicodeString* insertion,
|
/external/llvm/test/Transforms/LICM/ |
D | 2003-02-27-PreheaderExitNodeUpdate.ll | 1 ; This testcase fails because preheader insertion is not updating exit node
|
D | 2003-02-27-PreheaderProblem.ll | 3 ; happens because preheader insertion doesn't insert a preheader for this
|
/external/freetype/src/base/ |
D | ftrfork.c | 355 const char *insertion ); 780 const char *insertion ) in raccess_make_file_name() argument 791 new_length = ft_strlen( original_name ) + ft_strlen( insertion ); in raccess_make_file_name() 808 ft_strcat( new_name, insertion ); in raccess_make_file_name()
|
/external/webkit/Source/WebCore/inspector/ |
D | InspectorBrowserDebuggerAgent.cpp | 253 …gerAgent::descriptionForDOMEvent(Node* target, int breakpointType, bool insertion, InspectorObject… in descriptionForDOMEvent() argument 265 if (!insertion) in descriptionForDOMEvent() 274 description->setBoolean("insertion", insertion); in descriptionForDOMEvent()
|
D | InspectorBrowserDebuggerAgent.h | 90 …void descriptionForDOMEvent(Node* target, int breakpointType, bool insertion, InspectorObject* des…
|
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
D | statetracker.py | 351 insertion = distance[i+1][j] + 1 356 if deletion <= insertion and deletion <= substitution: 362 elif insertion <= substitution: 364 best = insertion
|
/external/eigen/doc/ |
D | SparseQuickReference.dox | 41 …matrix. However, an exact estimation will avoid multiple reallocations during the insertion phase. 45 // Direct insertion of the value v_ij; 49 After insertion, a value at (i,j) can be modified using coeffRef()
|
/external/llvm/docs/HistoricalNotes/ |
D | 2001-02-13-Reference-Memory.txt | 32 SSA generation/PHI node insertion pass to build the dependencies
|
D | 2001-02-13-Reference-MemoryResponse.txt | 36 > SSA generation/PHI node insertion pass to build the dependencies
|
D | 2003-06-25-Reoptimizer1.txt | 115 The trace insertion routine takes an original start address, a vector 120 The trace insertion routine is responsible for inserting branches from
|
/external/llvm/test/CodeGen/X86/ |
D | commute-two-addr.ll | 2 ; insertion of register-register copies.
|
/external/llvm/test/Transforms/TailCallElim/ |
D | accum_recursion.ll | 21 ; This is a more aggressive form of accumulator recursion insertion, which
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
D | ACBTree.m | 155 /** insertKey is the insertion entry point 228 * i == t.numkeys if no existing insertion branch found. 229 * otherwise i == insertion branch. 364 /** Do the actual insertion or split and insert
|
/external/webkit/Source/WebCore/editing/mac/ |
D | SelectionControllerMac.mm | 56 // if zoom feature is enabled, insertion point changes should update the zoom
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
D | codegen.ml | 113 (* Start insertion in loop_bb. *) 206 (* Create a new basic block to start insertion into. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/ |
D | codegen.ml | 84 (* Create a new basic block to start insertion into. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/ |
D | codegen.ml | 84 (* Create a new basic block to start insertion into. *)
|