OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * Copyright (C) 2000 Frederik Holljen (frederik.holljen@hig.no) | 3 * Copyright (C) 2000 Frederik Holljen (frederik.holljen@hig.no) |
4 * Copyright (C) 2001 Peter Kelly (pmk@post.com) | 4 * Copyright (C) 2001 Peter Kelly (pmk@post.com) |
5 * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com) | 5 * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com) |
6 * Copyright (C) 2004, 2008 Apple Inc. All rights reserved. | 6 * Copyright (C) 2004, 2008 Apple Inc. All rights reserved. |
7 * | 7 * |
8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
(...skipping 52 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
63 NodePointer(PassRefPtr<Node>, bool); | 63 NodePointer(PassRefPtr<Node>, bool); |
64 void clear(); | 64 void clear(); |
65 bool moveToNext(Node* root); | 65 bool moveToNext(Node* root); |
66 bool moveToPrevious(Node* root); | 66 bool moveToPrevious(Node* root); |
67 }; | 67 }; |
68 | 68 |
69 void updateForNodeRemoval(Node& nodeToBeRemoved, NodePointer&) const; | 69 void updateForNodeRemoval(Node& nodeToBeRemoved, NodePointer&) const; |
70 | 70 |
71 NodePointer m_referenceNode; | 71 NodePointer m_referenceNode; |
72 NodePointer m_candidateNode; | 72 NodePointer m_candidateNode; |
73 bool m_detached; | |
74 }; | 73 }; |
75 | 74 |
76 } // namespace WebCore | 75 } // namespace WebCore |
77 | 76 |
78 #endif // NodeIterator_h | 77 #endif // NodeIterator_h |
OLD | NEW |