|
Tree Compression with Top Trees Revisited
|
#include <iostream>#include <string>#include "Edges.h"#include "Nodes.h"#include "OrderedTree.h"#include "RePair/Coder.h"#include "RePair/Prepair.h"#include "RePair/RePair.h"#include "ArgParser.h"#include "BPString.h"#include "Timer.h"#include "XML.h"
Go to the source code of this file.
Functions | |
| template<typename InType , typename DataType > | |
| long long | compress (vector< InType > &data, const std::string &description, const bool skipPrepair=false, const bool verbose=false) |
| int | main (int argc, char **argv) |
| long long compress | ( | vector< InType > & | data, |
| const std::string & | description, | ||
| const bool | skipPrepair = false, |
||
| const bool | verbose = false |
||
| ) |
Definition at line 26 of file repair.cpp.
| int main | ( | int | argc, |
| char ** | argv | ||
| ) |
Definition at line 65 of file repair.cpp.
1.8.9.1