blob: eede574678cdf8dd7774fe52d6a66981e489739d [file] [log] [blame]
/*
* This file is part of the DOM implementation for KDE.
*
* Copyright (C) 1999 Lars Knoll (knoll@kde.org)
* (C) 1999 Antti Koivisto (koivisto@kde.org)
* (C) 2001 Dirk Mueller (mueller@kde.org)
* Copyright (C) 2004, 2006 Apple Computer, Inc.
*
* 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., 59 Temple Place - Suite 330,
* Boston, MA 02111-1307, USA.
*
*/
#ifndef DOM_ContainerNodeImpl_h
#define DOM_ContainerNodeImpl_h
#include "NodeImpl.h"
namespace DOM {
class ContainerNodeImpl : public NodeImpl
{
public:
ContainerNodeImpl(DocumentImpl *doc);
virtual ~ContainerNodeImpl();
virtual NodeImpl* firstChild() const;
virtual NodeImpl* lastChild() const;
virtual bool insertBefore(PassRefPtr<NodeImpl> newChild, NodeImpl* refChild, ExceptionCode&);
virtual bool replaceChild(PassRefPtr<NodeImpl> newChild, NodeImpl* oldChild, ExceptionCode&);
virtual bool removeChild(NodeImpl* child, ExceptionCode&);
virtual bool appendChild(PassRefPtr<NodeImpl> newChild, ExceptionCode&);
virtual ContainerNodeImpl* addChild(PassRefPtr<NodeImpl>);
virtual bool hasChildNodes() const;
virtual void attach();
virtual void detach();
virtual void willRemove();
virtual IntRect getRect() const;
virtual void setFocus(bool = true);
virtual void setActive(bool active = true, bool pause = false);
virtual void setHovered(bool = true);
virtual unsigned childNodeCount() const;
virtual NodeImpl* childNode(unsigned index) const;
virtual void insertedIntoDocument();
virtual void removedFromDocument();
virtual void insertedIntoTree(bool deep);
virtual void removedFromTree(bool deep);
NodeImpl* fastFirstChild() const { return m_firstChild; }
NodeImpl* fastLastChild() const { return m_lastChild; }
void removeAllChildren();
void removeChildren();
void cloneChildNodes(NodeImpl* clone);
private:
NodeImpl* m_firstChild;
NodeImpl* m_lastChild;
bool getUpperLeftCorner(int& x, int& y) const;
bool getLowerRightCorner(int& x, int& y) const;
};
} //namespace
#endif