UltraGrid
UltraGrid Low-Latency High-Resolution Transmission System
Loading...
Searching...
No Matches
list.h
Go to the documentation of this file.
1
5/*
6 * Copyright (c) 2013-2023 CESNET, z. s. p. o.
7 * All rights reserved.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, is permitted provided that the following conditions
11 * are met:
12 *
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 *
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 *
20 * 3. Neither the name of CESNET nor the names of its contributors may be
21 * used to endorse or promote products derived from this software without
22 * specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE AUTHORS AND CONTRIBUTORS
25 * "AS IS" AND ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING,
26 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
27 * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
28 * EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
29 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
30 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
31 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
34 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
35 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 */
37
38#ifndef SIMPLE_LINKED_LIST_H_
39#define SIMPLE_LINKED_LIST_H_
40
41#ifndef __cplusplus
42#include <stdbool.h>
43#else
44extern "C" {
45#endif
46
50void simple_linked_list_prepend(struct simple_linked_list *, void *data);
51void simple_linked_list_append(struct simple_linked_list *, void *data);
52bool simple_linked_list_append_if_less(struct simple_linked_list *, void *data, int max_size);
57
71void *simple_linked_list_it_next(void **it);
72void *simple_linked_list_it_peek_next(const void *it);
74void simple_linked_list_it_destroy(void *it);
75
81
87
88#ifdef __cplusplus
89}
90#endif
91
92#endif// SIMPLE_LINKED_LIST_H_
void * simple_linked_list_it_peek_next(const void *it)
Definition list.cpp:132
void simple_linked_list_destroy(struct simple_linked_list *)
Definition list.cpp:58
void simple_linked_list_append(struct simple_linked_list *, void *data)
Definition list.cpp:68
void * simple_linked_list_first(struct simple_linked_list *)
returns first element of list, UB if empty
Definition list.cpp:98
void simple_linked_list_it_destroy(void *it)
Should be used when it != NULL, eg. when leaving the loop before the end.
Definition list.cpp:139
struct simple_linked_list * simple_linked_list_init(void)
Definition list.cpp:53
void * simple_linked_list_remove_index(struct simple_linked_list *, int index)
Definition list.cpp:155
int simple_linked_list_size(struct simple_linked_list *)
Definition list.cpp:93
void * simple_linked_list_it_next(void **it)
Definition list.cpp:119
bool simple_linked_list_append_if_less(struct simple_linked_list *, void *data, int max_size)
Definition list.cpp:73
void * simple_linked_list_last(struct simple_linked_list *)
returns last element of list, UB if empty
Definition list.cpp:103
void * simple_linked_list_it_init(struct simple_linked_list *)
Definition list.cpp:108
void simple_linked_list_prepend(struct simple_linked_list *, void *data)
Definition list.cpp:63
void * simple_linked_list_pop(struct simple_linked_list *)
Definition list.cpp:82
bool simple_linked_list_remove(struct simple_linked_list *, void *)
Definition list.cpp:144