The Ordered Map Interface. More...

#include "impl/impl_ordered_map.h"
#include "types.h"

Include dependency graph for ordered_map.h:

This graph shows which files directly or indirectly include this file:

Initialization Interface
Initialize the container with memory, callbacks, and permissions.
#define	ccc_om_init(om_name, struct_name, om_elem_field, key_elem_field, alloc_fn, key_cmp, aux)
	Initializes the ordered map at runtime or compile time.

Entry Interface
Obtain and operate on container entries for efficient queries when non-trivial control flow is needed.
#define	ccc_om_insert_r(ordered_map_ptr, key_val_handle_ptr, tmp_ptr)
	Invariantly inserts the key value wrapping key_val_handle_ptr.

#define	ccc_om_try_insert_r(ordered_map_ptr, key_val_handle_ptr)
	Attempts to insert the key value wrapping key_val_handle.

#define	ccc_om_try_insert_w(ordered_map_ptr, key, lazy_value...)
	lazily insert lazy_value into the map at key if key is absent.

#define	ccc_om_insert_or_assign_w(ordered_map_ptr, key, lazy_value...)
	Inserts a new key value pair or overwrites the existing entry.

#define	ccc_om_remove_r(ordered_map_ptr, out_handle_ptr)
	Removes the key value in the map storing the old value, if present, in the struct containing out_handle provided by the user.

#define	ccc_om_entry_r(ordered_map_ptr, key_ptr)
	Obtains an entry for the provided key in the map for future use.

#define	ccc_om_and_modify_w(ordered_map_entry_ptr, type_name, closure_over_T...)
	Modify an Occupied entry with a closure over user type T.

#define	ccc_om_or_insert_w(ordered_map_entry_ptr, lazy_key_value...) ccc_impl_om_or_insert_w(ordered_map_entry_ptr, lazy_key_value)
	Lazily insert the desired key value into the entry if it is Vacant.

#define	ccc_om_insert_entry_w(ordered_map_entry_ptr, lazy_key_value...) ccc_impl_om_insert_entry_w(ordered_map_entry_ptr, lazy_key_value)
	Write the contents of the compound literal lazy_key_value to a node.

#define	ccc_om_remove_entry_r(ordered_map_entry_ptr)
	Remove the entry from the map if Occupied.

ccc_entry	ccc_om_insert (ccc_ordered_map om, ccc_omap_elem key_val_handle, ccc_omap_elem *tmp)
	Invariantly inserts the key value wrapping key_val_handle.

ccc_entry	ccc_om_try_insert (ccc_ordered_map om, ccc_omap_elem key_val_handle)
	Attempts to insert the key value wrapping key_val_handle.

ccc_entry	ccc_om_insert_or_assign (ccc_ordered_map om, ccc_omap_elem key_val_handle)
	Invariantly inserts or overwrites a user struct into the map.

ccc_entry	ccc_om_remove (ccc_ordered_map om, ccc_omap_elem out_handle)
	Removes the key value in the map storing the old value, if present, in the struct containing out_handle provided by the user.

ccc_omap_entry	ccc_om_entry (ccc_ordered_map om, void const key)
	Obtains an entry for the provided key in the map for future use.

ccc_omap_entry *	ccc_om_and_modify (ccc_omap_entry e, ccc_update_fn fn)
	Modifies the provided entry if it is Occupied.

ccc_omap_entry *	ccc_om_and_modify_aux (ccc_omap_entry e, ccc_update_fn fn, void *aux)
	Modifies the provided entry if it is Occupied.

void *	ccc_om_or_insert (ccc_omap_entry const e, ccc_omap_elem elem)
	Inserts the struct with handle elem if the entry is Vacant.

void *	ccc_om_insert_entry (ccc_omap_entry const e, ccc_omap_elem elem)
	Inserts the provided entry invariantly.

ccc_entry	ccc_om_remove_entry (ccc_omap_entry *e)
	Remove the entry from the map if Occupied.

void *	ccc_om_unwrap (ccc_omap_entry const *e)
	Unwraps the provided entry to obtain a view into the map element.

bool	ccc_om_occupied (ccc_omap_entry const *e)
	Returns the Vacant or Occupied status of the entry.

bool	ccc_om_insert_error (ccc_omap_entry const *e)
	Provides the status of the entry should an insertion follow.

ccc_entry_status	ccc_om_entry_status (ccc_omap_entry const *e)
	Obtain the entry status from a container entry.

Iterator Interface
Obtain and manage iterators over the container.
#define	ccc_om_equal_range_r(ordered_map_ptr, begin_and_end_key_ptrs...)
	Returns a compound literal reference to the desired range. Amortized O(lg N).

#define	ccc_om_equal_rrange_r(ordered_map_ptr, rbegin_and_rend_key_ptrs...)
	Returns a compound literal reference to the desired rrange. Amortized O(lg N).

ccc_range	ccc_om_equal_range (ccc_ordered_map om, void const begin_key, void const *end_key)
	Return an iterable range of values from [begin_key, end_key). Amortized O(lg N).

ccc_rrange	ccc_om_equal_rrange (ccc_ordered_map om, void const rbegin_key, void const *rend_key)
	Return an iterable rrange of values from [begin_key, end_key). Amortized O(lg N).

void *	ccc_om_begin (ccc_ordered_map const *om)
	Return the start of an inorder traversal of the map. Amortized O(lg N).

void *	ccc_om_rbegin (ccc_ordered_map const *om)
	Return the start of a reverse inorder traversal of the map. Amortized O(lg N).

void *	ccc_om_next (ccc_ordered_map const om, ccc_omap_elem const iter_handle)
	Return the next element in an inorder traversal of the map. O(1).

void *	ccc_om_rnext (ccc_ordered_map const om, ccc_omap_elem const iter_handle)
	Return the rnext element in a reverse inorder traversal of the map. O(1).

void *	ccc_om_end (ccc_ordered_map const *om)
	Return the end of an inorder traversal of the map. O(1).

void *	ccc_om_rend (ccc_ordered_map const *om)
	Return the rend of a reverse inorder traversal of the map. O(1).

Container Types
Types available in the container interface.
typedef union ccc_ordered_map_	ccc_ordered_map
	A self-optimizing data structure offering amortized O(lg N) search, insert, and erase and pointer stability.

typedef union ccc_omap_elem_	ccc_omap_elem
	The intrusive element for the user defined struct being stored in the map.

typedef union ccc_omap_entry_	ccc_omap_entry
	A container specific entry used to implement the Entry Interface.

Membership Interface
Test membership or obtain references to stored user types directly.
bool	ccc_om_contains (ccc_ordered_map om, void const key)
	Searches the map for the presence of key.

void *	ccc_om_get_key_val (ccc_ordered_map om, void const key)
	Returns a reference into the map at entry key.

Deallocation Interface
Destroy the container.
ccc_result	ccc_om_clear (ccc_ordered_map om, ccc_destructor_fn destructor)
	Pops every element from the map calling destructor if destructor is non-NULL. O(N).

State Interface
Obtain the container state.
bool	ccc_om_is_empty (ccc_ordered_map const *om)
	Returns the size status of the map.

size_t	ccc_om_size (ccc_ordered_map const *om)
	Returns the size of the map.

bool	ccc_om_validate (ccc_ordered_map const *om)
	Validation of invariants for the map.

Detailed Description

The Ordered Map Interface.

An ordered map offers storage and retrieval elements by key. Because the data structure is self-optimizing it is not suitable map in a realtime environment where strict runtime bounds are needed. Also, searching the map is not a const thread-safe operation as indicated by the function signatures. The map is optimized upon every new search. However, in many cases the self-optimizing structure of the map can be beneficial when considering non-uniform access patterns. In the best case, repeated searches of the same value yield an O(1) access and many other frequently searched values will remain close to the root

To shorten names in the interface, define the following preprocessor directive at the top of your file.

#define ORDERED_MAP_USING_NAMESPACE_CCC

All types and functions can then be written without the ccc_ prefix.

Macro Definition Documentation

◆ ccc_om_and_modify_w

#define ccc_om_and_modify_w	(	ordered_map_entry_ptr,
		type_name,
		closure_over_T...
	)

Value:

    &(ccc_omap_entry)                                                          \
    {                                                                          \
        ccc_impl_om_and_modify_w(ordered_map_entry_ptr, type_name,             \
                                 closure_over_T)                               \
    }

Modify an Occupied entry with a closure over user type T.

Parameters

[in]	ordered_map_entry_ptr	a pointer to the obtained entry.
[in]	type_name	the name of the user type stored in the container.
[in]	closure_over_T	the code to be run on the reference to user type T, if Occupied. This may be a semicolon separated list of statements to execute on T or a section of code wrapped in braces {code here} which may be preferred for formatting.

Returns: a compound literal reference to the modified entry if it was occupied or a vacant entry if it was vacant.

Note: T is a reference to the user type stored in the entry guaranteed to be non-NULL if the closure executes.

#define ORDERED_MAP_USING_NAMESPACE_CCC
// Increment the key k if found otherwise do nothing.
om_entry *e = om_and_modify_w(entry_r(&om, &k), word, T->cnt++;);
 
// Increment the key k if found otherwise insert a default value.
word *w = om_or_insert_w(om_and_modify_w(entry_r(&om, &k), word,
                                         { T->cnt++; }),
                         (word){.key = k, .cnt = 1});

Note that any code written is only evaluated if the entry is Occupied and the container can deliver the user type T. This means any function calls are lazily evaluated in the closure scope.

◆ ccc_om_entry_r

#define ccc_om_entry_r	(	ordered_map_ptr,
		key_ptr
	)

Value:

    &(ccc_omap_entry)                                                          \
    {                                                                          \
        ccc_om_entry((ordered_map_ptr), (key_ptr)).impl_                       \
    }

Obtains an entry for the provided key in the map for future use.

Parameters

[in]	ordered_map_ptr	the map to be searched.
[in]	key_ptr	the key used to search the map matching the stored key type.

Returns: a compound literal reference to a specialized entry for use with other functions in the Entry Interface.

Warning: the contents of an entry should not be examined or modified. Use the provided functions, only.

An entry is a search result that provides either an Occupied or Vacant entry in the map. An occupied entry signifies that the search was successful. A Vacant entry means the search was not successful but a handle is gained to where in the map such an element should be inserted.

An entry is rarely useful on its own. It should be passed in a functional style to subsequent calls in the Entry Interface.

◆ ccc_om_equal_range_r

#define ccc_om_equal_range_r	(	ordered_map_ptr,
		begin_and_end_key_ptrs...
	)

Value:

    &(ccc_range)                                                               \
    {                                                                          \
        ccc_om_equal_range(ordered_map_ptr, begin_and_end_key_ptrs).impl_      \
    }

Returns a compound literal reference to the desired range. Amortized O(lg N).

Parameters

[in]	ordered_map_ptr	a pointer to the map.
[in]	begin_and_end_key_ptrs	two pointers, one to the start of the range and a second to the end of the range.

Returns: a compound literal reference to the produced range associated with the enclosing scope. This reference is always non-NULL.

◆ ccc_om_equal_rrange_r

#define ccc_om_equal_rrange_r	(	ordered_map_ptr,
		rbegin_and_rend_key_ptrs...
	)

Value:

    &(ccc_rrange)                                                              \
    {                                                                          \
        ccc_om_equal_rrange(ordered_map_ptr, rbegin_and_rend_key_ptrs).impl_   \
    }

Returns a compound literal reference to the desired rrange. Amortized O(lg N).

Parameters

[in]	ordered_map_ptr	a pointer to the map.
[in]	rbegin_and_rend_key_ptrs	two pointers, one to the start of the rrange and a second to the end of the rrange.

Returns: a compound literal reference to the produced rrange associated with the enclosing scope. This reference is always non-NULL.

◆ ccc_om_init

#define ccc_om_init	(	om_name,
		struct_name,
		om_elem_field,
		key_elem_field,
		alloc_fn,
		key_cmp,
		aux
	)

Value:

ccc_impl_om_init(om_name, struct_name, om_elem_field, key_elem_field, \

alloc_fn, key_cmp, aux)

Initializes the ordered map at runtime or compile time.

Parameters

[in]	om_name	the name of the ordered map being initialized.
[in]	struct_name	the user type wrapping the intrusive element.
[in]	om_elem_field	the name of the intrusive map elem field.
[in]	key_elem_field	the name of the field in user type used as key.
[in]	alloc_fn	the allocation function or NULL if allocation is banned.
[in]	key_cmp	the key comparison function (see types.h).
[in]	aux	a pointer to any auxiliary data for comparison or destruction.

Returns: the struct initialized ordered map for direct assignment (i.e. ccc_ordered_map m = ccc_om_init(...);).

◆ ccc_om_insert_entry_w

#define ccc_om_insert_entry_w	(	ordered_map_entry_ptr,
		lazy_key_value...
	)	ccc_impl_om_insert_entry_w(ordered_map_entry_ptr, lazy_key_value)

Write the contents of the compound literal lazy_key_value to a node.

Parameters

[in]	ordered_map_entry_ptr	a pointer to the obtained entry.
[in]	lazy_key_value	the compound literal to write to a new slot.

Returns: a reference to the newly inserted or overwritten user type. NULL is returned if allocation failed or is not allowed when required.

◆ ccc_om_insert_or_assign_w

#define ccc_om_insert_or_assign_w	(	ordered_map_ptr,
		key,
		lazy_value...
	)

Value:

    &(ccc_entry)                                                               \
    {                                                                          \
        ccc_impl_om_insert_or_assign_w(ordered_map_ptr, key, lazy_value)       \
    }

Inserts a new key value pair or overwrites the existing entry.

Parameters

[in]	ordered_map_ptr	the pointer to the flat hash map.
[in]	key	the key to be searched in the map.
[in]	lazy_value	the compound literal to insert or use for overwrite.

Returns: a compound literal reference to the entry of the existing or newly inserted value. Occupied indicates the key existed, Vacant indicates the key was absent. Unwrapping in any case provides the current value unless an error occurs that prevents insertion. An insertion error will flag such a case.

Note that for brevity and convenience the user need not write the key to the lazy value compound literal as well. This function ensures the key in the compound literal matches the searched key.

◆ ccc_om_insert_r

#define ccc_om_insert_r	(	ordered_map_ptr,
		key_val_handle_ptr,
		tmp_ptr
	)

Value:

    &(ccc_entry)                                                               \
    {                                                                          \
        ccc_om_insert((ordered_map_ptr), (key_val_handle_ptr), (tmp_ptr))      \
            .impl_                                                             \
    }

Invariantly inserts the key value wrapping key_val_handle_ptr.

Parameters

[in]	ordered_map_ptr	the pointer to the ordered map.
[in]	key_val_handle_ptr	the handle to the user type wrapping map elem.
[in]	tmp_ptr	handle to space for swapping in the old value, if present. The same user type stored in the map should wrap tmp_ptr.

Returns: a compound literal reference to an entry. If Vacant, no prior element with key existed and the type wrapping tmp_ptr remains unchanged. If Occupied the old value is written to the type wrapping tmp_ptr and may be unwrapped to view. If more space is needed but allocation fails or has been forbidden, an insert error is set.

Note that this function may write to the struct containing tmp_ptr and wraps it in an entry to provide information about the old value.

◆ ccc_om_or_insert_w

#define ccc_om_or_insert_w	(	ordered_map_entry_ptr,
		lazy_key_value...
	)	ccc_impl_om_or_insert_w(ordered_map_entry_ptr, lazy_key_value)

Lazily insert the desired key value into the entry if it is Vacant.

Parameters

[in]	ordered_map_entry_ptr	a pointer to the obtained entry.
[in]	lazy_key_value	the compound literal to construct in place if the entry is Vacant.

Returns: a reference to the unwrapped user type in the entry, either the unmodified reference if the entry was Occupied or the newly inserted element if the entry was Vacant. NULL is returned if resizing is required but fails or is not allowed.

Note that if the compound literal uses any function calls to generate values or other data, such functions will not be called if the entry is Occupied.

◆ ccc_om_remove_entry_r

#define ccc_om_remove_entry_r ( ordered_map_entry_ptr )

Value:

    &(ccc_entry)                                                               \
    {                                                                          \
        ccc_om_remove_entry((ordered_map_entry_ptr)).impl_                     \
    }

Remove the entry from the map if Occupied.

Parameters

[in] ordered_map_entry_ptr a pointer to the map entry.

Returns: a compound literal reference to an entry containing NULL or a reference to the old entry. If Occupied an entry in the map existed and was removed. If Vacant, no prior entry existed to be removed.

Note that if allocation is permitted the old element is freed and the entry will contain a NULL reference. If allocation is prohibited the entry can be unwrapped to obtain the old user struct stored in the map and the user may free or use as needed.

◆ ccc_om_remove_r

#define ccc_om_remove_r	(	ordered_map_ptr,
		out_handle_ptr
	)

Value:

    &(ccc_entry)                                                               \
    {                                                                          \
        ccc_om_remove((ordered_map_ptr), (out_handle_ptr)).impl_               \
    }

Removes the key value in the map storing the old value, if present, in the struct containing out_handle provided by the user.

Parameters

[in]	ordered_map_ptr	the pointer to the ordered map.
[out]	out_handle_ptr	the handle to the user type wrapping map elem.

Returns: a compound literal reference to the removed entry. If Occupied it may be unwrapped to obtain the old key value pair. If Vacant the key value pair was not stored in the map. If bad input is provided an input error is set.

Note that this function may write to the struct containing the second parameter and wraps it in an entry to provide information about the old value.

If allocation has been prohibited upon initialization then the entry returned contains the previously stored user type, if any, and nothing is written to the out_handle. It is then the user's responsibility to manage their previously stored memory as they see fit.

◆ ccc_om_try_insert_r

#define ccc_om_try_insert_r	(	ordered_map_ptr,
		key_val_handle_ptr
	)

Value:

    &(ccc_entry)                                                               \
    {                                                                          \
        ccc_om_try_insert((ordered_map_ptr), (key_val_handle_ptr)).impl_       \
    }

Attempts to insert the key value wrapping key_val_handle.

Parameters

[in]	ordered_map_ptr	the pointer to the map.
[in]	key_val_handle_ptr	the handle to the user type wrapping map elem.

Returns: a compound literal reference to an entry. If Occupied, the entry contains a reference to the key value user type in the map and may be unwrapped. If Vacant the entry contains a reference to the newly inserted entry in the map. If more space is needed but allocation fails or has been forbidden, an insert error is set.

◆ ccc_om_try_insert_w

#define ccc_om_try_insert_w	(	ordered_map_ptr,
		key,
		lazy_value...
	)

Value:

    &(ccc_entry)                                                               \
    {                                                                          \
        ccc_impl_om_try_insert_w(ordered_map_ptr, key, lazy_value)             \
    }

lazily insert lazy_value into the map at key if key is absent.

Parameters

[in]	ordered_map_ptr	a pointer to the map.
[in]	key	the direct key r-value.
[in]	lazy_value	the compound literal specifying the value.

Returns: a compound literal reference to the entry of the existing or newly inserted value. Occupied indicates the key existed, Vacant indicates the key was absent. Unwrapping in any case provides the current value unless an error occurs that prevents insertion. An insertion error will flag such a case.

Note that for brevity and convenience the user need not write the key to the lazy value compound literal as well. This function ensures the key in the compound literal matches the searched key.

Typedef Documentation

◆ ccc_omap_elem

typedef union ccc_omap_elem_ ccc_omap_elem

The intrusive element for the user defined struct being stored in the map.

Note that if allocation is not permitted, insertions functions accepting this type as an argument assume it to exist in pre-allocated memory that will exist with the appropriate lifetime and scope for the user's needs; the container does not allocate or free in this case.

◆ ccc_omap_entry

typedef union ccc_omap_entry_ ccc_omap_entry

A container specific entry used to implement the Entry Interface.

The Entry Interface offers efficient search and subsequent insertion, deletion, or value update based on the needs of the user.

◆ ccc_ordered_map

typedef union ccc_ordered_map_ ccc_ordered_map

A self-optimizing data structure offering amortized O(lg N) search, insert, and erase and pointer stability.

Warning: it is undefined behavior to access an uninitialized container.

An ordered map can be initialized on the stack, heap, or data segment at runtime or compile time.

Function Documentation

◆ ccc_om_and_modify()

ccc_omap_entry * ccc_om_and_modify	(	ccc_omap_entry *	e,
		ccc_update_fn *	fn
	)

Modifies the provided entry if it is Occupied.

Parameters

[in]	e	the entry obtained from an entry function or macro.
[in]	fn	an update function in which the auxiliary argument is unused.

Returns: the updated entry if it was Occupied or the unmodified vacant entry.

This function is intended to make the function chaining in the Entry Interface more succinct if the entry will be modified in place based on its own value without the need of the auxiliary argument a ccc_update_fn can provide.

◆ ccc_om_and_modify_aux()

ccc_omap_entry * ccc_om_and_modify_aux	(	ccc_omap_entry *	e,
		ccc_update_fn *	fn,
		void *	aux
	)

Modifies the provided entry if it is Occupied.

Parameters

[in]	e	the entry obtained from an entry function or macro.
[in]	fn	an update function that requires auxiliary data.
[in]	aux	auxiliary data required for the update.

Returns: the updated entry if it was Occupied or the unmodified vacant entry.

This function makes full use of a ccc_update_fn capability, meaning a complete ccc_update object will be passed to the update function callback.

◆ ccc_om_begin()

void * ccc_om_begin ( ccc_ordered_map const * om )

Return the start of an inorder traversal of the map. Amortized O(lg N).

Parameters

[in] om a pointer to the map.

Returns: the oldest minimum element of the map.

◆ ccc_om_clear()

ccc_result ccc_om_clear	(	ccc_ordered_map *	om,
		ccc_destructor_fn *	destructor
	)

Pops every element from the map calling destructor if destructor is non-NULL. O(N).

Parameters

[in]	om	a pointer to the map.
[in]	destructor	a destructor function if required. NULL if unneeded.

Returns: an input error if om points to NULL otherwise OK.

Note that if the map has been given permission to allocate, the destructor will be called on each element before it uses the provided allocator to free the element. Therefore, the destructor should not free the element or a double free will occur.

If the container has not been given allocation permission, then the destructor may free elements or not depending on how and when the user wishes to free elements of the map according to their own memory management schemes.

◆ ccc_om_contains()

bool ccc_om_contains	(	ccc_ordered_map *	om,
		void const *	key
	)

Searches the map for the presence of key.

Parameters

[in]	om	the map to be searched.
[in]	key	pointer to the key matching the key type of the user struct.

Returns: true if the struct containing key is stored, false if not.

◆ ccc_om_end()

void * ccc_om_end ( ccc_ordered_map const * om )

Return the end of an inorder traversal of the map. O(1).

Parameters

[in] om a pointer to the map.

Returns: the newest maximum element of the map.

◆ ccc_om_entry()

ccc_omap_entry ccc_om_entry	(	ccc_ordered_map *	om,
		void const *	key
	)

Obtains an entry for the provided key in the map for future use.

Parameters

[in]	om	the map to be searched.
[in]	key	the key used to search the map matching the stored key type.

Returns: a specialized entry for use with other functions in the Entry Interface.

Warning: the contents of an entry should not be examined or modified. Use the provided functions, only.

An entry is a search result that provides either an Occupied or Vacant entry in the map. An occupied entry signifies that the search was successful. A Vacant entry means the search was not successful but a handle is gained to where in the map such an element should be inserted.

An entry is rarely useful on its own. It should be passed in a functional style to subsequent calls in the Entry Interface.

◆ ccc_om_entry_status()

ccc_entry_status ccc_om_entry_status ( ccc_omap_entry const * e )

Obtain the entry status from a container entry.

Parameters

[in] e a pointer to the entry.

Returns: the status stored in the entry after the required action on the container completes. If e is NULL an entry input error is returned so ensure e is non-NULL to avoid an inaccurate status returned.

Note that this function can be useful for debugging or if more detailed messages are needed for logging purposes. See ccc_entry_status_msg() in ccc/types.h for more information on detailed entry statuses.

◆ ccc_om_equal_range()

ccc_range ccc_om_equal_range	(	ccc_ordered_map *	om,
		void const *	begin_key,
		void const *	end_key
	)

Return an iterable range of values from [begin_key, end_key). Amortized O(lg N).

Parameters

[in]	om	a pointer to the map.
[in]	begin_key	a pointer to the key intended as the start of the range.
[in]	end_key	a pointer to the key intended as the end of the range.

Returns: a range containing the first element NOT LESS than the begin_key and the first element GREATER than end_key.

Note that due to the variety of values that can be returned in the range, using the provided range iteration functions from types.h is recommended for example:

for (struct val *i = range_begin(&range);
     i != end_range(&range);
     i = next(&om, &i->elem))
{}

This avoids any possible errors in handling an end range element that is in the map versus the end map sentinel.

◆ ccc_om_equal_rrange()

ccc_rrange ccc_om_equal_rrange	(	ccc_ordered_map *	om,
		void const *	rbegin_key,
		void const *	rend_key
	)

Return an iterable rrange of values from [begin_key, end_key). Amortized O(lg N).

Parameters

[in]	om	a pointer to the map.
[in]	rbegin_key	a pointer to the key intended as the start of the rrange.
[in]	rend_key	a pointer to the key intended as the end of the rrange.

Returns: a rrange containing the first element NOT GREATER than the begin_key and the first element LESS than rend_key.

Note that due to the variety of values that can be returned in the rrange, using the provided rrange iteration functions from types.h is recommended for example:

for (struct val *i = rrange_begin(&rrange);
     i != rend_rrange(&rrange);
     i = rnext(&om, &i->elem))
{}

This avoids any possible errors in handling an rend rrange element that is in the map versus the end map sentinel.

◆ ccc_om_get_key_val()

void * ccc_om_get_key_val	(	ccc_ordered_map *	om,
		void const *	key
	)

Returns a reference into the map at entry key.

Parameters

[in]	om	the ordered map to search.
[in]	key	the key to search matching stored key type.

Returns: a view of the map entry if it is present, else NULL.

◆ ccc_om_insert()

ccc_entry ccc_om_insert	(	ccc_ordered_map *	om,
		ccc_omap_elem *	key_val_handle,
		ccc_omap_elem *	tmp
	)

Invariantly inserts the key value wrapping key_val_handle.

Parameters

[in]	om	the pointer to the ordered map.
[in]	key_val_handle	the handle to the user type wrapping map elem.
[in]	tmp	handle to space for swapping in the old value, if present. The same user type stored in the map should wrap tmp.

Returns: an entry. If Vacant, no prior element with key existed and the type wrapping tmp remains unchanged. If Occupied the old value is written to the type wrapping tmp and may be unwrapped to view. If more space is needed but allocation fails or has been forbidden, an insert error is set.

Note that this function may write to the struct containing tmp and wraps it in an entry to provide information about the old value.

◆ ccc_om_insert_entry()

void * ccc_om_insert_entry	(	ccc_omap_entry const *	e,
		ccc_omap_elem *	elem
	)

Inserts the provided entry invariantly.

Parameters

[in]	e	the entry returned from a call obtaining an entry.
[in]	elem	a handle to the struct the user intends to insert.

Returns: a pointer to the inserted element or NULL upon allocation failure.

This method can be used when the old value in the map does not need to be preserved. See the regular insert method if the old value is of interest.

◆ ccc_om_insert_error()

bool ccc_om_insert_error ( ccc_omap_entry const * e )

Provides the status of the entry should an insertion follow.

Parameters

[in] e the entry from a query to the table via function or macro.

Returns: true if an entry obtained from an insertion attempt failed to insert due to an allocation failure when allocation success was expected.

◆ ccc_om_insert_or_assign()

ccc_entry ccc_om_insert_or_assign	(	ccc_ordered_map *	om,
		ccc_omap_elem *	key_val_handle
	)

Invariantly inserts or overwrites a user struct into the map.

Parameters

[in]	om	a pointer to the flat hash map.
[in]	key_val_handle	the handle to the wrapping user struct key value.

Returns: an entry. If Occupied an entry was overwritten by the new key value. If Vacant no prior map entry existed.

Note that this function can be used when the old user type is not needed but the information regarding its presence is helpful.

◆ ccc_om_is_empty()

bool ccc_om_is_empty ( ccc_ordered_map const * om )

Returns the size status of the map.

Parameters

[in] om the map.

Returns: true if empty else false.

◆ ccc_om_next()

void * ccc_om_next	(	ccc_ordered_map const *	om,
		ccc_omap_elem const *	iter_handle
	)

Return the next element in an inorder traversal of the map. O(1).

Parameters

[in]	om	a pointer to the map.
[in]	iter_handle	a pointer to the intrusive map element of the current iterator.

Returns: the next user type stored in the map in an inorder traversal.

◆ ccc_om_occupied()

bool ccc_om_occupied ( ccc_omap_entry const * e )

Returns the Vacant or Occupied status of the entry.

Parameters

[in] e the entry from a query to the map via function or macro.

Returns: true if the entry is occupied, false if not.

◆ ccc_om_or_insert()

void * ccc_om_or_insert	(	ccc_omap_entry const *	e,
		ccc_omap_elem *	elem
	)

Inserts the struct with handle elem if the entry is Vacant.

Parameters

[in]	e	the entry obtained via function or macro call.
[in]	elem	the handle to the struct to be inserted to a Vacant entry.

Returns: a pointer to entry in the map invariantly. NULL on error.

Because this functions takes an entry and inserts if it is Vacant, the only reason NULL shall be returned is when an insertion error occurs, usually due to a user struct allocation failure.

If no allocation is permitted, this function assumes the user struct wrapping elem has been allocated with the appropriate lifetime and scope by the user.

◆ ccc_om_rbegin()

void * ccc_om_rbegin ( ccc_ordered_map const * om )

Return the start of a reverse inorder traversal of the map. Amortized O(lg N).

Parameters

[in] om a pointer to the map.

Returns: the oldest maximum element of the map.

◆ ccc_om_remove()

ccc_entry ccc_om_remove	(	ccc_ordered_map *	om,
		ccc_omap_elem *	out_handle
	)

Removes the key value in the map storing the old value, if present, in the struct containing out_handle provided by the user.

Parameters

[in]	om	the pointer to the ordered map.
[out]	out_handle	the handle to the user type wrapping map elem.

Returns: the removed entry. If Occupied it may be unwrapped to obtain the old key value pair. If Vacant the key value pair was not stored in the map. If bad input is provided an input error is set.

Note that this function may write to the struct containing the second parameter and wraps it in an entry to provide information about the old value.

If allocation has been prohibited upon initialization then the entry returned contains the previously stored user type, if any, and nothing is written to the out_handle. It is then the user's responsibility to manage their previously stored memory as they see fit.

◆ ccc_om_remove_entry()

ccc_entry ccc_om_remove_entry ( ccc_omap_entry * e )

Remove the entry from the map if Occupied.

Parameters

[in] e a pointer to the map entry.

Returns: an entry containing NULL or a reference to the old entry. If Occupied an entry in the map existed and was removed. If Vacant, no prior entry existed to be removed.

Note that if allocation is permitted the old element is freed and the entry will contain a NULL reference. If allocation is prohibited the entry can be unwrapped to obtain the old user struct stored in the map and the user may free or use as needed.

◆ ccc_om_rend()

void * ccc_om_rend ( ccc_ordered_map const * om )

Return the rend of a reverse inorder traversal of the map. O(1).

Parameters

[in] om a pointer to the map.

Returns: the newest minimum element of the map.

◆ ccc_om_rnext()

void * ccc_om_rnext	(	ccc_ordered_map const *	om,
		ccc_omap_elem const *	iter_handle
	)

Return the rnext element in a reverse inorder traversal of the map. O(1).

Parameters

[in]	om	a pointer to the map.
[in]	iter_handle	a pointer to the intrusive map element of the current iterator.

Returns: the rnext user type stored in the map in a reverse inorder traversal.

◆ ccc_om_size()

size_t ccc_om_size ( ccc_ordered_map const * om )

Returns the size of the map.

Parameters

[in] om the map.

Returns: the size_t size.

◆ ccc_om_try_insert()

ccc_entry ccc_om_try_insert	(	ccc_ordered_map *	om,
		ccc_omap_elem *	key_val_handle
	)

Attempts to insert the key value wrapping key_val_handle.

Parameters

[in]	om	the pointer to the map.
[in]	key_val_handle	the handle to the user type wrapping map elem.

Returns: an entry. If Occupied, the entry contains a reference to the key value user type in the map and may be unwrapped. If Vacant the entry contains a reference to the newly inserted entry in the map. If more space is needed but allocation fails, an insert error is set.

◆ ccc_om_unwrap()

void * ccc_om_unwrap ( ccc_omap_entry const * e )

Unwraps the provided entry to obtain a view into the map element.

Parameters

[in] e the entry from a query to the map via function or macro.

Returns: a view into the table entry if one is present, or NULL.

◆ ccc_om_validate()

bool ccc_om_validate ( ccc_ordered_map const * om )

Validation of invariants for the map.

Parameters

[in] om the map to validate.

Returns: true if all invariants hold, false if corruption occurs.

Initialization Interface

Entry Interface

Iterator Interface

Container Types

Membership Interface

Deallocation Interface

State Interface

Detailed Description

Macro Definition Documentation

◆ ccc_om_and_modify_w

◆ ccc_om_entry_r

◆ ccc_om_equal_range_r

◆ ccc_om_equal_rrange_r

◆ ccc_om_init

◆ ccc_om_insert_entry_w

◆ ccc_om_insert_or_assign_w

◆ ccc_om_insert_r

◆ ccc_om_or_insert_w

◆ ccc_om_remove_entry_r

◆ ccc_om_remove_r

◆ ccc_om_try_insert_r

◆ ccc_om_try_insert_w

Typedef Documentation

◆ ccc_omap_elem

◆ ccc_omap_entry

◆ ccc_ordered_map

Function Documentation

◆ ccc_om_and_modify()

◆ ccc_om_and_modify_aux()

◆ ccc_om_begin()

◆ ccc_om_clear()

◆ ccc_om_contains()

◆ ccc_om_end()

◆ ccc_om_entry()

◆ ccc_om_entry_status()

◆ ccc_om_equal_range()

◆ ccc_om_equal_rrange()

◆ ccc_om_get_key_val()

◆ ccc_om_insert()

◆ ccc_om_insert_entry()

◆ ccc_om_insert_error()

◆ ccc_om_insert_or_assign()

◆ ccc_om_is_empty()

◆ ccc_om_next()

◆ ccc_om_occupied()

◆ ccc_om_or_insert()

◆ ccc_om_rbegin()

◆ ccc_om_remove()

◆ ccc_om_remove_entry()

◆ ccc_om_rend()

◆ ccc_om_rnext()

◆ ccc_om_size()

◆ ccc_om_try_insert()

◆ ccc_om_unwrap()

◆ ccc_om_validate()