@Override public boolean visitEnter(TreeNodeResult<String> node) { String id = node.getObject(); int count = node.getAttCount(); TARGET object = converter.convert(id); TreeNodeResult<TARGET> newNode = new TreeNodeResult<TARGET>( object, count); TreeNodeResult<TARGET> parent = stack.peekLast(); if (parent == null) { // le premier noeud, donc le root a retourner plus tard tree = newNode; } else { parent.add(newNode); } stack.offerLast(newNode); return true; }
TreeNodeResult<String> child = e.getValue(); TreeNodeResult<String> parent = allTreeNodeResult.get(parentId); parent.add(child);
TreeNodeResult<String> parent = allTreeNodeResult.get(parentId); if (parent != child) { parent.add(child);