ds_prototypes.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
public void	initialize_bintree (Real x_min, Real x_max, Real y_min, Real y_max, Real z_min, Real z_max, bintree_struct_ptr bintree)
public void	delete_bintree_node (bintree_node_struct *node)
public void	delete_bintree (bintree_struct_ptr bintree)
public void	get_bintree_limits (bintree_struct_ptr bintree, range_struct *limits)
public bintree_node_struct *	create_bintree_internal_node (int split_coord, Real split_position, bintree_node_struct *left, bintree_node_struct *right)
public bintree_node_struct *	create_bintree_leaf (Real split_position, int n_objects, int object_list[])
public BOOLEAN	bintree_node_is_leaf (bintree_node_struct *node)
public int	get_bintree_leaf_objects (bintree_node_struct *node, int *object_list[])
public BOOLEAN	get_bintree_left_child_ptr (bintree_node_struct *node, bintree_node_struct ***ptr_to_left_child)
public BOOLEAN	get_bintree_left_child (bintree_node_struct *node, bintree_node_struct **left_child)
public BOOLEAN	get_bintree_right_child_ptr (bintree_node_struct *node, bintree_node_struct ***ptr_to_right_child)
public BOOLEAN	get_bintree_right_child (bintree_node_struct *node, bintree_node_struct **right_child)
public int	get_node_split_axis (bintree_node_struct *node)
public Real	get_node_split_position (bintree_node_struct *node)
public BOOLEAN	point_within_range (Point *point, range_struct *range)
public Real	range_volume (range_struct *range)
public Real	range_surface_area (range_struct *range)
public Status	io_bintree (FILE *file, IO_types direction, File_formats format, bintree_struct_ptr bintree)
public void	create_bitlist (int n_bits, bitlist_struct *bitlist)
public void	zero_bitlist (bitlist_struct *bitlist)
public void	fill_bitlist (bitlist_struct *bitlist)
public void	set_bitlist_bit (bitlist_struct *bitlist, int bit_index, BOOLEAN value)
public BOOLEAN	get_bitlist_bit (bitlist_struct *bitlist, int bit_index)
public void	delete_bitlist (bitlist_struct *bitlist)
public void	create_bitlist_3d (int nx, int ny, int nz, bitlist_3d_struct *bitlist)
public void	zero_bitlist_3d (bitlist_3d_struct *bitlist)
public void	get_bitlist_3d_sizes (bitlist_3d_struct *bitlist, int *nx, int *ny, int *nz)
public void	fill_bitlist_3d (bitlist_3d_struct *bitlist)
public void	set_bitlist_bit_3d (bitlist_3d_struct *bitlist, int x, int y, int z, BOOLEAN value)
public BOOLEAN	get_bitlist_bit_3d (bitlist_3d_struct *bitlist, int x, int y, int z)
public void	delete_bitlist_3d (bitlist_3d_struct *bitlist)
public Status	io_bitlist_3d (FILE *file, IO_types io_type, bitlist_3d_struct *bitlist)
public void	create_object_bintree (int n_objects, range_struct bound_vols[], bintree_struct_ptr bintree, int max_nodes)
public void	evaluate_bintree_efficiency (bintree_struct_ptr bintree, Real *avg_nodes_visited, Real *avg_objects_visited)
public void	initialize_hash_table (hash_table_struct *hash_table, int size, int data_size, Real enlarge_threshold, Real new_density)
public void	delete_hash_table (hash_table_struct *hash_table)
public void	insert_in_hash_table (hash_table_struct *hash_table, int key, void *data_ptr)
public BOOLEAN	lookup_in_hash_table (hash_table_struct *hash_table, int key, void *data_ptr)
public BOOLEAN	remove_from_hash_table (hash_table_struct *hash_table, int key, void *data_ptr)
public void	increase_hash_table_size (hash_table_struct *hash_table, int new_size)
public void	initialize_hash_pointer (hash_table_pointer *ptr)
public BOOLEAN	get_next_hash_entry (hash_table_struct *hash_table, hash_table_pointer *ptr, void *data_ptr)
public void	initialize_hash2_table (hash2_table_struct *hash_table, int size, int data_size, Real enlarge_threshold, Real new_density)
public void	delete_hash2_table (hash2_table_struct *hash_table)
public void	insert_in_hash2_table (hash2_table_struct *hash_table, int key1, int key2, void *data_ptr)
public BOOLEAN	lookup_in_hash2_table (hash2_table_struct *hash_table, int key1, int key2, void *data_ptr)
public BOOLEAN	remove_from_hash2_table (hash2_table_struct *hash_table, int key1, int key2, void *data_ptr)
public void	increase_hash2_table_size (hash2_table_struct *hash_table, int new_size)
public void	initialize_hash2_pointer (hash2_table_pointer *ptr)
public BOOLEAN	get_next_hash2_entry (hash2_table_struct *hash_table, hash2_table_pointer *ptr, void *data_ptr)
public void	delete_the_bintree (bintree_struct_ptr *bintree)
public void *	allocate_bintree (void)
public void	create_lines_bintree (lines_struct *lines, int max_nodes)
public void	create_polygons_bintree (polygons_struct *polygons, int max_nodes)
public void	create_quadmesh_bintree (quadmesh_struct *quadmesh, int max_nodes)
public Real	find_closest_point_in_bintree (Point *point, bintree_struct_ptr bintree, object_struct *object, int *obj_index, Point *point_on_object)
public Real	find_closest_vertex_in_bintree (Point *point, bintree_struct_ptr bintree, object_struct *object, int *vertex_on_object)
public void	print_bintree_stats (int n_objects)
public int	intersect_ray_with_bintree (Point *origin, Vector *direction, bintree_struct_ptr bintree, object_struct *object, int *obj_index, Real *dist, Real *distances[])
public BOOLEAN	ray_intersects_range (range_struct *range, Point *origin, Vector *direction, Real *t_min, Real *t_max)
public void	initialize_skiplist (skiplist_struct *skiplist)
public void	delete_skiplist (skiplist_struct *skiplist)
public BOOLEAN	search_skiplist (skiplist_struct *skiplist, float key, void **data_ptr)
public BOOLEAN	search_skiplist_and_return_pointer (skiplist_struct *skiplist, float key, skip_struct **entry_ptr, void **data_ptr)
public BOOLEAN	insert_in_skiplist (skiplist_struct *skiplist, float key, void *data_ptr)
public BOOLEAN	delete_from_skiplist (skiplist_struct *skiplist, float key, void **data_ptr)
public BOOLEAN	get_first_skiplist_entry (skiplist_struct *skiplist, skip_struct **entry_ptr, float *key, void **data_ptr)
public BOOLEAN	get_next_skiplist_entry (skip_struct **entry_ptr, float *key, void **data_ptr)

---

Function Documentation

public void* allocate_bintree (  void   )

Definition at line 89 of file object_bintrees.c. Referenced by create_lines_bintree(), create_polygons_bintree(), and create_quadmesh_bintree().

public BOOLEAN bintree_node_is_leaf (  bintree_node_struct *  node  )

Definition at line 324 of file bintree.c. References LEAF_SIGNAL, bintree_node_struct::node_info, and SUBDIVISION_AXIS_BITS. Referenced by get_bintree_left_child_ptr(), get_bintree_right_child_ptr(), output_bintree_node(), recursive_efficiency_count(), recursive_find_closest_point(), recursive_find_closest_vertex(), and recursive_intersect_ray().

public bintree_node_struct* create_bintree_internal_node (  int  split_coord, Real  split_position, bintree_node_struct *  left, bintree_node_struct *  right )

Definition at line 210 of file bintree.c. References LEFT_CHILD, LEFT_CHILD_EXISTS, bintree_node_struct::node_info, RIGHT_CHILD, RIGHT_CHILD_EXISTS, set_bintree_child(), and bintree_node_struct::split_position. Referenced by input_bintree_node(), and split_node().

public bintree_node_struct* create_bintree_leaf (  Real  split_position, int  n_objects, int  object_list[] )

Definition at line 271 of file bintree.c. References bintree_node_struct::data, LEAF_SIGNAL, MAX_NODE_INFO_OBJECTS, bintree_node_struct::node_info, NODE_INFO_OBJECTS_SHIFT, and bintree_node_struct::split_position. Referenced by input_bintree_node(), split_node(), and subdivide_bintree().

public void create_bitlist (  int  n_bits, bitlist_struct *  bitlist )

Definition at line 35 of file bitlist.c. References bitlist_struct::bits, BITS_PER_BITLIST_WORD, bitlist_struct::n_words, and zero_bitlist().

public void create_bitlist_3d (  int  nx, int  ny, int  nz, bitlist_3d_struct *  bitlist )

Definition at line 197 of file bitlist.c. References bitlist_3d_struct::bits, BITS_PER_BITLIST_WORD, bitlist_3d_struct::n_z_words, nx, bitlist_3d_struct::nx, ny, bitlist_3d_struct::ny, nz, bitlist_3d_struct::nz, and zero_bitlist_3d(). Referenced by fill_connected_voxels().

public void create_lines_bintree (  lines_struct *  lines, int  max_nodes )

Definition at line 112 of file object_bintrees.c. References allocate_bintree(), lines_struct::bintree, check_install_bintree_delete_function(), create_object_bintree(), lines_struct::end_indices, GET_OBJECT_SIZE, get_range_points(), lines_struct::indices, range_struct::limits, lines_struct::line_thickness, lines_struct::n_items, POINT_INDEX, and lines_struct::points.

public void create_object_bintree (  int  n_objects, range_struct  bound_vols[], bintree_struct_ptr  bintree, int  max_nodes )

Referenced by create_lines_bintree(), create_polygons_bintree(), and create_quadmesh_bintree().

public void create_polygons_bintree (  polygons_struct *  polygons, int  max_nodes )

Definition at line 184 of file object_bintrees.c. References allocate_bintree(), polygons_struct::bintree, check_install_bintree_delete_function(), create_object_bintree(), get_polygon_points(), get_range_points(), range_struct::limits, MAX_POINTS_PER_POLYGON, and polygons_struct::n_items.

public void create_quadmesh_bintree (  quadmesh_struct *  quadmesh, int  max_nodes )

Definition at line 233 of file object_bintrees.c. References allocate_bintree(), quadmesh_struct::bintree, check_install_bintree_delete_function(), create_object_bintree(), get_quadmesh_n_objects(), get_quadmesh_patch(), get_range_points(), and range_struct::limits.

public void delete_bintree (  bintree_struct_ptr  bintree  )

Definition at line 135 of file bintree.c. References recursive_delete_bintree(), and bintree_struct::root. Referenced by delete_the_bintree().

public void delete_bintree_node (  bintree_node_struct *  node  )

Definition at line 90 of file bintree.c. Referenced by recursive_delete_bintree(), and split_node().

public void delete_bitlist (  bitlist_struct *  bitlist  )

Definition at line 171 of file bitlist.c. References bitlist_struct::bits, and bitlist_struct::n_words.

public void delete_bitlist_3d (  bitlist_3d_struct *  bitlist  )

Definition at line 381 of file bitlist.c. References bitlist_3d_struct::bits, bitlist_3d_struct::nx, bitlist_3d_struct::ny, and bitlist_3d_struct::nz. Referenced by fill_connected_voxels().

public BOOLEAN delete_from_skiplist (  skiplist_struct *  skiplist, float  key, void **  data_ptr )

Definition at line 366 of file skiplist.c. References skip_struct::data_ptr, delete_entry_from_skiplist(), find_data_position(), skip_struct::forward, and update_struct::update.

public void delete_hash2_table (  hash2_table_struct *  hash_table  )

Definition at line 96 of file hash2_table.c. References delete_hash2_table_list(), hash2_entry_struct::next, hash2_table_struct::size, and hash2_table_struct::table. Referenced by intersect_planes_with_polygons(), and intersect_planes_with_quadmesh().

public void delete_hash_table (  hash_table_struct *  hash_table  )

Definition at line 95 of file hash_table.c. References delete_hash_table_list(), hash_entry_struct::next, hash_table_struct::size, and hash_table_struct::table. Referenced by delete_lookup_volume_coeficients().

public void delete_skiplist (  skiplist_struct *  skiplist  )

Definition at line 253 of file skiplist.c. References skip_struct::forward, and skiplist_struct::header.

public void delete_the_bintree (  bintree_struct_ptr *  bintree  )

Definition at line 37 of file object_bintrees.c. References delete_bintree(). Referenced by check_install_bintree_delete_function().

public void evaluate_bintree_efficiency (  bintree_struct_ptr  bintree, Real *  avg_nodes_visited, Real *  avg_objects_visited )

Definition at line 675 of file build_bintree.c. References node_visit_estimation(), bintree_struct::range, recursive_efficiency_count(), and bintree_struct::root. Referenced by PRIORITY_QUEUE_STRUCT().

public void fill_bitlist (  bitlist_struct *  bitlist  )

Definition at line 83 of file bitlist.c. References bitlist_type, bitlist_struct::bits, and bitlist_struct::n_words.

public void fill_bitlist_3d (  bitlist_3d_struct *  bitlist  )

Definition at line 269 of file bitlist.c. References bitlist_type, bitlist_3d_struct::bits, bitlist_3d_struct::n_z_words, bitlist_3d_struct::nx, bitlist_3d_struct::ny, and y.

public Real find_closest_point_in_bintree (  Point *  point, bintree_struct_ptr  bintree, object_struct *  object, int *  obj_index, Point *  point_on_object )

Definition at line 52 of file point_bintree.c. References bintree_struct::range, recursive_find_closest_point(), and bintree_struct::root. Referenced by find_closest_point_on_object().

public Real find_closest_vertex_in_bintree (  Point *  point, bintree_struct_ptr  bintree, object_struct *  object, int *  vertex_on_object )

Definition at line 243 of file point_bintree.c. References bintree_struct::range, recursive_find_closest_vertex(), and bintree_struct::root. Referenced by find_closest_vertex_on_object().

public int get_bintree_leaf_objects (  bintree_node_struct *  node, int *  object_list[] )

Definition at line 344 of file bintree.c. References bintree_node_struct::data, bintree_node_struct::node_info, and NODE_INFO_OBJECTS_SHIFT. Referenced by output_leaf_node(), recursive_efficiency_count(), recursive_find_closest_point(), recursive_find_closest_vertex(), recursive_intersect_ray(), and split_node().

public BOOLEAN get_bintree_left_child (  bintree_node_struct *  node, bintree_node_struct **  left_child )

Definition at line 409 of file bintree.c. References get_bintree_left_child_ptr(). Referenced by output_bintree_node(), recursive_delete_bintree(), recursive_efficiency_count(), recursive_find_closest_point(), recursive_find_closest_vertex(), and recursive_intersect_ray().

public BOOLEAN get_bintree_left_child_ptr (  bintree_node_struct *  node, bintree_node_struct ***  ptr_to_left_child )

Definition at line 380 of file bintree.c. References bintree_node_is_leaf(), bintree_node_struct::data, LEFT_CHILD_EXISTS, and bintree_node_struct::node_info. Referenced by get_bintree_left_child(), and subdivide_bintree().

public void get_bintree_limits (  bintree_struct_ptr  bintree, range_struct *  limits )

Definition at line 155 of file bintree.c. References bintree_struct::range. Referenced by subdivide_bintree().

public BOOLEAN get_bintree_right_child (  bintree_node_struct *  node, bintree_node_struct **  right_child )

Definition at line 475 of file bintree.c. References get_bintree_right_child_ptr(). Referenced by output_bintree_node(), recursive_delete_bintree(), recursive_efficiency_count(), recursive_find_closest_point(), recursive_find_closest_vertex(), and recursive_intersect_ray().

public BOOLEAN get_bintree_right_child_ptr (  bintree_node_struct *  node, bintree_node_struct ***  ptr_to_right_child )

Definition at line 438 of file bintree.c. References bintree_node_is_leaf(), bintree_node_struct::data, LEFT_CHILD_EXISTS, bintree_node_struct::node_info, and RIGHT_CHILD_EXISTS. Referenced by get_bintree_right_child(), and subdivide_bintree().

public void get_bitlist_3d_sizes (  bitlist_3d_struct *  bitlist, int *  nx, int *  ny, int *  nz )

Definition at line 245 of file bitlist.c. References bitlist_3d_struct::nx, nx, bitlist_3d_struct::ny, ny, bitlist_3d_struct::nz, and nz.

public BOOLEAN get_bitlist_bit (  bitlist_struct *  bitlist, int  bit_index )

Definition at line 140 of file bitlist.c. References bitlist_type, bitlist_struct::bits, BITS_PER_BITLIST_WORD_MINUS_1, and LOG_BITS_PER_BITLIST_WORD.

public BOOLEAN get_bitlist_bit_3d (  bitlist_3d_struct *  bitlist, int  x, int  y, int  z )

Definition at line 347 of file bitlist.c. References bitlist_type, bitlist_3d_struct::bits, BITS_PER_BITLIST_WORD_MINUS_1, FALSE, LOG_BITS_PER_BITLIST_WORD, and y. Referenced by fill_connected_voxels(), and voxel_might_contain_boundary().

public BOOLEAN get_first_skiplist_entry (  skiplist_struct *  skiplist, skip_struct **  entry_ptr, float *  key, void **  data_ptr )

Definition at line 403 of file skiplist.c. References skip_struct::forward, skiplist_struct::header, and skip_struct::key.

public BOOLEAN get_next_hash2_entry (  hash2_table_struct *  hash_table, hash2_table_pointer *  ptr, void *  data_ptr )

Definition at line 455 of file hash2_table.c. References hash2_table_pointer::current_entry, hash2_table_pointer::current_index, hash2_entry_struct::data, hash2_table_struct::data_size, hash2_entry_struct::next, hash2_table_struct::size, and hash2_table_struct::table.

public BOOLEAN get_next_hash_entry (  hash_table_struct *  hash_table, hash_table_pointer *  ptr, void *  data_ptr )

Definition at line 440 of file hash_table.c. References hash_table_pointer::current_entry, hash_table_pointer::current_index, hash_entry_struct::data, hash_table_struct::data_size, hash_entry_struct::next, hash_table_struct::size, and hash_table_struct::table.

public BOOLEAN get_next_skiplist_entry (  skip_struct **  entry_ptr, float *  key, void **  data_ptr )

Definition at line 435 of file skiplist.c. References skip_struct::forward, and skip_struct::key.

public int get_node_split_axis (  bintree_node_struct *  node  )

Definition at line 504 of file bintree.c. References bintree_node_struct::node_info, and SUBDIVISION_AXIS_BITS. Referenced by recursive_efficiency_count(), recursive_find_closest_point(), recursive_find_closest_vertex(), and recursive_intersect_ray().

public Real get_node_split_position (  bintree_node_struct *  node  )

Definition at line 523 of file bintree.c. References bintree_node_struct::split_position. Referenced by recursive_efficiency_count(), recursive_find_closest_point(), recursive_find_closest_vertex(), recursive_intersect_ray(), and split_node().

public void increase_hash2_table_size (  hash2_table_struct *  hash_table, int  new_size )

Definition at line 402 of file hash2_table.c. References hash2_table_struct::data_size, delete_hash2_table_list(), hash2_table_struct::enlarge_threshold, initialize_hash2_table(), move_hash2_entries_to_new_table(), and hash2_table_struct::new_density. Referenced by insert_in_hash2_table().

public void increase_hash_table_size (  hash_table_struct *  hash_table, int  new_size )

Definition at line 387 of file hash_table.c. References hash_table_struct::data_size, delete_hash_table_list(), hash_table_struct::enlarge_threshold, initialize_hash_table(), move_hash_entries_to_new_table(), and hash_table_struct::new_density. Referenced by insert_in_hash_table().

public void initialize_bintree (  Real  x_min, Real  x_max, Real  y_min, Real  y_max, Real  z_min, Real  z_max, bintree_struct_ptr  bintree )

Definition at line 57 of file bintree.c. References bintree_struct_ptr, range_struct::limits, bintree_struct::n_nodes, bintree_struct::range, and bintree_struct::root. Referenced by PRIORITY_QUEUE_STRUCT().

public void initialize_hash2_pointer (  hash2_table_pointer *  ptr  )

Definition at line 433 of file hash2_table.c. References hash2_table_pointer::current_entry, and hash2_table_pointer::current_index.

public void initialize_hash2_table (  hash2_table_struct *  hash_table, int  size, int  data_size, Real  enlarge_threshold, Real  new_density )

Definition at line 42 of file hash2_table.c. References hash2_table_struct::data_size, hash2_table_struct::enlarge_threshold, hash2_table_struct::n_entries, hash2_table_struct::new_density, hash2_table_struct::size, and hash2_table_struct::table. Referenced by increase_hash2_table_size(), intersect_planes_with_polygons(), and intersect_planes_with_quadmesh().

public void initialize_hash_pointer (  hash_table_pointer *  ptr  )

Definition at line 418 of file hash_table.c. References hash_table_pointer::current_entry, and hash_table_pointer::current_index.

public void initialize_hash_table (  hash_table_struct *  hash_table, int  size, int  data_size, Real  enlarge_threshold, Real  new_density )

Definition at line 41 of file hash_table.c. References hash_table_struct::data_size, hash_table_struct::enlarge_threshold, hash_table_struct::n_entries, hash_table_struct::new_density, hash_table_struct::size, and hash_table_struct::table. Referenced by increase_hash_table_size(), and lookup_volume_coeficients().

public void initialize_skiplist (  skiplist_struct *  skiplist  )

Definition at line 63 of file skiplist.c. References ALLOC_SKIP_STRUCT, skip_struct::forward, skiplist_struct::header, skiplist_struct::level, and MAX_SKIP_LEVELS.

public void insert_in_hash2_table (  hash2_table_struct *  hash_table, int  key1, int  key2, void *  data_ptr )

Definition at line 200 of file hash2_table.c. References hash2_entry_struct::data, hash2_table_struct::data_size, hash2_table_struct::enlarge_threshold, increase_hash2_table_size(), hash2_entry_struct::key1, hash2_entry_struct::key2, lookup(), hash2_table_struct::n_entries, hash2_table_struct::new_density, hash2_entry_struct::next, and hash2_table_struct::size. Referenced by intersect_planes_with_polygons(), and intersect_planes_with_quadmesh().

public void insert_in_hash_table (  hash_table_struct *  hash_table, int  key, void *  data_ptr )

Definition at line 192 of file hash_table.c. References hash_entry_struct::data, hash_table_struct::data_size, hash_table_struct::enlarge_threshold, increase_hash_table_size(), hash_entry_struct::key, lookup(), hash_table_struct::n_entries, hash_table_struct::new_density, hash_entry_struct::next, and hash_table_struct::size. Referenced by lookup_volume_coeficients().

public BOOLEAN insert_in_skiplist (  skiplist_struct *  skiplist, float  key, void *  data_ptr )

Definition at line 335 of file skiplist.c. References find_data_position(), and insert_data_in_skiplist().

public int intersect_ray_with_bintree (  Point *  origin, Vector *  direction, bintree_struct_ptr  bintree, object_struct *  object, int *  obj_index, Real *  dist, Real *  distances[] )

Definition at line 76 of file ray_bintree.c. References bintree_struct::range, ray_intersects_range(), recursive_intersect_ray(), and bintree_struct::root. Referenced by intersect_ray_with_object().

public Status io_bintree (  FILE *  file, IO_types  direction, File_formats  format, bintree_struct_ptr  bintree )

Definition at line 622 of file bintree.c. References input_bintree_node(), io_range(), output_bintree_node(), bintree_struct::range, and bintree_struct::root.

public Status io_bitlist_3d (  FILE *  file, IO_types  io_type, bitlist_3d_struct *  bitlist )

Definition at line 405 of file bitlist.c. References bitlist_3d_struct::bits, bitlist_3d_struct::n_z_words, bitlist_3d_struct::nx, bitlist_3d_struct::ny, and y.

public BOOLEAN lookup_in_hash2_table (  hash2_table_struct *  hash_table, int  key1, int  key2, void *  data_ptr )

Definition at line 260 of file hash2_table.c. References hash2_entry_struct::data, hash2_table_struct::data_size, FALSE, lookup(), and TRUE. Referenced by intersect_planes_with_polygons(), and intersect_planes_with_quadmesh().

public BOOLEAN lookup_in_hash_table (  hash_table_struct *  hash_table, int  key, void *  data_ptr )

Definition at line 248 of file hash_table.c. References hash_entry_struct::data, hash_table_struct::data_size, FALSE, lookup(), and TRUE. Referenced by lookup_volume_coeficients().

public BOOLEAN point_within_range (  Point *  point, range_struct *  range )

Definition at line 543 of file bintree.c. References range_struct::limits.

public void print_bintree_stats (  int  n_objects  )

Definition at line 51 of file ray_bintree.c. References n_nodes_searched, and n_objects_searched.

public Real range_surface_area (  range_struct *  range  )

Definition at line 593 of file bintree.c. References range_struct::limits. Referenced by node_visit_estimation().

public Real range_volume (  range_struct *  range  )

Definition at line 572 of file bintree.c. References range_struct::limits. Referenced by node_visit_estimation().

public BOOLEAN ray_intersects_range (  range_struct *  range, Point *  origin, Vector *  direction, Real *  t_min, Real *  t_max )

Definition at line 291 of file ray_bintree.c. References clip_line_to_box(), and range_struct::limits. Referenced by intersect_ray_with_bintree().

public BOOLEAN remove_from_hash2_table (  hash2_table_struct *  hash_table, int  key1, int  key2, void *  data_ptr )

Definition at line 308 of file hash2_table.c. References hash2_entry_struct::data, hash2_table_struct::data_size, FALSE, lookup(), hash2_table_struct::n_entries, hash2_entry_struct::next, and TRUE.

public BOOLEAN remove_from_hash_table (  hash_table_struct *  hash_table, int  key, void *  data_ptr )

Definition at line 294 of file hash_table.c. References hash_entry_struct::data, hash_table_struct::data_size, FALSE, lookup(), hash_table_struct::n_entries, hash_entry_struct::next, and TRUE. Referenced by lookup_volume_coeficients().

public BOOLEAN search_skiplist (  skiplist_struct *  skiplist, float  key, void **  data_ptr )

Definition at line 284 of file skiplist.c. References skip_struct::data_ptr, find_data_position(), skip_struct::forward, and update_struct::update.

public BOOLEAN search_skiplist_and_return_pointer (  skiplist_struct *  skiplist, float  key, skip_struct **  entry_ptr, void **  data_ptr )

Definition at line 300 of file skiplist.c. References skip_struct::data_ptr, find_data_position(), skip_struct::forward, and update_struct::update.

public void set_bitlist_bit (  bitlist_struct *  bitlist, int  bit_index, BOOLEAN  value )

Definition at line 107 of file bitlist.c. References bitlist_type, bitlist_struct::bits, BITS_PER_BITLIST_WORD_MINUS_1, and LOG_BITS_PER_BITLIST_WORD.

public void set_bitlist_bit_3d (  bitlist_3d_struct *  bitlist, int  x, int  y, int  z, BOOLEAN  value )

Definition at line 303 of file bitlist.c. References bitlist_type, bitlist_3d_struct::bits, BITS_PER_BITLIST_WORD_MINUS_1, LOG_BITS_PER_BITLIST_WORD, and y. Referenced by fill_connected_voxels(), and voxel_might_contain_boundary().

public void zero_bitlist (  bitlist_struct *  bitlist  )

Definition at line 61 of file bitlist.c. References bitlist_type, bitlist_struct::bits, and bitlist_struct::n_words. Referenced by create_bitlist().

public void zero_bitlist_3d (  bitlist_3d_struct *  bitlist  )

Definition at line 228 of file bitlist.c. References bitlist_type, bitlist_3d_struct::bits, bitlist_3d_struct::n_z_words, bitlist_3d_struct::nx, bitlist_3d_struct::ny, and y. Referenced by create_bitlist_3d().

---