|| || || || || || || ||

---

ArraySet.h

Go to the documentation of this file.

#ifndef Impala_Core_Array_ArraySet_h
#define Impala_Core_Array_ArraySet_h

#include <vector>
#include <string>
#include <iostream>

namespace Impala
{
namespace Core
{
namespace Array
{


// basically a wrapper around std::vector of arrays
// provides access to arrays based on names
template<class ArrayT>
class ArraySet
{
public:

    ArraySet()
    {
    }

    ArraySet(int nrArray)
    {
        for (int i=0 ; i<nrArray ; i++)
        {
            mArrays.push_back(0);
            mNames.push_back(std::string(""));
        }
    }

    ~ArraySet()
    {
        // no destruction of elements, as std::vector doesn't do it either
        //for (int i=0 ; i<mArrays.size() ; i++)
        //    delete mArrays[i];
    }

    void
    Delete() // requires "explicit call to destructor"
    {
        for (int i=0 ; i<mArrays.size() ; i++)
            delete mArrays[i];
        mArrays.clear();
        mNames.clear();
    }

    int
    Size()
    {
        return mNames.size();
    }

    std::string
    Name(int i)
    {
        return mNames[i];
    }

    ArrayT*&
    Array(int i)
    {
        return mArrays[i];
    }

    // return array with given name, allocate a new (empty) one otherwise
    ArrayT*&
    Array(std::string name)
    {
        for (int i=0 ; i<mNames.size() ; i++)
            if (mNames[i] == name)
                return mArrays[i];
        return AllocName(name);
    }

    std::vector<ArrayT*>
    GetArrays()
    {
        return mArrays;
    }

private:

    ArrayT*&
    AllocName(std::string name)
    {
        mNames.push_back(name);
        mArrays.push_back(0);
        return mArrays[mArrays.size()-1];
    }

    std::vector<ArrayT*>     mArrays;
    std::vector<std::string> mNames;

};

} // namespace Array
} // namespace Core
} // namespace Impala

#endif

---