/*------------------------------------------------------------------------------
 *
 * Copyright (c) 2011-2016, EURid. All rights reserved.
 * The YADIFA TM software product is provided under the BSD 3-clause license:
 * 
 * Redistribution and use in source and binary forms, with or without 
 * modification, are permitted provided that the following conditions
 * are met:
 *
 *        * Redistributions of source code must retain the above copyright 
 *          notice, this list of conditions and the following disclaimer.
 *        * 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.
 *        * Neither the name of EURid nor the names of its contributors may be 
 *          used to endorse or promote products derived from this software 
 *          without specific prior written permission.
 *
 * 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 HOLDER 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.
 *
 *------------------------------------------------------------------------------
 *
 */
/** @defgroup collections Generic collections functions
 *  @ingroup dnscore
 *  @brief A dictionary (map, hash, ...) ptr->ptr implemented as an AVL balanced tree
 * 
 * A dictionary (map, hash, ...) implemented as an AVL balanced tree
 * The key is a pointer and is compated with other keys using a used-defined,
 * per-collection comparison function.
 *
 * Pre-defined comparators include:
 * 
 * PTR_SET_EMPTY  (ptr_set_default_node_compare) pointer addresses
 * PTR_SET_ASCIIZ_EMPTY (ptr_set_asciizp_node_compare) C-strings
 * PTR_SET_DNSNAME_EMPTY (ptr_set_dnsname_node_compare) FQDNs
 * PTR_SET_NULLABLE_ASCIIZ_EMPTY (ptr_set_nullable_asciizp_node_compare) C-strings AND NULL
 * PTR_SET_NULLABLE_DNSNAME_EMPTY (ptr_set_nullable_dnsname_node_compare) FQDNs AND NULL
 * PTR_SET_PTR_EMPTY (ptr_set_ptr_node_compare) pointer addresses
 * PTR_SET_HOST_ADDRESS_EMPTY (ptr_set_host_address_node_compare) host_address
 * 
 * @{
 */

#pragma once

#ifdef	__cplusplus
extern "C"
{
#endif

#include <dnscore/sys_types.h>

/*
 * A digest is stored prefixed with its length ([1;255])
 */

/*
 * A structure to hold both children with direct access
 */

typedef int ptr_node_compare(const void *node_a, const void *node_b);

typedef struct ptr_set ptr_set;
typedef struct ptr_node ptr_node;

struct ptr_set
{
    struct ptr_node         *root;
    ptr_node_compare     *compare;
};

struct ptr_set_children
{
    struct ptr_node* left;
    struct ptr_node* right;
};

/*
 * An union to have access to the children with direct or indexed access
 */

typedef union ptr_set_children_union ptr_set_children_union;

union ptr_set_children_union
{
    struct ptr_set_children lr;
    struct ptr_node * child[2];
};

/*
 * The node structure CANNOT have a varying size on a given collection
 * This means that the digest size is a constant in the whole tree
 */

struct ptr_node
{
    union ptr_set_children_union children;  // 16
    /**/
    struct ptr_node* parent;            //  8
    /**/
    void    *key;   /* ie: nsec3 item */
    void    *value;  /* ie: label linked to the nsec3 item */
    
    s8 balance;
};

#define PTR_SET_NODE_SIZE(node) sizeof(ptr_node)

/*
 * AVL definition part begins here
 */

/*
 * The maximum depth of a tree.
 * 40 is enough for storing 433494436 items (worst case)
 *
 * Depth 0 is one node.
 *
 * Worst case : N is enough for sum[n = 0,N](Fn) where F is Fibonacci
 * Best case : N is enough for (2^(N+1))-1
 */
#define AVL_MAX_DEPTH   40 /* 64 */

/*
 * The previx that will be put in front of each function name
 */
#define AVL_PREFIX	ptr_set_

/*
 * The type that hold the node
 */
#define AVL_NODE_TYPE   ptr_node

/*
 * The type that hold the tree (should be AVL_NODE_TYPE*)
 */
#define AVL_TREE_TYPE   ptr_set

/*
 * The type that hold the tree (should be AVL_NODE_TYPE*)
 */
#define AVL_CONST_TREE_TYPE const ptr_set

/*
 *
 */
#define AVL_TREE_ROOT(__tree__)   (__tree__)->root
/*
 * The type used for comparing the nodes.
 */
#define AVL_REFERENCE_TYPE void*
#define AVL_REFERENCE_IS_POINTER TRUE
#define AVL_REFERENCE_IS_CONST FALSE

/*
 * The node has got a pointer to its parent
 *
 * 0   : disable
 * !=0 : enable
 */
#define AVL_HAS_PARENT_POINTER 1

#ifdef	__cplusplus
}
#endif

#include <dnscore/avl.h.inc>

#ifdef	__cplusplus
extern "C"
{
#endif

/*
 * I recommand setting a define to identify the C part of the template
 * So it can be used to undefine what is not required anymore for every
 * C file but that one.
 *
 */

#ifndef _PTR_SET_COLLECTION_C

#undef AVL_MAX_DEPTH
#undef AVL_PREFIX
#undef AVL_NODE_TYPE
#undef AVL_TREE_TYPE
#undef AVL_CONST_TREE_TYPE
#undef AVL_TREE_ROOT
#undef AVL_REFERENCE_TYPE
#undef AVL_HAS_PARENT_POINTER
#undef AVL_REFERENCE_IS_POINTER
#undef AVL_REFERENCE_IS_CONST
#undef _AVL_H_INC

#endif	/* _PTR_SET_COLLECTION_C */

#ifdef	__cplusplus
}
#endif

#define ptr_set_default_node_compare ptr_set_ptr_node_compare

/**
 * ptr_set comparator function.
 * Compares pointer values.
 * 
 * @param node_a
 * @param node_b
 * @return 
 */

int ptr_set_ptr_node_compare(const void *node_a, const void *node_b);

/**
 * ptr_set comparator function.
 * Compares C-string values.
 * 
 * @param node_a
 * @param node_b
 * @return 
 */

int ptr_set_asciizp_node_compare(const void *node_a, const void *node_b);

/**
 * ptr_set comparator function.
 * Compares dnsname values.
 * 
 * @param node_a
 * @param node_b
 * @return 
 */

int ptr_set_dnsname_node_compare(const void *node_a, const void *node_b);

/**
 * ptr_set comparator function.
 * Compares dnslabel values.
 * 
 * @param node_a
 * @param node_b
 * @return 
 */

int ptr_set_dnslabel_node_compare(const void *node_a, const void *node_b);

// key = asciiz (can be NULL)

/**
 * ptr_set comparator function.
 * Compares C-strings values, NULL is allowed.
 * 
 * @param node_a
 * @param node_b
 * @return 
 */

int ptr_set_nullable_asciizp_node_compare(const void *node_a, const void *node_b);

/**
 * ptr_set comparator function.
 * Compares dnsname values, NULL is allowed.
 * 
 * @param node_a
 * @param node_b
 * @return 
 */

int ptr_set_nullable_dnsname_node_compare(const void *node_a, const void *node_b);

/**
 * ptr_set comparator function.
 * Compares host_address values.
 * 
 * @param node_a
 * @param node_b
 * @return 
 */

int ptr_set_host_address_node_compare(const void *node_a, const void *node_b);

#define PTR_SET_EMPTY {NULL, ptr_set_default_node_compare}
#define PTR_SET_ASCIIZ_EMPTY {NULL, ptr_set_asciizp_node_compare}
#define PTR_SET_DNSNAME_EMPTY {NULL, ptr_set_dnsname_node_compare}
#define PTR_SET_NULLABLE_ASCIIZ_EMPTY {NULL, ptr_set_nullable_asciizp_node_compare}
#define PTR_SET_NULLABLE_DNSNAME_EMPTY {NULL, ptr_set_nullable_dnsname_node_compare}
#define PTR_SET_PTR_EMPTY {NULL, ptr_set_ptr_node_compare}
#define PTR_SET_CUSTOM(comparator___) {NULL, (comparator___)}
#define PTR_SET_HOST_ADDRESS_EMPTY {NULL, ptr_set_host_address_node_compare}

void *ptr_set_avl_iterator_hasnext_next_value(ptr_set_avl_iterator *iterp);

#define FOREACH_PTR_SET(cast__,var__,ptr_set__) ptr_set_avl_iterator PREPROCESSOR_CONCAT_EVAL(foreach_ptr_set_iter,__LINE__); ptr_set_avl_iterator_init((ptr_set__), &PREPROCESSOR_CONCAT_EVAL(foreach_ptr_set_iter,__LINE__)); for(cast__ var__;((var__) = (cast__)ptr_set_avl_iterator_hasnext_next_value(&PREPROCESSOR_CONCAT_EVAL(foreach_ptr_set_iter,__LINE__))) != NULL;)
//#define FOREACH_PTR_SET_KEY_VALUE(castk__,vark__,castv__,varv__,ptr_set__) ptr_set_avl_iterator PREPROCESSOR_CONCAT_EVAL(foreach_ptr_set_iter,__LINE__); ptr_set_avl_iterator_init((ptr_set__), &PREPROCESSOR_CONCAT_EVAL(foreach_ptr_set_iter,__LINE__)); for(varv__ varv__;((varc__) = (cast__)ptr_set_avl_iterator_hasnext_next_key_value(&PREPROCESSOR_CONCAT_EVAL(foreach_ptr_set_iter,__LINE__))) != NULL;)

/*
 * AVL definition part ends here
 */

/** @} */

/*----------------------------------------------------------------------------*/

