#include <GlareAlgorithm.h>
Inheritance diagram for GlareAlgorithm:
Public Methods | |
virtual | ~GlareAlgorithm () |
virtual bool | isOptimized (void)=0 |
virtual void | evaluateGoodness (void)=0 |
virtual void | pruneDimensions (void)=0 |
virtual std::ostream & | getTrace (std::ostream &p_ostream)=0 |
virtual void | reset (void) |
void | usePartition (bool p_is_using_partition=true) |
bool | isUsingPartition (void) const |
void | setNumberPartition (int p_number) |
void | setLibrarySets (std::vector< LibrarySet * > p_library_sets) |
void | addLibrarySet (LibrarySet *p_library_set) |
void | setLibraries (std::vector< Library * > p_libraries) |
void | addLibrary (Library *p_library) |
|
Default destructor |
|
|
Add a single LibrarySet to the internal list. |
|
Score the Fragment forming the combinatorial product(s) (LibrarySet). Implemented in GlareAlgorithmGoodHit. |
|
Prints to the stream the current status of the optimization. Implemented in GlareAlgorithmGoodHit. |
|
Returns true when the criteria for optimization are met. Implemented in GlareAlgorithmGoodHit. |
|
Return 'true' if partitioning scheme is used, returns false otherwise. |
|
Eliminates the undesired Fragments from lists. Implemented in GlareAlgorithmGoodHit. |
|
Reinitialize this class for a new optimization process. |
|
Associates the Library objects to use. This has the effect of loosing any Library objects already in internal list. |
|
Associates the LibrarySet(s) to use. Each LibrarySet corresponds to a combinatorial set. This has the effect of loosing the LibrarySet already present in the list. |
|
Set the minimum number of Fragment to use in a Library partition. |
|
Specify that partitioning scheme is to be used. |