52a3801208
git-svn-id: file:///srv/svn/repos/haiku/trunk/current@10 a95241bf-73f2-0310-859d-f6bbb57e9c96
41 lines
1.4 KiB
C
Executable File
41 lines
1.4 KiB
C
Executable File
/*
|
|
** Copyright 2001-2002, Travis Geiselbrecht. All rights reserved.
|
|
** Distributed under the terms of the NewOS License.
|
|
*/
|
|
#ifndef _KERNEL_KHASH_H
|
|
#define _KERNEL_KHASH_H
|
|
|
|
struct hash_iterator {
|
|
void *ptr;
|
|
int bucket;
|
|
};
|
|
|
|
void *hash_init(unsigned int table_size, int next_ptr_offset,
|
|
int compare_func(void *a, const void *key),
|
|
unsigned int hash_func(void *a, const void *key, unsigned int range));
|
|
int hash_uninit(void *_hash_table);
|
|
int hash_insert(void *_hash_table, void *_elem);
|
|
int hash_remove(void *_hash_table, void *_elem);
|
|
void *hash_find(void *_hash_table, void *e);
|
|
void *hash_lookup(void *_hash_table, const void *key);
|
|
struct hash_iterator *hash_open(void *_hash_table, struct hash_iterator *i);
|
|
void hash_close(void *_hash_table, struct hash_iterator *i, bool free_iterator);
|
|
void *hash_next(void *_hash_table, struct hash_iterator *i);
|
|
void hash_rewind(void *_hash_table, struct hash_iterator *i);
|
|
|
|
/* function ptrs must look like this:
|
|
// hash function should calculate hash on either e or key,
|
|
// depending on which one is not NULL
|
|
unsigned int hash_func(void *e, const void *key, unsigned int range);
|
|
// compare function should compare the element with
|
|
// the key, returning 0 if equal, other if not
|
|
// NOTE: compare func can be null, in which case the hash
|
|
// code will compare the key pointer with the target
|
|
int compare_func(void *e, const void *key);
|
|
*/
|
|
|
|
unsigned int hash_hash_str( const char *str );
|
|
|
|
#endif
|
|
|