public class TreeWalkResults extends ArrayList<TreeWalkResults.TreeWalkEntry>
| Modifier and Type | Class and Description |
|---|---|
static class |
TreeWalkResults.MatchSpec
This class has two public Lists: you can construct your own to set the acceptable and unacceptable STATUS codes.
|
static class |
TreeWalkResults.TreeWalkEntry |
| Modifier and Type | Field and Description |
|---|---|
String |
leftID |
String |
rightID |
modCount| Constructor and Description |
|---|
TreeWalkResults() |
| Modifier and Type | Method and Description |
|---|---|
int |
countFor(TreeWalkResults.TreeWalkEntry.STATUS status) |
static Map<TreeWalkResults.TreeWalkEntry.STATUS,Range> |
createDOMSet(String matched,
String missing,
String added,
String error,
String different,
String nested) |
String |
fullSummary() |
String |
getErrorMessages() |
int |
getMismatchCount() |
boolean |
hasDocErrors() |
boolean |
isStrictMatch() |
String |
miniSummary() |
String |
toString(String LEAD) |
boolean |
treesMatch()
For our purposes, trees match if they have the same element tree structure - no checking is done for text node changes.
|
boolean |
treesMatch(TreeWalkResults.MatchSpec matchSpec) |
add, add, addAll, addAll, clear, clone, contains, ensureCapacity, forEach, get, indexOf, isEmpty, iterator, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, removeIf, removeRange, replaceAll, retainAll, set, size, sort, spliterator, subList, toArray, toArray, trimToSizeequals, hashCodecontainsAll, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitcontainsAll, equals, hashCodeparallelStream, streampublic boolean hasDocErrors()
public String getErrorMessages()
public boolean isStrictMatch()
public int getMismatchCount()
public boolean treesMatch()
public boolean treesMatch(TreeWalkResults.MatchSpec matchSpec)
public int countFor(TreeWalkResults.TreeWalkEntry.STATUS status)
public String miniSummary()
public String fullSummary()
Copyright © 2016. All rights reserved.