libamxc  1.10.3
C Generic Data Containers
amxc_aqueue.h
Go to the documentation of this file.
1 /****************************************************************************
2 **
3 ** SPDX-License-Identifier: BSD-2-Clause-Patent
4 **
5 ** SPDX-FileCopyrightText: Copyright (c) 2023 SoftAtHome
6 **
7 ** Redistribution and use in source and binary forms, with or without modification,
8 ** are permitted provided that the following conditions are met:
9 **
10 ** 1. Redistributions of source code must retain the above copyright notice,
11 ** this list of conditions and the following disclaimer.
12 **
13 ** 2. Redistributions in binary form must reproduce the above copyright notice,
14 ** this list of conditions and the following disclaimer in the documentation
15 ** and/or other materials provided with the distribution.
16 **
17 ** Subject to the terms and conditions of this license, each copyright holder
18 ** and contributor hereby grants to those receiving rights under this license
19 ** a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable
20 ** (except for failure to satisfy the conditions of this license) patent license
21 ** to make, have made, use, offer to sell, sell, import, and otherwise transfer
22 ** this software, where such license applies only to those patent claims, already
23 ** acquired or hereafter acquired, licensable by such copyright holder or contributor
24 ** that are necessarily infringed by:
25 **
26 ** (a) their Contribution(s) (the licensed copyrights of copyright holders and
27 ** non-copyrightable additions of contributors, in source or binary form) alone;
28 ** or
29 **
30 ** (b) combination of their Contribution(s) with the work of authorship to which
31 ** such Contribution(s) was added by such copyright holder or contributor, if,
32 ** at the time the Contribution is added, such addition causes such combination
33 ** to be necessarily infringed. The patent license shall not apply to any other
34 ** combinations which include the Contribution.
35 **
36 ** Except as expressly stated above, no rights or licenses from any copyright
37 ** holder or contributor is granted under this license, whether expressly, by
38 ** implication, estoppel or otherwise.
39 **
40 ** DISCLAIMER
41 **
42 ** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
43 ** AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
44 ** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
45 ** ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
46 ** LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
47 ** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
48 ** SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
49 ** CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
50 ** OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
51 ** USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
52 **
53 ****************************************************************************/
54 
55 #if !defined(__AMXC_AQUEUE_H__)
56 #define __AMXC_AQUEUE_H__
57 
58 #ifdef __cplusplus
59 extern "C"
60 {
61 #endif
62 
63 #include <amxc/amxc_common.h>
64 #include <amxc/amxc_array.h>
65 
98 
105 
115 
138  return amxc_array_new(aqueue, 10);
139 }
140 
162  amxc_array_delete(aqueue, func);
163 }
164 
188 int amxc_aqueue_init(amxc_aqueue_t* const aqueue) {
189  return amxc_array_init(aqueue, 10);
190 }
191 
205 void amxc_aqueue_clean(amxc_aqueue_t* const aqueue,
207  amxc_array_clean(aqueue, func);
208 }
209 
224  return amxc_array_append_data(aqueue, data);
225 }
226 
238 void* amxc_aqueue_remove(amxc_aqueue_t* const aqueue) {
239  void* rv = amxc_array_take_first_data(aqueue);
240  amxc_array_shift_left(aqueue, 1, NULL);
241  return rv;
242 }
243 
255 size_t amxc_aqueue_size(const amxc_aqueue_t* const aqueue) {
256  return amxc_array_size(aqueue);
257 }
258 
271 size_t amxc_aqueue_is_empty(const amxc_aqueue_t* const aqueue) {
272  return amxc_array_is_empty(aqueue);
273 }
274 
275 #ifdef __cplusplus
276 }
277 #endif
278 
279 #endif // __AMXC_AQUEUE_H__
Ambiorix array API header file.
#define AMXC_INLINE
Definition: amxc_common.h:64
AMXC_INLINE void amxc_aqueue_delete(amxc_aqueue_t **aqueue, amxc_aqueue_it_delete_t func)
Frees the previously allocated array queue.
Definition: amxc_aqueue.h:161
AMXC_INLINE size_t amxc_aqueue_is_empty(const amxc_aqueue_t *const aqueue)
Checks that the array queue is empty.
Definition: amxc_aqueue.h:271
amxc_array_it_delete_t amxc_aqueue_it_delete_t
Definition of the item delete function.
Definition: amxc_aqueue.h:114
AMXC_INLINE size_t amxc_aqueue_size(const amxc_aqueue_t *const aqueue)
Calculates the number of items in the queue.
Definition: amxc_aqueue.h:255
AMXC_INLINE amxc_aqueue_it_t * amxc_aqueue_add(amxc_aqueue_t *const aqueue, void *data)
Adds data to the array queue.
Definition: amxc_aqueue.h:223
AMXC_INLINE void amxc_aqueue_clean(amxc_aqueue_t *const aqueue, amxc_aqueue_it_delete_t func)
Removes all items from the array queue.
Definition: amxc_aqueue.h:205
AMXC_INLINE void * amxc_aqueue_remove(amxc_aqueue_t *const aqueue)
Removes the first added data from the queue.
Definition: amxc_aqueue.h:238
amxc_array_it_t amxc_aqueue_it_t
The array queue iterator structure.
Definition: amxc_aqueue.h:104
AMXC_INLINE int amxc_aqueue_init(amxc_aqueue_t *const aqueue)
Initializes an array queue.
Definition: amxc_aqueue.h:188
amxc_array_t amxc_aqueue_t
The array queue structure.
Definition: amxc_aqueue.h:97
AMXC_INLINE int amxc_aqueue_new(amxc_aqueue_t **aqueue)
Allocates an array queue.
Definition: amxc_aqueue.h:137
void * amxc_array_take_first_data(amxc_array_t *const array)
Takes the data pointer from the first used item in the array.
Definition: amxc_array.c:576
size_t amxc_array_size(const amxc_array_t *const array)
Calculates the number of used items in the array.
Definition: amxc_array.c:415
int amxc_array_shift_left(amxc_array_t *const array, const size_t items, amxc_array_it_delete_t func)
Shift all items to the left in the array.
Definition: amxc_array.c:361
int amxc_array_init(amxc_array_t *const array, const size_t items)
Initializes an array.
Definition: amxc_array.c:231
bool amxc_array_is_empty(const amxc_array_t *const array)
Checks that the array is empty.
Definition: amxc_array.c:399
int8_t amxc_array_new(amxc_array_t **array, const size_t items)
Allocates an array.
Definition: amxc_array.c:179
void amxc_array_clean(amxc_array_t *const array, amxc_array_it_delete_t func)
Removes all items from the array.
Definition: amxc_array.c:261
void(* amxc_array_it_delete_t)(amxc_array_it_t *it)
Definition of the array item delete callback function.
Definition: amxc_array.h:194
amxc_array_it_t * amxc_array_append_data(amxc_array_t *const array, void *data)
Adds an item after the last used item in the array.
Definition: amxc_array.c:429
void amxc_array_delete(amxc_array_t **array, const amxc_array_it_delete_t func)
Frees the previously allocated array.
Definition: amxc_array.c:213
The array iterator structure.
Definition: amxc_array.h:174
The array structure.
Definition: amxc_array.h:162
char data[]