vbatts/PathPacker-java
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

getters

Browse source
This commit is contained in:
Vincent Batts 2012-10-31 13:17:30 -04:00
parent c053cae590
commit 1d13db07c5
1 changed files with 21 additions and 17 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

38
src/main/java/com/redhat/trie/PathTree.java
View file

@ -46,7 +46,7 @@ public class PathTree {
private List<HuffNode> pathDictionary; private List<HuffNode> pathDictionary;
private StringBuffer nodeBits; // TODO make a smart getter for this private StringBuffer nodeBits; // TODO make a smart getter for this
private byte[] payload; // FIXME - may not be needed private byte[] payload;
/** /**
* context incrementor used when building the trees * context incrementor used when building the trees
@ -112,8 +112,8 @@ public class PathTree {
*/ */
public void setPayload(byte[] payload) { public void setPayload(byte[] payload) {
this.modified = true; this.modified = true;
this.nodeBits = null; setNodeBits(null);
this.nodeCount = 0; setNodeCount(0);
this.pathNodeContext = new NodeContext(); this.pathNodeContext = new NodeContext();
this.huffNodeContext = new NodeContext(); this.huffNodeContext = new NodeContext();
@ -133,19 +133,17 @@ public class PathTree {
return this.huffNodeContext; return this.huffNodeContext;
} }
public long getDictOffset() { private long getDictOffset() {
return this.dictOffset; return this.dictOffset;
} }
public int getNodeCount() { private int getNodeCount() {
return this.nodeCount; return this.nodeCount;
} }
/** /**
* getter for the compressed payload blob. * getter for the compressed payload blob.
* *
* TODO - add logic to build the payload, it the object was constructed from contentSets
*
* @return byte array of deflated dict and tree. * @return byte array of deflated dict and tree.
*/ */
public byte[] getPayload() { public byte[] getPayload() {
@ -161,6 +159,10 @@ public class PathTree {
return this.nodeBits; return this.nodeBits;
} }
private void setNodeBits(StringBuffer nodeBits) {
this.nodeBits = nodeBits;
}
private void setDictOffset(long offset) { private void setDictOffset(long offset) {
this.dictOffset = offset; this.dictOffset = offset;
} }
@ -212,7 +214,7 @@ public class PathTree {
} }
if (this.modified || this.pathDictionary == null || this.nodeDictionary == null) { if (this.modified || this.pathDictionary == null || this.nodeDictionary == null) {
this.nodeDictionary = new ArrayList<HuffNode>(); this.nodeDictionary = new ArrayList<HuffNode>();
this.nodeBits = new StringBuffer(); setNodeBits(new StringBuffer());
ByteArrayInputStream bais = new ByteArrayInputStream(getPayload(), ByteArrayInputStream bais = new ByteArrayInputStream(getPayload(),
(new Long(getDictOffset())).intValue(), (new Long(getPayload().length - getDictOffset()).intValue())); (new Long(getDictOffset())).intValue(), (new Long(getPayload().length - getDictOffset()).intValue()));
@ -317,7 +319,7 @@ public class PathTree {
public void setContentSets(List<String> contentSets) throws PayloadException { public void setContentSets(List<String> contentSets) throws PayloadException {
this.modified = true; this.modified = true;
this.nodeBits = null; this.nodeBits = null;
this.nodeCount = 0; setNodeCount(0);
this.pathNodeContext = new NodeContext(); this.pathNodeContext = new NodeContext();
this.huffNodeContext = new NodeContext(); this.huffNodeContext = new NodeContext();
@ -428,8 +430,8 @@ public class PathTree {
String nameValue = null; String nameValue = null;
StringBuffer nameBits = new StringBuffer(); StringBuffer nameBits = new StringBuffer();
while (nameValue == null && stillNode) { while (nameValue == null && stillNode) {
nameBits.append(nodeBits.charAt(0)); nameBits.append(getNodeBits().charAt(0));
nodeBits.deleteCharAt(0); getNodeBits().deleteCharAt(0);
Object lookupValue = findHuffNodeValueByBits(pathTrie, Object lookupValue = findHuffNodeValueByBits(pathTrie,
nameBits.toString()); nameBits.toString());
if (lookupValue != null) { if (lookupValue != null) {
@ -439,7 +441,7 @@ public class PathTree {
} }
nameValue = (String) lookupValue; nameValue = (String) lookupValue;
} }
if (nodeBits.length() == 0) { if (getNodeBits().length() == 0) {
stillNode = false; stillNode = false;
} }
} }
@ -447,8 +449,8 @@ public class PathTree {
PathNode nodeValue = null; PathNode nodeValue = null;
StringBuffer pathBits = new StringBuffer(); StringBuffer pathBits = new StringBuffer();
while (nodeValue == null && stillNode) { while (nodeValue == null && stillNode) {
pathBits.append(nodeBits.charAt(0)); pathBits.append(getNodeBits().charAt(0));
nodeBits.deleteCharAt(0); getNodeBits().deleteCharAt(0);
PathNode lookupValue = (PathNode) findHuffNodeValueByBits(nodeTrie, PathNode lookupValue = (PathNode) findHuffNodeValueByBits(nodeTrie,
pathBits.toString()); pathBits.toString());
if (lookupValue != null) { if (lookupValue != null) {
@ -457,7 +459,7 @@ public class PathTree {
((PathNode) node.getValue()).addChild( ((PathNode) node.getValue()).addChild(
new NodePair(nameValue, nodeValue)); new NodePair(nameValue, nodeValue));
} }
if (nodeBits.length() == 0) { if (getNodeBits().length() == 0) {
stillNode = false; stillNode = false;
} }
} }
@ -802,7 +804,9 @@ public class PathTree {
} }
} }
/* TODO ??? */ /**
* TODO ???
*/
private byte[] toByteArray(int value) { private byte[] toByteArray(int value) {
return new byte[] { return new byte[] {
(byte) (value >> 24), (byte) (value >> 24),
@ -811,7 +815,7 @@ public class PathTree {
(byte) value}; (byte) value};
} }
public void condenseSubTreeNodes(PathNode location) { private void condenseSubTreeNodes(PathNode location) {
// "equivalent" parents are merged // "equivalent" parents are merged
List<PathNode> parentResult = new ArrayList<PathNode>(); List<PathNode> parentResult = new ArrayList<PathNode>();
parentResult.addAll(location.getParents()); parentResult.addAll(location.getParents());