mirror of https://github.com/LeOS-GSI/LeOS-Genesis
78 lines
3.6 KiB
C
78 lines
3.6 KiB
C
/**
|
|
* @file CAvl_decl.h
|
|
* @author Ambroz Bizjak <ambrop7@gmail.com>
|
|
*
|
|
* @section LICENSE
|
|
*
|
|
* 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.
|
|
* 3. Neither the name of the author 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 AUTHOR 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.
|
|
*/
|
|
|
|
#include "CAvl_header.h"
|
|
|
|
typedef struct {
|
|
CAvlLink root;
|
|
} CAvl;
|
|
|
|
typedef struct {
|
|
CAvlEntry *ptr;
|
|
CAvlLink link;
|
|
} CAvlRef;
|
|
|
|
static int CAvlIsNullRef (CAvlRef node);
|
|
static int CAvlIsValidRef (CAvlRef node);
|
|
static CAvlRef CAvlDeref (CAvlArg arg, CAvlLink link);
|
|
|
|
static void CAvl_Init (CAvl *o);
|
|
#if !CAVL_PARAM_FEATURE_KEYS_ARE_INDICES
|
|
static int CAvl_Insert (CAvl *o, CAvlArg arg, CAvlRef node, CAvlRef *out_ref);
|
|
#else
|
|
static void CAvl_InsertAt (CAvl *o, CAvlArg arg, CAvlRef node, CAvlCount index);
|
|
#endif
|
|
static void CAvl_Remove (CAvl *o, CAvlArg arg, CAvlRef node);
|
|
#if !CAVL_PARAM_FEATURE_KEYS_ARE_INDICES && !CAVL_PARAM_FEATURE_NOKEYS
|
|
static CAvlRef CAvl_Lookup (const CAvl *o, CAvlArg arg, CAvlKey key);
|
|
static CAvlRef CAvl_LookupExact (const CAvl *o, CAvlArg arg, CAvlKey key);
|
|
static CAvlRef CAvl_GetFirstGreater (const CAvl *o, CAvlArg arg, CAvlKey key);
|
|
static CAvlRef CAvl_GetLastLesser (const CAvl *o, CAvlArg arg, CAvlKey key);
|
|
static CAvlRef CAvl_GetFirstGreaterEqual (const CAvl *o, CAvlArg arg, CAvlKey key);
|
|
static CAvlRef CAvl_GetLastLesserEqual (const CAvl *o, CAvlArg arg, CAvlKey key);
|
|
#endif
|
|
static CAvlRef CAvl_GetFirst (const CAvl *o, CAvlArg arg);
|
|
static CAvlRef CAvl_GetLast (const CAvl *o, CAvlArg arg);
|
|
static CAvlRef CAvl_GetNext (const CAvl *o, CAvlArg arg, CAvlRef node);
|
|
static CAvlRef CAvl_GetPrev (const CAvl *o, CAvlArg arg, CAvlRef node);
|
|
static int CAvl_IsEmpty (const CAvl *o);
|
|
static void CAvl_Verify (const CAvl *o, CAvlArg arg);
|
|
#if CAVL_PARAM_FEATURE_COUNTS
|
|
static CAvlCount CAvl_Count (const CAvl *o, CAvlArg arg);
|
|
static CAvlCount CAvl_IndexOf (const CAvl *o, CAvlArg arg, CAvlRef node);
|
|
static CAvlRef CAvl_GetAt (const CAvl *o, CAvlArg arg, CAvlCount index);
|
|
#endif
|
|
#if CAVL_PARAM_FEATURE_ASSOC
|
|
static CAvlAssoc CAvl_AssocSum (const CAvl *o, CAvlArg arg);
|
|
static CAvlAssoc CAvl_ExclusiveAssocPrefixSum (const CAvl *o, CAvlArg arg, CAvlRef node);
|
|
static CAvlRef CAvl_FindLastExclusiveAssocPrefixSumLesserEqual (const CAvl *o, CAvlArg arg, CAvlAssoc sum, int (*sum_less) (void *, CAvlAssoc, CAvlAssoc), void *user);
|
|
#endif
|
|
|
|
#include "CAvl_footer.h"
|