-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathsortedtable.h
63 lines (50 loc) · 1.73 KB
/
sortedtable.h
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
/* cproxy - Copyright (C) 2012 Aaron Riekenberg ([email protected]).
cproxy 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 3 of the License, or
(at your option) any later version.
cproxy 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 cproxy. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef SORTED_TABLE_H
#define SORTED_TABLE_H
#include <stdbool.h>
struct SortedTable
{
void* pRBTable;
};
extern void initializeSortedTable(
struct SortedTable* sortedTable);
/* Add (key, data) to sorted table.
* Calls abort() if key is already in table. */
extern void addToSortedTable(
struct SortedTable* sortedTable,
int key,
void* data);
/* Add (key, data) to sorted table.
* Replaces old (key, data) if present in table.
* Returns old data if replaced, otherwise NULL. */
extern void* replaceDataInSortedTable(
struct SortedTable* sortedTable,
int key,
void* data);
/* Return non-zero if found.
* Return 0 if not found. */
extern bool sortedTableContainsKey(
const struct SortedTable* sortedTable,
int key);
/* Return data if found.
* Return NULL if not found. */
extern void* findDataInSortedTable(
const struct SortedTable* sortedTable,
int key);
/* Remove (key, data) and return data if found.
* Return NULL if not found. */
extern void* removeFromSortedTable(
struct SortedTable* sortedTable,
int key);
#endif