Uses of Class
com.hp.hpl.jena.graph.query.Domain

Packages that use Domain
com.hp.hpl.jena.graph.query Defines the graph-level Query classes, allowing multi-pattern query over arbitrary graphs. 
 

Uses of Domain in com.hp.hpl.jena.graph.query
 

Methods in com.hp.hpl.jena.graph.query that return Domain
 Domain Pipe.get()
          Answer the next element if there is one, otherwise throw a NoSuchElementException.
 Domain Domain.copy()
           
 Domain BufferPipe.get()
           
 

Methods in com.hp.hpl.jena.graph.query with parameters of type Domain
 void Pipe.put(Domain d)
          Put a domain element into the pipe for later extraction.
 TripleMatch Pattern.asTripleMatch(Domain d)
          Convert a Pattern into a TripleMatch by making a Triple who's Nodes are the conversions of the constituent elements.
 boolean Pattern.match(Domain d, Triple t)
          Answer true iff this pattern, given the values for variables as found in a given Domain, matches the given triple; update the Domain with any variable bindings.
 boolean Fixed.match(Domain d, Node x)
          Answer true iff we are matched against a node with the same value as ours.
 Node Fixed.asNodeMatch(Domain d)
          Answer the Node we represent given the variable-bindings Domain.
abstract  boolean Element.match(Domain d, Node x)
          Answer true if this Element matches x given the bindings in d.
abstract  Node Element.asNodeMatch(Domain d)
          Answer a Node suitable as a pattern-match element in a TripleMatch approximating this Element.
 void BufferPipe.put(Domain d)
           
 boolean Bound.match(Domain d, Node x)
          Answer true iff the node x matches the previously-seen value at Donain[index].
 Node Bound.asNodeMatch(Domain d)
           
 boolean Bind.match(Domain d, Node x)
          Answer true after updating the domain to record the value this element binds.
 Node Bind.asNodeMatch(Domain d)
          Answer Node.ANY, as a binding occurance of a variable can match anything.
 



Copyright © 2000-2003 Hewlett-Packard. All Rights Reserved.