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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
/*
* Copyright (C) 2015 Tobias Brunner
* Hochschule fuer Technik Rapperswil
*
* 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. See <http://www.fsf.org/copyleft/gpl.txt>.
*
* 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.
*/
#include "hash_algorithm_set.h"
#include <collections/array.h>
typedef struct private_hash_algorithm_set_t private_hash_algorithm_set_t;
struct private_hash_algorithm_set_t {
/**
* Public interface
*/
hash_algorithm_set_t public;
/**
* Algorithms contained in the set
*/
array_t *algorithms;
};
/**
* Sort hash algorithms
*/
static int hash_sort(const void *a, const void *b, void *user)
{
const hash_algorithm_t *ha = a, *hb = b;
return *ha - *hb;
}
/**
* Find a hash algorithm
*/
static int hash_find(const void *a, const void *b)
{
return hash_sort(a, b, NULL);
}
METHOD(hash_algorithm_set_t, contains, bool,
private_hash_algorithm_set_t *this, hash_algorithm_t hash)
{
return array_bsearch(this->algorithms, &hash, hash_find, NULL) != -1;
}
METHOD(hash_algorithm_set_t, add, void,
private_hash_algorithm_set_t *this, hash_algorithm_t hash)
{
if (!contains(this, hash))
{
array_insert(this->algorithms, ARRAY_TAIL, &hash);
array_sort(this->algorithms, hash_sort, NULL);
}
}
METHOD(hash_algorithm_set_t, count, int,
private_hash_algorithm_set_t *this)
{
return array_count(this->algorithms);
}
static bool hash_filter(void *data, void **in, hash_algorithm_t *out)
{
*out = **(hash_algorithm_t**)in;
return TRUE;
}
METHOD(hash_algorithm_set_t, create_enumerator, enumerator_t*,
private_hash_algorithm_set_t *this)
{
return enumerator_create_filter(array_create_enumerator(this->algorithms),
(void*)hash_filter, NULL, NULL);
}
METHOD(hash_algorithm_set_t, destroy, void,
private_hash_algorithm_set_t *this)
{
array_destroy(this->algorithms);
free(this);
}
/**
* Described in header
*/
hash_algorithm_set_t *hash_algorithm_set_create()
{
private_hash_algorithm_set_t *this;
INIT(this,
.public = {
.add = _add,
.contains = _contains,
.count = _count,
.create_enumerator = _create_enumerator,
.destroy = _destroy,
},
.algorithms = array_create(sizeof(hash_algorithm_t), 0),
);
return &this->public;
}
|
