Duplicator.h

// (c) 2016 Neeraj Sharma <neeraj.sharma@alumni.iitg.ernet.in>.
// This file is part of SignalBlocks.
//
// SignalBlocks is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// SignalBlocks is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with SignalBlocks.  If not, see <http://www.gnu.org/licenses/>.
//

#ifndef SIGNALBLOCKS_DUPLICATOR_H
#define SIGNALBLOCKS_DUPLICATOR_H

#include "../../common/Port.h"

#include <algorithm>
#include <assert.h>
#include <memory>

namespace signalblocks {
    template<int M, class T>
    class Duplicator
            : public Port<1, M, T> {
    public:
        Duplicator(std::string name)
                : Port<1, M, T>(std::move(name), "A duplicator block.") {
        }

    protected: // Port interface
        virtual void Process(int sourceIndex, const T& data, const TimeTick& startTime) {
            for (int i = 0; i < M; ++i) {
                this->LeakData(i, data, startTime);
            }
        }

        virtual void Process(
                int sourceIndex, std::unique_ptr<T[]> data, int len, const TimeTick& startTime) {
            assert(sourceIndex == 0); // XXX change to an assertion library.
            for (int i = 0; i < (M - 1); ++i) {
                std::unique_ptr<T[]> datacopy(new T[len]);
                // The std::copy() will not work with complex data structure (T), where
                // shallow-copy is an issue and hence error prone. Instead rely on
                // assignment operator, which should be available for type T.
                //std::copy(data.get(), &(data.get()[len]), datacopy.get());
                for (int j = 0; j < len; ++j) {
                    datacopy.get()[j] = data.get()[j];
                }
                this->LeakData(i, std::move(datacopy), len, startTime);
            }
            constexpr int index = M - 1;
            if (index >= 0) {
                this->LeakData(index, std::move(data), len, startTime);
            }
        }

        virtual void ProcessMatrix(int sourceIndex,
                                   std::unique_ptr<T[]> data,
                                   const std::vector<int>& dims,
                                   const TimeTick& startTime) {
            assert(sourceIndex == 0); // XXX change to an assertion library.
            int len = dims[0];
            for (size_t i = 1; i < dims.size(); ++i) {
                len *= dims[i];
            }
            assert(len > 0);
            for (int i = 0; i < (M - 1); ++i) {
                std::unique_ptr<T[]> datacopy(new T[len]);
                // The std::copy() will not work with complex data structure (T), where
                // shallow-copy is an issue and hence error prone. Instead rely on
                // assignment operator, which should be available for type T.
                //std::copy(data.get(), &(data.get()[len]), datacopy.get());
                for (int j = 0; j < len; ++j) {
                    datacopy.get()[j] = data.get()[j];
                }
                this->LeakMatrix(i, std::move(datacopy), dims, startTime);
            }
            constexpr int index = M - 1;
            if (index >= 0) {
                this->LeakMatrix(index, std::move(data), dims, startTime);
            }
        }
    };
}

#endif //SIGNALBLOCKS_DUPLICATOR_H