blob: 03ac04ddbe21c4bc510b4452d396eb9779b869e2 (
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
74
75
76
77
78
79
80
81
82
83
84
85
|
/* list.h
*
* Simple struct with functions to create a list which associates ids with data
* -Allows for finding ids associated with data such as IPs or public keys in a short time
* -Should only be used if there are relatively few add/remove calls to the list
*
* Copyright (C) 2014 Tox project All Rights Reserved.
*
* This file is part of Tox.
*
* Tox 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.
*
* Tox 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 Tox. If not, see <http://www.gnu.org/licenses/>.
*
*/
#ifndef LIST_H
#define LIST_H
#include <stdlib.h>
#include <stdint.h>
#include <string.h>
typedef struct {
uint32_t n; //number of elements
uint32_t capacity; //number of elements memory is allocated for
uint32_t element_size; //size of the elements
void *data; //array of elements
int *ids; //array of element ids
} BS_LIST;
/* Initialize a list, element_size is the size of the elements in the list and
* initial_capacity is the number of elements the memory will be initially allocated for
*
* return value:
* 1 : success
* 0 : failure
*/
int bs_list_init(BS_LIST *list, uint32_t element_size, uint32_t initial_capacity);
/* Free a list initiated with list_init */
void bs_list_free(BS_LIST *list);
/* Retrieve the id of an element in the list
*
* return value:
* >= 0 : id associated with data
* -1 : failure
*/
int bs_list_find(const BS_LIST *list, const void *data);
/* Add an element with associated id to the list
*
* return value:
* 1 : success
* 0 : failure (data already in list)
*/
int bs_list_add(BS_LIST *list, const void *data, int id);
/* Remove element from the list
*
* return value:
* 1 : success
* 0 : failure (element not found or id does not match)
*/
int bs_list_remove(BS_LIST *list, const void *data, int id);
/* Removes the memory overhead
*
* return value:
* 1 : success
* 0 : failure
*/
int bs_list_trim(BS_LIST *list);
#endif
|
