Differential D7092 Diff 22787 source/blender/blenlib/BLI_wavlTree.h

Changeset View

Standalone View

source/blender/blenlib/BLI_wavlTree.h

This file was added.

				/*
				* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
				*
				* The Original Code is Copyright (C) 2009 Blender Foundation, Joshua Leung
				* All rights reserved.
				*/

				#ifndef __BLI_WAVLTREE_H__
				#define __BLI_WAVLTREE_H__

				/** \file
				* \ingroup bli
				*/

				#ifdef __cplusplus
				extern "C" {
				#endif

				/* WAVL Tree Implementation:
				*
				* WAVL-trees (or weak AVL-trees) are a hybrid of RB-trees and AVL-trees.
				* They where first introduced in the paper "Rank-balanced trees" by
				* Haeupler, Bernhard; Sen, Siddhartha; Tarjan, Robert E. (2015)
				* http://sidsen.azurewebsites.net//papers/rb-trees-talg.pdf.
				* The main advantage of AVL-trees over RB-trees is that they are more
				* balanced. RB-trees however use a constant amount of tree rotations
				* when deleting a node, compared to a (worst case) logarithmic
				* number using AVL-trees. WAVL-trees have both of the better properties.
				*/

				/* ********************************************** */

				/* Data structs*/

				/* Node data */
				typedef struct WAVLT_Node {
				/* pointers for tree structure */
				struct WAVLT_Node left, right;
				struct WAVLT_Node *parent;
				/* pointers to successor and predecessor
				* for quick access */
				struct WAVLT_Node succ, pred;
				/* Size of the subtree including the node */
				uint size;
				/* The rank is an approximation of the distance
				* to the farthest leaf descendant.
				* (used internally to balance the BST) */
				int rank;
				/* pointer to the data in the node */
				void *data;
				} WAVLT_Node;

				/* WAVL Tree data */
				typedef struct WAVLT_Tree {
				/* root node */
				struct WAVLT_Node *root;
				/* pointers to min and max node
				* for quick access */
				struct WAVLT_Node min_node, max_node;
				} WAVLT_Tree;

				/* ********************************************** */
				/* Callbacks */

				/**
				* Callback function that returns -1, 0, 1 depending on
				* whether the data in WAVLT_Node A is less than, equal,
				* or greater than the data in WAVLT_Node B.
				*/
				typedef short (WAVLT_comparator_FP)(void data_a, void *data_b);

				/**
				* Callback function that frees the data of a node.
				*/
				typedef void (WAVLT_free_data_FP)(void data);

				/* ********************************************** */
				/* Public API */

				struct WAVLT_Tree *BLI_wavlTree_new(void);
				void BLI_wavlTree_free(struct WAVLT_Tree *tree, WAVLT_free_data_FP free_data);

				bool BLI_wavlTree_empty(const struct WAVLT_Tree *tree);
				uint BLI_wavlTree_size(const struct WAVLT_Tree *tree);

				struct WAVLT_Node BLI_wavlTree_search(const struct WAVLT_Tree tree, WAVLT_comparator_FP cmp, void *search_data);
				struct WAVLT_Node BLI_wavlTree_successor_ex(const struct WAVLT_Node node);
				struct WAVLT_Node BLI_wavlTree_successor(const struct WAVLT_Tree tree, WAVLT_comparator_FP cmp, void *data);
				struct WAVLT_Node BLI_wavlTree_predecessor_ex(const struct WAVLT_Node node);
				struct WAVLT_Node BLI_wavlTree_predecessor(const struct WAVLT_Tree tree, WAVLT_comparator_FP cmp, void *data);
				struct WAVLT_Node BLI_wavlTree_min(const struct WAVLT_Tree tree);
				struct WAVLT_Node BLI_wavlTree_max(const struct WAVLT_Tree tree);
				void BLI_wavlTree_min_data(const struct WAVLT_Tree tree);
				void BLI_wavlTree_max_data(const struct WAVLT_Tree tree);

				struct WAVLT_Node BLI_wavlTree_insert(struct WAVLT_Tree tree, WAVLT_comparator_FP cmp, void *data);
				void BLI_wavlTree_update_node(struct WAVLT_Tree tree, WAVLT_comparator_FP cmp, struct WAVLT_Node node);
				void BLI_wavlTree_update(struct WAVLT_Tree tree, WAVLT_comparator_FP cmp, void data);
				void BLI_wavlTree_delete_node(struct WAVLT_Tree tree, WAVLT_free_data_FP free_data, struct WAVLT_Node node);
				void BLI_wavlTree_delete(struct WAVLT_Tree tree, WAVLT_comparator_FP cmp, WAVLT_free_data_FP free_data, void data);

				/* Macro for in-order walk over the the data in the tree (uses predecessor-successor DLL).
				* The type should be that of the data in a node */
				#define WAVLTREE_INORDER(type, var, tree) \
				type var = (type)((tree)->min_node->data); \
				for (WAVLT_Node *_curr = (tree)->min_node; _curr != NULL; \
				_curr = _curr->succ, var = (_curr != NULL) ? (type)(_curr->data) : NULL)

				#define WAVLTREE_REVERSE_INORDER(type, var, tree) \
				type var = (type)((tree)->max_node->data); \
				for (WAVLT_Node *_curr = (tree)->max_node; _curr != NULL; \
				_curr = _curr->pred, var = (_curr != NULL) ? (type)(_curr->data) : NULL)

				/* ********************************************** */

				#ifdef __cplusplus
				}
				#endif

				#endif /* __BLI_WAVLTREE_H__ */