public static ArrayList<Object> deleteItemSets(ArrayList<Object> itemSets,int minSupport,int maxSupport){
  ArrayList<Object> newVector=new ArrayList<Object>(itemSets.size());
  for (int i=0; i < itemSets.size(); i++) {
    LabeledItemSet current=(LabeledItemSet)itemSets.get(i);
    if ((current.m_ruleSupCounter >= minSupport) && (current.m_ruleSupCounter <= maxSupport)) {
      newVector.add(current);
    }
  }
  return newVector;
}

public static ArrayList < Object > deleteItemSets ( ArrayList < Object > itemSets , int minSupport , int maxSupport ) { ArrayList < Object > newVector = new ArrayList < Object > ( itemSets . size ( ) ) ; for ( int i = 0 ; i < itemSets . size ( ) ; i ++ ) { LabeledItemSet current = ( LabeledItemSet ) itemSets . get ( i ) ; if ( ( current . m_ruleSupCounter >= minSupport ) && ( current . m_ruleSupCounter <= maxSupport ) ) { newVector . add ( current ) ; } } return newVector ; }
deletes all item sets that don ' t have minimum support and have more than maximum support
