DefaultMutableTreeNode dmtn = new DefaultMutableTreeNode(rul,true); if (rul.getSpecializable().equals("yes") && rul.getLeft().equals(left) && rul.getRight().equals(right)) { toNode = dmtn;
if (rul.getProcessed().equals("yes")) { DefaultMutableTreeNode dmtn = new DefaultMutableTreeNode(rul,true); if (rul.getSpecializable().equals("yes") && rul.getLeft().equals(left) && rul.getRight().equals(right)) { toNode = dmtn; } generateModel(curRule,dmtn); mtn.insert(dmtn,i++);
  void generateModel(Element deb,MutableTreeNode mtn) {    List listRule = deb.getChildren("Rule");    Iterator it = listRule.iterator();    int i = 0;    while(it.hasNext()) {      Element curRule = (Element)it.next();      Rule rul = new Rule(getLeftSide(curRule),                          getRightSide(curRule),                          getPrincipalRule(curRule),                          getSupport(curRule),                          getConfidence(curRule),                          getSpecializable(curRule),                          getProcessed(curRule),                          getNumber(curRule));    DefaultMutableTreeNode dmtn = new DefaultMutableTreeNode(rul,true);    if (rul.getSpecializable().equals("yes") &&        rul.getLeft().equals(left) &&        rul.getRight().equals(right)) {      toNode = dmtn;      }    generateModel(curRule,dmtn);    mtn.insert(dmtn,i++);    }  }