2 parray.hh -- declare Pointer_array
4 source file of the Flower Library
6 (c) 1997--2006 Han-Wen Nienhuys <hanwen@xs4all.nl>
12 #include "std-vector.hh"
21 class Link_array : private Array<void *>
24 Link_array (Array<void *> const &v)
34 T *const &back() const
36 return (T * const &) Array<void *>::back();
41 return (T *&) Array<void *>::back ();
48 Array<void *>::resize;
51 Array<void *>::pop_back;
55 Array<void *>::unordered_del;
56 Array<void *>::reverse;
57 Array<void *>::tighten_maxsize;
59 static int default_compare (T *const &p1, T *const &p2)
61 /* can't do p1 -p2, since T might be an incomplete type */
68 Link_array (T *const *tp, int n)
69 : Array<void *> ((void **)tp, n)
73 Link_array (Link_array<T> const &src)
83 T *&elem_ref (int i) const
85 return (T *&) Array<void *>::elem_ref (i);
89 T *&operator [] (int i)
91 return (T *&) Array<void *>::elem_ref (i);
94 T *const operator [] (int i) const
96 return (T *const) Array<void *>::elem (i);
100 T* t = (T *) Array<void *>::back ();
104 void insert (T *t, vsize i)
106 Array<void *>::insert (t, i);
108 void push_back (T *t)
110 Array<void *>::push_back (t);
113 /// return last entry
116 return (T *) Array<void *>::top (j);
120 return (T *&) Array<void *>::top (i);
123 void substitute (T *old, T *new_p)
126 while ((i = find_index (old)) >= 0)
128 elem_ref (i) = new_p;
130 erase (begin () + i);
132 void unordered_substitute (T *old, T *new_p)
135 while ((i = find_index (old)) >= 0)
137 elem_ref (i) = new_p;
143 sort (default_compare);
147 void sort (int (*compare) (T *const &, T *const &),
148 int lower = -1, int upper = -1);
153 for (vsize i = 0; i < size (); i++)
154 if (!i || elem (i - 1) != elem (i))
155 ls.push_back (elem (i));
159 T *& boundary (int d, int i)
167 T *boundary (int d, int i)const
176 T ** accesses () const
178 return (T **) Array<void *>::accesses ();
181 remove i-th element, and return it.
186 Array<void*>::erase (Array<void*>::begin () + i);
190 slice (int l, int u) const
192 return Array<void *>::Array (begin () + l, begin () + u);
194 void concat (Link_array<T> const &a2)
196 Array<void *>::concat (a2);
198 int find_index (T const *t) const
200 for (vsize i = 0; i < size (); i++)
205 T *find (T const *t) const
207 int i = find_index (t);
215 template<class T, class V>
217 typecasts (Link_array<V> const &a, T * /* dummy */)
220 for (vsize i = a.size (); i--;)
221 ret.push_back (dynamic_cast<T *> (a[i])); // ugh?
225 template<class T> inline void
226 Link_array<T>::sort (int (*compare) (T *const &, T *const &), int lower, int upper)
235 swap (lower, (lower + upper) / 2);
237 for (int i = lower +1; i <= upper; i++)
238 if (compare (elem (i), elem (lower)) < 0)
241 sort (compare, lower, last - 1);
242 sort (compare, last + 1, upper);
247 junk_pointers (Link_array<T> &a)
249 for (vsize i = 0; i < a.size (); i++)
255 lookup with binsearch, return tokencode.
259 binsearch (Array<T> const &arr, T t, int (*compare) (T const &, T const &))
264 int hi = arr.size ();
271 result = compare (t, arr[cmp]);
280 if (!compare (t, arr[lo]))
288 binsearch_links (Link_array<T> const &arr, T *t,
289 int (*compare) (T *const &, T *const &))
294 int hi = arr.size ();
304 result = (*compare) (t, arr[cmp]);
313 if (!compare (t, arr[lo]))
321 binary_search_bounds (Link_array<T> const &table,
322 T const *key, int (*compare) (T *const &, T *const &),
332 cmp = (*lo + *hi) / 2;
334 result = (*compare) ((T *) key, table[cmp]);
341 while (*hi - *lo > 1);