open62541 1.3.12
Open source implementation of OPC UA
Loading...
Searching...
No Matches
aa_tree.h File Reference

Go to the source code of this file.

Data Structures

struct  aa_entry
 
struct  aa_head
 

Enumerations

enum  aa_cmp
 

Functions

void aa_init (struct aa_head *head, enum aa_cmp(*cmp)(const void *, const void *), unsigned int entry_offset, unsigned int key_offset)
 
void aa_insert (struct aa_head *head, void *elem)
 
void aa_remove (struct aa_head *head, void *elem)
 
void * aa_find (const struct aa_head *head, const void *key)
 
void * aa_min (const struct aa_head *head)
 
void * aa_max (const struct aa_head *head)
 
void * aa_next (const struct aa_head *head, const void *elem)
 
void * aa_prev (const struct aa_head *head, const void *elem)
 

Enumeration Type Documentation

◆ aa_cmp

enum aa_cmp

This Source Code Form is subject to the terms of the Mozilla Public License, v.

2.0. If a copy of the MPL was not distributed with this file, You can obtain one at http://mozilla.org/MPL/2.0/.

Copyright 2020 (c) Fraunhofer IOSB (Author: Julius Pfrommer)

Enumerator
AA_CMP_LESS 
AA_CMP_EQ 
AA_CMP_MORE 

Definition at line 15 of file aa_tree.h.

Function Documentation

◆ aa_init()

void aa_init ( struct aa_head * head,
enum aa_cmp(* cmp )(const void *, const void *),
unsigned int entry_offset,
unsigned int key_offset )

The AA-Tree allows duplicate entries.

The first matching key is returned in aa_find.

◆ aa_insert()

void aa_insert ( struct aa_head * head,
void * elem )

◆ aa_remove()

void aa_remove ( struct aa_head * head,
void * elem )

◆ aa_find()

void * aa_find ( const struct aa_head * head,
const void * key )

◆ aa_min()

void * aa_min ( const struct aa_head * head)

◆ aa_max()

void * aa_max ( const struct aa_head * head)

◆ aa_next()

void * aa_next ( const struct aa_head * head,
const void * elem )

◆ aa_prev()

void * aa_prev ( const struct aa_head * head,
const void * elem )