2 parray.hh -- declare Pointer_array
4 source file of the Flower Library
6 (c) 1997--2005 Han-Wen Nienhuys <hanwen@cs.uu.nl>
21 class Link_array : private Array<void *>
24 Link_array (Array<void *> v)
32 static int default_compare (T *const &p1, T *const &p2)
34 /* can't do p1 -p2, since T might be an incomplete type */
41 Link_array (T *const *tp, int n)
42 : Array<void *> ((void **)tp, n)
46 Link_array (Link_array<T> const &src)
55 T *&elem_ref (int i) const
57 return (T *&) Array<void *>::elem_ref (i);
61 T *&operator [] (int i)
63 return (T *&) Array<void *>::elem_ref (i);
66 T *const operator [] (int i) const
68 return (T *const) Array<void *>::elem (i);
72 return (T *) Array<void *>::pop ();
74 void insert (T *t, int i)
76 Array<void *>::insert (t, i);
80 Array<void *>::push (t);
83 T *top (int j = 0) const
85 return (T *) Array<void *>::top (j);
89 return (T *&) Array<void *>::top (i);
91 void substitute (T *old, T *new_p)
94 while ((i = find_index (old)) >= 0)
100 void unordered_substitute (T *old, T *new_p)
103 while ((i = find_index (old)) >= 0)
105 elem_ref (i) = new_p;
113 sort (default_compare);
116 void sort (int (*compare) (T *const &, T *const &),
117 int lower = -1, int upper = -1);
122 for (int i = 0; i < size (); i++)
123 if (!i || elem (i - 1) != elem (i))
128 Array<void *>::unordered_del;
130 Array<void *>::clear;
131 Array<void *>::set_size;
132 Array<void *>::is_empty;
133 Array<void *>::reverse;
134 Array<void *>::tighten_maxsize;
136 T *& boundary (int d, int i)
144 T *boundary (int d, int i)const
153 T ** accesses () const
155 return (T **) Array<void *>::accesses ();
159 return (T *) Array<void *>::get (i);
164 return Array<void *>::slice (l, u);
166 void concat (Link_array<T> const &a2)
168 Array<void *>::concat (a2);
170 int find_index (T const *t) const
172 for (int i = 0; i < size (); i++)
177 T *find (T const *t) const
179 int i = find_index (t);
187 template<class T, class V>
189 typecasts (Link_array<V> const &a, T * /* dummy */)
192 for (int i = a.size (); i--;)
193 ret.push (dynamic_cast<T *> (a[i])); // ugh?
197 template<class T> inline void
198 Link_array<T>::sort (int (*compare) (T *const &, T *const &), int lower, int upper)
207 swap (lower, (lower + upper) / 2);
209 for (int i = lower +1; i <= upper; i++)
210 if (compare (elem (i), elem (lower)) < 0)
213 sort (compare, lower, last - 1);
214 sort (compare, last + 1, upper);
219 junk_pointers (Link_array<T> &a)
221 for (int i = 0; i < a.size (); i++)
229 lookup with binsearch, return tokencode.
233 binsearch (Array<T> const &arr, T t, int (*compare) (T const &, T const &))
240 hi = Array<T>::maxkey;
247 result = compare (t, arr[cmp]);
256 if (!compare (t, arr[lo]))
259 return -1; /* not found */
264 binsearch_links (Link_array<T> const &arr, T *t,
265 int (*compare) (T *const &, T *const &),
266 int lo = 0, int hi = -1)
281 result = (*compare) (t, arr[cmp]);
290 if (!compare (t, arr[lo]))
293 return -1; /* not found */
298 binary_search_bounds (Link_array<T> const &table,
299 T const *key, int (*compare) (T *const &, T *const &),
309 cmp = (*lo + *hi) / 2;
311 result = (*compare) ((T *) key, table[cmp]);
318 while (*hi - *lo > 1);