![]() |
ScalES-PPM
|
simple functions and transformations from combinatorics More...
Data Types | |
interface | ppm_combinatorics::permute |
randomly permute a given array More... | |
interface | ppm_combinatorics::selection |
produce random selection More... | |
interface | ppm_combinatorics::combination |
produce random selection and its complement More... | |
interface | ppm_combinatorics::is_permutation |
establish whether an array is a permutation of another array or a range More... | |
interface | ppm_combinatorics::prime_factorization |
compute list of prime factors (sorted, but duplicates included) More... | |
Modules | |
module | ppm_combinatorics |
gathers some base routines for combinatorial problems | |
Functions/Subroutines | |
subroutine | ppm_combinatorics::permute_randomly_i4 (a) |
randomly permute a given array More... | |
subroutine | ppm_combinatorics::permute_randomly_i8 (a) |
randomly permute a given array More... | |
pure logical function | ppm_combinatorics::is_permutation_of_range_i4 (a, r) |
establish whether one array of integers is a permutation of a range More... | |
pure logical function | ppm_combinatorics::is_permutation_of_array_i4 (a, b) |
establish whether one array of integers is a permutation of another More... | |
subroutine | ppm_combinatorics::random_selection_i4 (selected, range) |
produce random selection from range More... | |
subroutine | ppm_combinatorics::random_combination_i4 (selected, not_selected, range) |
produce random selection and its complement from range More... | |
pure subroutine | ppm_combinatorics::prime_factorization_i4 (n, factors) |
compute list of prime factors (sorted, but duplicates included) More... | |
Variables | |
character(len= *), parameter | ppm_combinatorics::filename = 'ppm_combinatorics.f90' |
simple functions and transformations from combinatorics
Das diesem Bericht zugrundeliegende Vorhaben wurde mit Mitteln des Bundesministeriums für Bildung, und Forschung unter dem Förderkennzeichen 01IH08004E gefördert. Die Verantwortung für den Inhalt dieser Veröffentlichung liegt beim Autor.