set.h
External header file
setInt.h
Internal header file
setSet.c
Generic Set Data Structure

set.h

External header file

By: Marco Roveri

()
use this to iterate over a set

setInt.h

Internal header file

By: Marco Roveri

See Alsooptional


setSet.c

Generic Set Data Structure

By: Marco Roveri, Roberto Cavada

This package provides an implementation of sets. Sets are ordered, meaning that elements can be traversed in the same chronological order they have been added. Uniqueness is not assured, meaning that you might have to idential sets that are stored into two different structures. This means that you cannot compare two sets by comparing their sets. For further details see the description about the Set_t structure

set_pkg_init()
Initializes the set package
set_pkg_quit()
De-Initializes the set package
Set_MakeEmpty()
Create a generic empty set
Set_Make()
Given a list, builds a corresponding set
Set_MakeSingleton()
Creates a Singleton
Set_MakeFromUnion()
Given an union node, builds a corresponding set
Set_Copy()
Returns the independent copy of a set
Set_ReleaseSet()
Frees a set
Set_ReleaseSetOfSet()
Frees a set of sets
Set_IsEmpty()
Set Emptiness
Set_IsMember()
Set memberships
Set_GiveCardinality()
Set Cardinality
Set_AddMember()
Adds a new element to the set
Set_RemoveMember()
Removes the given element from the set, if found
Set_AddMembersFromList()
Adds all new elements found in list
Set_Contains()
Checks if set1 contains set2
Set_Equals()
Checks if set1 = set2
Set_Intersects()
Checks set1 and set2 has at least one common element
Set_Union()
Set Union
Set_Intersection()
Set intersection
Set_Difference()
Set Difference
Set_GetRest()
Returns the rest of a set from a starting point
Set_Freeze()
Freezes a set
Set_GetFirstIter()
Provides an iterator to the "first" element of the set
Set_GetNextIter()
Given an itarator of a set, returns the iterator pointing to the next chronological element in that set.
Set_IsEndIter()
Returns true if the set iterator is at the end of the iteration
Set_GetMember()
Returns the element at given iterator
Set_Set2List()
Given a set, returns the corresponding list
()
Prints a set
set_create()
Internal constructor
set_copy()
Internal copy constructor
set_copy_actual()
Internal copy constructor
set_destroy()
Internal destructor
set_check_frozen()
This methods checks family counter and returns either a new instance of self
set_check_list()
Fix the internal list if used actually
set_union_to_set_aux()
Given a node (possibly a UNION node) returns the corresponding set

Last updated on 2011/04/06 21h:16