summaryrefslogtreecommitdiff
path: root/tests/int-set/delete_management.c
blob: 93f7cf86b8a497df12b6f4961e60067613467f1e (plain)
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
/*
 * Copyright © 2009 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>
 */

#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;
	struct int_set_entry *entry;
	int size = 10000;
	uint32_t keys[size];
	uint32_t i;

	set = int_set_create();

	for (i = 0; i < size; i++) {
		int_set_add(set, i);

		if (i >= 100) {
			int_set_remove(set, i - 100);
		}
	}

	/* Make sure that all our entries were present at the end. */
	for (i = size - 100; i < size; i++) {
		assert(int_set_contains(set, i));
		entry = int_set_search(set, i);
		assert(entry);
		assert(entry->value == i);
	}

	/* Make sure that no extra entries got in */
	for (entry = int_set_next_entry(set, NULL);
	     entry != NULL;
	     entry = int_set_next_entry(set, entry)) {
		assert(entry->value >= size - 100 &&
		       entry->value < size);
	}
	assert(set->entries == 100);

	int_set_destroy(set);

	return 0;
}