HomeSort by relevance Sort by last modified time
    Searched refs:toInsert (Results 1 - 12 of 12) sorted by null

  /libcore/luni/src/main/java/org/apache/harmony/xml/dom/
InnerNodeImpl.java 116 LeafNodeImpl toInsert = (LeafNodeImpl) newChild;
117 if (toInsert.document != null && document != null && toInsert.document != document) {
120 if (toInsert.isParentOf(this)) {
124 if (toInsert.parent != null) {
125 int oldIndex = toInsert.index;
126 toInsert.parent.children.remove(oldIndex);
127 toInsert.parent.refreshIndices(oldIndex);
130 children.add(index, toInsert);
131 toInsert.parent = this
    [all...]
DocumentImpl.java 419 @Override public Node insertChildAt(Node toInsert, int index) {
420 if (toInsert instanceof Element && getDocumentElement() != null) {
424 if (toInsert instanceof DocumentType && getDoctype() != null) {
428 return super.insertChildAt(toInsert, index);
  /external/guava/guava-testlib/src/com/google/common/collect/testing/
AbstractIteratorTester.java 546 final Object toInsert = elementsToInsert.next();
552 rawIterator.add(toInsert);
559 final E toInsert = elementsToInsert.next();
565 li.set(toInsert);
  /external/chromium_org/third_party/WebKit/Source/core/dom/
DocumentMarkerController.cpp 218 RenderedDocumentMarker toInsert(newMarker);
219 if (toInsert.type() != DocumentMarker::TextMatch) {
220 mergeOverlapping(list.get(), toInsert);
222 MarkerList::iterator pos = std::lower_bound(list->begin(), list->end(), toInsert, startsFurther);
223 list->insert(pos - list->begin(), RenderedDocumentMarker(toInsert));
232 void DocumentMarkerController::mergeOverlapping(MarkerList* list, DocumentMarker& toInsert)
234 MarkerList::iterator firstOverlapping = std::lower_bound(list->begin(), list->end(), toInsert, doesNotOverlap);
236 list->insert(index, RenderedDocumentMarker(toInsert));
  /external/chromium_org/third_party/skia/src/core/
SkRTree.cpp 132 Branch* toInsert = branch;
135 toInsert = this->insert(root->child(childIndex)->fChild.subtree, branch, level);
139 if (NULL != toInsert) {
149 toDivide[fMaxChildren] = *toInsert;
168 *root->child(root->fNumChildren) = *toInsert;
  /external/skia/src/core/
SkRTree.cpp 132 Branch* toInsert = branch;
135 toInsert = this->insert(root->child(childIndex)->fChild.subtree, branch, level);
139 if (NULL != toInsert) {
149 toDivide[fMaxChildren] = *toInsert;
168 *root->child(root->fNumChildren) = *toInsert;
  /external/chromium_org/third_party/icu/source/i18n/
ucol_tok.h 80 uint32_t toInsert;
ucol_bld.cpp 466 count = tok->next->toInsert;
491 uint32_t count = tok->toInsert;
745 tok->toInsert = 1;
758 tok->toInsert = t[tok->strength];
761 tok->toInsert = t[tok->strength];
782 fprintf(stderr,"%i", tok->toInsert);
    [all...]
  /external/icu4c/i18n/
ucol_tok.h 80 uint32_t toInsert;
ucol_bld.cpp 467 count = tok->next->toInsert;
492 uint32_t count = tok->toInsert;
753 tok->toInsert = 1;
766 tok->toInsert = t[tok->strength];
769 tok->toInsert = t[tok->strength];
790 fprintf(stderr,"%i", tok->toInsert);
    [all...]
  /prebuilts/tools/common/netbeans-visual/
org-openide-util.jar 
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.eclipse.jface.text_3.6.1.r361_v20100825-0800.jar 

Completed in 164 milliseconds