/** As we flatten the tree, we use UP, DOWN nodes to represent * the tree structure. When debugging we need unique nodes * so instantiate new ones when uniqueNavigationNodes is true. */ protected void addNavigationNode(final int ttype) { Object navNode = null; if ( ttype==Token.DOWN ) { if ( hasUniqueNavigationNodes() ) { navNode = adaptor.create(Token.DOWN, "DOWN"); } else { navNode = down; } } else { if ( hasUniqueNavigationNodes() ) { navNode = adaptor.create(Token.UP, "UP"); } else { navNode = up; } } nodes.add(navNode); }
/** As we flatten the tree, we use UP, DOWN nodes to represent * the tree structure. When debugging we need unique nodes * so instantiate new ones when uniqueNavigationNodes is true. */ protected void addNavigationNode(final int ttype) { Object navNode; if ( ttype==Token.DOWN ) { if ( hasUniqueNavigationNodes() ) { navNode = adaptor.create(Token.DOWN, "DOWN"); } else { navNode = down; } } else { if ( hasUniqueNavigationNodes() ) { navNode = adaptor.create(Token.UP, "UP"); } else { navNode = up; } } nodes.add(navNode); }
/** As we flatten the tree, we use UP, DOWN nodes to represent * the tree structure. When debugging we need unique nodes * so instantiate new ones when uniqueNavigationNodes is true. */ protected void addNavigationNode(final int ttype) { Object navNode; if ( ttype==Token.DOWN ) { if ( hasUniqueNavigationNodes() ) { navNode = adaptor.create(Token.DOWN, "DOWN"); } else { navNode = down; } } else { if ( hasUniqueNavigationNodes() ) { navNode = adaptor.create(Token.UP, "UP"); } else { navNode = up; } } nodes.add(navNode); }
/** As we flatten the tree, we use UP, DOWN nodes to represent * the tree structure. When debugging we need unique nodes * so instantiate new ones when uniqueNavigationNodes is true. */ protected void addNavigationNode(final int ttype) { Object navNode; if ( ttype==Token.DOWN ) { if ( hasUniqueNavigationNodes() ) { navNode = adaptor.create(Token.DOWN, "DOWN"); } else { navNode = down; } } else { if ( hasUniqueNavigationNodes() ) { navNode = adaptor.create(Token.UP, "UP"); } else { navNode = up; } } nodes.add(navNode); }
/** As we flatten the tree, we use UP, DOWN nodes to represent * the tree structure. When debugging we need unique nodes * so instantiate new ones when uniqueNavigationNodes is true. */ protected void addNavigationNode(final int ttype) { Object navNode; if ( ttype==Token.DOWN ) { if ( hasUniqueNavigationNodes() ) { navNode = adaptor.create(Token.DOWN, "DOWN"); } else { navNode = down; } } else { if ( hasUniqueNavigationNodes() ) { navNode = adaptor.create(Token.UP, "UP"); } else { navNode = up; } } nodes.add(navNode); }
/** As we flatten the tree, we use UP, DOWN nodes to represent * the tree structure. When debugging we need unique nodes * so instantiate new ones when uniqueNavigationNodes is true. */ protected void addNavigationNode(final int ttype) { Object navNode; if ( ttype==Token.DOWN ) { if ( hasUniqueNavigationNodes() ) { navNode = adaptor.create(Token.DOWN, "DOWN"); } else { navNode = down; } } else { if ( hasUniqueNavigationNodes() ) { navNode = adaptor.create(Token.UP, "UP"); } else { navNode = up; } } nodes.add(navNode); }