Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV NEXT | FRAMES NO FRAMES

## Uses of Class
com.hp.hpl.jena.graph.query.QueryNode

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

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

Subclasses of QueryNode in com.hp.hpl.jena.graph.query
`static class` | `QueryNode.Any`
`static class` | `QueryNode.Bind`
`static class` | `QueryNode.Bound`
`static class` | `QueryNode.Fixed`
`static class` | `QueryNode.JustBound`

Fields in com.hp.hpl.jena.graph.query declared as QueryNode
`QueryNode` | `QueryTriple.O`
`QueryNode` | `QueryTriple.P`
`QueryNode` | `QueryTriple.S`

Methods in com.hp.hpl.jena.graph.query that return QueryNode
`static QueryNode` | `QueryNode.classify(QueryNodeFactory f, Mapping map, java.util.Set recent, Node n)` Answer a QueryNode that classifies the argument node `n`.
`QueryNode` | `QueryNodeFactoryBase.createAny()`
`QueryNode` | `QueryNodeFactory.createAny()`
`QueryNode` | `QueryNodeFactoryBase.createBind(Node node, int i)`
`QueryNode` | `QueryNodeFactory.createBind(Node node, int i)`
`QueryNode` | `QueryNodeFactoryBase.createBound(Node node, int i)`
`QueryNode` | `QueryNodeFactory.createBound(Node node, int i)`
`QueryNode` | `QueryNodeFactoryBase.createFixed(Node n)`
`QueryNode` | `QueryNodeFactory.createFixed(Node n)`
`QueryNode` | `QueryNodeFactoryBase.createJustBound(Node node, int i)`
`QueryNode` | `QueryNodeFactory.createJustBound(Node node, int i)`

Methods in com.hp.hpl.jena.graph.query with parameters of type QueryNode
`QueryTriple` | `QueryNodeFactoryBase.createTriple(QueryNode S, QueryNode P, QueryNode O)`
`QueryTriple` | `QueryNodeFactory.createTriple(QueryNode s, QueryNode p, QueryNode o)`

Constructors in com.hp.hpl.jena.graph.query with parameters of type QueryNode
`QueryTriple(QueryNode S, QueryNode P, QueryNode O)`

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV NEXT | FRAMES NO FRAMES

Copyright © 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 Hewlett-Packard Development Company, LP