protected final Stack<Long>
        addNewText(final Stack<Long> paramLeftSiblingKeyStack, final String paramText) throws TTException {
        assert paramLeftSiblingKeyStack != null;
        final String text = paramText;
        long key;
        final ByteBuffer textByteBuffer = ByteBuffer.wrap(TypedValue.getBytes(text));
        if (textByteBuffer.array().length > 0) {

            if (paramLeftSiblingKeyStack.peek() == NULL_NODE) {
                key = mWtx.insertTextAsFirstChild(new String(textByteBuffer.array()));
            } else {
                key = mWtx.insertTextAsRightSibling(new String(textByteBuffer.array()));
            }

            paramLeftSiblingKeyStack.pop();
            paramLeftSiblingKeyStack.push(key);

        }
        return paramLeftSiblingKeyStack;
    }
protected final Stack < Long > addNewText ( final Stack < Long > paramLeftSiblingKeyStack , final String paramText ) throws TTException { assert paramLeftSiblingKeyStack != null ; final String text = paramText ; long key ; final ByteBuffer textByteBuffer = ByteBuffer . wrap ( TypedValue . getBytes ( text ) ) ; if ( textByteBuffer . array ( ) . length > 0 ) { if ( paramLeftSiblingKeyStack . peek ( ) == NULL_NODE ) { key = mWtx . insertTextAsFirstChild ( new String ( textByteBuffer . array ( ) ) ) ; } else { key = mWtx . insertTextAsRightSibling ( new String ( textByteBuffer . array ( ) ) ) ; } paramLeftSiblingKeyStack . pop ( ) ; paramLeftSiblingKeyStack . push ( key ) ; } return paramLeftSiblingKeyStack ; }
Add a new text node.

@param paramLeftSiblingKeyStack
stack used to determine if the new element has to be inserted
as a right sibling or as a new child (in the latter case is
NULL on top of the stack)
@param paramText
the text string to add
@return the modified stack
@throws TTException
if adding text fails