7 This file is part of PulseAudio.
9 PulseAudio is free software; you can redistribute it and/or modify
10 it under the terms of the GNU Lesser General Public License as
11 published by the Free Software Foundation; either version 2.1 of the
12 License, or (at your option) any later version.
14 PulseAudio is distributed in the hope that it will be useful, but
15 WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 Lesser General Public License for more details.
19 You should have received a copy of the GNU Lesser General Public
20 License along with PulseAudio; if not, write to the Free Software
21 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
27 /* A combination of a set and a dynamic array. Entries are indexable
28 * both through a numeric automatically generated index and the entry's
29 * data pointer. As usual, memory management is the user's job. */
31 /* A special index value denoting the invalid index. */
32 #define PA_IDXSET_INVALID ((uint32_t) -1)
34 /* Generic implementations for hash and comparison functions. Just
35 * compares the pointer or calculates the hash value directly from the
37 unsigned pa_idxset_trivial_hash_func(const void *p);
38 int pa_idxset_trivial_compare_func(const void *a, const void *b);
40 /* Generic implementations for hash and comparison functions for strings. */
41 unsigned pa_idxset_string_hash_func(const void *p);
42 int pa_idxset_string_compare_func(const void *a, const void *b);
44 typedef struct pa_idxset pa_idxset;
46 /* Instantiate a new idxset with the specified hash and comparison functions */
47 pa_idxset* pa_idxset_new(unsigned (*hash_func) (const void *p), int (*compare_func) (const void*a, const void*b));
49 /* Free the idxset. When the idxset is not empty the specified function is called for every entry contained */
50 void pa_idxset_free(pa_idxset *s, void (*free_func) (void *p, void *userdata), void *userdata);
52 /* Store a new item in the idxset. The index of the item is returned in *idx */
53 int pa_idxset_put(pa_idxset*s, void *p, uint32_t *idx);
55 /* Get the entry by its idx */
56 void* pa_idxset_get_by_index(pa_idxset*s, uint32_t idx);
58 /* Get the entry by its data. The idx is returned in *index */
59 void* pa_idxset_get_by_data(pa_idxset*s, const void *p, uint32_t *idx);
61 /* Similar to pa_idxset_get_by_index(), but removes the entry from the idxset. */
62 void* pa_idxset_remove_by_index(pa_idxset*s, uint32_t idx);
64 /* Similar to pa_idxset_get_by_data(), but removes the entry from the idxset */
65 void* pa_idxset_remove_by_data(pa_idxset*s, const void *p, uint32_t *idx);
67 /* This may be used to iterate through all entries. When called with
68 an invalid index value it returns the first entry, otherwise the
69 next following. The function is best called with *idx =
70 PA_IDXSET_VALID first. It is safe to manipulate the idxset between
71 the calls. It is not guaranteed that all entries have already been
72 returned before the an entry is returned the second time.*/
73 void* pa_idxset_rrobin(pa_idxset *s, uint32_t *idx);
75 /* Return the oldest entry in the idxset. Fill in its index in *idx. */
76 void* pa_idxset_first(pa_idxset *s, uint32_t *idx);
78 /* Return the entry following the entry indexed by *idx. After the
79 * call *index contains the index of the returned
80 * object. pa_idxset_first() and pa_idxset_next() may be used to
81 * iterate through the set.*/
82 void *pa_idxset_next(pa_idxset *s, uint32_t *idx);
84 /* Call a function for every item in the set. If the callback function
85 returns -1, the loop is terminated. If *del is set to non-zero that
86 specific item is removed. It is not safe to call any other
87 functions on the idxset while pa_idxset_foreach is executed. */
88 int pa_idxset_foreach(pa_idxset*s, int (*func)(void *p, uint32_t idx, int *del, void*userdata), void *userdata);
90 unsigned pa_idxset_size(pa_idxset*s);
92 int pa_idxset_isempty(pa_idxset *s);