Package org.jrdf.graph

Examples of org.jrdf.graph.ObjectNode


        addTriplesToSetForSubject(graph, set, node);
        addTriplesToSetForObject(graph, set, node);
        for (Triple triple : set) {
            final SubjectNode sNode = triple.getSubject();
            addBlankNodeToSet(graph, bSet, sNode);
            final ObjectNode oNode = triple.getObject();
            addBlankNodeToSet(graph, bSet, oNode);
        }
        set.clear();
    }
View Full Code Here


            addTriplesToSet(tmpSet, ANY_SUBJECT_NODE, ANY_PREDICATE_NODE, (ObjectNode) node);
        }
        for (Triple triple : tmpSet) {
            final SubjectNode sNode = triple.getSubject();
            addBlankNodeToSet(sNode);
            final ObjectNode oNode = triple.getObject();
            addBlankNodeToSet(oNode);
        }
        tmpSet.clear();
    }
View Full Code Here

    // TODO AN Not tested - can change first and last values and tests still pass.
    public Triple createTriple(Long... nodes) {
        SubjectNode subject = (SubjectNode) nodePool.getNodeById(nodes[1]);
        PredicateNode predicate = (PredicateNode) nodePool.getNodeById(nodes[2]);
        ObjectNode object = (ObjectNode) nodePool.getNodeById(nodes[0]);
        return new TripleImpl(subject, predicate, object);
    }
View Full Code Here

        final Node predNode = nodePool.getNodeById(nodes[1]);
        final Node objNode = nodePool.getNodeById(nodes[2]);

        SubjectNode subject = (SubjectNode) subNode;
        PredicateNode predicate = (PredicateNode) predNode;
        ObjectNode object = (ObjectNode) objNode;
        return new TripleImpl(subject, predicate, object);
    }
View Full Code Here

    // TODO AN Not tested - can change first and last values and tests still pass.
    public Triple createTriple(Long... nodes) {
        SubjectNode subject = (SubjectNode) nodePool.getNodeById(nodes[2]);
        PredicateNode predicate = (PredicateNode) nodePool.getNodeById(nodes[0]);
        ObjectNode object = (ObjectNode) nodePool.getNodeById(nodes[1]);
        return new TripleImpl(subject, predicate, object);
    }
View Full Code Here

    TupleBinding<Node> nodeBinding = new NodeBinding();

    public Triple entryToObject(TupleInput input) {
        SubjectNode subject = (SubjectNode) nodeBinding.entryToObject(input);
        PredicateNode predicate = (PredicateNode) nodeBinding.entryToObject(input);
        ObjectNode object = (ObjectNode) nodeBinding.entryToObject(input);
        return new TripleImpl(subject, predicate, object);
    }
View Full Code Here

    }

    private Triple convertTriple(Triple triple) {
        SubjectNode subject = triple.getSubject();
        PredicateNode predicate = triple.getPredicate();
        ObjectNode object = triple.getObject();
        if (map.containsKey(subject)) {
            subject = map.get(subject);
        }
        if (map.containsKey(object)) {
            object = map.get(object);
View Full Code Here

            return currentTriple;
        }
    }

    private void addObjectNodeIfBlank(Triple triple) {
        ObjectNode object = triple.getObject();
        if (isBlankNode(object)) {
            visitedNodes.add((BlankNode) object);
        }
    }
View Full Code Here

    public void addTripleToGraph(Triple triple) throws GraphException {
        SubjectNode subjectNode = elementFactory.createURIReference(((URIReference) triple.getSubject()).getURI());
        PredicateNode predicateNode = elementFactory.createURIReference(
            ((URIReference) triple.getPredicate()).getURI());
        ObjectNode objectNode = createLiteralOrURI(triple.getObject());
        final Triple triple1 = tripleFactory.createTriple(subjectNode, predicateNode, objectNode);
        graph.add(triple1);
    }
View Full Code Here

            hashcode = (long) subjectNode.hashCode();
            if (!newBNodeMap.containsKey(hashcode)) {
                newBNodeMap.put(hashcode, elementFactory.createBlankNode());
            }
        }
        final ObjectNode objectNode = triple.getObject();
        if (AbstractBlankNode.isBlankNode(objectNode)) {
            hashcode = (long) objectNode.hashCode();
            if (!newBNodeMap.containsKey(hashcode)) {
                newBNodeMap.put(hashcode, elementFactory.createBlankNode());
            }
        }
    }
View Full Code Here

TOP

Related Classes of org.jrdf.graph.ObjectNode

Copyright © 2018 www.massapicom. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.