|
RcdMathLib_doc
Open Source Library for Linear and Non-linear Algebra
|
Calculate possible
without repetition in ascending order.
More...
Go to the source code of this file.
Functions | |
| uint8_t | combinatorics_init (uint8_t n, uint8_t k, uint8_t comb_arr[]) |
| Initialize the combinations generator. More... | |
| uint8_t | combinatorics_get_next_without_rep (uint8_t n, uint8_t k, uint8_t comb_arr[]) |
| Generate the next combination. More... | |
Calculate possible
without repetition in ascending order.
Definition in file combinatorics.c.
| uint8_t combinatorics_get_next_without_rep | ( | uint8_t | n, |
| uint8_t | k, | ||
| uint8_t | comb_arr[] | ||
| ) |
Generate the next combination.
| [in] | n | size of the set. |
| [in] | k | size of the sub-set. |
| [in,out] | comb_arr[] | pointer to the combination set. |
return COMBI_END, if the last combination is generated. return COMBI_SUCCESS, if successful.
Definition at line 48 of file combinatorics.c.
References COMBI_END, and COMBI_SUCCESS.
Referenced by recog_mitigate_multipath().
| uint8_t combinatorics_init | ( | uint8_t | n, |
| uint8_t | k, | ||
| uint8_t | comb_arr[] | ||
| ) |
Initialize the combinations generator.
| [in] | n | size of the set. |
| [in] | k | size of the sub-set. |
| [out] | comb_arr[] | pointer to the combination set. |
return COMBI_ERROR, if k > n. return COMBI_EMPTY, if k =0. return COMBI_SUCCESS, if successful.
Definition at line 29 of file combinatorics.c.
References COMBI_EMPTY, COMBI_ERROR, and COMBI_SUCCESS.
Referenced by recog_mitigate_multipath().