Package org.jrdf.graph

Examples of org.jrdf.graph.Node

136
137
138
139
140
141
142
143
144
145
146
    }

    private boolean findAnyEqualAttributeValue(Map<Attribute, Node> avps1, Map<Attribute, Node> avps2) {
        boolean found = false;
        for (Map.Entry<Attribute, Node> attributeValue : avps1.entrySet()) {
            final Node avpsNode2 = avps2.get(attributeValue.getKey());
            found = avpsNode2 != null && attributeValue.getValue().equals(avpsNode2);
            if (found) {
                break;
            }
        }
View Full Code Here
165
166
167
168
169
170
171
172
173
174
175
176
    }

    private boolean onlyContainsAttributesValues(Map<Attribute, Node> avps1, Map<Attribute, Node> avps2) {
        boolean found = false;
        for (Map.Entry<Attribute, Node> attributeValue : avps2.entrySet()) {
            final Node avpsNode1 = avps1.get(attributeValue.getKey());
            found = avpsNode1 != null && avpsNode1.equals(attributeValue.getValue());
            if (!found) {
                break;
            }
        }
        return found;
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
        return node;
    }

    public void visitBlankNode(BlankNode blankNode) {
        currentId = ((LocalizedNode) blankNode).getId();
        Node node = nodePool.getNodeIfExists(currentId);
        if (node == null) {
            try {
                node = createLocalBlankNode();
                currentId = ((LocalizedNode) node).getId();
            } catch (GraphException e) {
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
    public boolean nodeExists(Long nodeToTest) {
        return (getNodeIfExists(nodeToTest) != null);
    }

    public Node get(Long nodeId) {
        Node node = getNodeIfExists(nodeId);
        if (node == null) {
            throw new IllegalArgumentException("Couldn't find: " + nodeId);
        } else {
            return node;
        }
View Full Code Here
100
101
102
103
104
105
106
107
108
109
110
            return node;
        }
    }

    public Node getNodeIfExists(Long nodeId) {
        Node node = null;
        if (blankNodePool.keySet().contains(nodeId)) {
            node = mapper.convertToBlankNode(blankNodePool.get(nodeId));
        } else if (uriNodePool.keySet().contains(nodeId)) {
            node = mapper.convertToURIReference(uriNodePool.get(nodeId), nodeId);
        } else if (literalNodePool.keySet().contains(nodeId)) {
View Full Code Here
96
97
98
99
100
101
102
103
        this.tuple = newTuple;
    }

    @Override
    public Boolean visitBound(BoundOperator bound) {
        final Node value = getNextValue(bound);
        return (value != null);
    }
View Full Code Here
117
118
119
120
121
122
123
124
125
        return !notExpression.getExpression().accept(this);
    }

    @Override
    public Boolean visitEqualsExpression(EqualsExpression equalsExpression) {
        Node lhsValue = VALUE_EVALUATOR.getValue(tuple, equalsExpression.getLhs());
        Node rhsValue = VALUE_EVALUATOR.getValue(tuple, equalsExpression.getRhs());
        return compareNodes(lhsValue, rhsValue) == 0;
    }
View Full Code Here
124
125
126
127
128
129
130
131
132
        return compareNodes(lhsValue, rhsValue) == 0;
    }

    @Override
    public Boolean visitNEqualsExpression(NEqualsExpression nEqualsExpression) {
        Node lhsValue = VALUE_EVALUATOR.getValue(tuple, nEqualsExpression.getLhs());
        Node rhsValue = VALUE_EVALUATOR.getValue(tuple, nEqualsExpression.getRhs());
        return compareNodes(lhsValue, rhsValue) != 0;
    }
View Full Code Here
131
132
133
134
135
136
137
138
139
        return compareNodes(lhsValue, rhsValue) != 0;
    }

    @Override
    public Boolean visitLessThanExpression(LessThanExpression lessThanExpression) {
        Node lhsValue = VALUE_EVALUATOR.getValue(tuple, lessThanExpression.getLhs());
        Node rhsValue = VALUE_EVALUATOR.getValue(tuple, lessThanExpression.getRhs());
        return compareNodes(lhsValue, rhsValue) < 0;
    }
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
101
    @Override
    public Node visitSingleValue(SingleValue singleValue) {
        Map<Attribute, Node> avo = singleValue.getValue();
        Attribute attribute = avo.keySet().iterator().next();
        Node node = avo.get(attribute);
        final Node newValue = tuple.getValue(attribute);
        if (ANY_NODE.equals(node)) {
            if (newValue != null) {
                return newValue;
            } else {
                return null;
View Full Code Here
TOP

Related Classes of org.jrdf.graph.Node

  • org.fcrepo.server.security.xacml.util.RIRelationshipResolver
  • org.jrdf.graph.local.index.graphhandler.GraphHandler012
  • org.jrdf.graph.local.index.nodepool.LocalizerImpl
  • org.jrdf.graph.local.index.nodepool.NodeTypePoolImpl
  • org.jrdf.graph.local.iterator.ResourceIterator
  • org.jrdf.graph.local.iterator.URIReferenceResourceIterator
  • org.jrdf.graph.local.util.GraphToGraphMapperImpl
  • org.jrdf.query.execute.ExpressionSimplifierImpl
  • org.jrdf.query.expression.SingleConstraint
  • org.jrdf.query.relation.mem.AttributeTupleComparatorImpl
    • 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.