public Set searchChildren(NodeNameFilter filter,boolean recursive){
  Set set=new HashSet();
  getChildren(recursive,set);
  Set results=new HashSet();
  for (Iterator i=set.iterator(); i.hasNext(); ) {
    SMSFlatFileTreeNode node=(SMSFlatFileTreeNode)i.next();
    if ((filter == null) || filter.accept(node.getName())) {
      results.add(node);
    }
  }
  return results;
}

public Set searchChildren ( NodeNameFilter filter , boolean recursive ) { Set set = new HashSet ( ) ; getChildren ( recursive , set ) ; Set results = new HashSet ( ) ; for ( Iterator i = set . iterator ( ) ; i . hasNext ( ) ; ) { SMSFlatFileTreeNode node = ( SMSFlatFileTreeNode ) i . next ( ) ; if ( ( filter == null ) || filter . accept ( node . getName ( ) ) ) { results . add ( node ) ; } } return results ; }
searches for nodes that matches with a given filter .
