src-gu/mir-reasoner/src/possibleworlds/PossibleWorldsBruteForce.java
//	Returns a collection of all possible maps
Returns a collection of all possible maps
Returns a collection of all possible maps
private Collection<Map<Integer, Character>> findAllCombos(){
		int[] counters = new int[multipleRelations.size()];
		char[][] set = createSet();
		Collection<Map<Integer, Character>> returnArray = new HashSet<Map<Integer, Character>>();
		int[] index = new int[multipleRelations.size()];
		int j = 0;
		for(Integer key : multipleRelations.keySet()){
			index[j++] = key;
		}
		do{
			returnArray.add(getCombinationMapEntry(counters, set, index));
		}
		while(increment(counters, set));
		return returnArray;
	}
private Collection < Map < Integer , Character > > findAllCombos ( ) { int [ ] counters = new int [ multipleRelations . size ( ) ] ; char [ ] [ ] set = createSet ( ) ; Collection < Map < Integer , Character > > returnArray = new HashSet < Map < Integer , Character > > ( ) ; int [ ] index = new int [ multipleRelations . size ( ) ] ; int j = 0 ; for ( Integer key : multipleRelations . keySet ( ) ) { index [ j ++ ] = key ; } do { returnArray . add ( getCombinationMapEntry ( counters , set , index ) ) ; } while ( increment ( counters , set ) ) ; return returnArray ; }
Returns a collection of all possible maps
Returns a collection of all possible maps