| /* |
| * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| * (C) 1999 Antti Koivisto (koivisto@kde.org) |
| * (C) 2001 Dirk Mueller (mueller@kde.org) |
| * (C) 2006 Alexey Proskuryakov (ap@webkit.org) |
| * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2011, 2012 Apple Inc. All rights reserved. |
| * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/) |
| * Copyright (C) 2008, 2009, 2011, 2012 Google Inc. All rights reserved. |
| * Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies) |
| * Copyright (C) 2013 Google Inc. All rights reserved. |
| * |
| * This library is free software; you can redistribute it and/or |
| * modify it under the terms of the GNU Library General Public |
| * License as published by the Free Software Foundation; either |
| * version 2 of the License, or (at your option) any later version. |
| * |
| * This library is distributed in the hope that it will be useful, |
| * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| * Library General Public License for more details. |
| * |
| * You should have received a copy of the GNU Library General Public License |
| * along with this library; see the file COPYING.LIB. If not, write to |
| * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
| * Boston, MA 02110-1301, USA. |
| */ |
| |
| #include "config.h" |
| #include "core/dom/DocumentOrderedList.h" |
| |
| #include "core/dom/Node.h" |
| |
| namespace WebCore { |
| |
| void DocumentOrderedList::add(Node* node) |
| { |
| if (m_nodes.isEmpty()) { |
| m_nodes.add(node); |
| return; |
| } |
| |
| // Determine an appropriate insertion point. |
| iterator begin = m_nodes.begin(); |
| iterator end = m_nodes.end(); |
| iterator it = end; |
| Node* followingNode = 0; |
| do { |
| --it; |
| Node* n = *it; |
| unsigned short position = n->compareDocumentPositionInternal(node, Node::TreatShadowTreesAsComposed); |
| if (position & Node::DOCUMENT_POSITION_FOLLOWING) { |
| m_nodes.insertBefore(followingNode, node); |
| return; |
| } |
| followingNode = n; |
| } while (it != begin); |
| |
| m_nodes.insertBefore(followingNode, node); |
| } |
| |
| void DocumentOrderedList::parserAdd(Node* node) |
| { |
| ASSERT(m_nodes.isEmpty() || m_nodes.last()->compareDocumentPositionInternal(node, Node::TreatShadowTreesAsComposed) & Node::DOCUMENT_POSITION_FOLLOWING); |
| m_nodes.add(node); |
| } |
| |
| void DocumentOrderedList::remove(Node* node) |
| { |
| m_nodes.remove(node); |
| } |
| |
| } |
| |