2022-02-11 09:07:11 +11:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0-or-later
|
|
|
|
|
* Copyright 2001-2002 NaN Holding BV. All rights reserved. */
|
2002-10-12 11:37:38 +00:00
|
|
|
|
2012-02-17 18:59:41 +00:00
|
|
|
#pragma once
|
2002-10-12 11:37:38 +00:00
|
|
|
|
2019-02-18 08:08:12 +11:00
|
|
|
/** \file
|
|
|
|
|
* \ingroup bli
|
2011-02-18 13:58:08 +00:00
|
|
|
*/
|
|
|
|
|
|
2020-04-28 18:08:00 +02:00
|
|
|
#include "BLI_utildefines.h"
|
|
|
|
|
|
2020-01-07 12:53:39 +01:00
|
|
|
#ifdef __cplusplus
|
|
|
|
|
extern "C" {
|
|
|
|
|
#endif
|
|
|
|
|
|
2002-10-12 11:37:38 +00:00
|
|
|
typedef struct _GSQueue GSQueue;
|
|
|
|
|
|
2022-01-12 12:49:36 +01:00
|
|
|
GSQueue *BLI_gsqueue_new(size_t elem_size);
|
2021-12-09 20:01:44 +11:00
|
|
|
/**
|
|
|
|
|
* Returns true if the queue is empty, false otherwise.
|
|
|
|
|
*/
|
2020-09-04 20:59:13 +02:00
|
|
|
bool BLI_gsqueue_is_empty(const GSQueue *queue);
|
|
|
|
|
size_t BLI_gsqueue_len(const GSQueue *queue);
|
2021-12-09 20:01:44 +11:00
|
|
|
/**
|
|
|
|
|
* Retrieves and removes the first element from the queue.
|
|
|
|
|
* The value is copies to \a r_item, which must be at least \a elem_size bytes.
|
|
|
|
|
*
|
|
|
|
|
* Does not reduce amount of allocated memory.
|
|
|
|
|
*/
|
2020-09-04 20:59:13 +02:00
|
|
|
void BLI_gsqueue_pop(GSQueue *queue, void *r_item);
|
2021-12-09 20:01:44 +11:00
|
|
|
/**
|
|
|
|
|
* Copies the source value onto the end of the queue
|
|
|
|
|
*
|
|
|
|
|
* \note This copies #GSQueue.elem_size bytes from \a item,
|
|
|
|
|
* (the pointer itself is not stored).
|
|
|
|
|
*
|
|
|
|
|
* \param item: source data to be copied to the queue.
|
|
|
|
|
*/
|
2020-09-04 20:59:13 +02:00
|
|
|
void BLI_gsqueue_push(GSQueue *queue, const void *item);
|
2021-12-09 20:01:44 +11:00
|
|
|
/**
|
|
|
|
|
* Free the queue's data and the queue itself.
|
|
|
|
|
*/
|
2020-09-04 20:59:13 +02:00
|
|
|
void BLI_gsqueue_free(GSQueue *queue);
|
2002-10-12 11:37:38 +00:00
|
|
|
|
2020-01-07 12:53:39 +01:00
|
|
|
#ifdef __cplusplus
|
|
|
|
|
}
|
|
|
|
|
#endif
|