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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
/* Boolector: Satisfiability Modulo Theories (SMT) solver.
*
* Copyright (C) 2007-2021 by the authors listed in the AUTHORS file.
*
* This file is part of Boolector.
* See COPYING for more information on using this software.
*/
#include "test.h"
extern "C" {
#include "utils/btorhashptr.h"
}
#include <stdlib.h>
class TestHash : public TestMm
{
};
TEST_F (TestHash, new_delete)
{
size_t allocated = d_mm->allocated;
BtorPtrHashTable *ht = btor_hashptr_table_new (d_mm, 0, 0);
btor_hashptr_table_delete (ht);
ASSERT_EQ (allocated, d_mm->allocated);
}
TEST_F (TestHash, str2i)
{
BtorPtrHashTable *ht = btor_hashptr_table_new (d_mm, 0, 0);
btor_hashptr_table_add (ht, (void *) "one")->data.as_int = 1;
ASSERT_NE (btor_hashptr_table_get (ht, (void *) "one"), nullptr);
ASSERT_EQ (btor_hashptr_table_get (ht, (void *) "one")->data.as_int, 1);
btor_hashptr_table_add (ht, (void *) "two")->data.as_int = 2;
ASSERT_NE (btor_hashptr_table_get (ht, (void *) "two"), nullptr);
ASSERT_EQ (btor_hashptr_table_get (ht, (void *) "two")->data.as_int, 2);
btor_hashptr_table_add (ht, (void *) "three")->data.as_int = 3;
ASSERT_NE (btor_hashptr_table_get (ht, (void *) "three"), nullptr);
ASSERT_EQ (btor_hashptr_table_get (ht, (void *) "three")->data.as_int, 3);
btor_hashptr_table_delete (ht);
}
TEST_F (TestHash, traverse_str2i)
{
open_log_file ("traverse_hash_str2i");
BtorPtrHashTable *ht;
BtorPtrHashBucket *p;
char buffer[20];
int32_t i;
ht = btor_hashptr_table_new (d_mm, btor_hash_str, btor_compare_str);
for (i = 0; i < 40; i++)
{
sprintf (buffer, "%d", i);
p = btor_hashptr_table_add (ht, buffer);
p->data.as_int = i;
p->key = btor_mem_strdup (d_mm, buffer);
}
for (i = 0; i < 40; i++)
{
sprintf (buffer, "%d", i);
ASSERT_NE (btor_hashptr_table_get (ht, buffer), nullptr);
ASSERT_EQ (btor_hashptr_table_get (ht, buffer)->data.as_int, i);
}
for (p = ht->first; p; p = p->next)
{
fprintf (d_log_file, "%s %d\n", (char *) p->key, p->data.as_int);
btor_mem_freestr (d_mm, (char *) p->key);
}
btor_hashptr_table_delete (ht);
}
TEST_F (TestHash, str2str)
{
open_log_file ("hash_str2str");
BtorPtrHashTable *ht;
BtorPtrHashBucket *p;
BtorHashTableData data;
char buffer[20];
void *key;
int32_t i;
ht = btor_hashptr_table_new (d_mm, btor_hash_str, btor_compare_str);
for (i = 0; i < 10; i++)
{
sprintf (buffer, "%d", i);
p = btor_hashptr_table_add (ht, buffer);
p->key = btor_mem_strdup (d_mm, buffer);
sprintf (buffer, "%d", 10 - i);
p->data.as_str = btor_mem_strdup (d_mm, buffer);
}
for (i = 0; i < 10; i++)
{
sprintf (buffer, "%d", i);
p = btor_hashptr_table_get (ht, buffer);
ASSERT_NE (p, nullptr);
ASSERT_EQ (i, atoi ((char *) p->key));
ASSERT_EQ (10 - i, atoi (p->data.as_str));
}
for (i = 0; i < 10; i += 2)
{
sprintf (buffer, "%d", i);
btor_hashptr_table_remove (ht, buffer, &key, &data);
btor_mem_freestr (d_mm, data.as_str);
btor_mem_freestr (d_mm, (char *) key);
}
for (p = ht->first; p; p = p->next)
{
fprintf (d_log_file, "%s -> %s\n", (char *) p->key, p->data.as_str);
btor_mem_freestr (d_mm, (char *) p->key);
btor_mem_freestr (d_mm, p->data.as_str);
}
btor_hashptr_table_delete (ht);
}
|
