Go to the source code of this file.
Classes
Namespaces
Defines
Functions
- template<typename C > list< C > cons (const C &c, const list< C > &l)
- Return a new list with head
and
tail l.
- template<typename C > const C & car (const list< C > &l)
- Return the head of l.
- template<typename C > C & car (list< C > &l)
- Return the head of l.
- template<typename C > const list< C > & cdr (const list< C > &l)
- Return the tail of l.
- template<typename C > list< C > & cdr (list< C > &l)
- Return the tail of l.
- template<typename C > bool is_nil (const list< C > &l)
- Return true iff is empty.
- DEFINE_UNARY_FORMAT_1 (list) template< typename C > inline format< C > CF(const list< C > &l)
- template<typename C > list_rep< C > * inside (const list< C > &x)
- template<typename C > nat hard_hash (const list< C > &x)
- template<typename C > bool hard_eq (const list< C > &x, const list< C > &y)
- template<typename C > bool hard_neq (const list< C > &x, const list< C > &y)
- template<typename C > const C & read_car (const list< C > &l)
- The same as car.
- template<typename C > const list< C > & read_cdr (const list< C > &l)
- The same as cdr.
- template<typename C > bool is_atom (const list< C > &l)
- Return true iff l has length 1.
- template<typename C > nat N (const list< C > &l)
- Return the number of elements in l.
- template<typename C > const C & read (const list< C > &l, nat i)
- The same as l[i].
- template<typename T , typename F > void set_as (list< T > &r, const vector< F > &l)
- template<typename C , typename T > void set_as (list< C > &r, const T &x)
- template<typename C > iterator< C > iterate (const list< C > &l)
- template<typename Op , typename C > nat unary_hash (const list< C > &ll)
- template<typename Op , typename C > bool binary_test (const list< C > &l1, const list< C > &l2)
- TRUE_IDENTITY_OP_SUGAR (template< typename C >, list< C >) EXACT_IDENTITY_OP_SUGAR(template< typename C >
- template<typename C > list< C > syntactic flatten (const list< C > &l)
- template<typename C > list< C > copy (const list< C > &l)
- template<typename C > list< C > append (const list< C > &l1, const list< C > &l2)
- Return a list comprising all the elements of l1 and l2.
- template<typename C > list< C > operator* (const list< C > &l1, const list< C > &l2)
- template<typename C > list< C > reverse (const list< C > &ll)
- Return the reversed list of l.
- template<typename C > list< C > range (const list< C > &l, nat start, nat end)
- Return a copy of the sublist of l from positions start to end.
- template<typename C > list< C > insert (const list< C > &l, const C &x)
- template<typename C > int find (const list< C > &l, const C &x)
- template<typename C > bool contains (const list< C > &l, const C &x)
- template<typename S1 , typename D > list< D > map (const function_1< D, Argument(S1) > &fun, const list< S1 > &l1, const format< D > &fm)
- template<typename S1 , typename D > list< D > map (D(*fun)(const S1 &), const list< S1 > &x1, const format< D > &fm)
Detailed Description
Definition in file list.hpp.
Define Documentation
#define List_rep list_rep<C> |
#define TMPL template<typename C> |
#define TMPL_DEF template<typename C> |