jme

Class JMEMath.Secuencias

java.lang.Object

jme.JMEMath.Secuencias

Enclosing class:

JMEMath

public static class JMEMath.Secuencias
extends java.lang.Object

SECUENCIAS

Constructor Summary

Constructors

Constructor and Description
Secuencias()

Method Summary

Modifier and Type	Method and Description
static <T> java.util.List<java.util.List<T>>	getPermutations(java.util.List<T> items, int length) Get all permutations with a specified length
static <T> java.util.List<java.util.List<T>>	getSequences(java.util.List<T> items, int length) Get all sequences with a specific length Sample: * length:2,[1,2] -> [[1,1],[1,2],[2,1],[2,2]] * length:3,[1] -> [[1,1,1]] * length:1,[1,2] -> [[1],[2]] The number of sequences is equal to variations with repetition of m elements taken by n (m^n)
static <T> java.util.List<java.util.List<T>>	getSequencesNoDuplicates(java.util.List<T> items, int length) Same as getSequences, but 'items' can have duplicates, although duplicate sequences will be erased.
static <T> java.util.List<java.util.List<T>>	getSortedSequences(java.util.List<T> items, int length) getSortedSequences with default comparator (natural ordering)
static <T> java.util.List<java.util.List<T>>	getSortedSequences(java.util.List<T> items, int length, java.util.Comparator<T> comp) Get all ordered sequences with a specified length.
static <T> java.util.HashSet<java.util.List<T>>	getSubsets(java.util.List<T> items) Generate all subsets in a list with non-duplicates elements, or all non-duplicate sequences with a list of duplicate elements.
static <T> java.util.List<java.util.List<T>>	getSubsetsWithDuplicates(java.util.List<T> items) Obtiene todos los subconjuntos incluyendo elementos y conjuntos duplicados

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Secuencias

public Secuencias()

Method Detail

getSubsetsWithDuplicates

public static <T> java.util.List<java.util.List<T>> getSubsetsWithDuplicates(java.util.List<T> items)
                                                                      throws JMEInterruptedException,
                                                                             java.lang.OutOfMemoryError

Obtiene todos los subconjuntos incluyendo elementos y conjuntos duplicados

Parameters:

items - conjunto de elementos

Returns:

subconjuntos como lista de listas de elementos

Throws:

JMEInterruptedException - si el hilo se interrumpe

java.lang.OutOfMemoryError - java heap space

getSubsets

public static <T> java.util.HashSet<java.util.List<T>> getSubsets(java.util.List<T> items)
                                                           throws JMEInterruptedException

Generate all subsets in a list with non-duplicates elements, or all non-duplicate sequences with a list of duplicate elements. The order of the subsets or sequences is unknow. Example: [1,2] -> [[1,2],[],[1],[2]], [1,1] -> [[],[1],[1,1]]

Type Parameters:

T - elementos del conjunto

Parameters:

items - a list with the items to generate subsets

Returns:

a set with the subsets as lists

Throws:

JMEInterruptedException - si el hilo se interrumpe

getPermutations

public static <T> java.util.List<java.util.List<T>> getPermutations(java.util.List<T> items,
                                                                    int length)
                                                             throws JMEInterruptedException

Get all permutations with a specified length

Parameters:

items - a list with items to permutate

length - size of the permutations

Returns:

a list with all permutations with size 'length'

Throws:

JMEInterruptedException - si el hilo se interrumpe

getSortedSequences

public static <T> java.util.List<java.util.List<T>> getSortedSequences(java.util.List<T> items,
                                                                       int length,
                                                                       java.util.Comparator<T> comp)
                                                                throws JMEInterruptedException

Get all ordered sequences with a specified length. The order of the sequences is unknow. Sample: length: 2, [1,2] -> [[1,1],[2,2],[1,2]]

Parameters:

items - a list with the items to create sequences

length - size of the sequences

comp - comparator for items (null for natural ordering)

Returns:

a list with all ordered sequences with size 'length'

Throws:

JMEInterruptedException - si el hilo se interrumpe

getSequencesNoDuplicates

public static <T> java.util.List<java.util.List<T>> getSequencesNoDuplicates(java.util.List<T> items,
                                                                             int length)
                                                                      throws JMEInterruptedException

Same as getSequences, but 'items' can have duplicates, although duplicate sequences will be erased. The order of the sequences is unknow Sample: length:2, [1,2,1] -> [[2,1],[1,1],[2,2],[1,2]]

Throws:

JMEInterruptedException

getSortedSequences

public static <T> java.util.List<java.util.List<T>> getSortedSequences(java.util.List<T> items,
                                                                       int length)

getSortedSequences with default comparator (natural ordering)

getSequences

public static <T> java.util.List<java.util.List<T>> getSequences(java.util.List<T> items,
                                                                 int length)
                                                          throws JMEInterruptedException

Get all sequences with a specific length
Sample:
* length:2,[1,2] -> [[1,1],[1,2],[2,1],[2,2]]
* length:3,[1] -> [[1,1,1]]
* length:1,[1,2] -> [[1],[2]]
The number of sequences is equal to variations with repetition of m elements taken by n (m^n)

Parameters:

items - a list with the items in the sequence with no duplicates

length - size of the sequences

Returns:

a list with all sequences (as lists) of size 'length'

Throws:

JMEInterruptedException - si el hilo se interrumpe