Package | Description |
---|---|
de.danielbechler.diff | |
de.danielbechler.diff.node | |
de.danielbechler.diff.visitor |
Modifier and Type | Method and Description |
---|---|
<T> Node |
ObjectDiffer.compare(T working,
T base)
Recursively inspects the given objects and returns a node representing their differences.
|
Modifier and Type | Method and Description |
---|---|
MapNode |
MapNodeFactory.createMapNode(Node parentNode,
de.danielbechler.diff.Instances instances) |
boolean |
Configuration.isEqualsOnly(Node node) |
boolean |
Configuration.isExcluded(Node node) |
boolean |
Configuration.isIgnored(Node node) |
boolean |
Configuration.isIncluded(Node node) |
boolean |
Configuration.isIntrospectible(Node node) |
boolean |
Configuration.isReturnable(Node node) |
Modifier and Type | Class and Description |
---|---|
class |
CollectionNode |
class |
DefaultNode |
class |
MapNode |
Modifier and Type | Field and Description |
---|---|
static Node |
Node.ROOT |
Modifier and Type | Method and Description |
---|---|
Node |
Node.getChild(Element pathElement)
Retrieve a child that matches the given path element relative to this node.
|
Node |
DefaultNode.getChild(Element pathElement) |
Node |
Node.getChild(PropertyPath path)
Retrieve a child that matches the given absolute path, starting from the current node.
|
Node |
DefaultNode.getChild(PropertyPath path) |
Node |
Node.getChild(String propertyName)
Retrieve a child with the given property name relative to this node.
|
Node |
DefaultNode.getChild(String propertyName) |
Node |
Node.getCircleStartNode() |
Node |
DefaultNode.getCircleStartNode() |
Node |
Node.getParentNode() |
Node |
DefaultNode.getParentNode() |
Modifier and Type | Method and Description |
---|---|
Collection<Node> |
CollectionNode.getAdditions() |
Collection<Node> |
CollectionNode.getChanges() |
Collection<Node> |
Node.getChildren() |
Collection<Node> |
DefaultNode.getChildren() |
Collection<Node> |
CollectionNode.getRemovals() |
Modifier and Type | Method and Description |
---|---|
void |
Node.Visitor.accept(Node node,
Visit visit) |
boolean |
Node.addChild(Node node)
Adds a child to this node and sets this node as its parent node.
|
boolean |
DefaultNode.addChild(Node node) |
void |
Node.setCircleStartNode(Node node) |
void |
DefaultNode.setCircleStartNode(Node circleStartNode) |
void |
Node.setParentNode(Node parent)
Sets the parent node.
|
void |
DefaultNode.setParentNode(Node parentNode) |
Constructor and Description |
---|
CollectionNode(Node parent,
Accessor accessor,
Class<?> valueType) |
DefaultNode(Node parentNode,
Accessor accessor,
Class<?> valueType) |
MapNode(Node parentNode,
Accessor accessor,
Class<?> valueType) |
Modifier and Type | Method and Description |
---|---|
Node |
PropertyVisitor.getNode() |
Modifier and Type | Method and Description |
---|---|
Collection<Node> |
AbstractFilteringVisitor.getMatches() |
Modifier and Type | Method and Description |
---|---|
protected boolean |
StateFilteringVisitor.accept(Node node) |
protected boolean |
CategoryFilteringVisitor.accept(Node node) |
protected abstract boolean |
AbstractFilteringVisitor.accept(Node node) |
void |
PropertyVisitor.accept(Node node,
Visit visit) |
void |
PrintingVisitor.accept(Node node,
Visit visit) |
void |
NodeHierarchyVisitor.accept(Node node,
Visit visit) |
void |
AbstractFilteringVisitor.accept(Node node,
Visit visit) |
protected String |
ToMapPrintingVisitor.differenceToString(Node node,
Object base,
Object modified) |
protected String |
PrintingVisitor.differenceToString(Node node,
Object base,
Object modified) |
protected boolean |
PrintingVisitor.filter(Node node) |
protected void |
StateFilteringVisitor.onAccept(Node node,
Visit visit) |
protected void |
AbstractFilteringVisitor.onAccept(Node node,
Visit visit) |
protected void |
StateFilteringVisitor.onDismiss(Node node,
Visit visit) |
protected void |
CategoryFilteringVisitor.onDismiss(Node node,
Visit visit) |
protected void |
AbstractFilteringVisitor.onDismiss(Node node,
Visit visit) |
protected void |
NodeHierarchyVisitor.print(Node node,
int level) |
Copyright © 2013. All Rights Reserved.