/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | MutationRecord.h | 50 static PassRefPtrWillBeRawPtr<MutationRecord> createChildList(PassRefPtrWillBeRawPtr<Node> target, PassRefPtrWillBeRawPtr<StaticNodeList> added, PassRefPtrWillBeRawPtr<StaticNodeList> removed, PassRefPtrWillBeRawPtr<Node> previousSibling, PassRefPtrWillBeRawPtr<Node> nextSibling); 64 virtual Node* previousSibling() { return 0; } function in class:blink::MutationRecord
|
H A D | TreeWalker.cpp | 126 if (node->previousSibling()) { 127 node = node->previousSibling(); 139 Node* TreeWalker::previousSibling(ExceptionState& exceptionState) function in class:blink::TreeWalker 145 for (RefPtrWillBeRawPtr<Node> sibling = node->previousSibling(); sibling; ) { 163 sibling = sibling->previousSibling(); 217 while (Node* previousSibling = node->previousSibling()) { 218 node = previousSibling;
|
H A D | ElementTraversal.h | 90 static ElementType* previousSibling(const Node&); 92 static ElementType* previousSibling(const Node&, MatchFunc); 189 node = node->previousSibling(); 199 element = Traversal<ElementType>::previousSibling(*element); 356 inline ElementType* Traversal<ElementType>::previousSibling(const Node& current) function in class:blink::Traversal 358 Node* node = current.previousSibling(); 360 node = node->previousSibling(); 366 inline ElementType* Traversal<ElementType>::previousSibling(const Node& current, MatchFunc isMatch) function in class:blink::Traversal 368 ElementType* element = Traversal<ElementType>::previousSibling(current); 370 element = Traversal<ElementType>::previousSibling(*elemen [all...] |
H A D | MutationRecord.cpp | 47 ChildListRecord(PassRefPtrWillBeRawPtr<Node> target, PassRefPtrWillBeRawPtr<StaticNodeList> added, PassRefPtrWillBeRawPtr<StaticNodeList> removed, PassRefPtrWillBeRawPtr<Node> previousSibling, PassRefPtrWillBeRawPtr<Node> nextSibling) argument 51 , m_previousSibling(previousSibling) 71 virtual Node* previousSibling() OVERRIDE { return m_previousSibling.get(); } 163 virtual Node* previousSibling() OVERRIDE { return m_record->previousSibling(); } 193 PassRefPtrWillBeRawPtr<MutationRecord> MutationRecord::createChildList(PassRefPtrWillBeRawPtr<Node> target, PassRefPtrWillBeRawPtr<StaticNodeList> added, PassRefPtrWillBeRawPtr<StaticNodeList> removed, PassRefPtrWillBeRawPtr<Node> previousSibling, PassRefPtrWillBeRawPtr<Node> nextSibling) argument 195 return adoptRefWillBeNoop(new ChildListRecord(target, added, removed, previousSibling, nextSibling));
|
H A D | NodeRenderingTraversal.cpp | 94 Node* previousSibling(const Node* node) function in namespace:blink::NodeRenderingTraversal 101 walker.previousSibling(); 122 Node* previousNode = previousSibling(node); 234 for (Node* sibling = NodeRenderingTraversal::previousSibling(node); sibling; sibling = NodeRenderingTraversal::previousSibling(sibling)) {
|
H A D | ContainerNode.h | 167 node.previousSibling(), 174 static ChildrenChange forRemoval(Node& node, Node* previousSibling, Node* nextSibling, ChildrenChangeSource byParser) argument 178 previousSibling,
|
H A D | Node.h | 188 Node* previousSibling() const { return m_previous; } function in class:blink::Node
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | RenderObjectChildList.cpp | 97 if (oldChild->previousSibling()) 98 oldChild->previousSibling()->setNextSibling(oldChild->nextSibling()); 100 oldChild->nextSibling()->setPreviousSibling(oldChild->previousSibling()); 105 setLastChild(oldChild->previousSibling()); 144 RenderObject* previousSibling = beforeChild->previousSibling(); local 145 if (previousSibling) 146 previousSibling->setNextSibling(newChild); 147 newChild->setPreviousSibling(previousSibling);
|
H A D | CounterNode.h | 59 CounterNode* previousSibling() const { return m_previousSibling; } function in class:blink::CounterNode
|
H A D | RenderCounter.cpp | 168 // previousSibling accordingly. 182 static bool findPlaceForCounter(RenderObject& counterOwner, const AtomicString& identifier, bool isReset, RefPtr<CounterNode>& parent, RefPtr<CounterNode>& previousSibling) argument 191 previousSibling = nullptr; 208 previousSibling = parent ? currentCounter : 0; 215 // In these cases the identified previousSibling will be invalid as its parent is different from 220 previousSibling = previousSiblingProtector.get(); 231 previousSibling = previousSiblingProtector.get(); 237 // previousSibling, and when we are a sibling of the end counter we must set previousSibling 242 previousSibling [all...] |
H A D | RenderLayer.h | 101 RenderLayer* previousSibling() const { return m_previous; } function in class:blink::RenderLayer
|
/external/chromium_org/third_party/WebKit/Source/web/ |
H A D | RemoteFrameClient.cpp | 39 Frame* RemoteFrameClient::previousSibling() const function in class:blink::RemoteFrameClient 41 return toCoreFrame(m_webFrame->previousSibling());
|
H A D | WebFrame.cpp | 169 WebFrame* WebFrame::previousSibling() const function in class:blink::WebFrame
|
H A D | WebNode.cpp | 116 WebNode WebNode::previousSibling() const function in class:blink::WebNode 118 return WebNode(m_private->previousSibling());
|
H A D | FrameLoaderClientImpl.cpp | 273 Frame* FrameLoaderClientImpl::previousSibling() const function in class:blink::FrameLoaderClientImpl 275 return toCoreFrame(m_webFrame->previousSibling());
|
/external/chromium_org/third_party/WebKit/Source/core/dom/shadow/ |
H A D | ComposedTreeWalker.h | 58 void previousSibling(); 138 inline void ComposedTreeWalker::previousSibling() function in class:blink::ComposedTreeWalker
|
/external/chromium_org/third_party/WebKit/Source/core/page/ |
H A D | FrameTree.cpp | 93 Frame* FrameTree::previousSibling() const function in class:blink::FrameTree 97 return m_thisFrame->client()->previousSibling(); 360 if (Frame* prevSibling = previousSibling())
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
H A D | DOM2DTM.java | 175 * @param previousSibling The previous sibling index. 183 int previousSibling, int forceNodeType) 250 m_prevsib.setElementAt(previousSibling,nodeIndex); 300 if (DTM.NULL != previousSibling) 301 m_nextsib.setElementAt(nodeIndex,previousSibling); 182 addNode(Node node, int parentIndex, int previousSibling, int forceNodeType) argument
|
/external/chromium_org/third_party/WebKit/Source/core/inspector/ |
H A D | DOMPatchSupport.cpp | 123 Node* previousSibling = node->previousSibling(); local 165 return previousSibling ? previousSibling->nextSibling() : parentNode->firstChild();
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | LinkedListMultimap.java | 117 Node<K, V> previousSibling; // the previous node with the same key field in class:LinkedListMultimap.Node 204 node.previousSibling = keyTail; 210 node.previousSibling = nextSibling.previousSibling; 213 if (nextSibling.previousSibling == null) { // nextSibling was key head 216 nextSibling.previousSibling.nextSibling = node; 224 nextSibling.previousSibling = node; 246 if (node.previousSibling != null) { 247 node.previousSibling.nextSibling = node.nextSibling; 254 node.nextSibling.previousSibling [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | LinkedListMultimap.java | 113 Node<K, V> previousSibling; // the previous node with the same key field in class:LinkedListMultimap.Node 200 node.previousSibling = keyTail; 206 node.previousSibling = nextSibling.previousSibling; 209 if (nextSibling.previousSibling == null) { // nextSibling was key head 212 nextSibling.previousSibling.nextSibling = node; 220 nextSibling.previousSibling = node; 242 if (node.previousSibling != null) { 243 node.previousSibling.nextSibling = node.nextSibling; 250 node.nextSibling.previousSibling [all...] |
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/sax2dtm/ |
H A D | SAX2DTM.java | 860 * @param previousSibling The previous sibling index. 868 int parentIndex, int previousSibling, 887 m_prevsib.addElement(previousSibling); 890 if (DTM.NULL != previousSibling) { 891 m_nextsib.setElementAt(nodeIndex,previousSibling); 910 if (DTM.NULL == previousSibling && DTM.NULL != parentIndex) { 867 addNode(int type, int expandedTypeID, int parentIndex, int previousSibling, int dataOrPrefix, boolean canHaveFirstChild) argument
|
H A D | SAX2DTM2.java | 2327 * @param previousSibling The previous sibling index. 2335 int parentIndex, int previousSibling, 2356 m_prevsib.addElement(previousSibling); 2375 if (DTM.NULL != previousSibling) { 2376 m_nextsib.setElementAt(nodeIndex,previousSibling); 2334 addNode(int type, int expandedTypeID, int parentIndex, int previousSibling, int dataOrPrefix, boolean canHaveFirstChild) argument
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
H A D | DTMDocumentImpl.java | 81 int previousSibling = 0; // previous sibling - no previous sibling field in class:DTMDocumentImpl 214 nodes.writeEntry(previousSibling,2,slotnumber); 701 // previousSibling = 0; 800 // nodes.writeEntry(previousSibling, 2, NULL); 803 // previousSibling = currentParent; 857 // previousSibling = ourslot; // Should attributes be previous siblings 871 // //previousSibling = ourslot; 922 // previousSibling = ourslot; 971 // previousSibling = ourslot; 2104 previousSibling [all...] |
/external/chromium_org/third_party/WebKit/Source/core/editing/ |
H A D | ApplyStyleCommand.cpp | 501 if (before ? currentNode->previousSibling() : currentNode->nextSibling()) 895 RefPtrWillBeRawPtr<Node> previousSibling = element.previousSibling(); local 902 runStart = previousSibling ? previousSibling->nextSibling() : parent->firstChild(); 904 runEnd = nextSibling ? nextSibling->previousSibling() : parent->lastChild(); 1218 Node* prevNode = text->previousSibling(); 1248 if (!parentElement || !parentElement->previousSibling()) 1250 Node* firstTextNode = parentElement->previousSibling()->lastChild(); 1285 if (startNode->previousSibling()) 1371 RefPtrWillBeRawPtr<Node> previousSibling = element->previousSibling(); local [all...] |