Back to index

texmacs  1.0.7.15
Private Member Functions | Static Private Attributes | Friends
list< T > Class Template Reference

#include <list.hpp>

Inheritance diagram for list< T >:
Inheritance graph
[legend]

List of all members.

Private Member Functions

 CONCRETE_NULL_TEMPLATE (list, T)
 list (T item)
 list (T item, list< T > next)
 list (T item1, T item2, list< T > next)
 list (T item1, T item2, T item3, list< T > next)
Toperator[] (int i)
 operator tree ()

Static Private Attributes

static list< Tinit = list<T> ()

Friends

bool is_atom LESSGTR (list< T > l)
bool strong_equal LESSGTR (list< T > l1, list< T > l2)

Detailed Description

template<class T>
class list< T >

Definition at line 24 of file list.hpp.


Constructor & Destructor Documentation

template<class T>
TMPL list< T >::list ( T  item) [inline, private]

Definition at line 52 of file list.hpp.

: rep (tm_new<list_rep<T> > (item, list<T> ())) {}
template<class T>
TMPL list< T >::list ( T  item,
list< T next 
) [inline, private]

Definition at line 53 of file list.hpp.

                                              :
  rep (tm_new<list_rep<T> > (item, next)) {}
template<class T>
TMPL list< T >::list ( T  item1,
T  item2,
list< T next 
) [inline, private]

Definition at line 55 of file list.hpp.

                                                        :
  rep (tm_new<list_rep<T> > (item1, list<T> (item2, next))) {}
template<class T>
TMPL list< T >::list ( T  item1,
T  item2,
T  item3,
list< T next 
) [inline, private]

Definition at line 57 of file list.hpp.

                                                                 :
  rep (tm_new<list_rep<T> > (item1, list<T> (item2, item3, next))) {}

Member Function Documentation

template<class T>
list< T >::CONCRETE_NULL_TEMPLATE ( list< T ,
T   
) [private]
template<class T >
list< T >::operator tree ( ) [private]

Definition at line 41 of file list.cpp.

                                          {
  list<T> l;
  int i, n=N(*this);
  tree t (TUPLE, n);
  for (i=0, l=*this; i<n; i++, l=l->next)
    t[i]= as_tree (l->item);
  return t;
}

Here is the call graph for this function:

template<class T >
T & list< T >::operator[] ( int  i) [private]

Definition at line 35 of file list.cpp.

                           {
  ASSERT (rep != NULL, "list too short");
  if (i==0) return rep->item;
  return rep->next[i-1];
}

Friends And Related Function Documentation

template<class T>
bool is_atom LESSGTR ( list< T l) [friend]
template<class T>
bool strong_equal LESSGTR ( list< T l1,
list< T l2 
) [friend]

Member Data Documentation

template<class T>
TMPL list< T > list< T >::init = list<T> () [static, private]

Definition at line 32 of file list.hpp.


The documentation for this class was generated from the following files: