#include <DummyFile.h>
Inheritance diagram for DummyFile:
Public Member Functions | |
DummyFile (UWORD16 s, std::vector< std::vector< bool > > *svam) | |
std::list< CvrStgFile::Property > | getProperties (void) const |
unsigned long | getNumSamples (void) const |
void | replaceSample (const SamplePos pos, const SampleValue *s) |
SampleValue * | getSampleValue (const SamplePos pos) const |
std::vector< std::vector< bool > > * | getSampleValueAdjacencyMatrix () const |
Static Public Member Functions | |
void | createGraph (std::vector< std::list< UWORD16 > > &adjlist, BitString **bs, CvrStgFile **f, Selector **s) |
Private Attributes | |
std::vector< UWORD16 > | Samples |
std::vector< std::vector< bool > > * | SampleValueAdjacencyMatrix |
Static Private Attributes | |
const unsigned short | SamplesPerVertex = 2 |
const EmbValue | EmbValueModulus = 2 |
|
construct a DummyFile object containing the sample values 0,1,...,s-1
|
|
create a BitString, a DummyFile and a Selector that together will produce a graph like described by the adjacency list
The constructed graph has the following form: SamplesPerVertex == 2, EmbValueModulus = 2 every vertex has a sample value with bit == 0 at index 0 and one with bit == 1 at index 1, if two vertices are adjacent, one end of the edge is at index 0 of the vertex with the lower vertex label and the other end of the edge is at index 1 of the vertex with the higher vertex label. The distance between vertex with label i and vertex with label j is : 2*|j - i| + 1 |
|
get the number of samples in this CvrStgObject Implements CvrStgObject. |
|
Implements CvrStgFile. |
|
get the sample at position pos
Implements CvrStgObject. |
|
|
|
replace a sample thus (possibly) altering the value of the bit returned by SampleValue->getBit()
Implements CvrStgObject. |
|
Reimplemented from CvrStgFile. |
|
|
|
Reimplemented from CvrStgFile. |
|
|