import org.paukov.combinatorics.Factory; //导入依赖的package包/类
public void createStates()
{
	// Create the initial vector of 2 elements (0 and 1 to represent black and white)
	ICombinatoricsVector<Integer> originalVector = Factory.createVector(new Integer[] { 0, 1 });

	// Set the second parameter as 9, since we are permutating with 9 discs.
	Generator<Integer> gen = Factory.createPermutationWithRepetitionGenerator(originalVector, 9);
	
	for (ICombinatoricsVector<Integer> permuation : gen) 
	{
		int[][] generatedState = new int[3][3];
		List<Integer> listOfGeneratedStates = permuation.getVector();
		int numOfState = 0;
		for(int y = 0; y < 3; y++)
		{
			for(int x = 0; x < 3; x++)
			{
			generatedState[x][y] = listOfGeneratedStates.get(numOfState);
			
			numOfState++;
			}
		}
		setOfStates.add(generatedState);
	}
}
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
@Test
public void attrCombTest() {
  Attribute isbn = new Attribute("isbn", Type.TEXT);
  Attribute author = new Attribute("author", Type.TEXT);
  Attribute binding = new Attribute("binding", Type.TEXT);
  
  List<Attribute> attrs = new ArrayList<Attribute>();
  attrs.add(isbn);
  attrs.add(author);
  attrs.add(binding);
  
  ICombinatoricsVector<Attribute> initialVector = Factory.createVector(attrs);
  
  List<Attribute> newAttrs = (List<Attribute>) initialVector;
  
  System.out.println(newAttrs);

}
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
static void simple_combinations() {

        System.out.println("===== Simple Combinations: =====");

        // Create the initial vector
        ICombinatoricsVector<String> initialVector = Factory
                .createVector(new String[]{"red", "black", "white", "green",
                        "blue"});

        // Create a simple combination generator to generate 3-combinations of
        // the initial vector
        Generator<String> gen = Factory.createSimpleCombinationGenerator(
                initialVector, 3);

        // Print all possible combinations
        for (ICombinatoricsVector<String> combination : gen) {
            System.out.println(combination);
        }

    }
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
static void multi_combinations() {

        System.out.println("===== Multi Combinations: =====");

        // Create the initial vector of (apple, orange)
        ICombinatoricsVector<String> initialVector = Factory
                .createVector(new String[]{"apple", "orange"});

        // Create a multi-combination generator to generate 3-combinations of
        // the initial vector
        Generator<String> gen = Factory.createMultiCombinationGenerator(
                initialVector, 3);

        // Print all possible combinations
        for (ICombinatoricsVector<String> combination : gen) {
            System.out.println(combination);
        }

    }
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
static void permutation_with_repetitions() {

        System.out.println("===== Permutation With Repetitions: =====");

        // Create the initial set/vector of 2 elements (apple, orange)
        ICombinatoricsVector<String> originalVector = Factory
                .createVector(new String[]{"apple", "orange"});

        // Create the generator by calling the appropriate method in the Factory
        // class
        Generator<String> gen = Factory
                .createPermutationWithRepetitionGenerator(originalVector, 3);

        // Print the result
        for (ICombinatoricsVector<String> perm : gen)
            System.out.println(perm);

    }
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
static void permutation_without_repetitions() {

        System.out.println("===== Permutations Without Repetitions: =====");

        // Create the initial set/vector of 3 elements (apple, orange, cherry)
        ICombinatoricsVector<String> originalVector = Factory
                .createVector(new String[]{"apple", "orange", "cherry"});

        // Create the permutation generator by calling the appropriate method in
        // the Factory class
        Generator<String> gen = Factory
                .createPermutationGenerator(originalVector);

        // Print the result
        for (ICombinatoricsVector<String> perm : gen)
            System.out.println(perm);

    }
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
static void complex_combination_example() {

        System.out.println("complexCombinationExample");
        System.out.println("===== Complex Combination Example: =====");

        // create a combinatorics vector (A, B, B, C)
        ICombinatoricsVector<String> vector = Factory
                .createVector(new String[]{"A", "B", "B", "C"});

        // Create a complex-combination generator
        Generator<ICombinatoricsVector<String>> gen = new ComplexCombinationGenerator<String>(
                vector, 2);

        // Iterate the combinations
        for (ICombinatoricsVector<ICombinatoricsVector<String>> comb : gen) {
            System.out.println(ComplexCombinationGenerator.convert2String(comb)
                    + " - " + comb);
        }
    }
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
static void simple_subsets() {

        System.out.println("===== All subsets: =====");

        // Create an initial vector/set
        ICombinatoricsVector<String> initialSet = Factory
                .createVector(new String[]{"one", "two", "three"});

        // Create an instance of the subset generator
        Generator<String> gen = Factory.createSubSetGenerator(initialSet);

        // Print the subsets
        for (ICombinatoricsVector<String> subSet : gen) {
            System.out.println(subSet);
        }
    }
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
static void duplicate_subsets() {

        System.out.println("===== All subsets with duplicates: =====");

        // Create an initial vector/set (a, b, a, c)
        ICombinatoricsVector<String> initialSet = Factory
                .createVector(new String[]{"a", "b", "a", "c"});

        // Create an instance of the subset generator
        Generator<String> gen = Factory
                .createSubSetGenerator(initialSet, false);

        // Print the subsets
        for (ICombinatoricsVector<String> subSet : gen) {
            System.out.println(subSet);
        }
    }
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
@Test
public void simpleFiveCompositionRange() {

	Generator<Integer> compositionGenerator = Factory
			.createCompositionGenerator(5);

	System.out.println("Number of compositions is: "
			+ compositionGenerator.getNumberOfGeneratedObjects());
	assertEquals(16, compositionGenerator.getNumberOfGeneratedObjects());

	List<ICombinatoricsVector<Integer>> list = compositionGenerator
			.generateObjectsRange(5, 7);

	assertEquals(3, list.size());

	assertEquals("CombinatoricsVector=([3, 2], size=2)", list.get(0)
			.toString());
	assertEquals("CombinatoricsVector=([1, 2, 2], size=3)", list.get(1)
			.toString());
	assertEquals("CombinatoricsVector=([2, 1, 2], size=3)", list.get(2)
			.toString());
}
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
/**
 * This example recreates the issue 14.
 * https://code.google.com/p/combinatoricslib/issues/detail?id=14
 *
 * It generates all permutations of a given length where repetition is NOT allowed,
 * from a larger set of elements.
 */
static void all_permutations_of_all_combination() {

    System.out.println("===== All permutations of all combination: =====");

    // Create the initial vector of 4 elements (apple, orange, cherry, raspberry)
    ICombinatoricsVector<String> originalVector = Factory.createVector(
            new String[] { "apple", "orange", "cherry", "raspberry" }
    );

    // Create the combination generator by calling the appropriate method in the Factory class
    Generator<String> combinations = Factory.createSimpleCombinationGenerator(originalVector, 3);

    // Print all permutations for all simple 3-combinations
    for (ICombinatoricsVector<String> comb : combinations){
        Generator<String> permutations = Factory.createPermutationGenerator(comb);
        for(ICombinatoricsVector<String> perm : permutations){
            System.out.println(perm);
        }
    }
}
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
@Test
public void simpleZeroComposition() {

	Generator<Integer> compositionGenerator = Factory
			.createCompositionGenerator(0);
	Iterator<ICombinatoricsVector<Integer>> compositionIterator = compositionGenerator
			.iterator();

	System.out.println("Number of compositions is: "
			+ compositionGenerator.getNumberOfGeneratedObjects());
	assertEquals(1, compositionGenerator.getNumberOfGeneratedObjects());

	while (compositionIterator.hasNext()) {
		compositionIterator.next();
		System.out.println(compositionIterator);
	}

	List<ICombinatoricsVector<Integer>> list = compositionGenerator
			.generateAllObjects();

	assertEquals(1, list.size());

	assertEquals("CombinatoricsVector=([0], size=1)", list.get(0)
			.toString());

}
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
/**
 * Constructor
 * 
 * @param generator
 *            Generator
 */
PermutationWithRepetitionIterator(
		PermutationWithRepetitionGenerator<T> generator) {
	_generator = generator;
	_n = generator.getOriginalVector().getSize();
	_k = generator.getPermutationLength();

	List<T> list = new ArrayList<T>(_k);
	T defaultValue = generator.getOriginalVector().getValue(0);
	for (int i = 0; i < _k; i++) {
		list.add(defaultValue);
	}

	_currentPermutation = Factory.createVector(list);

	_bitVector = new int[_k + 2];
	init();
}
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
/**
 * Moves to the next permutation
 * 
 * @see Iterator#next()
 */
@Override
public ICombinatoricsVector<T> next() {
	_currentIndex++;

	for (int j = _k - 1; j >= 0; j--) {
		int index = _bitVector[j];
		_currentPermutation.setValue(j, _generator.getOriginalVector()
				.getValue(index));
	}

	int i = 0;
	while (_bitVector[i] == _n - 1) {
		if (i < _k + 1)
			_bitVector[i] = 0;
		else {
			_bitVector[_k] = 1;
			return Factory.createVector(_currentPermutation);
		}
		i++;
	}

	_bitVector[i]++;
	return Factory.createVector(_currentPermutation);

}
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
/**
 * Returns the next subset if it is available
 * 
 * @see Iterator#next()
 */
@Override
public ICombinatoricsVector<T> next() {
	_currentIndex++;
	_currentSubSet.clearVector();
	for (int index = 1; index <= _length; index++) {
		if (_bitVector[index] == 1) {
			T value = _generator.getOriginalVector().getValue(index - 1);
			_currentSubSet.addValue(value);
		}
	}
	int i = 1;
	while (_bitVector[i] == 1) {
		_bitVector[i] = 0;
		i++;
	}
	_bitVector[i] = 1;

	return Factory.createVector(_currentSubSet);
}
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
/**
 * Constructor
 * 
 * @param originalVector
 *            Original vector/set which is used for combination generation
 * @param combinationsLength
 *            Length of combination to generate
 * @param isOrderImportant
 *            true if the order of the generated combinations is important
 * @param excludeEmptySet
 *            true if the empty set has to be excluded from the generated
 *            combinations
 */
public ComplexCombinationGenerator(ICombinatoricsVector<T> originalVector,
		int combinationsLength, boolean isOrderImportant,
		boolean excludeEmptySet) {

	if (excludeEmptySet && combinationsLength > originalVector.getSize())
		throw new RuntimeException(
				"Unable to generate complex combinations, the requested combination length is more then the size of the original vector, length: "
						+ combinationsLength
						+ ", originalVector: "
						+ originalVector);

	_originalVector = Factory.createVector(originalVector);
	_combinationLength = combinationsLength;
	_isOrderImportant = isOrderImportant;
	_excludeEmptySet = excludeEmptySet;
}
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
/**
 * Returns current composition
 */
private ICombinatoricsVector<Integer> getCurrentItem() {

	_currentComposition = Factory.<Integer> createVector();

	List<Integer> vector = _currentSubset.getVector();
	java.util.Iterator<Integer> itr = vector.iterator();

	int currentValueSubSet = 0;
	int indexCompositionElement = 0;
	int valueCompositionElement = 0;

	while (itr.hasNext()) {
		Integer currentSubsetElement = itr.next();
		valueCompositionElement = currentSubsetElement - currentValueSubSet;
		_currentComposition.setValue(indexCompositionElement,
				valueCompositionElement);
		indexCompositionElement++;
		currentValueSubSet = currentSubsetElement;
	}
	_currentComposition.setValue(indexCompositionElement,
			_generator._initialValue - currentValueSubSet);

	return _currentComposition;
}
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
@Test
public void simpleEmptyPermutation() {

	ArrayList<Integer> array = new ArrayList<Integer>();

	ICombinatoricsVector<Integer> corePermutation = Factory
			.createVector(array);
	Generator<Integer> generator = Factory
			.createPermutationGenerator(corePermutation);

	System.out.println("Number of permutations is: "
			+ generator.getNumberOfGeneratedObjects());
	assertEquals(0, generator.getNumberOfGeneratedObjects());

	Iterator<ICombinatoricsVector<Integer>> iterator = generator.iterator();

	while (iterator.hasNext()) {
		iterator.next();
		System.out.println(iterator);
	}

	List<ICombinatoricsVector<Integer>> list = generator
			.generateAllObjects();

	assertEquals(0, list.size());
}
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
@Test
public void allIdenticalPermutation() {

	ICombinatoricsVector<String> initialVector = Factory
			.createVector(new String[] { "a", "a", "a" });
	Generator<String> generator = Factory
			.createPermutationGenerator(initialVector);

	Iterator<ICombinatoricsVector<String>> iterator = generator.iterator();

	while (iterator.hasNext()) {
		iterator.next();
		System.out.println(iterator);
	}

	List<ICombinatoricsVector<String>> list = generator
			.generateAllObjects();

	assertEquals(1, list.size());

	assertEquals("CombinatoricsVector=([a, a, a], size=3)", list.get(0)
			.toString());
}
 

import org.paukov.combinatorics.Factory; //导入依赖的package包/类
@Test
public void simpleOnePartition() {

	Generator<Integer> partitionGenerator = Factory
			.createPartitionGenerator(1);
	Iterator<ICombinatoricsVector<Integer>> partitionIterator = partitionGenerator
			.iterator();

	System.out.println("Number of partition is: "
			+ partitionGenerator.getNumberOfGeneratedObjects());
	assertEquals(1, partitionGenerator.getNumberOfGeneratedObjects());

	while (partitionIterator.hasNext()) {
		partitionIterator.next();
		System.out.println(partitionIterator);
	}

	List<ICombinatoricsVector<Integer>> list = partitionGenerator
			.generateAllObjects();

	assertEquals(1, list.size());

	assertEquals("CombinatoricsVector=([1], size=1)", list.get(0)
			.toString());
}