/* * Copyright (C) 2007 Apple Inc. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef PositionIterator_h #define PositionIterator_h #include "Position.h" namespace WebCore { class PositionIterator { public: PositionIterator() : m_parent(0) , m_child(0) , m_offset(0) { } PositionIterator(const Position& pos) : m_parent(pos.node()) , m_child(m_parent->childNode(pos.offset())) , m_offset(m_child ? 0 : pos.offset()) { } void increment(); void decrement(); Node* node() const { return m_parent; } int offsetInLeafNode() const { return m_offset; } bool atStart() const; bool atEnd() const; bool atStartOfNode() const; bool atEndOfNode() const; bool isCandidate() const; private: friend class Position; Node* m_parent; Node* m_child; int m_offset; }; } // namespace WebCore #endif // PositionIterator_h