private static int childDiff(Tree<OWLAxiom> o1, Tree<OWLAxiom> o2) { int childCount1 = o1.getChildCount(); childCount1 = childCount1 > 0 ? 0 : 1; int childCount2 = o2.getChildCount(); childCount2 = childCount2 > 0 ? 0 : 1; return childCount1 - childCount2; }
private static int childDiff(Tree<OWLAxiom> o1, Tree<OWLAxiom> o2) { int childCount1 = o1.getChildCount(); childCount1 = childCount1 > 0 ? 0 : 1; int childCount2 = o2.getChildCount(); childCount2 = childCount2 > 0 ? 0 : 1; return childCount1 - childCount2; }
private static int childDiff(Tree<OWLAxiom> o1, Tree<OWLAxiom> o2) { int childCount1 = o1.getChildCount(); childCount1 = childCount1 > 0 ? 0 : 1; int childCount2 = o2.getChildCount(); childCount2 = childCount2 > 0 ? 0 : 1; return childCount1 - childCount2; }
private static int childDiff(Tree<OWLAxiom> o1, Tree<OWLAxiom> o2) { int childCount1 = o1.getChildCount(); childCount1 = childCount1 > 0 ? 0 : 1; int childCount2 = o2.getChildCount(); childCount2 = childCount2 > 0 ? 0 : 1; return childCount1 - childCount2; }
private static int childDiff(Tree<OWLAxiom> o1, Tree<OWLAxiom> o2) { int childCount1 = o1.getChildCount(); childCount1 = childCount1 > 0 ? 0 : 1; int childCount2 = o2.getChildCount(); childCount2 = childCount2 > 0 ? 0 : 1; return childCount1 - childCount2; }
private static int childDiff(Tree<OWLAxiom> o1, Tree<OWLAxiom> o2) { int childCount1 = o1.getChildCount(); childCount1 = childCount1 > 0 ? 0 : 1; int childCount2 = o2.getChildCount(); childCount2 = childCount2 > 0 ? 0 : 1; return childCount1 - childCount2; }
private static int childDiff(Tree<OWLAxiom> o1, Tree<OWLAxiom> o2) { int childCount1 = o1.getChildCount(); childCount1 = childCount1 > 0 ? 0 : 1; int childCount2 = o2.getChildCount(); childCount2 = childCount2 > 0 ? 0 : 1; return childCount1 - childCount2; }
private static int childDiff(Tree<OWLAxiom> o1, Tree<OWLAxiom> o2) { int childCount1 = o1.getChildCount(); childCount1 = childCount1 > 0 ? 0 : 1; int childCount2 = o2.getChildCount(); childCount2 = childCount2 > 0 ? 0 : 1; return childCount1 - childCount2; }
return -1; int childCount1 = o1.getChildCount(); childCount1 = childCount1 > 0 ? 0 : 1; int childCount2 = o2.getChildCount(); childCount2 = childCount2 > 0 ? 0 : 1; int diff = childCount1 - childCount2;