nokogiri-backupify 1.5.0.beta.4

data/ext/java/nokogiri/internals/PushInputStream.java

@@ -0,0 +1,411 @@
+/**
+ * (The MIT License)
+ *
+ * Copyright (c) 2008 - 2010:
+ *
+ * * {Aaron Patterson}[http://tenderlovemaking.com]
+ * * {Mike Dalessio}[http://mike.daless.io]
+ * * {Charles Nutter}[http://blog.headius.com/]
+ * * {Sergio Arbeo}[http://www.serabe.com/]
+ * * {Patrick Mahoney}[http://polycrystal.org/]
+ * * {Yoko Harada}[http://yokolet.blogspot.com/]
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining
+ * a copy of this software and associated documentation files (the
+ * 'Software'), to deal in the Software without restriction, including
+ * without limitation the rights to use, copy, modify, merge, publish,
+ * distribute, sublicense, and/or sell copies of the Software, and to
+ * permit persons to whom the Software is furnished to do so, subject to
+ * the following conditions:
+ * 
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ * 
+ * THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+ * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+ * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+ * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+ * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ */
+
+package nokogiri.internals;
+
+import java.io.IOException;
+import java.io.InputStream;
+import java.nio.channels.ClosedChannelException;
+import java.util.ArrayList;
+
+
+/**
+ * Implements a "push" InputStream.  An owner thread create an
+ * InputStream and passes it to a second thread.  The owner thread
+ * calls PushInputStream.write() to write data to the stream.  The
+ * second thread calls PushInputStream.read() and other InputStream
+ * methods.
+ *
+ * You should ensure that only one thread write to, and only one
+ * thread reads to, this stream, though nothing enforces this
+ * strictly.
+ */
+public class PushInputStream extends InputStream {
+    /**
+     * Current position in the stream relative to the start of the
+     * buffer.
+     */
+    protected int pos;
+
+    /**
+     * Current mark position, or -1 if there is no mark.
+     */
+    protected int mark;
+
+    protected int readlimit;
+
+    /**
+     * State is open or closed.
+     */
+    protected boolean isOpen;
+
+    protected Buffer buffer;
+
+    public PushInputStream() {
+        pos = 0;
+        mark = -1;
+        readlimit = -1;
+        isOpen = true;
+
+        buffer = new Buffer(512);
+    }
+
+    protected synchronized void ensureOpen() throws IOException {
+        if (!isOpen) {
+            throw new ClosedChannelException();
+        }
+    }
+
+    /**
+     * Write data that can be read from the stream.
+     */
+    public synchronized void write(byte[] b) {
+        if (buffer == null) System.out.println("BUFFER IS NULL");
+        if (b == null) System.out.println("BYTE ARRAY IS NILL");
+        buffer.put(b);
+        notifyAll();            // notify readers waiting
+    }
+
+    /**
+     * Write data and then wait until all the data has been read
+     * (waits until the thread reading from this stream is blocked in
+     * a read()).
+     */
+    public synchronized void writeAndWaitForRead(byte[] b) throws IOException {
+        ensureOpen();
+        write(b);
+        for (;;) {
+            try {
+                wait();
+                break;
+            } catch (InterruptedException e) {
+                // continue waiting
+            }
+        }
+    }
+
+    /*
+     *------------------------------------------------------------
+     * InputStream methods
+     *------------------------------------------------------------
+     */
+
+    /**
+     * @see InputStream.available()
+     */
+    @Override
+    public synchronized int available() throws IOException {
+        ensureOpen();
+        return buffer.size() - pos;
+    }
+
+    int nClose = 0;
+    /**
+     * @see InputStream.close()
+     */
+    @Override
+    public synchronized void close() throws IOException {
+        if (!isOpen) return;
+        isOpen = false;
+        buffer = null;
+        notifyAll();
+    }
+
+    /**
+     * @see InputStream.mark()
+     */
+    @Override
+    public synchronized void mark(int readlimit) {
+        this.mark = pos;
+        this.readlimit = readlimit;
+    }
+
+    /**
+     * Mark the current position in this stream.  Supported by
+     * PushInputStream.
+     *
+     * @see InputStream.markSupported()
+     */
+    @Override
+    public synchronized boolean markSupported() {
+        return true;
+    }
+
+    /**
+     * @see InputStream.read()
+     */
+    @Override
+    public synchronized int read() throws IOException {
+        ensureOpen();
+        byte[] b = new byte[1];
+        read(b, 0, 1);
+        return (int) b[0];
+    }
+
+    /**
+     * @see InputStream.read(byte[])
+     */
+    @Override
+    public synchronized int read(byte[] b) throws IOException {
+        ensureOpen();
+        return read(b, 0, b.length);
+    }
+
+    protected synchronized boolean markIsValid() {
+        return (mark >= 0 && pos < mark+readlimit);
+    }
+
+    /**
+     * @see InputStream.read(byte[], int, int)
+     */
+    @Override
+    public synchronized int read(byte[] b, int off, int len) throws IOException {
+        while (isOpen && available() == 0) {
+            /* block until data available */
+            try {
+                notifyAll();    // notify writers waiting
+                wait();
+            } catch (InterruptedException e) {
+                // continue waiting
+            }
+        }
+
+        if (!isOpen) {
+            return -1;
+        }
+
+        int readLen = Math.min(available(), len);
+
+        buffer.get(pos, readLen, b, off);
+        pos += readLen;
+
+        int reduce;
+
+        if (markIsValid()) {
+            reduce = mark;
+        } else {
+            reduce = pos;
+        }
+
+        buffer.truncateFromStart(buffer.size - reduce);
+        pos -= reduce;
+        mark -= reduce;
+        if (mark < 0) mark = -1; // don't wrap mark around?
+
+        return readLen;
+    }
+
+    /**
+     * @see InputStream.reset()
+     */
+    @Override
+    public synchronized void reset() throws IOException {
+        ensureOpen();
+        if (markIsValid())
+            pos = mark;
+    }
+
+    /**
+     * @see InputStream.skip()
+     */
+    @Override
+    public synchronized long skip(long n) throws IOException {
+        ensureOpen();
+        pos += n;
+        return n;
+    }
+
+    /*
+     *------------------------------------------------------------
+     * Data Buffer
+     *------------------------------------------------------------
+     */
+
+    public static class Block {
+        protected byte[] data;
+
+        public Block(int size) {
+            data = new byte[size];
+        }
+
+        public void copyIn(byte[] src, int srcPos, int destPos, int length) {
+            System.arraycopy(src, srcPos, data, destPos, length);
+        }
+
+        public void copyOut(int srcPos, byte[] dest, int destPos, int length) {
+            System.arraycopy(data, srcPos, dest, destPos, length);
+        }
+    }
+
+    public static class BlockList extends ArrayList<Block> {
+        public BlockList() {
+            super();
+        }
+
+        @Override
+        public void removeRange(int fromIndex, int toIndex) {
+            super.removeRange(fromIndex, toIndex);
+        }
+    }
+
+    public static class Buffer {
+        protected int blockSize;
+        protected BlockList blocks;
+
+        /**
+         * Offset (position) to the first logical byte in the buffer.
+         */
+        protected int offset;
+
+        /**
+         * Logical size of the buffer.
+         */
+        protected int size;
+
+        public Buffer(int blockSize) {
+            this.blockSize = blockSize;
+            this.blocks = new BlockList();
+            this.offset = 0;
+            this.size = 0;
+        }
+
+        public int size() {
+            return size;
+        }
+
+        protected class Segment {
+            /**
+             * Block index.
+             */
+            protected int block;
+
+            /**
+             * Offset into the block.
+             */
+            protected int off;
+
+            /**
+             * Length of segment.
+             */
+            protected int len;
+
+            /**
+             * Calculate the block number and block offset given a position.
+             */
+            protected Segment(int pos) {
+                int absPos = offset + pos;
+                block = (int) (absPos / blockSize);
+                off = (int) (absPos % blockSize);
+                len = -1;
+            }
+        }
+
+        protected Segment[] accessList(int pos, int size) {
+            Segment start = new Segment(pos);
+            Segment end = new Segment(pos + size);
+            int nBlocks = end.block - start.block + 1;
+            Segment[] segs = new Segment[nBlocks];
+
+            start.len = Math.min(size, blockSize - start.off);
+            segs[0] = start;
+            int currPos = pos + start.len;
+            int currSize = start.len;
+            for (int i = 1; i < nBlocks; i++) {
+                Segment seg = new Segment(currPos);
+                seg.len = Math.min(blockSize, size - currSize);
+                segs[i] = seg;
+                currPos += seg.len;
+                currSize += seg.len;
+            }
+
+            return segs;
+        }
+
+        protected void ensureCapacity(int pos) {
+            Segment seg = new Segment(pos-1);
+
+            while (blocks.size() < (seg.block + 1))
+                blocks.add(new Block(blockSize));
+        }
+
+        public void put(byte b) {
+            byte[] buf = new byte[1];
+            buf[0] = b;
+            put(buf);
+        }
+
+        public void put(byte[] b) {
+            ensureCapacity(size + b.length);
+            Segment[] segs = accessList(size, b.length);
+
+            int off = 0;
+            for (int i = 0; i < segs.length; i++) {
+                Block block = blocks.get(segs[i].block);
+                block.copyIn(b, off, segs[i].off, segs[i].len);
+            }
+
+            size += b.length;
+        }
+
+        public byte[] get(int pos, int len) {
+            byte[] b = new byte[len];
+            get(pos, len, b, 0);
+            return b;
+        }
+
+        /**
+         * Throws IndexOutOfBoundsException.
+         */
+        public void get(int pos, int len, byte[] b, int off) {
+            Segment[] segs = accessList(pos, len);
+            for (int i = 0; i < segs.length; i++) {
+                Block block = blocks.get(segs[i].block);
+                block.copyOut(segs[i].off, b, off, segs[i].len);
+            }
+        }
+
+        /**
+         * Truncate the buffer to <code>newSize</code> by removing
+         * data from the start of the buffer.
+         */
+        public void truncateFromStart(int newSize) {
+            if (newSize > size || newSize < 0)
+                throw new RuntimeException("invalid size");
+
+            Segment newStart = new Segment(size - newSize);
+            blocks.removeRange(0, newStart.block);
+
+            size = newSize;
+            offset = newStart.off;
+        }
+    }
+}

data/ext/java/nokogiri/internals/ReaderNode.java

@@ -0,0 +1,473 @@
+/**
+ * (The MIT License)
+ *
+ * Copyright (c) 2008 - 2010:
+ *
+ * * {Aaron Patterson}[http://tenderlovemaking.com]
+ * * {Mike Dalessio}[http://mike.daless.io]
+ * * {Charles Nutter}[http://blog.headius.com]
+ * * {Sergio Arbeo}[http://www.serabe.com]
+ * * {Patrick Mahoney}[http://polycrystal.org]
+ * * {Yoko Harada}[http://yokolet.blogspot.com]
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining
+ * a copy of this software and associated documentation files (the
+ * 'Software'), to deal in the Software without restriction, including
+ * without limitation the rights to use, copy, modify, merge, publish,
+ * distribute, sublicense, and/or sell copies of the Software, and to
+ * permit persons to whom the Software is furnished to do so, subject to
+ * the following conditions:
+ * 
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ * 
+ * THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+ * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+ * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+ * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+ * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ */
+
+package nokogiri.internals;
+
+import static nokogiri.internals.NokogiriHelpers.getNokogiriClass;
+import static nokogiri.internals.NokogiriHelpers.isNamespace;
+import static nokogiri.internals.NokogiriHelpers.isXmlBase;
+import static nokogiri.internals.NokogiriHelpers.rubyStringToString;
+import static nokogiri.internals.NokogiriHelpers.stringOrBlank;
+import static nokogiri.internals.NokogiriHelpers.stringOrNil;
+
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.Stack;
+
+import nokogiri.XmlAttr;
+import nokogiri.XmlDocument;
+import nokogiri.XmlSyntaxError;
+
+import org.jruby.Ruby;
+import org.jruby.RubyArray;
+import org.jruby.RubyBoolean;
+import org.jruby.RubyHash;
+import org.jruby.runtime.ThreadContext;
+import org.jruby.runtime.builtin.IRubyObject;
+import org.w3c.dom.Attr;
+import org.w3c.dom.Document;
+import org.xml.sax.Attributes;
+import org.xml.sax.SAXParseException;
+
+/**
+ * Abstract class of Node for XmlReader.
+ * 
+ * @author Yoko Harada <yokolet@gmail.com>
+ *
+ */
+public abstract class ReaderNode {
+
+    Ruby ruby;
+    public ReaderAttributeList attributeList;
+    public Map<String, String> namespaces;
+    public int depth, nodeType;
+    public String lang, localName, xmlBase, prefix, name, uri, value, xmlVersion = "1.0";
+    public boolean hasChildren = false;
+    public abstract String getString();
+    private Document document = null;
+
+    public IRubyObject getAttributeByIndex(IRubyObject index){
+        if(index.isNil()) return index;
+        
+        long i = index.convertToInteger().getLongValue();
+        if(i > Integer.MAX_VALUE) {
+            throw ruby.newArgumentError("value too long to be an array index");
+        }
+
+        if (attributeList == null) return ruby.getNil();
+        if (i<0 || attributeList.length <= i) return ruby.getNil();
+        return stringOrBlank(ruby, attributeList.values.get(((Long)i).intValue()));
+    }
+
+    public IRubyObject getAttributeByName(IRubyObject name){
+        if(attributeList == null) return ruby.getNil();
+        String value = attributeList.getByName(rubyStringToString(name));
+        return stringOrNil(ruby, value);
+    }
+    
+    public IRubyObject getAttributeByName(String name){
+        if(attributeList == null) return ruby.getNil();
+        String value = attributeList.getByName(name);
+        return stringOrNil(ruby, value);
+    }
+
+    public IRubyObject getAttributeCount(){
+        if(attributeList == null) return ruby.newFixnum(0);
+        return ruby.newFixnum(attributeList.length);
+    }
+
+    public IRubyObject getAttributesNodes() {
+        RubyArray array = RubyArray.newArray(ruby);
+        if (attributeList != null && attributeList.length > 0) {
+            if (document == null) {
+                document = ((XmlDocument) getNokogiriClass(ruby, "Nokogiri::XML::Document").allocate()).getDocument();
+            }
+            for (int i=0; i<attributeList.length; i++) {
+                if (!isNamespace(attributeList.names.get(i))) {
+                    Attr attr = document.createAttributeNS(attributeList.namespaces.get(i), attributeList.names.get(i));
+                    attr.setValue(attributeList.values.get(i));
+                    XmlAttr xmlAttr = (XmlAttr) getNokogiriClass(ruby, "Nokogiri::XML::Attr").allocate();
+                    xmlAttr.setNode(ruby.getCurrentContext(), attr);
+                    array.append(xmlAttr);
+                }
+            }
+        }
+        return array;
+    }
+    
+    public IRubyObject getAttributes(ThreadContext context) {
+        if(attributeList == null) return context.getRuntime().getNil();
+        RubyHash hash = RubyHash.newHash(context.getRuntime());
+        for (int i=0; i<attributeList.length; i++) {
+            IRubyObject k = stringOrBlank(context.getRuntime(), attributeList.names.get(i));
+            IRubyObject v = stringOrBlank(context.getRuntime(), attributeList.values.get(i));
+            if (context.getRuntime().is1_9()) hash.op_aset19(context, k, v);
+            else hash.op_aset(context, k, v);
+        }
+        return hash;
+    }
+
+    public IRubyObject getDepth() {
+        return ruby.newFixnum(depth);
+    }
+
+    public IRubyObject getLang() {
+        return stringOrNil(ruby, lang);
+    }
+
+    public IRubyObject getLocalName() {
+        return stringOrNil(ruby, localName);
+    }
+
+    public IRubyObject getName() {
+        return stringOrNil(ruby, name);
+    }
+
+    public IRubyObject getNamespaces(ThreadContext context) {
+        if(namespaces == null) return ruby.getNil();
+        RubyHash hash = RubyHash.newHash(ruby);
+        Set<String> keys = namespaces.keySet();
+        for (String key : keys) {
+            String stringValue = namespaces.get(key);
+            IRubyObject k = stringOrBlank(context.getRuntime(), key);
+            IRubyObject v = stringOrBlank(context.getRuntime(), stringValue);
+            if (context.getRuntime().is1_9()) hash.op_aset19(context, k, v);
+            else hash.op_aset(context, k, v);
+        }
+        return hash;
+    }
+    
+    public IRubyObject getXmlBase() {
+        return stringOrNil(ruby, xmlBase);
+    }
+
+    public IRubyObject getPrefix() {
+        return stringOrNil(ruby, prefix);
+    }
+
+    public IRubyObject getUri() {
+        return stringOrNil(ruby, uri);
+    }
+
+    public IRubyObject getValue() {
+        return stringOrNil(ruby, value);
+    }
+
+    public IRubyObject getXmlVersion() {
+        return ruby.newString(xmlVersion);
+    }
+
+    public RubyBoolean hasAttributes() {
+        if (attributeList == null || attributeList.length == 0) return ruby.getFalse();
+        return ruby.getTrue();
+    }
+
+    public abstract RubyBoolean hasValue();
+
+    public RubyBoolean isDefault(){
+        // TODO Implement.
+        return ruby.getFalse();
+    }
+
+    public boolean isError() { return false; }
+
+    protected void parsePrefix(String qName) {
+        int index = qName.indexOf(':');
+        if(index != -1) prefix = qName.substring(0, index);
+    }
+
+    public void setLang(String lang) {
+        lang = (lang != null) ? lang : null;
+    }
+
+    public IRubyObject toSyntaxError() { return ruby.getNil(); }
+    
+    public IRubyObject getNodeType() { return ruby.newFixnum(nodeType); }
+
+    public static enum ReaderNodeType {
+        NODE(0),
+        ELEMENT(1),
+        ATTRIBUTE(2),
+        TEXT(3),
+        CDATA(4),
+        ENTITY_REFERENCE(5),
+        ENTITY(6),
+        PROCESSING_INSTRUCTION(7),
+        COMMENT(8),
+        DOCUMENT(9),
+        DOCUMENT_TYPE(10),
+        DOCUMENTFRAGMENT(11),
+        NOTATION(12),
+        WHITESPACE(13),
+        SIGNIFICANT_WHITESPACE(14),
+        END_ELEMENT(15),
+        END_ENTITY(16),
+        XML_DECLARATION(17);
+        
+        private final int value;
+        ReaderNodeType(int value) {
+            this.value = value;
+        }
+        
+        public int getValue() {
+            return value;
+        }
+    }
+
+    public static class ClosingNode extends ReaderNode {
+
+        public ClosingNode(Ruby ruby, String uri, String localName, String qName, int depth, Stack<String> langStack, Stack<String> xmlBaseStack) {
+            this.ruby = ruby;
+            nodeType = ReaderNodeType.END_ELEMENT.getValue();
+            this.uri = "".equals(uri) ? null : uri;
+            this.localName = localName.trim().length() > 0 ? localName : qName;
+            this.name = qName;
+            parsePrefix(qName);
+            this.depth = depth;
+            if (!langStack.isEmpty()) this.lang = langStack.peek();
+            if (!xmlBaseStack.isEmpty()) this.xmlBase = xmlBaseStack.peek();
+        }
+
+        @Override
+        public IRubyObject getAttributeCount() {
+            return ruby.newFixnum(0);
+        }
+
+        @Override
+        public RubyBoolean hasValue() {
+            return ruby.getFalse();
+        }
+
+        @Override
+        public String getString() {
+            StringBuffer sb = new StringBuffer();
+            sb.append("</").append(name).append(">");
+            return new String(sb);
+        }
+    }
+    
+    public static class ElementNode extends ReaderNode {
+        private List<String> attributeStrings = new ArrayList<String>();
+        
+        public ElementNode(Ruby ruby, String uri, String localName, String qName, Attributes attrs, int depth, Stack<String> langStack, Stack<String> xmlBaseStack) {
+            this.ruby = ruby;
+            this.nodeType = ReaderNodeType.ELEMENT.getValue();
+            this.uri = "".equals(uri) ? null : uri;
+            this.localName = localName.trim().length() > 0 ? localName : qName;
+            this.name = qName;
+            parsePrefix(qName);
+            this.depth = depth;
+            hasChildren = true;
+            parseAttributes(attrs, langStack, xmlBaseStack);
+        }
+
+        @Override
+        public RubyBoolean hasValue() {
+            return ruby.getFalse();
+        }
+
+        private void parseAttributes(Attributes attrs, Stack<String> langStack, Stack<String> xmlBaseStack) {
+            if (attrs.getLength() > 0) attributeList = new ReaderAttributeList();
+            String u, n, v;
+            for (int i = 0; i < attrs.getLength(); i++) {
+                u = attrs.getURI(i);
+                n = attrs.getQName(i);
+                v = attrs.getValue(i);
+                if (isNamespace(n)) {
+                    if (namespaces == null) namespaces = new HashMap<String, String>();
+                    namespaces.put(n, v);
+                } else {
+                    if (lang == null) lang = resolveLang(n, v, langStack);
+                    if (xmlBase == null) xmlBase = resolveXmlBase(n, v, xmlBaseStack);
+                }
+                attributeList.add(u, n, v);
+                attributeStrings.add(n + "=\"" + v + "\"");
+            }
+        }
+        
+        private String resolveLang(String n, String v, Stack<String> langStack) {
+            if ("xml:lang".equals(n)) {
+                return v;
+            } else if (!langStack.isEmpty()) {
+                return langStack.peek();
+            } else {
+                return null;
+            }
+        }
+        
+        private String resolveXmlBase(String n, String v, Stack<String> xmlBaseStack) {
+            if (isXmlBase(n)) {
+                return getXmlBaseUri(n, v, xmlBaseStack);
+            } else if (!xmlBaseStack.isEmpty()) {
+                return xmlBaseStack.peek();
+            } else {
+                return null;
+            }
+        }
+        
+        private String getXmlBaseUri(String n, String v, Stack<String> xmlBaseStack) {
+            if ("xml:base".equals(n)) {
+                if (v.startsWith("http://")) {
+                    return v;
+                } else if (v.startsWith("/") && v.endsWith("/")) {
+                    String sub = v.substring(1, v.length() - 2);
+                    String base = xmlBaseStack.peek();
+                    if (base.endsWith("/")) {
+                        base = base.substring(0, base.length() - 1);
+                    }
+                    int pos = base.lastIndexOf("/");
+                    return base.substring(0, pos).concat(sub);
+                } else {
+                    String base = xmlBaseStack.peek();
+                    if (base.endsWith("/")) return base.concat(v);
+                    else return base.concat("/").concat(v);
+                }
+            } else if ("xlink:href".equals(n)) {
+                String base = xmlBaseStack.peek();
+                if (base.endsWith("/")) return base.concat(v);
+                else return base.concat("/").concat(v);
+            }
+            return null;
+        }
+
+        @Override
+        public String getString() {
+            StringBuffer sb = new StringBuffer();
+            sb.append("<").append(name);
+            if (attributeList != null) {
+                for (int i=0; i<attributeList.length; i++) {
+                    sb.append(" ").append(attributeStrings.get(i));
+                }
+            }
+            if (hasChildren) sb.append(">");
+            else sb.append("/>");
+            return new String(sb);
+        }
+    }
+
+    public static class ReaderAttributeList {
+        List<String> namespaces  = new ArrayList<String>();
+        List<String> names  = new ArrayList<String>();
+        List<String> values = new ArrayList<String>();
+        int length = 0;
+        
+        void add(String namespace, String name, String value) {
+            namespace = namespace != null ? namespace : "";
+            namespaces.add(namespace);
+            name = name != null ? name : "";
+            names.add(name);
+            value = value != null ? value : "";
+            values.add(value);
+            length++;
+        }
+        
+        String getByName(String name) {
+            for (int i=0; i<names.size(); i++) {
+                if (name.equals(names.get(i))) {
+                    return values.get(i);
+                }
+            }
+            return null;
+        }
+    }
+
+    public static class EmptyNode extends ReaderNode {
+
+        public EmptyNode(Ruby ruby) {
+            this.ruby = ruby;
+            this.nodeType = ReaderNodeType.NODE.getValue();
+        }
+
+        @Override
+        public IRubyObject getXmlVersion() {
+            return this.ruby.getNil();
+        }
+
+        @Override
+        public RubyBoolean hasValue() {
+            return ruby.getFalse();
+        }
+
+        @Override
+        public String getString() {
+            return null;
+        }
+    }
+
+    public static class ExceptionNode extends EmptyNode {
+        private final XmlSyntaxError exception;
+
+        // Still don't know what to do with ex.
+        public ExceptionNode(Ruby ruby, SAXParseException ex) {
+            super(ruby);
+            this.exception = new XmlSyntaxError(ruby);
+        }
+
+        @Override
+        public boolean isError() {
+            return true;
+        }
+
+        @Override
+        public IRubyObject toSyntaxError() {
+            return this.exception;
+        }
+    }
+
+    public static class TextNode extends ReaderNode {
+
+        public TextNode(Ruby ruby, String content, int depth, Stack<String> langStack, Stack<String> xmlBaseStack) {
+            this.ruby = ruby;
+            this.value = content;
+            this.localName = "#text";
+            this.name = "#text";
+            this.depth = depth;
+            if (content.trim().length() > 0) nodeType = ReaderNodeType.TEXT.getValue();
+            else nodeType = ReaderNodeType.SIGNIFICANT_WHITESPACE.getValue();
+            if (!langStack.isEmpty()) this.lang = langStack.peek();
+            if (!xmlBaseStack.isEmpty()) this.xmlBase = xmlBaseStack.peek();
+        }
+
+        @Override
+        public RubyBoolean hasValue() {
+            return ruby.getTrue();
+        }
+
+        @Override
+        public String getString() {
+            return value;
+        }
+    }
+}