Home
last modified time | relevance | path

Searched refs:insertion (Results 1 – 25 of 107) sorted by relevance

12345

/external/icu4c/layout/
DLEInsertionList.cpp60 …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/
Dbrktrans.h36 const UnicodeString &insertion);
61 virtual void setInsertion(const UnicodeString &insertion);
Dbrktrans.cpp149 void BreakTransliterator::setInsertion(const UnicodeString &insertion) { in setInsertion() argument
150 this->fInsertion = insertion; in setInsertion()
Dtranslit.cpp282 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/
Dgoogle-11-srtp-replay-fix.patch41 * test sequential insertion
43 printf("\ttesting sequential insertion...");
61 printf("\ttesting non-sequential insertion...");
/external/guava/guava-tests/test/com/google/common/hash/
DAbstractStreamingHasherTest.java135 for (int insertion = 0; insertion < totalInsertions; insertion++) { in testExhaustive()
/external/protobuf/src/google/protobuf/compiler/
Dplugin.proto103 // 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/
Dtranslit.h468 const UnicodeString& insertion,
487 UChar32 insertion,
540 const UnicodeString* insertion,
/external/llvm/test/Transforms/LICM/
D2003-02-27-PreheaderExitNodeUpdate.ll1 ; This testcase fails because preheader insertion is not updating exit node
D2003-02-27-PreheaderProblem.ll3 ; happens because preheader insertion doesn't insert a preheader for this
/external/freetype/src/base/
Dftrfork.c355 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/
DInspectorBrowserDebuggerAgent.cpp253 …gerAgent::descriptionForDOMEvent(Node* target, int breakpointType, bool insertion, InspectorObject… in descriptionForDOMEvent() argument
265 if (!insertion) in descriptionForDOMEvent()
274 description->setBoolean("insertion", insertion); in descriptionForDOMEvent()
DInspectorBrowserDebuggerAgent.h90 …void descriptionForDOMEvent(Node* target, int breakpointType, bool insertion, InspectorObject* des…
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/
Dstatetracker.py351 insertion = distance[i+1][j] + 1
356 if deletion <= insertion and deletion <= substitution:
362 elif insertion <= substitution:
364 best = insertion
/external/eigen/doc/
DSparseQuickReference.dox41 …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/
D2001-02-13-Reference-Memory.txt32 SSA generation/PHI node insertion pass to build the dependencies
D2001-02-13-Reference-MemoryResponse.txt36 > SSA generation/PHI node insertion pass to build the dependencies
D2003-06-25-Reoptimizer1.txt115 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/
Dcommute-two-addr.ll2 ; insertion of register-register copies.
/external/llvm/test/Transforms/TailCallElim/
Daccum_recursion.ll21 ; This is a more aggressive form of accumulator recursion insertion, which
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
DACBTree.m155 /** 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/
DSelectionControllerMac.mm56 // if zoom feature is enabled, insertion point changes should update the zoom
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/
Dcodegen.ml113 (* Start insertion in loop_bb. *)
206 (* Create a new basic block to start insertion into. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/
Dcodegen.ml84 (* Create a new basic block to start insertion into. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/
Dcodegen.ml84 (* Create a new basic block to start insertion into. *)

12345