Campbell Barton
c434782e3a
Use a shorter/simpler license convention, stops the header taking so much space. Follow the SPDX license specification: https://spdx.org/licenses - C/C++/objc/objc++ - Python - Shell Scripts - CMake, GNUmakefile While most of the source tree has been included - `./extern/` was left out. - `./intern/cycles` & `./intern/atomic` are also excluded because they use different header conventions. doc/license/SPDX-license-identifiers.txt has been added to list SPDX all used identifiers. See P2788 for the script that automated these edits. Reviewed By: brecht, mont29, sergey Ref D14069
47 lines
1.5 KiB
C++
47 lines
1.5 KiB
C++
/* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
#pragma once
|
|
|
|
/** \file
|
|
* \ingroup bke
|
|
*/
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
struct BLI_mempool;
|
|
struct ID;
|
|
struct TreeStoreElem;
|
|
|
|
/* create and fill hashtable with treestore elements */
|
|
void *BKE_outliner_treehash_create_from_treestore(struct BLI_mempool *treestore);
|
|
|
|
/* full rebuild for already allocated hashtable */
|
|
void *BKE_outliner_treehash_rebuild_from_treestore(void *treehash, struct BLI_mempool *treestore);
|
|
|
|
/* clear element usage flags */
|
|
void BKE_outliner_treehash_clear_used(void *treehash);
|
|
|
|
/* Add/remove hashtable elements */
|
|
void BKE_outliner_treehash_add_element(void *treehash, struct TreeStoreElem *elem);
|
|
void BKE_outliner_treehash_remove_element(void *treehash, struct TreeStoreElem *elem);
|
|
|
|
/* find first unused element with specific type, nr and id */
|
|
struct TreeStoreElem *BKE_outliner_treehash_lookup_unused(void *treehash,
|
|
short type,
|
|
short nr,
|
|
struct ID *id);
|
|
|
|
/* find user or unused element with specific type, nr and id */
|
|
struct TreeStoreElem *BKE_outliner_treehash_lookup_any(void *treehash,
|
|
short type,
|
|
short nr,
|
|
struct ID *id);
|
|
|
|
/* free treehash structure */
|
|
void BKE_outliner_treehash_free(void *treehash);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|