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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
struct bin_tree {
size_t index;
unsigned long long value;
struct bin_tree *right;
struct bin_tree *left;
};
typedef struct bin_tree node;
void insert(node ** tree, size_t index) {
node *temp = NULL;
if(!(*tree)) {
temp = (node *)malloc(sizeof(node));
temp->left = temp->right = NULL;
temp->index = index;
temp->value = 1;
*tree = temp;
return;
}
if(index < (*tree)->index)
insert(&(*tree)->left, index);
else if(index > (*tree)->index)
insert(&(*tree)->right, index);
}
void deltree(node * tree) {
if (tree) {
deltree(tree->left);
deltree(tree->right);
free(tree);
}
}
node* search(node ** tree, size_t index) {
if(!(*tree))
return NULL;
if(index < (*tree)->index)
search(&((*tree)->left), index);
else if(index > (*tree)->index)
search(&((*tree)->right), index);
else if(index == (*tree)->index)
return *tree;
}
unsigned long long *lookup(node **tree, size_t index) {
node *ret = search(tree, index);
if(ret)
return ret->value;
else
return 0;
}
void print_sparse(node *tree, bool label, bool nonzero, unsigned int kmer) {
if (tree) {
print_sparse(tree->left, label, nonzero, kmer);
if(label && nonzero) {
char *kmer_str = index_to_kmer(tree->index, kmer);
if (tree->value != 0)
fprintf(stdout, "%s\t%llu\n", kmer_str, tree->value);
free(kmer_str);
}
else if(label) {
char *kmer_str = index_to_kmer(tree->index, kmer);
fprintf(stdout, "%s\t%llu\n", kmer_str, tree->value);
free(kmer_str);
}
else if(nonzero) {
if (tree->value != 0)
fprintf(stdout, "%zu\t%llu\n", tree->index, tree->value);
}
else
fprintf(stdout, "%llu\n", tree->value);
print_sparse(tree->right, label, nonzero, kmer);
}
}
|
