return (flattener.getNumTiles()+newTiles<=target);
return (Partitioner.countTilesNeeded(str, flattener, joinersNeedTiles)+newTiles<=target);
    private boolean canFiss(LinkedList candidates, GraphFlattener flattener) {	// count the number of new tiles required	int newTiles = 0;	// go through the candidates and count tiles, check that can	// be duplicated	for (int i=0; i<candidates.size(); i++) {	    SIRFilter filter = (SIRFilter)candidates.get(i);	    // check fissable	    if (!StatelessDuplicate.isFissable(filter)) {		return false;	    }	    // count new copies of the filter	    newTiles += tilesForFission(filter, flattener, 2);	}	// return whether or not there's room for candidates	return (flattener.getNumTiles()+newTiles<=target);    }