This repository has been archived on 2023-10-09. You can view files and clone it, but cannot push or open issues or pull requests.
Files
blender-archive/source/blender/blenlib/BLI_gsqueue.h

100 lines
2.6 KiB
C++
Raw Normal View History

2002-10-12 11:37:38 +00:00
/*
* ***** BEGIN GPL LICENSE BLOCK *****
2002-10-12 11:37:38 +00:00
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
2002-10-12 11:37:38 +00:00
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
2010-02-12 13:34:04 +00:00
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
2002-10-12 11:37:38 +00:00
*
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
* All rights reserved.
*
* The Original Code is: all of this file.
*
* Contributor(s): none yet.
*
* ***** END GPL LICENSE BLOCK *****
2002-10-12 11:37:38 +00:00
*/
#ifndef __BLI_GSQUEUE_H__
#define __BLI_GSQUEUE_H__
2002-10-12 11:37:38 +00:00
/** \file BLI_gsqueue.h
* \ingroup bli
* \brief A generic structure queue (a queue for fixed length
* (generally small) structures.
*/
2002-10-12 11:37:38 +00:00
typedef struct _GSQueue GSQueue;
/**
* Create a new GSQueue.
*
* \param elem_size The size of the structures in the queue.
* \retval The new queue
*/
GSQueue *BLI_gsqueue_new(int elem_size);
2002-10-12 11:37:38 +00:00
/**
* Query if the queue is empty
*/
int BLI_gsqueue_is_empty(GSQueue *gq);
2002-10-12 11:37:38 +00:00
/**
* Query number elements in the queue
*/
int BLI_gsqueue_size(GSQueue *gq);
/**
* Access the item at the head of the queue
* without removing it.
*
* \param item_r A pointer to an appropriately
* sized structure (the size passed to BLI_gsqueue_new)
*/
void BLI_gsqueue_peek(GSQueue *gq, void *item_r);
2002-10-12 11:37:38 +00:00
/**
* Access the item at the head of the queue
* and remove it.
*
* \param item_r A pointer to an appropriately
* sized structure (the size passed to BLI_gsqueue_new).
* Can be NULL if desired.
*/
void BLI_gsqueue_pop(GSQueue *gq, void *item_r);
2002-10-12 11:37:38 +00:00
/**
* Push an element onto the tail of the queue.
*
* \param item A pointer to an appropriately
* sized structure (the size passed to BLI_gsqueue_new).
*/
void BLI_gsqueue_push(GSQueue *gq, void *item);
2002-10-12 11:37:38 +00:00
/**
* Push an element back onto the head of the queue (so
* it would be returned from the next call to BLI_gsqueue_pop).
*
* \param item A pointer to an appropriately
* sized structure (the size passed to BLI_gsqueue_new).
*/
void BLI_gsqueue_pushback(GSQueue *gq, void *item);
2002-10-12 11:37:38 +00:00
/**
* Free the queue
*/
void BLI_gsqueue_free(GSQueue *gq);
2002-10-12 11:37:38 +00:00
#endif /* __BLI_GSQUEUE_H__ */