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
|
/* arrayu64.h - an expanding array of 64 bit unsigned integers
*
* Copyright (c) 1994-2011 Carnegie Mellon University. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. The name "Carnegie Mellon University" must not be used to
* endorse or promote products derived from this software without
* prior written permission. For permission or any legal
* details, please contact
* Carnegie Mellon University
* Center for Technology Transfer and Enterprise Creation
* 4615 Forbes Avenue
* Suite 302
* Pittsburgh, PA 15213
* (412) 268-7393, fax: (412) 268-7395
* innovation@andrew.cmu.edu
*
* 4. Redistributions of any form whatsoever must retain the following
* acknowledgment:
* "This product includes software developed by Computing Services
* at Carnegie Mellon University (http://www.cmu.edu/computing/)."
*
* CARNEGIE MELLON UNIVERSITY DISCLAIMS ALL WARRANTIES WITH REGARD TO
* THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS, IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY BE LIABLE
* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN
* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
* OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
* Author: Greg Banks
* Start Date: 2011/01/11
*/
#ifndef __CYRUS_ARRAYU64_H__
#define __CYRUS_ARRAYU64_H__
#include <sys/types.h>
#include <stdint.h>
typedef struct
{
size_t count;
size_t alloc;
uint64_t *data;
} arrayu64_t;
#define ARRAYU64_INITIALIZER { 0, 0, NULL }
#define arrayu64_init(sa) (memset((sa), 0, sizeof(arrayu64_t)))
void arrayu64_fini(arrayu64_t *);
arrayu64_t *arrayu64_new(void);
void arrayu64_free(arrayu64_t *);
int arrayu64_append(arrayu64_t *, uint64_t);
int arrayu64_add(arrayu64_t *, uint64_t);
void arrayu64_set(arrayu64_t *, int idx, uint64_t);
void arrayu64_insert(arrayu64_t *, int idx, uint64_t);
uint64_t arrayu64_remove(arrayu64_t *, int idx);
/* returns number removed */
int arrayu64_remove_all(arrayu64_t *, uint64_t);
uint64_t arrayu64_nth(const arrayu64_t *, int idx);
void arrayu64_truncate(arrayu64_t *, size_t newlen);
arrayu64_t *arrayu64_dup(const arrayu64_t *);
uint64_t arrayu64_max(const arrayu64_t *);
#define arrayu64_shift(sa) arrayu64_remove((sa), 0)
#define arrayu64_unshift(sa, s) arrayu64_insert((sa), 0, (s))
#define arrayu64_pop(sa) arrayu64_remove((sa), -1)
#define arrayu64_push(sa, s) arrayu64_append((sa), (s))
/* arrayu64_cmp_fn_t is same sig as qsort's compar argument */
typedef int arrayu64_cmp_fn_t(const void *, const void *);
void arrayu64_sort(arrayu64_t *, arrayu64_cmp_fn_t *);
void arrayu64_uniq(arrayu64_t *);
size_t arrayu64_size(const arrayu64_t *);
off_t arrayu64_find(const arrayu64_t *au, uint64_t val, off_t start);
off_t arrayu64_bsearch(const arrayu64_t *au, uint64_t val);
#endif /* __CYRUS_ARRAYU64_H__ */
|
