use of org.sirix.gui.view.sunburst.SunburstItem in project sirix by sirixdb.
the class TraverseCompareTree method createSunburstItem.
@Override
public float createSunburstItem(final Item pItem, @Nonnegative final int pDepth, @Nonnegative final int pIndex) {
checkNotNull(pItem);
checkArgument(pDepth >= 0, "pDepth must be positive!");
checkArgument(pIndex >= 0, "pIndex must be >= 0!");
// Initialize variables.
final float angle = pItem.mAngle;
final float parExtension = pItem.mExtension;
final int indexToParent = pItem.mIndexToParent;
final int descendantCount = pItem.mDescendantCount;
final int parentDescCount = pItem.mParentDescendantCount;
final int modificationCount = pItem.mModificationCount;
long parentModificationCount = pItem.mParentModificationCount;
final boolean subtract = pItem.mSubtract;
final DiffTuple diffCont = pItem.mDiff;
final int origDepth = pItem.mOrigDepth;
final int nextDepth = pItem.mNextDepth;
final int depth = pDepth;
// Calculate extension.
float extension = 2 * PConstants.PI;
if (indexToParent > -1) {
if (mItems.get(indexToParent).getSubtract()) {
parentModificationCount -= FACTOR;
}
extension = (1f - mModWeight) * (parExtension * (float) descendantCount / ((float) parentDescCount - 1f)) + mModWeight * // modificationCount/parentModificationCount.
(parExtension * (float) modificationCount / ((float) parentModificationCount - 1f));
}
LOGWRAPPER.debug("ITEM: " + pIndex);
LOGWRAPPER.debug("modificationCount: " + modificationCount);
LOGWRAPPER.debug("parentModificationCount: " + parentModificationCount);
LOGWRAPPER.debug("descendantCount: " + descendantCount);
LOGWRAPPER.debug("parentDescCount: " + parentDescCount);
LOGWRAPPER.debug("indexToParent: " + indexToParent);
LOGWRAPPER.debug("extension: " + extension);
LOGWRAPPER.debug("depth: " + depth);
LOGWRAPPER.debug("next Depth: " + nextDepth);
LOGWRAPPER.debug("angle: " + angle);
if (mPrune == Pruning.ITEMSIZE && extension < TraverseModel.ANGLE_TO_PRUNE && modificationCount <= descendantCount) {
nodePruned();
} else {
// Add a sunburst item.
if (mPrune == Pruning.DIFF && diffCont.getDiff() == DiffType.SAMEHASH) {
mIsPruned = true;
} else {
mIsPruned = false;
}
final NodeReadTrx rtx = (diffCont.getDiff() == DiffType.DELETED || diffCont.getDiff() == DiffType.MOVEDFROM || diffCont.getDiff() == DiffType.REPLACEDOLD) ? mOldRtx : mNewRtx;
final EStructType structKind = nextDepth > depth ? EStructType.ISINNERNODE : EStructType.ISLEAFNODE;
// Set node relations.
String text = "";
NodeRelations relations = null;
final DiffType currDiff = diffCont.getDiff();
if (rtx.getKind() == Kind.TEXT) {
if (currDiff == DiffType.DELETED || currDiff == DiffType.MOVEDFROM || currDiff == DiffType.REPLACEDOLD) {
text = mOldRtx.getValue();
} else {
text = mNewRtx.getValue();
}
if (currDiff == DiffType.UPDATED || ((currDiff == DiffType.REPLACEDNEW || currDiff == DiffType.REPLACEDOLD) && mOldRtx.getKind() == mNewRtx.getKind())) {
final String oldValue = mOldRtx.getValue();
final String newValue = mNewRtx.getValue();
float similarity = 1;
// try {
// Integer.parseInt(oldValue);
// Integer.parseInt(newValue);
//
// // TODO: Implement similarity measure on numerical data (easy!).
// } catch (final NumberFormatException e) {
similarity = mLevenshtein.getSimilarity(oldValue, newValue);
// }
relations = new NodeRelations(origDepth, depth, structKind, similarity, 0, 1, indexToParent).setSubtract(subtract);
} else if (currDiff == DiffType.SAME || currDiff == DiffType.SAMEHASH) {
relations = new NodeRelations(origDepth, depth, structKind, 1, 0, 1, indexToParent).setSubtract(subtract);
} else {
relations = new NodeRelations(origDepth, depth, structKind, 0, 0, 1, indexToParent).setSubtract(subtract);
}
} else {
if (mMaxDescendantCount == 0) {
if (mPrune == Pruning.NO) {
try {
mMaxDescendantCount = mMaxDescendantCountFuture.get().getDescendants();
} catch (final InterruptedException | ExecutionException e) {
LOGWRAPPER.error(e.getMessage(), e);
}
} else {
mMaxDescendantCount = mAxis.getDescendantCount();
}
}
relations = new NodeRelations(origDepth, depth, structKind, descendantCount, 1, mMaxDescendantCount, indexToParent).setSubtract(subtract);
}
// Build item.
final SunburstItem.Builder builder = new SunburstItem.Builder(mParent, angle, extension, relations, mDb, mGUI).setNodeKey(rtx.getNodeKey()).setKind(rtx.getKind()).setDiff(diffCont.getDiff());
if (modificationCount > descendantCount) {
final int diffCounts = (modificationCount - descendantCount) / TraverseModel.FACTOR;
LOGWRAPPER.debug("modCount: " + diffCounts);
builder.setModifications(diffCounts);
}
if (text.isEmpty()) {
QNm name = null;
if (diffCont.getDiff() == DiffType.DELETED || diffCont.getDiff() == DiffType.MOVEDFROM || diffCont.getDiff() == DiffType.REPLACEDOLD) {
name = mOldRtx.getName();
builder.setAttributes(fillAttributes(mOldRtx));
builder.setNamespaces(fillNamespaces(mOldRtx));
builder.setOldKey(mOldRtx.getNodeKey());
LOGWRAPPER.debug("name: " + name.getLocalName());
builder.setOldQName(name);
} else {
name = mNewRtx.getName();
builder.setAttributes(fillAttributes(mNewRtx));
builder.setNamespaces(fillNamespaces(mNewRtx));
LOGWRAPPER.debug("name: " + name.getLocalName());
builder.setQName(name);
}
} else {
LOGWRAPPER.debug("text: " + text);
if (currDiff == DiffType.DELETED || currDiff == DiffType.MOVEDFROM || currDiff == DiffType.REPLACEDOLD) {
builder.setOldText(text);
builder.setOldKey(mOldRtx.getNodeKey());
} else {
builder.setText(text);
}
}
updated(diffCont.getDiff(), builder);
final SunburstItem item = builder.build();
if (item.getDiff() == DiffType.MOVEDFROM) {
LOGWRAPPER.debug("movedToIndex: " + diffCont.getIndex());
item.setIndexMovedTo(diffCont.getIndex() - mAxis.getPrunedNodes());
}
mItems.add(item);
// Set depth max.
mNewDepthMax = Math.max(depth, mNewDepthMax);
}
return extension;
}
Aggregations