opencv2/surface_matching/t_hash_int.hpp#

#include <stdio.h>
#include <stdlib.h>

Include dependency graph for t_hash_int.hpp:

opencv2/surface_matching/t_hash_int.hpp Node1 opencv2/surface_matching /t_hash_int.hpp Node2 stdio.h Node1->Node2 Node3 stdlib.h Node1->Node3

opencv2/surface_matching/t_hash_int.hpp Node1 opencv2/surface_matching /t_hash_int.hpp Node2 stdio.h Node1->Node2 Node3 stdlib.h Node1->Node3

This graph shows which files directly or indirectly include t_hash_int.hpp:

incby nc501496137 opencv2/surface_matching/ppf_match_3d.hpp n8d3351ae61 opencv2/surface_matching/t_hash_int.hpp nc501496137->n8d3351ae61 n55bef43d3a opencv2/surface_matching.hpp n55bef43d3a->nc501496137

incby nc501496137 opencv2/surface_matching/ppf_match_3d.hpp n8d3351ae61 opencv2/surface_matching/t_hash_int.hpp nc501496137->n8d3351ae61 n55bef43d3a opencv2/surface_matching.hpp n55bef43d3a->nc501496137

Classes#

struct hashnode_i
struct hashtable_int

Namespaces#

namespace cv
namespace cv::ppf_match_3d

Functions#

hashtable_int * cv::ppf_match_3d::hashtable_int_clone (hashtable_int *hashtbl)
hashtable_int * cv::ppf_match_3d::hashtableCreate (size_t size, size_t(*hashfunc)(uint))
void cv::ppf_match_3d::hashtableDestroy (hashtable_int *hashtbl)
void * cv::ppf_match_3d::hashtableGet (hashtable_int *hashtbl, KeyType key)
hashnode_i * cv::ppf_match_3d::hashtableGetBucketHashed (hashtable_int *hashtbl, KeyType key)
int cv::ppf_match_3d::hashtableInsert (hashtable_int *hashtbl, KeyType key, void *data)
int cv::ppf_match_3d::hashtableInsertHashed (hashtable_int *hashtbl, KeyType key, void *data)
void cv::ppf_match_3d::hashtablePrint (hashtable_int *hashtbl)
hashtable_int * cv::ppf_match_3d::hashtableRead (FILE *f)
int cv::ppf_match_3d::hashtableRemove (hashtable_int *hashtbl, KeyType key)
int cv::ppf_match_3d::hashtableResize (hashtable_int *hashtbl, size_t size)
int cv::ppf_match_3d::hashtableWrite (const hashtable_int *hashtbl, const size_t dataSize, FILE *f)
static uint cv::ppf_match_3d::next_power_of_two (uint value)

Round up to the next highest power of 2.