Next: Sorting, Previous: Combinations, Up: Top [Index]
This chapter describes functions for creating and manipulating multisets. A multiset c is represented by an array of k integers in the range 0 to n-1, where each value c_i may occur more than once. The multiset c corresponds to indices of k elements chosen from an n element vector with replacement. In mathematical terms, n is the cardinality of the multiset while k is the maximum multiplicity of any value. Multisets are useful, for example, when iterating over the indices of a k-th order symmetric tensor in n-space.
The functions described in this chapter are defined in the header file gsl_multiset.h.
| • The Multiset struct: | ||
| • Multiset allocation: | ||
| • Accessing multiset elements: | ||
| • Multiset properties: | ||
| • Multiset functions: | ||
| • Reading and writing multisets: | ||
| • Multiset Examples: |