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
|
/*
* Copyright © 2009,2013 Intel Corporation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice (including the next
* paragraph) shall be included in all copies or substantial portions of the
* Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*
* Authors:
* Eric Anholt <eric@anholt.net>
* Carl Worth <cworth@cworth.org>
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include "int-set.h"
int
main(int argc, char **argv)
{
struct int_set *set;
/* Use two values with the lowest bits in common so they will
* hash to the same initial entry, so we can test the deletion
* behavior for chained objects. */
uint32_t value1 = 0x00000123;
uint32_t value2 = 0x10000123;
uint32_t value3 = 0x20000123;
struct int_set_entry *entry;
set = int_set_create();
int_set_add(set, value1);
int_set_add(set, value2);
int_set_add(set, value3);
assert(int_set_contains(set, value3));
entry = int_set_search(set, value3);
assert(entry->value == value3);
assert(int_set_contains(set, value2));
entry = int_set_search(set, value2);
assert(entry->value == value2);
assert(int_set_contains(set, value1));
entry = int_set_search(set, value1);
assert(entry->value == value1);
int_set_remove_entry(set, entry);
int_set_remove(set, value2);
assert(!int_set_contains(set, value1));
entry = int_set_search(set, value1);
assert(entry == NULL);
assert(!int_set_contains(set, value2));
entry = int_set_search(set, value2);
assert(entry == NULL);
assert(int_set_contains(set, value3));
entry = int_set_search(set, value3);
assert(entry->value == value3);
int_set_destroy(set);
return 0;
}
|
