bsp.h File Reference

Binary space partitioning module. More...

#include "mersenne_types.h"
#include "portability.h"
#include "tree.h"

Go to the source code of this file.

Classes
struct	TCOD_bsp_t

Typedefs
typedef bool(*	TCOD_bsp_callback_t) (TCOD_bsp_t *node, void *userData)

Functions
TCOD_bsp_t *	TCOD_bsp_new (void)
TCOD_bsp_t *	TCOD_bsp_new_with_size (int x, int y, int w, int h)
void	TCOD_bsp_delete (TCOD_bsp_t *node)
TCOD_bsp_t *	TCOD_bsp_left (TCOD_bsp_t *node)
TCOD_bsp_t *	TCOD_bsp_right (TCOD_bsp_t *node)
TCOD_bsp_t *	TCOD_bsp_father (TCOD_bsp_t *node)
bool	TCOD_bsp_is_leaf (TCOD_bsp_t *node)
bool	TCOD_bsp_traverse_pre_order (TCOD_bsp_t *node, TCOD_bsp_callback_t listener, void *userData)
bool	TCOD_bsp_traverse_in_order (TCOD_bsp_t *node, TCOD_bsp_callback_t listener, void *userData)
bool	TCOD_bsp_traverse_post_order (TCOD_bsp_t *node, TCOD_bsp_callback_t listener, void *userData)
bool	TCOD_bsp_traverse_level_order (TCOD_bsp_t *node, TCOD_bsp_callback_t listener, void *userData)
bool	TCOD_bsp_traverse_inverted_level_order (TCOD_bsp_t *node, TCOD_bsp_callback_t listener, void *userData)
bool	TCOD_bsp_contains (TCOD_bsp_t *node, int x, int y)
TCOD_bsp_t *	TCOD_bsp_find_node (TCOD_bsp_t *node, int x, int y)
void	TCOD_bsp_resize (TCOD_bsp_t *node, int x, int y, int w, int h)
void	TCOD_bsp_split_once (TCOD_bsp_t *node, bool horizontal, int position)
void	TCOD_bsp_split_recursive (TCOD_bsp_t *node, TCOD_Random *randomizer, int nb, int minHSize, int minVSize, float maxHRatio, float maxVRatio)
void	TCOD_bsp_remove_sons (TCOD_bsp_t *node)

Detailed Description

Binary space partitioning module.