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
|
/*
BOOSTER: BOOtstrap Support by TransfER:
BOOSTER is an alternative method to compute bootstrap branch supports
in large trees. It uses transfer distance between bipartitions, instead
of perfect match.
Copyright (C) 2017 Frederic Lemoine, Jean-Baka Domelevo Entfellner, Olivier Gascuel
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifndef _BITSET_INDEX_H_
#define _BITSET_INDEX_H_
#include "hashtables_bfields.h"
typedef struct bitset_keyvalue{
id_hash_table_t* key;
int value;
} bitset_keyvalue;
typedef struct bitset_bucket{
int size;
int capacity;
struct bitset_keyvalue **values;
} bitset_bucket;
typedef struct bitset_hashmap{
struct bitset_bucket **map_array;
int capacity;
float loadfactor;
int total;
} bitset_hashmap;
// Allocates a new bitset hasmap
bitset_hashmap* new_bitset_hashmap(int size, float loadfactor);
// Free the whole bitset hashmap
void free_bitset_hashmap(bitset_hashmap *hm);
// Free a map_array
void bitset_hash_map_free_map_array(bitset_bucket **map_array, int total);
// Free a set of bitset_keyvalue
void bitset_hash_map_free_buckets(bitset_keyvalue ** values, int total);
// returns the index in the hash map, given a hashcode
int bitset_hashmap_indexfor(int hashcode, int capacity);
// Returns the count for the given Edge
// If the edge is not present, returns -1
// If the edge is present, returns the value
int bitset_hashmap_value(bitset_hashmap *hm, id_hash_table_t *bitset, int nb_taxa);
// Inserts a value in the hashmap
void bitset_hashmap_putvalue(bitset_hashmap *hm, id_hash_table_t *bitset, int nb_taxa, int value);
// Computes a hash code for the bitset associated with an edge
int bitset_hashcode(id_hash_table_t *hashtable, int nb_taxa);
// HashCode for an edge bitset.
// Used for insertion in an EdgeMap
int bitset_hashEquals(id_hash_table_t *tbl1, id_hash_table_t *tbl2, int nb_taxa);
// Reconstructs the HashMap if the capacity is almost attained (loadfactor)
void bitset_hashmap_rehash(bitset_hashmap *hm, int nb_taxa);
#endif
|
