SortingExpression.cpp

Go to the documentation of this file.

// Copyright CERN 2012 - Developed in collaboration with GSI

#include <fesa-core/Sorting/SortingExpression.h>
#include <fesa-core/Sorting/FieldExpression.h>
#include <fesa-core/Sorting/ComplementExpression.h>
#include <fesa-core/Sorting/UnionExpression.h>
#include <fesa-core/Sorting/IntersectExpression.h>
#include <fesa-core/Sorting/HomogeneousDevCol.h>

#include <cmw-log/Logger.h>

#include <iostream>

namespace
{
CMW::Log::Logger& logger = CMW::Log::LoggerFactory::getLogger("FESA.FWK.fesa-core.Sorting.SortingExpression");
}

namespace fesa
{

// use to transmit the device collection to sub-class which need it (FieldExpresion for instance)
std::vector<AbstractDevice*>* SortingExpression::pDevCol_ = NULL;

// NOTE actually the function below shall remove all blanks
// within the string, and be invoked only once, when starting
// the parser.
void SortingExpression::removeBlanks(std::string * pS)
{

    // remove front-blanks

    std::string::size_type n;
    do
    {
        n = pS->find(' ');
        if (n != std::string::npos)
            pS->erase(n, 1);
    }
    while (n != std::string::npos);

    // remove trail-blanks

    do
    {
        n = pS->rfind(' ');
        if (n != std::string::npos)
            pS->erase(n, 1);
    }
    while (n != std::string::npos);

}

void SortingExpression::setDeviceCollection(std::vector<AbstractDevice *>* pDevCol)
{
    pDevCol_ = pDevCol;
}

// match and tryMatch together form a recursive algorithm

SortingExpression * SortingExpression::tryMatch(SortingContext sc)
{
    if(logger.isLoggable(CMW::Log::Level::LL_TRACE))
    {
        std::ostringstream msg;
        msg << "Tries to match " << sc.formula_;
        LOG_TRACE_IF(logger, msg.str());
    }

    SortingExpression * pE;

    pE = new FieldExpression();

    if (pE->match(sc))
    {
        return pE;
    }

    delete pE;

    pE = new ComplementExpression();

    if (pE->match(sc))
    {
        return pE;
    }

    delete pE;

    pE = new UnionExpression();

    if (pE->match(sc))
    {
        return pE;
    }

    delete pE;

    pE = new IntersectExpression();

    if (pE->match(sc))
    {
        return pE;
    }

    delete pE;

    return 0;

}

} // fesa