#include <LibrarySet.h>
Public Methods | |
LibrarySet (void) | |
virtual | ~LibrarySet () |
void | initialize (void) |
void | addLibrary (Library *p_library) |
void | addLibrary (std::vector< Library * > &p_libraries) |
IndexType | getSetSize (void) const |
IndexType | getInitialSetSize (void) const |
void | goFirst (void) |
void | goNext (void) |
void | goPrevious (void) |
void | goTo (IndexType p_index) |
bool | isLast (void) const |
bool | isFirst (void) const |
bool | isEnd (void) const |
void | buildCompositeFragment (CompositeFragment &p_composite_fragment) |
std::vector< Library * > & | getLibraries (void) |
std::string | getCompositionString (void) |
std::string | getLibrarySetName (void) const |
void | setLibrarySetName (const std::string &p_name) |
double | getEffectiveness (void) |
|
Default constructor. |
|
Default destructor. |
|
Add a list of library at once to the object Library list. |
|
|
Build a CompositeFragment generated by the combination of Fragment objects associated to the current position of the internal iterator.
|
|
Return a text of the size of the libraries. Ex. 128 x 874 x 501 = 56047872 |
|
Return the effectiveness defined as: 1/number_of_libraries * SUM[over all Library 'i'] ( number_of_remaining_reagent_in_Library(i) / number_of_initial_reagent_in_Library(i) ) |
|
Return the number of combinations that can be formed with the libraries before any pruning occured. |
|
Return the Library list used to generate the combinatorial products. |
|
Getter of the LibrarySet name. |
|
Return the number of combinations that can be formed with the actual libraries. |
|
Position the internal iterator to the first element of the combinatorial product list. |
|
Advance the internal iterator to the next element of the combinatorial product list. |
|
Go back one position in the combinatorial product list. |
|
Move to a specific combinatorial product.
|
|
Empty the Library list. |
|
Return 'true' if the current position of the internal iterator is passed the last element of the combinatorial product list. Return 'false' otherwise. |
|
Return 'true' if the current position of the internal iterator is on the first element of the combinatorial product list. Return 'false' otherwise. |
|
Return 'true' if the current position of the internal iterator is on the last element of the combinatorial product list. Return 'false' otherwise. |
|
Setter of the LibrarySet name. |