org.apache.jena.graph.Node#equals

Source File: ElementTransformSPARQLStarTest.java From RDFstarTools with Apache License 2.0

6 votes

public boolean canBeIsomorphic(Node n1, Node n2) {
    if (    (n1.isBlank() || Var.isBlankNodeVar(n1))
         && (n2.isBlank() || Var.isBlankNodeVar(n2)) ) {
        final Node other = map.get(n1);
        if ( other == null ) {
        	if ( valueSet.contains(n2) )
        		return false;

            map.put(n1, n2);
            valueSet.add(n2);
            return true;
        }
        return other.equals(n2);
    }
    return n1.equals(n2);
}

Source File: localname.java From xcurator with Apache License 2.0

6 votes

private QueryIterator execFixedSubject(Node nodeURI, Node nodeLocalname, Binding binding, ExecutionContext execCxt)
{
    if ( ! nodeURI.isURI() )
        // Subject bound but not a URI
        return QueryIterNullIterator.create(execCxt) ;

    // Subject is bound and a URI - get the localname as a Node 
    Node localname = NodeFactory.createLiteral(nodeURI.getLocalName()) ;
    
    // Object - unbound variable or a value? 
    if ( ! nodeLocalname.isVariable() )
    {
        // Object bound or a query constant.  Is it the same as the calculated value?
        if ( nodeLocalname.equals(localname) )
            // Same
            return QueryIterSingleton.create(binding, execCxt) ;
        // No - different - no match.
        return QueryIterNullIterator.create(execCxt) ;
    }
    
    // Object unbound variable - assign the localname to it.
    return QueryIterSingleton.create(binding, Var.alloc(nodeLocalname), localname, execCxt) ;
}

Source File: SubstitutionImplForJena.java From quetzal with Eclipse Public License 2.0

6 votes

/**
 * Accumulates the different subsititions for a triple and applies them intelligently
	if we have a substitution 
	x/y
	and in a next step we compute a new substitution
	y/z
	then the composition should be
	x/z, y/z
	and not
	x/y, y/z **/
@Override
public boolean compose(Node original, Node substitution) {
	SubstitutionForJena unifier = StatementUnifierForJena.getUnifier(original, substitution);
	Set<Node> trivialRemove = new HashSet<Node>();

	if (unifier == null)
		return false;
	if (unifier instanceof NeutralSubstitution)
		return true;
	for (Node key : map.keySet()) {
		Node value = map.get(key);
		if (value.equals(original))
			if (key.equals(substitution)) {
				// existing substitition now trivial, remove it.
				trivialRemove.add(key);
			} else {
				map.put(key, substitution);
			}
	}
	map.put(original, substitution);
	map.keySet().removeAll(trivialRemove);
	return true;
}

Source File: StatementUnifierForJena.java From quetzal with Eclipse Public License 2.0

6 votes

/***
 * Returns null if both terms cant be unified, a neutralsubstitution if they
 * are already equal, or a singleton substitution otherwise.
 * 
 * @param term1
 * @param term2
 * @return
 */
public static SubstitutionForJena getUnifier(Node term1, Node term2) {

	if (term1.equals(term2))
		return new NeutralSubstitutionForJena();

	if (!term1.isVariable() && !term2.isVariable()) {
		if (term1.matches(term2)) {
			return new NeutralSubstitutionForJena();
		}
		return null;
	}
	else if (term1.isVariable() && !term2.isVariable())// left is always a variable
		return new SingletonSubstitutionForJena(term1, term2);
	else {
		// both not equal variables, substitution right for left (priority for
		// original names).
		return new SingletonSubstitutionForJena(term2, term1);  // n, x
	}
}

Source File: LicenseException.java From tools with Apache License 2.0

6 votes

/**
 * @param id the id to set
 * @throws InvalidSPDXAnalysisException 
 */
public void setLicenseExceptionId(String id) throws InvalidSPDXAnalysisException {
	if (model != null) {
		Node duplicateNode = findException(model, this.licenseExceptionId);
		if (duplicateNode != null && !duplicateNode.equals(this.exceptionNode)) {
			throw(new InvalidSPDXAnalysisException("Can not set the License Exception ID to "+id+".  That ID is already in use."));
		}
	}
	this.licenseExceptionId = id;
	if (this.exceptionNode != null) {
		// delete any previous created
		Property p = model.getProperty(SpdxRdfConstants.SPDX_NAMESPACE, SpdxRdfConstants.PROP_LICENSE_EXCEPTION_ID);
		model.removeAll(resource, p, null);
		// add the property
		if (id != null) {
			p = model.createProperty(SpdxRdfConstants.SPDX_NAMESPACE, SpdxRdfConstants.PROP_LICENSE_EXCEPTION_ID);
			resource.addProperty(p, id);
		}
	}
}

Source File: SPARQLExtFormatterElement.java From sparql-generate with Apache License 2.0

5 votes

private int printProperty(Node p) {
    String str = slotToString(p);
    if (p.equals(RDF.Nodes.type) && str.equals(RDFTYPE)) {
        out.print("a");
    } else {
        out.print(str);
    }
    out.pad(predicateWidth);
    return str.length();
}

Source File: SHACLFunctionsCache.java From shacl with Apache License 2.0

5 votes

private boolean argEquals(Node arg1, Node arg2) {
	if(arg1 == null) {
		return arg2 == null;
	}
	else if(arg2 == null) {
		return false;
	}
	else {
		return arg1.equals(arg2);
	}
}

Source File: OWLQLCompiler.java From quetzal with Eclipse Public License 2.0

5 votes

protected boolean unify(Node t1, Node t2, Map<Node, Node> old2New) {
	if (t1.isVariable()) {
		return unifyT1Variable(t1, t2, old2New);
	} else if (t2.isVariable()) {
		return unifyT1Variable(t2,t1, old2New);
	} else {
		// i.e., t1 and t2 are not variables
		return t1.equals(t2);
	}
}

Source File: DB2Dataset.java From quetzal with Eclipse Public License 2.0

5 votes

@Override
public Iterator<Quad> findNG(Node g, Node s, Node p, Node o)
   {
   if ((g == null) || g.equals(Node.ANY))
      {
      // TODO: REVISIT: very inefficient way to get all the matching quads from named graphs only
      LinkedList<Quad> l = new LinkedList<Quad>();
      Iterator<Quad> res = find(g, s, p, o);
      while (res.hasNext())
         {
         Quad q = res.next();
         if (q.getGraph() != null
               && (!q.getGraph().isURI() || !q.getGraph().getURI().equalsIgnoreCase(Constants.DEFAULT_GRAPH_MONIKER)))
            {
            l.add(q);
            }
         }
      return l.iterator();

      }
   else if (g.getURI().equalsIgnoreCase(Constants.DEFAULT_GRAPH_MONIKER))
      {
      return new LinkedList<Quad>().iterator();
      }
   else
      {
      return find(g, s, p, o);
      }
   }

Source File: DB2Dataset.java From quetzal with Eclipse Public License 2.0

5 votes

public Iterator<Quad> find(Node g, final Node s, final Node p, final Node o)
{

ExtendedIterator<Triple> it;

if ((g == null) || g.equals(Node.ANY))
   {
   it = DB2Graph.find(store, new Triple(s, p, o), null, connection, false, /* not reification */
         true /* search all graphs */);
   }
else
   {

   if (g.getURI().equalsIgnoreCase(Constants.DEFAULT_GRAPH_MONIKER))
      {
      it = defaultModel.getGraph().find(s, p, o);
      }
   else
      {
      it = getGraph(g).find(s, p, o);
      }

   }

Set<Quad> sq = new HashSet<Quad>();
while (it.hasNext())
   {
   sq.add(new Quad(g, it.next()));
   }
it.close();

return sq.iterator();

}

Source File: QueryIterTripleStarPattern.java From RDFstarTools with Apache License 2.0

5 votes

static protected boolean insert( Node inputNode,
                                 Node outputNode,
                                 BindingMap results,
                                 boolean inputNodeIsTripleWithVars )
{
	if ( inputNodeIsTripleWithVars )
    {
		if ( !(outputNode instanceof Node_Triple) )
			return false;

		final Triple outputTriple = ( (Node_Triple) outputNode ).get();
		final Triple inputTriple  = ( (Node_Triple) inputNode  ).get();

		return insert(outputTriple,
		              inputTriple.getSubject(),
		              inputTriple.getPredicate(),
		              inputTriple.getObject(),
		              results );
    }
    else if ( Var.isVar(inputNode) )
    {
    	final Var v = Var.alloc(inputNode);
        final Node x = results.get(v);
        if ( x != null )
            return outputNode.equals(x);

        results.add(v, outputNode);
        return true;
    }
    else
    	return true;
}