40 struct hb_array_t : hb_iter_with_fallback_t<hb_array_t<Type>, Type&>  struct
45   hb_array_t () : arrayZ (nullptr), length (0), backwards_length (0) {}  in hb_array_t()  argument
46 …hb_array_t (Type *array_, unsigned int length_) : arrayZ (array_), length (length_), backwards_len…  in hb_array_t()  argument
48   hb_array_t (Type (&array_)[length_]) : arrayZ (array_), length (length_), backwards_length (0) {}  in hb_array_t()  argument
52   hb_array_t (const hb_array_t<U> &o) :  in hb_array_t()  function
57   hb_array_t& operator = (const hb_array_t<U> &o)  in operator =()  argument
63   typedef Type& __item_t__;
64   static constexpr bool is_random_access_iterator = true;
65   Type& __item_at__ (unsigned i) const  in __item_at__()
92   bool operator != (const hb_array_t& o) const  in operator !=()  argument
98   operator hb_array_t<const Type> () { return hb_array_t<const Type> (arrayZ, length); }  in operator hb_array_t<const Type>()  argument
101   HB_INTERNAL bool operator == (const hb_array_t &o) const;  argument
116   int cmp (const hb_array_t &a) const  in cmp()  argument
124     hb_array_t *a = (hb_array_t *) pa;  in cmp()  argument
130   Type *lsearch (const T &x, Type *not_found = nullptr)  in lsearch()
139   const Type *lsearch (const T &x, const Type *not_found = nullptr) const  in lsearch()
148   hb_sorted_array_t<Type> qsort (int (*cmp_)(const void*, const void*))  in qsort()
174 …hb_array_t sub_array (unsigned int start_offset = 0, unsigned int *seg_count = nullptr /* IN/OUT *…  in sub_array()  argument
188   hb_array_t sub_array (unsigned int start_offset, unsigned int seg_count) const  in sub_array()  argument
191   hb_array_t truncate (unsigned length) const { return sub_array (0, length); }  in truncate()  argument
213   hb_array_t copy (hb_serialize_context_t *c) const  in copy()  argument
236 template <typename T> inline hb_array_t<T>  argument