- Link_array (Array<void *> const &v)
- :Array<void *> (v)
- {
- }
-
-public:
- Link_array ()
- {
- }
-
- T *const &back() const
- {
- return (T * const &) Array<void *>::back();
- }
-
- T *&back ()
- {
- return (T *&) Array<void *>::back ();
- }
-
- Array<void *>::begin;
- Array<void *>::end;
- Array<void *>::clear;
- Array<void *>::erase;
- Array<void *>::resize;
- Array<void *>::size;
- Array<void *>::empty;
- Array<void *>::pop_back;
-
-
- /* Flower compat */
- Array<void *>::unordered_del;
- Array<void *>::reverse;
- Array<void *>::tighten_maxsize;
-
- static int default_compare (T *const &p1, T *const &p2)
- {
- /* can't do p1 -p2, since T might be an incomplete type */
- if (p1 < p2)
- return -1;
- if (p2 < p1)
- return 1;
- return 0;
- }
- Link_array (T *const *tp, int n)
- : Array<void *> ((void **)tp, n)
- {
- }
-
- Link_array (Link_array<T> const &src)
- : Array<void *> (src)
- {
- }
-
- T *at (int i)
- {
- return (T *) Array<void *>::at (i);
- }
- T const *at (int i) const
- {
- return (T const *) Array<void *>::at (i);
- }
-
- /// access element
- T *&operator [] (int i)
- {
- return (T *&) Array<void *>::at (i);
- }
- /// access element
- T *const operator [] (int i) const
- {
- return (T *const) Array<void *>::at (i);
- }
- T *pop ()
- {
- T* t = (T *) Array<void *>::back ();
- pop_back ();
- return t;
- }
- void insert (iterator b, T *t)
- {
- Array<void *>::insert (b, t);
- }
- void insert (iterator pos, const_iterator b, const_iterator e)
- {
- Array<void *>::insert (pos, b, e);
- }
- void push_back (T *t)
- {
- Array<void *>::push_back (t);
- }
-
- /// return last entry
- T *top (int j) const
- {
- return (T *) Array<void *>::top (j);
- }
- T *& top (int i)
- {
- return (T *&) Array<void *>::top (i);
- }
-
- void substitute (T *old, T *new_p)
- {
- int i;
- while ((i = find_index (old)) >= 0)
- if (new_p)
- at (i) = new_p;
- else
- erase (begin () + i);
- }
- void unordered_substitute (T *old, T *new_p)
- {
- int i;
- while ((i = find_index (old)) >= 0)
- if (new_p)
- at (i) = new_p;
- else
- unordered_del (i);
- }
- void default_sort ()
- {
- sort (default_compare);
- }
-
- // quicksort.
- void sort (int (*compare) (T *const &, T *const &),
- int lower = -1, int upper = -1);
-
- void uniq ()
- {
- Link_array<T> ls;
- for (vsize i = 0; i < size (); i++)
- if (!i || at (i - 1) != at (i))
- ls.push_back (at (i));
- *this = ls;
- }
-
- T *& boundary (int d, int i)
- {
- assert (d);
- if (d == 1)
- return top (i);
- else
- return at (i);
- }
- T *boundary (int d, int i)const
- {
- assert (d);
- if (d == 1)
- return top (i);
- else
- return at (i);
- }
-
- T ** accesses () const
- {
- return (T **) Array<void *>::accesses ();
- }
- /**
- remove i-th element, and return it.
- */
- T *get (vsize i)
- {
- T *t = at (i);
- Array<void*>::erase (Array<void*>::begin () + i);
- return t;
- }
- Link_array<T>
- slice (int l, int u) const
- {
- return Array<void *>::Array (begin () + l, begin () + u);
- }
- void concat (Link_array<T> const &a2)
- {
- Array<void *>::insert (end (), a2.begin (), a2.end ());
- }
- int find_index (T const *t) const
- {
- for (vsize i = 0; i < size (); i++)
- if (at (i) == t)
- return i;
- return -1;
- }
- T const *find (T const *t) const
- {
- int i = find_index (t);
- if (i >= 0)
- return at (i);
- else
- return 0;
- }