summaryrefslogtreecommitdiff
path: root/omegalib/omega/include/basic/SimpleList.h
blob: a08b30752aa5eaa39e11423583bea4992a38e9b9 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
#if ! defined _Simple_List_h
#define _Simple_List_h 1

/*
 *  Linked lists with an interface like a bit of libg++'s SLSimple_List class
 */

#include <assert.h>
#include <basic/Iterator.h>
#include <basic/Collection.h>
#include <basic/Link.h>

namespace omega {
  
#define Simple_List Omega_Simple_List
#define Simple_List_Iterator Omega_Simple_List_Iterator

template<class T> class Simple_List_Iterator;

// A TEMPORARY HACK - ERROR IF YOU TRY TO USE "INDEX" - FERD

template<class T> class Simple_List : public Sequence<T> {
public:
  Simple_List(const Simple_List<T> &l)
  { contents = l.contents ? new List_Element<T>(*l.contents) : 0; }
  Simple_List() { contents = 0; }
  virtual ~Simple_List() { delete contents; }

  Iterator<T> *new_iterator();
  const T &operator[](int) const;
  T &operator[](int);

    
  int size() const;
  int length() const { return size(); }
  int empty() const { return size() == 0; }

  T &front() const;

// insertion/deletion on a list invalidates any iterators
// that are on/after the element added/removed

  T remove_front();	       

  void prepend(const T &item);
  void append(const T &item);

  void del_front();
  void clear();

  void join(Simple_List<T> &consumed);

  int index(const T &) const {
		assert(0&&"ILLEGAL SimpleList operation\n");
    return -1;
  }

private:
  friend class Simple_List_Iterator<T>;
  List_Element<T> **end()
  {
    List_Element<T> **e = &contents;
    while (*e)
      e = &((*e)->tail);
    return e;
  }

  List_Element<T> *contents;
};


template<class T> class Simple_List_Iterator : public List_Element_Iterator<T> {
public:
  Simple_List_Iterator(Simple_List<T> &l);
  Simple_List_Iterator(const Simple_List<T> &l);
  Simple_List_Iterator();
private:
  List_Element<T> &element() { return *this->i; } ;
  friend class Simple_List<T>;
};

} // namespace

#if ! defined DONT_INCLUDE_TEMPLATE_CODE
#include <basic/SimpleList.c>
#endif

#define instantiate_Simple_List(T)	template class Simple_List<T>;  \
  template class Simple_List_Iterator<T>;                           \
  instantiate_Only_List_Element(T)                                  \
  instantiate_Sequence(T)

#endif