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 *> v)
34 T *const &back() const
36 return (T * const &) Array<void *>::back();
41 return (T *&) Array<void *>::back ();
47 Array<void *>::resize;
50 Array<void *>::pop_back;
54 Array<void *>::unordered_del;
55 Array<void *>::reverse;
56 Array<void *>::tighten_maxsize;
58 static int default_compare (T *const &p1, T *const &p2)
60 /* can't do p1 -p2, since T might be an incomplete type */
67 Link_array (T *const *tp, int n)
68 : Array<void *> ((void **)tp, n)
72 Link_array (Link_array<T> const &src)
81 T *&elem_ref (int i) const
83 return (T *&) Array<void *>::elem_ref (i);
87 T *&operator [] (int i)
89 return (T *&) Array<void *>::elem_ref (i);
92 T *const operator [] (int i) const
94 return (T *const) Array<void *>::elem (i);
98 T* t = (T *) Array<void *>::back ();
102 void insert (T *t, vsize i)
104 Array<void *>::insert (t, i);
106 void push_back (T *t)
108 Array<void *>::push_back (t);
111 /// return last entry
114 return (T *) Array<void *>::top (j);
118 return (T *&) Array<void *>::top (i);
121 void substitute (T *old, T *new_p)
124 while ((i = find_index (old)) >= 0)
126 elem_ref (i) = new_p;
128 erase (begin () + i);
130 void unordered_substitute (T *old, T *new_p)
133 while ((i = find_index (old)) >= 0)
135 elem_ref (i) = new_p;
141 sort (default_compare);
145 void sort (int (*compare) (T *const &, T *const &),
146 int lower = -1, int upper = -1);
151 for (vsize i = 0; i < size (); i++)
152 if (!i || elem (i - 1) != elem (i))
153 ls.push_back (elem (i));
157 T *& boundary (int d, int i)
165 T *boundary (int d, int i)const
174 T ** accesses () const
176 return (T **) Array<void *>::accesses ();
179 remove i-th element, and return it.
184 Array<void*>::erase (Array<void*>::begin () + i);
188 slice (int l, int u) const
190 return Array<void *>::slice (l, u);
192 void concat (Link_array<T> const &a2)
194 Array<void *>::concat (a2);
196 int find_index (T const *t) const
198 for (vsize i = 0; i < size (); i++)
203 T *find (T const *t) const
205 int i = find_index (t);
213 template<class T, class V>
215 typecasts (Link_array<V> const &a, T * /* dummy */)
218 for (vsize i = a.size (); i--;)
219 ret.push_back (dynamic_cast<T *> (a[i])); // ugh?
223 template<class T> inline void
224 Link_array<T>::sort (int (*compare) (T *const &, T *const &), int lower, int upper)
233 swap (lower, (lower + upper) / 2);
235 for (int i = lower +1; i <= upper; i++)
236 if (compare (elem (i), elem (lower)) < 0)
239 sort (compare, lower, last - 1);
240 sort (compare, last + 1, upper);
245 junk_pointers (Link_array<T> &a)
247 for (vsize i = 0; i < a.size (); i++)
253 lookup with binsearch, return tokencode.
257 binsearch (Array<T> const &arr, T t, int (*compare) (T const &, T const &))
262 int hi = arr.size ();
269 result = compare (t, arr[cmp]);
278 if (!compare (t, arr[lo]))
286 binsearch_links (Link_array<T> const &arr, T *t,
287 int (*compare) (T *const &, T *const &))
292 int hi = arr.size ();
302 result = (*compare) (t, arr[cmp]);
311 if (!compare (t, arr[lo]))
319 binary_search_bounds (Link_array<T> const &table,
320 T const *key, int (*compare) (T *const &, T *const &),
330 cmp = (*lo + *hi) / 2;
332 result = (*compare) ((T *) key, table[cmp]);
339 while (*hi - *lo > 1);