| /* |
| * The Apache Software License, Version 1.1 |
| * |
| * Copyright (c) 2001 The Apache Software Foundation. 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. |
| * |
| * 3. The end-user documentation included with the redistribution, |
| * if any, must include the following acknowledgment: |
| * "This product includes software developed by the |
| * Apache Software Foundation (http://www.apache.org/)." |
| * Alternately, this acknowledgment may appear in the software itself, |
| * if and wherever such third-party acknowledgments normally appear. |
| * |
| * 4. The names "Xerces" and "Apache Software Foundation" must |
| * not be used to endorse or promote products derived from this |
| * software without prior written permission. For written |
| * permission, please contact apache\@apache.org. |
| * |
| * 5. Products derived from this software may not be called "Apache", |
| * nor may "Apache" appear in their name, without prior written |
| * permission of the Apache Software Foundation. |
| * |
| * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED 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 THE APACHE SOFTWARE FOUNDATION OR |
| * ITS 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. |
| * ==================================================================== |
| * |
| * This software consists of voluntary contributions made by many |
| * individuals on behalf of the Apache Software Foundation, and was |
| * originally based on software copyright (c) 2001, International |
| * Business Machines, Inc., http://www.ibm.com . For more information |
| * on the Apache Software Foundation, please see |
| * <http://www.apache.org/>. |
| */ |
| |
| /* |
| * $Log$ |
| * Revision 1.2 2001/05/11 13:25:55 tng |
| * Copyright update. |
| * |
| * Revision 1.1.1.1 2001/04/03 00:14:32 andyh |
| * IDOM |
| * |
| */ |
| |
| #ifndef IDOM_Text_HEADER_GUARD_ |
| #define IDOM_Text_HEADER_GUARD_ |
| |
| #include <util/XercesDefs.hpp> |
| #include "IDOM_CharacterData.hpp" |
| |
| |
| |
| /** |
| * The <code>Text</code> interface represents the textual content (termed |
| * character data in XML) of an <code>Element</code> or <code>Attr</code>. |
| * If there is no markup inside an element's content, the text is contained |
| * in a single object implementing the <code>Text</code> interface that is |
| * the only child of the element. If there is markup, it is parsed into a |
| * list of elements and <code>Text</code> nodes that form the list of |
| * children of the element. |
| * <p>When a document is first made available via the DOM, there is only one |
| * <code>Text</code> node for each block of text. Users may create adjacent |
| * <code>Text</code> nodes that represent the contents of a given element |
| * without any intervening markup, but should be aware that there is no way |
| * to represent the separations between these nodes in XML, so they |
| * will not (in general) persist between DOM editing sessions. The |
| * <code>normalize()</code> method on <code>Element</code> merges any such |
| * adjacent <code>Text</code> objects into a single node for each block of |
| * text; this is recommended before employing operations that depend on a |
| * particular document structure, such as navigation with |
| * <code>XPointers.</code> |
| */ |
| class CDOM_EXPORT IDOM_Text: public IDOM_CharacterData { |
| |
| protected: |
| /** @name Constructors and assignment operator */ |
| //@{ |
| IDOM_Text() {}; |
| |
| IDOM_Text(const IDOM_Text &other) {}; |
| |
| IDOM_Text & operator = (const IDOM_Text &other) {return *this;}; |
| |
| |
| //@} |
| public: |
| /** @name Destructor. */ |
| //@{ |
| /** |
| * Destructor for IDOM_Text. The object being destroyed is the reference |
| * object, not the underlying Comment node itself. |
| * |
| */ |
| virtual ~IDOM_Text() {}; |
| |
| //@} |
| /** @name Functions to modify the Text node. */ |
| //@{ |
| |
| /** |
| * Breaks this node into two nodes at the specified |
| * offset, keeping both in the tree as siblings. |
| * |
| * This node then only |
| * contains all the content up to the <code>offset</code> point. And a new |
| * node of the same nodeType, which is inserted as the next sibling of this |
| * node, contains all the content at and after the <code>offset</code> |
| * point. When the <code>offset</code> is equal to the lenght of this node, |
| * the new node has no data. |
| * @param offset The offset at which to split, starting from 0. |
| * @return The new <code>Text</code> node. |
| * @exception DOMException |
| * INDEX_SIZE_ERR: Raised if the specified offset is negative or greater |
| * than the number of characters in <code>data</code>. |
| * <br>NO_MODIFICATION_ALLOWED_ERR: Raised if this node is readonly. |
| */ |
| virtual IDOM_Text *splitText(unsigned int offset) = 0; |
| |
| //@} |
| /** @name Non-standard (not defined by the DOM specification) functions. */ |
| //@{ |
| |
| /** |
| * |
| * <p><b>"Experimental - subject to change"</b></p> |
| * |
| * Return true if this node contains ignorable whitespaces only. |
| * @return True if this node contains ignorable whitespaces only. |
| */ |
| virtual bool isIgnorableWhitespace() const = 0; |
| |
| //@} |
| |
| }; |
| |
| #endif |
| |
| |