list.h revision 67259dc535458471f701aa4a4f3ff00d5736c0df
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * IPRT - Generic List Class.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Copyright (C) 2011 Oracle Corporation
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * This file is part of VirtualBox Open Source Edition (OSE), as
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * available from http://www.virtualbox.org. This file is free software;
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * you can redistribute it and/or modify it under the terms of the GNU
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * General Public License (GPL) as published by the Free Software
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Foundation, in version 2 as it comes in the "COPYING" file of the
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * VirtualBox OSE distribution. VirtualBox OSE is distributed in the
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * The contents of this file may alternatively be used under the terms
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * of the Common Development and Distribution License Version 1.0
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * (CDDL) only, as it comes in the "COPYING.CDDL" file of the
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * VirtualBox OSE distribution, in which case the provisions of the
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * CDDL are applicable instead of those of the GPL.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * You may elect to license modified versions of this file under the
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * terms and conditions of either the GPL or the CDDL or both.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @defgroup grp_rt_cpp_list C++ List support
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @ingroup grp_rt_cpp
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @brief Generic C++ list class support.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * This list classes manage any amount of data in a fast and easy to use way.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * They have no dependencies on STL, only on generic memory management methods
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * of IRPT. This allows list handling in situations where the use of STL
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * container classes is forbidden.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Not all of the functionality of STL container classes is implemented. There
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * are no iterators or any other high level access/modifier methods (e.g.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * std::algorithms).
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * The implementation is array based which allows fast access to the items.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Appending items is usually also fast, cause the internal array is
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * preallocated. To minimize the memory overhead, native types (that is
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * everything smaller then the size of void*) are directly saved in the array.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * If bigger types are used (e.g. iprt::MiniString) the internal array is an
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * array of pointers to the objects.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * The size of the internal array will usually not shrink, but grow
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * automatically. Only certain methods, like list::clear or the "=" operator
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * will reset any previously allocated memory. You can call list::setCapacity
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * for manual adjustment. If the size of an new list will be known, calling the
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * constructor with the necessary capacity will speed up the insertion of the
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * new items.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * For the full public interface these list classes offer see ListBase.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * There are some requirements for the types used which follow:
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * -# They need a default and a copy constructor.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * -# If the type is some complex class (that is, having a constructor which
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * allocates members on the heap) it has to be greater than sizeof(void*) to
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * be used correctly. If this is not the case you can manually overwrite the
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * list behavior. Just add T* as a second parameter to the list template if
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * your class is called T. Another possibility is to specialize the list for
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * your target class. See below for more information.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * The native types like int, bool, ptr, ..., are meeting this criteria, so
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * they are save to use.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Implementation details:
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * It is possible to specialize any type. This might be necessary to get the
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * best speed out of the list. Examples are the 64-bit types, which use the
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * native (no pointers) implementation even on a 32-bit host. Consult the
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * source code for more details.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Current specialized implementations:
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * - int64_t: iprt::list<int64_t>
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * - uint64_t: iprt::list<uint64_t>
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * General helper template for managing native values in ListBase.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync static inline void set(T2 *p, size_t i, const T1 &v) { p[i] = v; }
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync static inline T1 & at(T2 *p, size_t i) { return p[i]; }
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync static inline void copyTo(T2 *p, T2 *const p1 , size_t iTo, size_t cSize)
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync static inline void erase(T2 *p, size_t /* i */) { /* Nothing to do here. */ }
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync static inline void eraseRange(T2 * /* p */, size_t /* cFrom */, size_t /* cSize */) { /* Nothing to do here. */ }
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Specialized helper template for managing pointer values in ListBase.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync static inline void set(T1 **p, size_t i, const T1 &v) { p[i] = new T1(v); }
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync static inline T1 & at(T1 **p, size_t i) { return *p[i]; }
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync static inline void copyTo(T1 **p, T1 **const p1 , size_t iTo, size_t cSize)
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync static inline void erase(T1 **p, size_t i) { delete p[i]; }
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync static inline void eraseRange(T1 **p, size_t cFrom, size_t cSize)
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * This is the base class for all other list classes. It implements the
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * necessary list functionality in a type independent way and offers the public
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * list interface to the user.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Creates a new list.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * This preallocates @a cCapacity elements within the list.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @param cCapacitiy The initial capacity the list has.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @throws std::bad_alloc
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * Creates a copy of another list.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * The other list will be fully copied and the capacity will be the same as
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * the size if the other list.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @param other The list to copy.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @throws std::bad_alloc
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync ListHelper<T, list_type>::copyTo(m_pArray, other.m_pArray, 0, other.m_cSize);
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Destructor.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync ListHelper<T, list_type>::eraseRange(m_pArray, 0, m_cSize);
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * Sets a new capacity within the list.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * If the new capacity is bigger than the old size, it will be simply
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * preallocated more space for the new items. If the new capacity is
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * smaller than the previous size, items at the end of the list will be
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @param cCapacity The new capacity within the list.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @throws std::bad_alloc
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync void setCapacity(size_t cCapacity) { realloc(cCapacity); }
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * Return the current capacity of the list.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @return The actual capacity.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * Check if an list contains any items.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @return True if there is more than zero items, false otherwise.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Return the current count of elements within the list.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @return The current element count.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * Inserts an item to the list at position @a i.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @param i The position of the new item.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @param val The new item.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @return a reference to this list.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @throws std::bad_alloc
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync memmove(&m_pArray[i + 1], &m_pArray[i], (m_cSize - i) * sizeof(list_type));
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Prepend an item to the list.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @param val The new item.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @return a reference to this list.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @throws std::bad_alloc
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Prepend a list of type T to the list.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @param other The list to prepend.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @return a reference to this list.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @throws std::bad_alloc
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync ListBase<T, TYPE> &prepend(const ListBase<T, TYPE> &other)
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync realloc_grow(m_cCapacity + (other.m_cSize - (m_cCapacity - m_cSize)));
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync memmove(&m_pArray[other.m_cSize], &m_pArray[0], m_cSize * sizeof(list_type));
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync ListHelper<T, list_type>::copyTo(m_pArray, other.m_pArray, 0, other.m_cSize);
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Append an item to the list.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @param val The new item.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @return a reference to this list.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @throws std::bad_alloc
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync ListHelper<T, list_type>::set(m_pArray, m_cSize, val);
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Append a list of type T to the list.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @param other The list to append.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @return a reference to this list.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @throws std::bad_alloc
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync ListBase<T, TYPE> &append(const ListBase<T, TYPE> &other)
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync realloc_grow(m_cCapacity + (other.m_cSize - (m_cCapacity - m_cSize)));
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync ListHelper<T, list_type>::copyTo(m_pArray, other.m_pArray, m_cSize, other.m_cSize);
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Copy the items of the other list into this list. All previous items of
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * this list are deleted.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @param other The list to copy.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @return a reference to this list.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync ListBase<T, TYPE> &operator=(const ListBase<T, TYPE>& other)
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync /* Prevent self assignment */
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync /* Values cleanup */
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync ListHelper<T, list_type>::eraseRange(m_pArray, 0, m_cSize);
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync ListHelper<T, list_type>::copyTo(m_pArray, other.m_pArray, 0, other.m_cSize);
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * Replace an item in the list.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @note No boundary checks are done. Make sure @a i is equal or greater zero
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * and smaller than list::size.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @param i The position of the item to replace.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync * @param val The new value.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * @return a reference to this list.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Return the first item as constant reference.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @note No boundary checks are done. Make sure @a i is equal or greater zero
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * and smaller than list::size.
64fee3f73de7a63db0b27a93be05cd635a149d14vboxsync * @return The first item.
64fee3f73de7a63db0b27a93be05cd635a149d14vboxsync const T &first() const
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * Return the first item as mutable reference.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @note No boundary checks are done. Make sure @a i is equal or greater zero
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * and smaller than list::size.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @return The first item.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * Return the last item as constant reference.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @note No boundary checks are done. Make sure @a i is equal or greater zero
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * and smaller than list::size.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @return The last item.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync const T &last() const
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync return ListHelper<T, list_type>::at(m_pArray, m_cSize - 1);
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * Return the last item as mutable reference.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @note No boundary checks are done. Make sure @a i is equal or greater zero
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * and smaller than list::size.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @return The last item.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync return ListHelper<T, list_type>::at(m_pArray, m_cSize - 1);
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * Return the item at position @a i as constant reference.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @note No boundary checks are done. Make sure @a i is equal or greater zero
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * and smaller than list::size.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @param i The position of the item to return.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @return The item at position @a i.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * Return the item at position @a i as mutable reference.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @note No boundary checks are done. Make sure @a i is equal or greater zero
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * and smaller than list::size.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @param i The position of the item to return.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @return The item at position @a i.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * Return the item at position @a i as mutable reference.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @note No boundary checks are done. Make sure @a i is equal or greater zero
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * and smaller than list::size.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @param i The position of the item to return.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @return The item at position @a i.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * Return the item at position @a i. If @a i isn't valid within the list a
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * default value is returned.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @param i The position of the item to return.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @return The item at position @a i.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync return T();
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * Return the item at position @a i. If @a i isn't valid within the list
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @a defaultVal is returned.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @param i The position of the item to return.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @param defaultVal The value to return in case @a i is invalid.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @return The item at position @a i.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * Remove the item at position @a i.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @note No boundary checks are done. Make sure @a i is equal or greater zero
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * and smaller than list::size.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @param i The position of the item to remove.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync /* Not last element? */
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync memmove(&m_pArray[i], &m_pArray[i + 1], (m_cSize - i - 1) * sizeof(list_type));
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * Remove a range of items from the list.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @note No boundary checks are done. Make sure @a iFrom is equal or
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * greater zero and smaller than list::size. @a iTo has to be
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * greater than @a iFrom and equal or smaller than list::size.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @param iFrom The start position of the items to remove.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * @param iTo The end position of the items to remove (excluded).
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync ListHelper<T, list_type>::eraseRange(m_pArray, iFrom, iTo - iFrom);
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync /* Not last elements? */
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync memmove(&m_pArray[iFrom], &m_pArray[iTo], (m_cSize - iTo) * sizeof(list_type));
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * Delete all items in the list.
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync /* Values cleanup */
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync ListHelper<T, list_type>::eraseRange(m_pArray, 0, m_cSize);
61d4c60e55bc9d7545fc89bd9a32bafe38cea555vboxsync * The default capacity of the list. This is also used as grow factor.
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Generic realloc, which does some kind of boundary checking.
a3bbbe5c597341d9b6041560b790596ee41c2cfavboxsync /* Same size? */
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync /* If we get smaller we have to delete some of the objects at the end
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync of the list. */
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync ListHelper<T, list_type>::eraseRange(m_pArray, cNewSize, m_cSize - cNewSize);
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync /* If we get zero we delete the array it self. */
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync /* Resize the array. */
64fee3f73de7a63db0b27a93be05cd635a149d14vboxsync m_pArray = static_cast<list_type*>(RTMemRealloc(m_pArray, sizeof(list_type) * cNewSize));
64fee3f73de7a63db0b27a93be05cd635a149d14vboxsync#endif /* RT_EXCEPTIONS_ENABLED */
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Special realloc method which require that the array will grow.
64fee3f73de7a63db0b27a93be05cd635a149d14vboxsync * @note No boundary checks are done!
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync /* Resize the array. */
64fee3f73de7a63db0b27a93be05cd635a149d14vboxsync m_pArray = static_cast<list_type*>(RTMemRealloc(m_pArray, sizeof(list_type) * cNewSize));
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync#endif /* RT_EXCEPTIONS_ENABLED */
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * Which type of list should be created. This depends on the size of T. If
67259dc535458471f701aa4a4f3ff00d5736c0dfvboxsync * T is a native type (int, bool, ptr, ...), the list will contain the
template <>
template <>