1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45
|
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <sys/time.h>
#include <string.h>
#include <inttypes.h>
#include <cmath> // for log2f
#include <algorithm> // for max
#include <unistd.h> // for truncate
#ifndef DEBLOOM_H
#define DEBLOOM_H
#include "Bank.h"
#include "Bloom.h"
#include "Kmer.h"
#include "Hash16.h"
#include "Utils.h"
#include "Traversal.h"
#define DEBUGE(a) //printf a
using namespace std;
extern uint64_t b1_size ;
extern uint64_t nbkmers_solid ;
typedef ListSet FPSet; // list-based
//typedef HashSet FPSet; // hash-based
// GUS: see comment in Debloom.cpp, where false_positive is been declared
extern Set *false_positives;
int debloom(int order, int max_memory);
void end_debloom_partition(bool last_partition);
Set *dummy_false_positives();
Set *load_false_positives();
Set *load_false_positives_cascading4();
void print_size_summary(FPSet *fp);
void print_size_summary(FPSetCascading4 *fp);
#endif
|