Memory-efficient Cartesian products, combinations and permutation on collections.

This module offers memory-efficient views on combinatoric collections. Methods of the views create objects only when needed. Moreover, produced objects during iterations are free to be collected and their memory reused.

This enable these views and method to works with very combinatoric large collections.

When small combinatoric views need to be kept in memory (for fast access by example). The Collection::to_a method and other related factories can be used to transform the combinatoric views into extensive collections,

All subgroups and modules

module combinations

combinations :: combinations

Memory-efficient Cartesian products, combinations and permutation on collections.
package_diagram combinations\> combinations core core combinations\>->core crapto crapto crapto->combinations\>

Ancestors

group codecs

core > codecs

Group module for all codec-related manipulations
group collection

core > collection

This module define several collection classes.
group text

core > text

All the classes and methods related to the manipulation of text entities

Parents

group core

core

Nit common library of core classes and methods

Children

group crapto

crapto

Cryptographic attacks and utilities.

Descendants