arrayofelmts.cpp

Go to the documentation of this file.

#include "group.hpp"
#include "elmt.hpp"
#include "arrayofelmts.hpp"


using namespace arithm;


ArrayOfElmts::ArrayOfElmts()
{
}


ArrayOfElmts::ArrayOfElmts(verifierUtils::ByteTree * bt, Group * grp)
{
        if (!bt->isNode())
        {
                std::cout<<"ERROR: in ArrayOfElmts(bt,grp), bt is not "
                         <<"a Node.\nbt=";
                bt->prettyPrint("");
                std::cout<<std::endl;
                exit(1);
        }
        elmts.resize(bt->size());
        for (unsigned int i=0; i<bt->size(); i++)
                elmts[i] = new Elmt(grp->getElmt(bt->getChild(i)));
}


verifierUtils::ByteTree * ArrayOfElmts::toByteTree()
{
        verifierUtils::ByteTree * result = new verifierUtils::Node();
        for (unsigned int i=0; i<elmts.size(); i++)
                result->addChild(elmts[i]->toByteTree());
        return result;
}


ArrayOfElmts ArrayOfElmts::subArray(std::vector<bool> keepList)
{
        if (keepList.size() != elmts.size())
        {
                std::cout<<"ERROR: in ArrayOfElmts.subArray(keepList),"
                         <<" keepList and this are not of the same "
                         <<"size.\nthis.size()="<<elmts.size()
                         <<"\nkeepList.size()="<<keepList.size()
                         <<std::endl;
                exit(1);
        }
        ArrayOfElmts result;
        for (unsigned int i=0; i<keepList.size(); i++)
                if (keepList[i])
                        result.addElmt(getElmt(i));
        return result;
}


void ArrayOfElmts::addElmt(Elmt e)
{
        Elmt * ptr = new Elmt(e);
        elmts.push_back(ptr);
}


Elmt ArrayOfElmts::getElmt(unsigned int i)
{
        Elmt res = (*elmts[i]);
        return res;
}


unsigned int ArrayOfElmts::size()
{
        return elmts.size();
}