Home | History | Annotate | Download | only in tinyutils

Lines Matching refs:TYPE

32 template <class TYPE>
36 typedef TYPE value_type;
43 SortedVector(const SortedVector<TYPE>& rhs);
47 const SortedVector<TYPE>& operator = (const SortedVector<TYPE>& rhs) const;
48 SortedVector<TYPE>& operator = (const SortedVector<TYPE>& rhs);
74 inline const TYPE* array() const;
78 TYPE* editArray();
81 ssize_t indexOf(const TYPE& item) const;
84 size_t orderOf(const TYPE& item) const;
92 inline const TYPE& operator [] (size_t index) const;
94 inline const TYPE& itemAt(size_t index) const;
96 const TYPE& top() const;
98 const TYPE& mirrorItemAt(ssize_t index) const;
105 ssize_t add(const TYPE& item);
108 TYPE& editItemAt(size_t index) {
109 return *( static_cast<TYPE *>(VectorImpl::editItemLocation(index)) );
113 ssize_t merge(const Vector<TYPE>& vector);
114 ssize_t merge(const SortedVector<TYPE>& vector);
117 ssize_t remove(const TYPE&);
139 template<class TYPE> inline
140 SortedVector<TYPE>::SortedVector()
141 : SortedVectorImpl(sizeof(TYPE),
142 ((traits<TYPE>::has_trivial_ctor ? HAS_TRIVIAL_CTOR : 0)
143 |(traits<TYPE>::has_trivial_dtor ? HAS_TRIVIAL_DTOR : 0)
144 |(traits<TYPE>::has_trivial_copy ? HAS_TRIVIAL_COPY : 0)
145 |(traits<TYPE>::has_trivial_assign ? HAS_TRIVIAL_ASSIGN : 0))
150 template<class TYPE> inline
151 SortedVector<TYPE>::SortedVector(const SortedVector<TYPE>& rhs)
155 template<class TYPE> inline
156 SortedVector<TYPE>::~SortedVector() {
160 template<class TYPE> inline
161 SortedVector<TYPE>& SortedVector<TYPE>::operator = (const SortedVector<TYPE>& rhs) {
166 template<class TYPE> inline
167 const SortedVector<TYPE>& SortedVector<TYPE>::operator = (const SortedVector<TYPE>& rhs) const {
172 template<class TYPE> inline
173 const TYPE* SortedVector<TYPE>::array() const {
174 return static_cast<const TYPE *>(arrayImpl());
177 template<class TYPE> inline
178 TYPE* SortedVector<TYPE>::editArray() {
179 return static_cast<TYPE *>(editArrayImpl());
183 template<class TYPE> inline
184 const TYPE& SortedVector<TYPE>::operator[](size_t index) const {
189 template<class TYPE> inline
190 const TYPE& SortedVector<TYPE>::itemAt(size_t index) const {
194 template<class TYPE> inline
195 const TYPE& SortedVector<TYPE>::mirrorItemAt(ssize_t index) const {
200 template<class TYPE> inline
201 const TYPE& SortedVector<TYPE>::top() const {
205 template<class TYPE> inline
206 ssize_t SortedVector<TYPE>::add(const TYPE& item) {
210 template<class TYPE> inline
211 ssize_t SortedVector<TYPE>::indexOf(const TYPE& item) const {
215 template<class TYPE> inline
216 size_t SortedVector<TYPE>::orderOf(const TYPE& item) const {
220 template<class TYPE> inline
221 ssize_t SortedVector<TYPE>::merge(const Vector<TYPE>& vector) {
225 template<class TYPE> inline
226 ssize_t SortedVector<TYPE>::merge(const SortedVector<TYPE>& vector) {
230 template<class TYPE> inline
231 ssize_t SortedVector<TYPE>::remove(const TYPE& item) {
235 template<class TYPE> inline
236 ssize_t SortedVector<TYPE>::removeItemsAt(size_t index, size_t count) {
242 template<class TYPE>
243 void SortedVector<TYPE>::do_construct(void* storage, size_t num) const {
244 construct_type( reinterpret_cast<TYPE*>(storage), num );
247 template<class TYPE>
248 void SortedVector<TYPE>::do_destroy(void* storage, size_t num) const {
249 destroy_type( reinterpret_cast<TYPE*>(storage), num );
252 template<class TYPE>
253 void SortedVector<TYPE>::do_copy(void* dest, const void* from, size_t num) const {
254 copy_type( reinterpret_cast<TYPE*>(dest), reinterpret_cast<const TYPE*>(from), num );
257 template<class TYPE>
258 void SortedVector<TYPE>::do_splat(void* dest, const void* item, size_t num) const {
259 splat_type( reinterpret_cast<TYPE*>(dest), reinterpret_cast<const TYPE*>(item), num );
262 template<class TYPE>
263 void SortedVector<TYPE>::do_move_forward(void* dest, const void* from, size_t num) const {
264 move_forward_type( reinterpret_cast<TYPE*>(dest), reinterpret_cast<const TYPE*>(from), num );
267 template<class TYPE>
268 void SortedVector<TYPE>::do_move_backward(void* dest, const void* from, size_t num) const {
269 move_backward_type( reinterpret_cast<TYPE*>(dest), reinterpret_cast<const TYPE*>(from), num );
272 template<class TYPE>
273 int SortedVector<TYPE>::do_compare(const void* lhs, const void* rhs) const {
274 return compare_type( *reinterpret_cast<const TYPE*>(lhs), *reinterpret_cast<const TYPE*>(rhs) );