FMath/FMArray.h

Go to the documentation of this file.

/*
    Copyright (C) 2005-2006 Feeling Software Inc.
    MIT License: http://www.opensource.org/licenses/mit-license.php
*/

#ifndef _FM_ARRAY_H_
#define _FM_ARRAY_H_

template <class T>
class FCOLLADA_EXPORT vector : public std::vector<T>
{
public:
    vector() : std::vector<T>() {}

    vector(size_t size) : std::vector<T>(size) {}

    vector(size_t size, const T& defaultValue) : std::vector<T>(size, defaultValue) {}

    vector(const std::vector& copy) : std::vector<T>(copy) {}

    vector(const T* values, size_t count) : std::vector<T>()
    {
        resize(count);
        memcpy(&at(0), values, count * sizeof(T));
    }

    template <typename _T>
    inline iterator find(const _T& value) { return std::find(begin(), end(), value); }
    template <typename _T>
    inline const_iterator find(const _T& value) const { return std::find(begin(), end(), value); } 
    inline void erase(iterator it) { std::vector<T>::erase(it); }

    inline void erase(iterator first, iterator last) { std::vector<T>::erase(first, last); }

    inline bool erase(const T& value) { iterator it = find(value); if (it != end()) { erase(it); return true; } return false; }

    inline void erase(size_t index) { erase(begin() + index); }

    inline bool release(const T& value) { iterator it = find(value); if (it != end()) { erase(it); delete value; return true; } return false; }

    inline bool contains(const T& value) const { const_iterator it = find(value); return it != end(); }
};

template <typename T>
inline bool IsEquivalent(const vector<T>& dl, const T* cl, size_t count)
{
    if (dl.size() != count) return false;
    bool equivalent = true;
    for (size_t i = 0; i < count && equivalent; ++i) equivalent = IsEquivalent(dl.at(i), cl[i]);
    return equivalent;
}

#endif // _FM_ARRAY_H_

---