public void fillBuffer(Object t) { boolean nil = adaptor.isNil(t); if ( !nil ) { nodes.add(t); // add this node } // add DOWN node if t has children int n = adaptor.getChildCount(t); if ( !nil && n>0 ) { addNavigationNode(Token.DOWN); } // and now add all its children for (int c=0; c<n; c++) { Object child = adaptor.getChild(t,c); fillBuffer(child); } // add UP node if t has children if ( !nil && n>0 ) { addNavigationNode(Token.UP); } }
public void fillBuffer(Object t) { boolean nil = adaptor.isNil(t); if ( !nil ) { nodes.add(t); // add this node } // add DOWN node if t has children int n = adaptor.getChildCount(t); if ( !nil && n>0 ) { addNavigationNode(Token.DOWN); } // and now add all its children for (int c=0; c<n; c++) { Object child = adaptor.getChild(t,c); fillBuffer(child); } // add UP node if t has children if ( !nil && n>0 ) { addNavigationNode(Token.UP); } }
public void fillBuffer(Object t) { boolean nil = adaptor.isNil(t); if ( !nil ) { nodes.add(t); // add this node } // add DOWN node if t has children int n = adaptor.getChildCount(t); if ( !nil && n>0 ) { addNavigationNode(Token.DOWN); } // and now add all its children for (int c=0; c<n; c++) { Object child = adaptor.getChild(t,c); fillBuffer(child); } // add UP node if t has children if ( !nil && n>0 ) { addNavigationNode(Token.UP); } }
public void fillBuffer(Object t) { boolean nil = adaptor.isNil(t); if ( !nil ) { nodes.add(t); // add this node } // add DOWN node if t has children int n = adaptor.getChildCount(t); if ( !nil && n>0 ) { addNavigationNode(Token.DOWN); } // and now add all its children for (int c=0; c<n; c++) { Object child = adaptor.getChild(t,c); fillBuffer(child); } // add UP node if t has children if ( !nil && n>0 ) { addNavigationNode(Token.UP); } }
public void fillBuffer(Object t) { boolean nil = adaptor.isNil(t); if ( !nil ) { nodes.add(t); // add this node } // add DOWN node if t has children int n = adaptor.getChildCount(t); if ( !nil && n>0 ) { addNavigationNode(Token.DOWN); } // and now add all its children for (int c=0; c<n; c++) { Object child = adaptor.getChild(t,c); fillBuffer(child); } // add UP node if t has children if ( !nil && n>0 ) { addNavigationNode(Token.UP); } }
public void fillBuffer(Object t) { boolean nil = adaptor.isNil(t); if ( !nil ) { nodes.add(t); // add this node } // add DOWN node if t has children int n = adaptor.getChildCount(t); if ( !nil && n>0 ) { addNavigationNode(Token.DOWN); } // and now add all its children for (int c=0; c<n; c++) { Object child = adaptor.getChild(t,c); fillBuffer(child); } // add UP node if t has children if ( !nil && n>0 ) { addNavigationNode(Token.UP); } }