crn::Combinatorics Namespace Reference

Combinatorics toolbox. More...

Functions
int	CountCombinations (int n, int p) noexcept
	More...
int	CountArrangements (int n, int p) noexcept
	More...
template<class ITER , class CMP >
std::vector< typename std::iterator_traits< ITER > ::value_type >	Minimals (ITER i_begin, ITER i_end, CMP comp=std::less< typename std::iterator_traits< ITER >::value_type >())

Detailed Description

Combinatorics toolbox.

Tools for combinatorics

Author

Jean DUONG

Date

March 2008

Version

0.1

Function Documentation

int crn::Combinatorics::CountArrangements ( int  n, int  p  )

noexcept

Counts arrangements of p objects from n:

Parameters

[in]	n	total number of objects
[in]	p	number of objects to choose

Returns

number arrangements of p objects from n

Definition at line 55 of file CRNCombinatorics.cpp.

int crn::Combinatorics::CountCombinations ( int  n, int  p  )

noexcept

Counts combinations of p objects from n:

Parameters

[in]	n	total number of objects
[in]	p	number of objects to choose

Returns

number of combinations of p objects from n

Definition at line 33 of file CRNCombinatorics.cpp.

template<class ITER , class CMP >

std::vector<typename std::iterator_traits<ITER>::value_type> crn::Combinatorics::Minimals	(	ITER	i_begin,
		ITER	i_end,
		CMP	comp = std::less<typename std::iterator_traits<ITER>::value_type>()
	)

Get minimal elements of a collection given an order relation

Definition at line 48 of file CRNCombinatorics.h.