cuex/set.h: Set-Like Terms
[cuex: Expressions]


cuoo_type_t cuex_set_type ()
cu_bool_t cuex_is_set (cuex_t e)
cuex_t cuex_empty_set (void)
cu_bool_t cuex_is_empty_set (cuex_t S)
cuex_t cuex_singleton_set (cuex_t e)
cuex_t cuex_set_insert (cuex_t S, cuex_t e)
cuex_t cuex_set_erase (cuex_t S, cuex_t e)
cuex_t cuex_set_union (cuex_t S0, cuex_t S1)
cuex_t cuex_set_isecn (cuex_t S0, cuex_t S1)
cu_bool_t cuex_set_contains (cuex_t S, cuex_t e)
cu_bool_t cuex_set_subeq (cuex_t S0, cuex_t S1)
cu_order_t cuex_set_order (cuex_t S0, cuex_t S1)
cu_ptr_source_t cuex_set_iter_source (cuex_t S)

Detailed Description

See also:
cuex/semilattice.h: Expression Support for Semilattices
cuex/labelling.h: Association from Constants to Expressions
cuex/atree.h: Associative Trees of Expressions

Function Documentation

cuex_t cuex_empty_set ( void   ) 

The empty set term.

cu_bool_t cuex_is_empty_set ( cuex_t  S  ) 

True iff S is the empty set term.

cu_bool_t cuex_is_set ( cuex_t  e  ) 

True iff e is a set.

cu_bool_t cuex_set_contains ( cuex_t  S,
cuex_t  e 

True iff eS.

cuex_t cuex_set_erase ( cuex_t  S,
cuex_t  e 

Returns Se.

cuex_t cuex_set_insert ( cuex_t  S,
cuex_t  e 

Returns Se.

cuex_t cuex_set_isecn ( cuex_t  S0,
cuex_t  S1 

Returns S0S1.

cu_ptr_source_t cuex_set_iter_source ( cuex_t  S  ) 

A commutative source over all elements of S.

cu_order_t cuex_set_order ( cuex_t  S0,
cuex_t  S1 

Return the most strict ordering predicate R such that S0 R S1.

cu_bool_t cuex_set_subeq ( cuex_t  S0,
cuex_t  S1 

True iff S0S1.

cuoo_type_t cuex_set_type (  ) 

The type of set terms.

cuex_t cuex_set_union ( cuex_t  S0,
cuex_t  S1 

Returns S0S1.

cuex_t cuex_singleton_set ( cuex_t  e  ) 

Returns the singleton set {e}.

Generated 2009-11-23 for culibs-0.25 using Doxygen. Maintained by Petter Urkedal.