org.dmd.dmu.util.json

Class DeepSortNode

java.lang.Object

org.dmd.dmu.util.json.DeepSortNode

public class DeepSortNode
extends Object

Constructor Summary

Constructors

Constructor and Description
DeepSortNode(DeepSortNode parent, String key, boolean isArray, TreeSet<String> possibleSortKeyNames)
DeepSortNode(TreeSet<String> possibleSortKeyNames) Creates a root node.

Method Summary

Modifier and Type	Method and Description
void	addKeySignature(org.json.JSONObject obj) For an array element node, this will create a key signature for the specified object and maintain a count of how many times we see that signature for all of the objects in an array.
void	addPrimitive(String key)
DeepSortNode	arrayElement()
void	fullHierarchy(StringBuilder sb)
boolean	isArray()
String	path()
void	pathAndKeys(StringBuilder sb)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

DeepSortNode

public DeepSortNode(TreeSet<String> possibleSortKeyNames)

Creates a root node.

DeepSortNode

public DeepSortNode(DeepSortNode parent,
                    String key,
                    boolean isArray,
                    TreeSet<String> possibleSortKeyNames)

Method Detail

isArray

public boolean isArray()

arrayElement

public DeepSortNode arrayElement()

path

public String path()

addKeySignature

public void addKeySignature(org.json.JSONObject obj)

For an array element node, this will create a key signature for the specified object and maintain a count of how many times we see that signature for all of the objects in an array. This allows us to determine if we're dealing with homogeneous or heterogeneous objects and provides us with a count of each unique signature.

Parameters:

obj - the object to be analyzed.

addPrimitive

public void addPrimitive(String key)

fullHierarchy

public void fullHierarchy(StringBuilder sb)

pathAndKeys

public void pathAndKeys(StringBuilder sb)