private void rebuild(){
  List<SearchResultDataLine> existing=new ArrayList<SearchResultDataLine>(_list);
  List<SearchResultDataLine> hidden=new ArrayList<SearchResultDataLine>(HIDDEN);
  simpleClear();
  if (isSorted()) {
    for (int i=0; i < existing.size(); i++) {
      addSorted(existing.get(i));
    }
  }
 else {
    for (int i=0; i < existing.size(); i++) {
      add(existing.get(i));
    }
  }
  Map<String,SearchResultDataLine> mergeMap=new HashMap<String,SearchResultDataLine>();
  for (int i=0; i < hidden.size(); i++) {
    SearchResultDataLine tl=hidden.get(i);
    if (isSorted()) {
      addSorted(tl);
    }
 else {
      add(tl);
    }
  }
  if (isSorted()) {
    for (    SearchResultDataLine line : mergeMap.values())     addSorted(line);
  }
 else {
    for (    SearchResultDataLine line : mergeMap.values())     add(line);
  }
}

private void rebuild ( ) { List < SearchResultDataLine > existing = new ArrayList < SearchResultDataLine > ( _list ) ; List < SearchResultDataLine > hidden = new ArrayList < SearchResultDataLine > ( HIDDEN ) ; simpleClear ( ) ; if ( isSorted ( ) ) { for ( int i = 0 ; i < existing . size ( ) ; i ++ ) { addSorted ( existing . get ( i ) ) ; } } else { for ( int i = 0 ; i < existing . size ( ) ; i ++ ) { add ( existing . get ( i ) ) ; } } Map < String , SearchResultDataLine > mergeMap = new HashMap < String , SearchResultDataLine > ( ) ; for ( int i = 0 ; i < hidden . size ( ) ; i ++ ) { SearchResultDataLine tl = hidden . get ( i ) ; if ( isSorted ( ) ) { addSorted ( tl ) ; } else { add ( tl ) ; } } if ( isSorted ( ) ) { for ( SearchResultDataLine line : mergeMap . values ( ) ) addSorted ( line ) ; } else { for ( SearchResultDataLine line : mergeMap . values ( ) ) add ( line ) ; } }
rebuilds the internal map to denote a new filter .
