tommyhashdyn.h

Go to the documentation of this file.

/*
 * Copyright (c) 2010, Andrea Mazzoleni. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#ifndef __TOMMYHASHDYN_H
#define __TOMMYHASHDYN_H

#include "tommyhash.h"

/******************************************************************************/
/* hashdyn */

#define TOMMY_HASHDYN_BIT 4

typedef tommy_node tommy_hashdyn_node;

typedef struct tommy_hashdyn_struct {
        tommy_hashdyn_node** bucket; 
        tommy_uint_t bucket_bit; 
        tommy_count_t bucket_max; 
        tommy_count_t bucket_mask; 
        tommy_count_t count; 
} tommy_hashdyn;

void tommy_hashdyn_init(tommy_hashdyn* hashdyn);

void tommy_hashdyn_done(tommy_hashdyn* hashdyn);

void tommy_hashdyn_insert(tommy_hashdyn* hashdyn, tommy_hashdyn_node* node, void* data, tommy_hash_t hash);

void* tommy_hashdyn_remove(tommy_hashdyn* hashdyn, tommy_search_func* cmp, const void* cmp_arg, tommy_hash_t hash);

tommy_inline tommy_hashdyn_node* tommy_hashdyn_bucket(tommy_hashdyn* hashdyn, tommy_hash_t hash)
{
        return hashdyn->bucket[hash & hashdyn->bucket_mask];
}

tommy_inline void* tommy_hashdyn_search(tommy_hashdyn* hashdyn, tommy_search_func* cmp, const void* cmp_arg, tommy_hash_t hash)
{
        tommy_hashdyn_node* i = tommy_hashdyn_bucket(hashdyn, hash);

        while (i) {
                /* we first check if the hash matches, as in the same bucket we may have multiples hash values */
                if (i->key == hash && cmp(cmp_arg, i->data) == 0)
                        return i->data;
                i = i->next;
        }
        return 0;
}

void* tommy_hashdyn_remove_existing(tommy_hashdyn* hashdyn, tommy_hashdyn_node* node);

void tommy_hashdyn_foreach(tommy_hashdyn* hashdyn, tommy_foreach_func* func);

void tommy_hashdyn_foreach_arg(tommy_hashdyn* hashdyn, tommy_foreach_arg_func* func, void* arg);

tommy_inline tommy_count_t tommy_hashdyn_count(tommy_hashdyn* hashdyn)
{
        return hashdyn->count;
}

tommy_size_t tommy_hashdyn_memory_usage(tommy_hashdyn* hashdyn);

#endif