Examples with NodeImpl org.exist.dom.memtree.NodeImpl used on opensource projects

Example 36 with NodeImpl

use of org.exist.dom.memtree.NodeImpl in project exist by eXist-db.

the class ValueSequence method getDescendantAttributes.

@Override
public Sequence getDescendantAttributes(final NodeTest test) throws XPathException {
    sortInDocumentOrder();
    final ValueSequence nodes = new ValueSequence(true);
    nodes.keepUnOrdered(keepUnOrdered);
    for (int i = 0; i <= size; i++) {
        final NodeImpl node = (NodeImpl) values[i];
        node.selectDescendantAttributes(test, nodes);
    }
    return nodes;
}

Example 37 with NodeImpl

use of org.exist.dom.memtree.NodeImpl in project exist by eXist-db.

the class ValueSequence method getFollowingSiblings.

@Override
public Sequence getFollowingSiblings(final NodeTest test) throws XPathException {
    sortInDocumentOrder();
    final ValueSequence nodes = new ValueSequence(true);
    nodes.keepUnOrdered(keepUnOrdered);
    for (int i = 0; i <= size; i++) {
        final NodeImpl node = (NodeImpl) values[i];
        // if the context node is an attribute or namespace node, the following-sibling axis is empty
        if (node.getNodeType() != Node.ATTRIBUTE_NODE) {
            node.selectFollowingSiblings(test, nodes);
        }
    }
    return nodes;
}

Example 38 with NodeImpl

use of org.exist.dom.memtree.NodeImpl in project exist by eXist-db.

the class ValueSequence method getChildrenForParent.

@Override
public Sequence getChildrenForParent(final NodeImpl parent) {
    sortInDocumentOrder();
    final ValueSequence nodes = new ValueSequence(true);
    nodes.keepUnOrdered(keepUnOrdered);
    for (int i = 0; i <= size; i++) {
        final NodeImpl node = (NodeImpl) values[i];
        if (node.getNodeId().isChildOf(parent.getNodeId())) {
            nodes.add(node);
        }
    }
    return nodes;
}

Example 39 with NodeImpl

use of org.exist.dom.memtree.NodeImpl in project exist by eXist-db.

the class OrderedValueSequence method toNodeSet.

@Override
public NodeSet toNodeSet() throws XPathException {
    // return early
    if (isEmpty()) {
        return NodeSet.EMPTY_SET;
    }
    // for this method to work, all items have to be nodes
    if (itemType != Type.ANY_TYPE && Type.subTypeOf(itemType, Type.NODE)) {
        // Was ExtArrayNodeset() which orders the nodes in document order
        // The order seems to change between different invocations !!!
        final NodeSet set = new AVLTreeNodeSet();
        // NodeSet set = new ArraySet(100);
        for (int i = 0; i < count; i++) {
            NodeValue v = (NodeValue) items[i].item;
            if (v.getImplementationType() != NodeValue.PERSISTENT_NODE) {
                // found an in-memory document
                final org.exist.dom.memtree.DocumentImpl doc = v.getType() == Type.DOCUMENT ? (org.exist.dom.memtree.DocumentImpl) v : ((NodeImpl) v).getOwnerDocument();
                if (doc == null) {
                    continue;
                }
                // make this document persistent: doc.makePersistent()
                // returns a map of all root node ids mapped to the corresponding
                // persistent node. We scan the current sequence and replace all
                // in-memory nodes with their new persistent node objects.
                final DocumentImpl expandedDoc = doc.expandRefs(null);
                final org.exist.dom.persistent.DocumentImpl newDoc = expandedDoc.makePersistent();
                if (newDoc != null) {
                    final NodeId rootId = newDoc.getBrokerPool().getNodeFactory().createInstance();
                    for (int j = i; j < count; j++) {
                        v = (NodeValue) items[j].item;
                        if (v.getImplementationType() != NodeValue.PERSISTENT_NODE) {
                            NodeImpl node = (NodeImpl) v;
                            final Document nodeOwnerDoc = node.getNodeType() == Node.DOCUMENT_NODE ? (org.exist.dom.memtree.DocumentImpl) v : ((NodeImpl) v).getOwnerDocument();
                            if (nodeOwnerDoc == doc) {
                                node = expandedDoc.getNode(node.getNodeNumber());
                                NodeId nodeId = node.getNodeId();
                                if (nodeId == null) {
                                    throw new XPathException("Internal error: nodeId == null");
                                }
                                if (node.getNodeType() == Node.DOCUMENT_NODE) {
                                    nodeId = rootId;
                                } else {
                                    nodeId = rootId.append(nodeId);
                                }
                                final NodeProxy p = new NodeProxy(newDoc, nodeId, node.getNodeType());
                                if (p != null) {
                                    // replace the node by the NodeProxy
                                    items[j].item = p;
                                }
                            }
                        }
                    }
                }
                set.add((NodeProxy) items[i].item);
            } else {
                set.add((NodeProxy) v);
            }
        }
        return set;
    } else {
        throw new XPathException("Type error: the sequence cannot be converted into" + " a node set. Item type is " + Type.getTypeName(itemType));
    }
}

Example 40 with NodeImpl

use of org.exist.dom.memtree.NodeImpl in project exist by eXist-db.

the class ValueSequence method selectChildren.

@Override
public Sequence selectChildren(final MemoryNodeSet children) {
    sortInDocumentOrder();
    final ValueSequence nodes = new ValueSequence(true);
    nodes.keepUnOrdered(keepUnOrdered);
    for (int i = 0; i <= size; i++) {
        final NodeImpl node = (NodeImpl) values[i];
        for (int j = 0; j < children.size(); j++) {
            final NodeImpl descendant = children.get(j);
            if (descendant.getNodeId().isChildOf(node.getNodeId())) {
                nodes.add(node);
            }
        }
    }
    return nodes;
}