Extension of type LIST to handle and implement SET. More...

Functions
trilean	dyn_set_set_len (dyn_c *set, const dyn_ushort len)
	Initialize dynamic element as empty set with maximal length. More...

trilean	dyn_set_insert (dyn_c set, dyn_c element)
	Insert new element into set, if and only if it is not included yet. More...

Detailed Description

Extension of type LIST to handle and implement SET.

Function Documentation

◆ dyn_set_insert()

trilean dyn_set_insert	(	dyn_c *	set,
		dyn_c *	element
	)

Insert new element into set, if and only if it is not included yet.

Before a new element is added, it is checked, whether it is already included or not.

Parameters

[in,out]	set	has to be of type SET
[in]	element	to be added

Return values

DYN_TRUE	if memory for the SET could be allocated
DYN_FALSE	otherwise

Definition at line 48 of file dynamic_set.c.

 {
     dyn_c rslt;
     DYN_INIT(&rslt);
     dyn_set_ref(&rslt, element);
 
     if (dyn_op_in(&rslt, set)) {
         if (!dyn_get_bool(&rslt)) {
             return dyn_list_push(set, element) ? DYN_TRUE : DYN_FALSE;
         }
     }
 
     return DYN_TRUE;
 }

◆ dyn_set_set_len()

trilean dyn_set_set_len	(	dyn_c *	dyn,
		const dyn_ushort	len
	)

Initialize dynamic element as empty set with maximal length.

Generate a set as a list with a maximal available number of preallocated elemens, and change the type of the list to SET. The returned set is empty.