DONE: * moved almost all declarations from BLI_blenlib.h into their own proper header files. * BLI_blenlib.h still includes all the declarations for convenience and to avoid changes in existing code * split util.c into several files, where it wasn't done already * DynamicList -> dynamiclist, * ListBase -> listbase, * String utility functions -> string.c * removed a few unused macros and functions, if they're needed back, they're still in svn ;) TODO: * btempdir global * further cleanup in the code of the different modules (especially util.c)
65 lines
2.3 KiB
C
65 lines
2.3 KiB
C
/**
|
|
* $Id$
|
|
*
|
|
* ***** BEGIN GPL LICENSE BLOCK *****
|
|
*
|
|
* 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.
|
|
*
|
|
* 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,
|
|
* Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
*
|
|
* Contributor(s): Jiri Hnidek.
|
|
*
|
|
* Documentation of Two way dynamic list with access array can be found at:
|
|
*
|
|
* http://wiki.blender.org/bin/view.pl/Blenderwiki/DynamicListWithAccessArray
|
|
*
|
|
* ***** END GPL LICENSE BLOCK *****
|
|
*/
|
|
|
|
#ifndef BLI_DYNAMIC_LIST_H
|
|
#define BLI_DYNAMIC_LIST_H
|
|
|
|
#include "DNA_listBase.h"
|
|
|
|
/*
|
|
* Access array using realloc
|
|
*/
|
|
typedef struct DynamicArray{
|
|
unsigned int count; /* count of items in list */
|
|
unsigned int max_item_index; /* max available index */
|
|
unsigned int last_item_index; /* max used index */
|
|
void **items; /* dynamicaly allocated array of pointers
|
|
pointing at items in list */
|
|
} DynamicArray;
|
|
|
|
/*
|
|
* Two way dynamic list with access array
|
|
*/
|
|
typedef struct DynamicList {
|
|
struct DynamicArray da; /* access array */
|
|
struct ListBase lb; /* two way linked dynamic list */
|
|
} DynamicList;
|
|
|
|
struct DynamicList *BLI_dlist_from_listbase(struct ListBase *lb);
|
|
struct ListBase *BLI_listbase_from_dlist(struct DynamicList *dlist, struct ListBase *lb);
|
|
void * BLI_dlist_find_link(struct DynamicList *dlist, unsigned int index);
|
|
unsigned int BLI_count_items(struct DynamicList *dlist);
|
|
void BLI_dlist_free_item(struct DynamicList *dlist, unsigned int index);
|
|
void BLI_dlist_rem_item(struct DynamicList *dlist, unsigned int index);
|
|
void * BLI_dlist_add_item_index(struct DynamicList *dlist, void *item, unsigned int index);
|
|
void BLI_dlist_destroy(struct DynamicList *dlist);
|
|
void BLI_dlist_init(struct DynamicList *dlist);
|
|
void BLI_dlist_reinit(struct DynamicList *dlist);
|
|
|
|
#endif
|