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

---

ApplyOrder.h

Go to the documentation of this file.

#ifndef Impala_Core_Column_ApplyOrder_h
#define Impala_Core_Column_ApplyOrder_h

#include "Util/ApplyOrder.h"
#include "Core/Vector/VectorSet.h"

namespace Impala
{
namespace Core
{
namespace Column
{


template <class C>
void
ApplyOrder(C* data, ColumnTem<int>* order)
{
    if(data->Size() == 0)
    {
        // probably an InvalidColumn : no error
        return;
    }
    if(data->Size() < order->Size())
    {
        std::cout << "[Column::ApplyOrder] column to reorder shorter than the presented order" << std::endl;
        return;
    }
    Util::ApplyOrder(data->GetData(), order->GetData(), order->Size());
}


template <>
void
ApplyOrder(Vector::VectorSet<Array::Array2dScalarReal64>* data, ColumnTem<int>* orderCol)
{
    typedef Vector::VectorTem<Array::Array2dScalarReal64::StorType> Type;

    int length = orderCol->Size();
    // order is copied to keep callers code simpler
    int* order = new int[length];
    memcpy(order, orderCol->GetData(), length*sizeof(int));
    
    int i;
    for(i=0 ; i<length ; ++i)
    {
        if(order[i] != i)
        {
            // keep swapping until an element is put at the correct position (this will happen!)
            int indexFrom = i;
            int indexTo = order[i];
            order[i] = i;
            Type value = data->Get(indexFrom);
            while(indexFrom != indexTo)
            {
                Type temp = data->Get(indexTo);
                data->Set(indexTo, value);
                value = temp;
                indexFrom = indexTo;
                indexTo = order[indexFrom];
                order[indexFrom] = indexFrom;
            }
        }
    }
}

} // namespace Column
} // namespace Core
} // namespace Impala

#endif

---