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

## Uses of Class
org.mindswap.pellet.Node

Packages that use Node
org.mindswap.pellet |
org.mindswap.pellet.rules |

Uses of Node in org.mindswap.pellet

Subclasses of Node in org.mindswap.pellet
`class` | `Individual`
`class` | `Literal`

Methods in org.mindswap.pellet that return Node
`Node` | `Node.copy()`
`Node` | `Individual.copyTo(ABox abox)`
`Node` | `Literal.copyTo(ABox abox)`
`abstract Node` | `Node.copyTo(ABox abox)`
`Node` | `Node.getMergedTo()`
`Node` | `Edge.getNeighbor(Node node)`
`Node` | `ABox.getNode(aterm.ATerm x)`
`Node` | `Node.getSame()`
`Node` | `Edge.getTo()`

Methods in org.mindswap.pellet that return types with arguments of type Node
`java.util.Set<Node>` | `Individual.getDifferents()`
`java.util.Set<Node>` | `EdgeList.getFilteredNeighbors(Individual node, aterm.ATermAppl c)` Find the neighbors of a node that has a certain type.
`java.util.Set<Node>` | `Individual.getMerged()`
`java.util.Set<Node>` | `EdgeList.getNeighbors(Node node)`
`java.util.Collection<Node>` | `ABox.getNodes()`
`java.util.Set<Node>` | `Individual.getRNeighbors(Role r)`
`java.util.Set<Node>` | `Individual.getRSuccessors(Role r)`
`java.util.Set<Node>` | `Individual.getRSuccessors(Role r, aterm.ATermAppl c)`
`java.util.Set<Node>` | `Individual.getSortedSuccessors()`
`java.util.Set<Node>` | `Individual.getSuccessors()`
`java.util.Set<Node>` | `EdgeList.getSuccessors()`

Methods in org.mindswap.pellet with parameters of type Node
`void` | `ContinuousRulesStrategy.addEdge(Individual subj, Role pred, Node obj, DependencySet ds)`
`void` | `CompletionStrategy.addEdge(Individual subj, Role pred, Node obj, DependencySet ds)`
`Edge` | `Individual.addEdge(Role r, Node x, DependencySet ds)`
`void` | `ContinuousRulesStrategy.addType(Node node, aterm.ATermAppl c, DependencySet ds)`
`void` | `CompletionStrategy.addType(Node node, aterm.ATermAppl c, DependencySet ds)`
`static Clash` | `Clash.atomic(Node node, DependencySet depends)`
`static Clash` | `Clash.atomic(Node node, DependencySet depends, aterm.ATermAppl c)`
`java.lang.String` | `Clash.describeNode(Node node)`
`static Clash` | `Clash.emptyDatatype(Node node, DependencySet depends)`
`static Clash` | `Clash.emptyDatatype(Node node, DependencySet depends, aterm.ATermAppl[] datatypes)`
`static Clash` | `Clash.functionalCardinality(Node node, DependencySet depends)`
`static Clash` | `Clash.functionalCardinality(Node node, DependencySet depends, aterm.ATermAppl r)`
`DependencySet` | `Individual.getDifferenceDependency(Node node)`
`DependencySet` | `Literal.getDifferenceDependency(Node node)`
`DependencySet` | `Node.getDifferenceDependency(Node node)`
`EdgeList` | `EdgeList.getEdgesContaining(Node node)`
`EdgeList` | `EdgeList.getEdgesFromTo(Individual from, Node to)`
`EdgeList` | `Individual.getEdgesTo(Node x)`
`EdgeList` | `EdgeList.getEdgesTo(Node to)`
`EdgeList` | `Individual.getEdgesTo(Node x, Role r)`
`Node` | `Edge.getNeighbor(Node node)`
`java.util.Set<Node>` | `EdgeList.getNeighbors(Node node)`
`boolean` | `EdgeList.hasEdge(Individual from, Role role, Node to)`
`boolean` | `EdgeList.hasEdgeTo(Node to)`
`boolean` | `EdgeList.hasEdgeTo(Role role, Node to)`
`boolean` | `Individual.hasSuccessor(Node x)`
`boolean` | `Literal.hasSuccessor(Node x)`
`abstract boolean` | `Node.hasSuccessor(Node x)`
`void` | `Node.inheritDifferents(Node y, DependencySet ds)`
`static Clash` | `Clash.invalidLiteral(Node node, DependencySet depends)`
`static Clash` | `Clash.invalidLiteral(Node node, DependencySet depends, aterm.ATermAppl value)`
`boolean` | `Individual.isDifferent(Node node)`
`boolean` | `Literal.isDifferent(Node node)`
`boolean` | `Node.isDifferent(Node node)`
`boolean` | `Node.isSame(Node node)`
`static Clash` | `Clash.maxCardinality(Node node, DependencySet depends)`
`static Clash` | `Clash.maxCardinality(Node node, DependencySet depends, aterm.ATermAppl r, int n)`
`void` | `ContinuousRulesStrategy.mergeTo(Node y, Node z, DependencySet ds)`
`void` | `CompletionStrategy.mergeTo(Node y, Node z, DependencySet ds)` Merge node y into z.
`static Clash` | `Clash.missingDatatype(Node node, DependencySet depends)`
`static Clash` | `Clash.missingDatatype(Node node, DependencySet depends, aterm.ATermAppl value, aterm.ATermAppl datatype)`
`static Clash` | `Clash.nominal(Node node, DependencySet depends)`
`static Clash` | `Clash.nominal(Node node, DependencySet depends, aterm.ATermAppl other)`
`void` | `Node.setDifferent(Node node, DependencySet ds)`
`void` | `Node.setSame(Node node, DependencySet ds)`
`static Clash` | `Clash.unexplained(Node node, DependencySet depends)`
`static Clash` | `Clash.unexplained(Node node, DependencySet depends, java.lang.String msg)`
`static Clash` | `Clash.valueDatatype(Node node, DependencySet depends)`
`static Clash` | `Clash.valueDatatype(Node node, DependencySet depends, aterm.ATermAppl value, aterm.ATermAppl datatype)`

Constructors in org.mindswap.pellet with parameters of type Node
`ChooseBranch(ABox abox, CompletionStrategy completion, Node x, aterm.ATermAppl c, DependencySet ds)`
`Edge(Role name, Individual from, Node to)`
`Edge(Role name, Individual from, Node to, DependencySet d)`

Uses of Node in org.mindswap.pellet.rules

Methods in org.mindswap.pellet.rules that return types with arguments of type Node
`java.util.Set<java.util.Map.Entry<? extends AtomVariable,? extends Node>>` | `VariableBinding.entrySet()`

Constructor parameters in org.mindswap.pellet.rules with type arguments of type Node
`LiteralFilter(java.util.Iterator<Node> iterator)`

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

Copyright © 2004 Evren Sirin. All Rights Reserved.