alvinalexander.com | career | drupal | java | mac | mysql | perl | scala | uml | unix  

What this is

This file is included in the DevDaily.com "Java Source Code Warehouse" project. The intent of this project is to help you "Learn Java by Example" TM.

Other links

The source code

/*
 *                 Sun Public License Notice
 * 
 * The contents of this file are subject to the Sun Public License
 * Version 1.0 (the "License"). You may not use this file except in
 * compliance with the License. A copy of the License is available at
 * http://www.sun.com/
 * 
 * The Original Code is NetBeans. The Initial Developer of the Original
 * Code is Sun Microsystems, Inc. Portions Copyright 1997-2002 Sun
 * Microsystems, Inc. All Rights Reserved.
 */

package org.netbeans.tax.dom;

import org.w3c.dom.*;
import org.netbeans.tax.*;

/**
 *
 * @author  Petr Kuzel
 */
class TextImpl extends NodeImpl implements Text {
    
    private final TreeText peer;
    
    /** Creates a new instance of AttrImpl */
    public TextImpl(TreeText peer) {
        this.peer = peer;
    }
    
    /** Append the string to the end of the character data of the node. Upon
     * success, data provides access to the concatenation of
     * data and the DOMString specified.
     * @param arg The DOMString to append.
     * @exception DOMException
     *   NO_MODIFICATION_ALLOWED_ERR: Raised if this node is readonly.
     *
     */
    public void appendData(String arg) throws DOMException {
        throw new ROException();
    }
    
    /** Remove a range of 16-bit units from the node. Upon success,
     * data and length reflect the change.
     * @param offset The offset from which to start removing.
     * @param count The number of 16-bit units to delete. If the sum of
     *   offset and count exceeds
     *   length then all 16-bit units from offset
     *   to the end of the data are deleted.
     * @exception DOMException
     *   INDEX_SIZE_ERR: Raised if the specified offset is
     *   negative or greater than the number of 16-bit units in
     *   data, or if the specified count is
     *   negative.
     *   
NO_MODIFICATION_ALLOWED_ERR: Raised if this node is readonly. * */ public void deleteData(int offset, int count) throws DOMException { throw new ROException(); } /** The character data of the node that implements this interface. The DOM * implementation may not put arbitrary limits on the amount of data * that may be stored in a CharacterData node. However, * implementation limits may mean that the entirety of a node's data may * not fit into a single DOMString. In such cases, the user * may call substringData to retrieve the data in * appropriately sized pieces. * @exception DOMException * NO_MODIFICATION_ALLOWED_ERR: Raised when the node is readonly. * @exception DOMException * DOMSTRING_SIZE_ERR: Raised when it would return more characters than * fit in a DOMString variable on the implementation * platform. * */ public String getData() throws DOMException { return peer.getData(); } /** The number of 16-bit units that are available through data * and the substringData method below. This may have the * value zero, i.e., CharacterData nodes may be empty. * */ public int getLength() { return peer.getLength(); } /** The name of this node, depending on its type; see the table above. * */ public String getNodeName() { return "#text"; } /** A code representing the type of the underlying object, as defined above. * */ public short getNodeType() { return Node.TEXT_NODE; } /** The value of this node, depending on its type; see the table above. * When it is defined to be null, setting it has no effect. * @exception DOMException * NO_MODIFICATION_ALLOWED_ERR: Raised when the node is readonly. * @exception DOMException * DOMSTRING_SIZE_ERR: Raised when it would return more characters than * fit in a DOMString variable on the implementation * platform. * */ public String getNodeValue() throws DOMException { return getData(); } /** The parent of this node. All nodes, except Attr, * Document, DocumentFragment, * Entity, and Notation may have a parent. * However, if a node has just been created and not yet added to the * tree, or if it has been removed from the tree, this is * null. * */ public Node getParentNode() { TreeParentNode parent = peer.getParentNode(); if (parent instanceof TreeElement) { return Wrapper.wrap((TreeElement) parent); } else if (parent instanceof TreeDocumentRoot) { return Wrapper.wrap((TreeDocumentRoot) parent); } return null; } /** Insert a string at the specified 16-bit unit offset. * @param offset The character offset at which to insert. * @param arg The DOMString to insert. * @exception DOMException * INDEX_SIZE_ERR: Raised if the specified offset is * negative or greater than the number of 16-bit units in * data. *
NO_MODIFICATION_ALLOWED_ERR: Raised if this node is readonly. * */ public void insertData(int offset, String arg) throws DOMException { throw new ROException(); } /** Replace the characters starting at the specified 16-bit unit offset * with the specified string. * @param offset The offset from which to start replacing. * @param count The number of 16-bit units to replace. If the sum of * offset and count exceeds * length, then all 16-bit units to the end of the data * are replaced; (i.e., the effect is the same as a remove * method call with the same range, followed by an append * method invocation). * @param arg The DOMString with which the range must be * replaced. * @exception DOMException * INDEX_SIZE_ERR: Raised if the specified offset is * negative or greater than the number of 16-bit units in * data, or if the specified count is * negative. *
NO_MODIFICATION_ALLOWED_ERR: Raised if this node is readonly. * */ public void replaceData(int offset, int count, String arg) throws DOMException { throw new ROException(); } /** The character data of the node that implements this interface. The DOM * implementation may not put arbitrary limits on the amount of data * that may be stored in a CharacterData node. However, * implementation limits may mean that the entirety of a node's data may * not fit into a single DOMString. In such cases, the user * may call substringData to retrieve the data in * appropriately sized pieces. * @exception DOMException * NO_MODIFICATION_ALLOWED_ERR: Raised when the node is readonly. * @exception DOMException * DOMSTRING_SIZE_ERR: Raised when it would return more characters than * fit in a DOMString variable on the implementation * platform. * */ public void setData(String data) throws DOMException { throw new ROException(); } /** Breaks this node into two nodes at the specified offset, * keeping both in the tree as siblings. After being split, this node * will contain all the content up to the offset point. A * new node of the same type, which contains all the content at and * after the offset point, is returned. If the original * node had a parent node, the new node is inserted as the next sibling * of the original node. When the offset is equal to the * length of this node, the new node has no data. * @param offset The 16-bit unit offset at which to split, starting from * 0. * @return The new node, of the same type as this node. * @exception DOMException * INDEX_SIZE_ERR: Raised if the specified offset is negative or greater * than the number of 16-bit units in data. *
NO_MODIFICATION_ALLOWED_ERR: Raised if this node is readonly. * */ public Text splitText(int offset) throws DOMException { throw new ROException(); } /** Extracts a range of data from the node. * @param offset Start offset of substring to extract. * @param count The number of 16-bit units to extract. * @return The specified substring. If the sum of offset and * count exceeds the length, then all 16-bit * units to the end of the data are returned. * @exception DOMException * INDEX_SIZE_ERR: Raised if the specified offset is * negative or greater than the number of 16-bit units in * data, or if the specified count is * negative. *
DOMSTRING_SIZE_ERR: Raised if the specified range of text does * not fit into a DOMString. * */ public String substringData(int offset, int count) throws DOMException { try { return peer.substringData(offset, count); } catch (InvalidArgumentException ex) { throw new UOException(); } } /** The node immediately preceding this node. If there is no such node, * this returns null. * */ public Node getPreviousSibling() { return Children.getPreviousSibling(peer); } /** The node immediately following this node. If there is no such node, * this returns null. * */ public Node getNextSibling() { return Children.getNextSibling(peer); } }
... this post is sponsored by my books ...

#1 New Release!

FP Best Seller

 

new blog posts

 

Copyright 1998-2021 Alvin Alexander, alvinalexander.com
All Rights Reserved.

A percentage of advertising revenue from
pages under the /java/jwarehouse URI on this website is
paid back to open source projects.