math.h

Go to the documentation of this file.

#if !defined(FLOW_MATH_H)
     #define FLOW_MATH_H

#include "node.h"

#include <algorithm>
#include <memory>
#include <utility>
#include <vector>


namespace flow { namespace samples { namespace math {

template<typename T>
class adder : public transformer<T, T>
{
public:
    adder(size_t ins = 2, const std::string& name_r = "adder") : node(name_r), transformer<T, T>(name_r, ins, 1) {}

    virtual ~adder() {}

    virtual void ready(size_t n)
    {
        // Check that a packet is ready at all inputs. If not, return and try again when another packet arrives.
        for(size_t i = 0; i != consumer<T>::ins(); ++i)
        {
            if(!consumer<T>::input(i).peek())
            {
                return;
            }
        }

        // Gather the terms in a container.
        std::vector<std::unique_ptr<packet<T>>> terms;

        for(auto& inpin : consumer<T>::inputs())
        {
            terms.emplace_back(move(inpin.pop()));
        }

        // Start the sum as equal to the first term.
        T sum(terms[0]->data());

        // Add to the sum the value of all other packets.
        std::for_each(terms.begin() + 1, terms.end(), [&sum](const std::unique_ptr<packet<T>>& packet_up_r){
            sum += packet_up_r->data();
        });

        // Make a packet with the sum data.
        std::unique_ptr<packet<T>> sum_up(new packet<T>(sum));

        // Output it.
        producer<T>::output(0).push(std::move(sum_up));
    }
};

template<typename T>
class const_adder : public transformer<T, T>
{
    const T d_addend;

public:
    const_adder(const T& addend, const std::string& name_r = "const_adder") : node(name_r), transformer<T, T>(name_r, 1, 1), d_addend(addend) {}

    virtual ~const_adder() {}

    virtual void ready(size_t)
    {
        std::unique_ptr<packet<T>> packet_p = consumer<T>::input(0).pop();

        packet_p->data() += d_addend;

        producer<T>::output(0).push(std::move(packet_p));
    }
};

}}}

#endif

/*
    (C) Copyright Thierry Seegers 2010-2012. Distributed under the following license:

    Boost Software License - Version 1.0 - August 17th, 2003

    Permission is hereby granted, free of charge, to any person or organization
    obtaining a copy of the software and accompanying documentation covered by
    this license (the "Software") to use, reproduce, display, distribute,
    execute, and transmit the Software, and to prepare derivative works of the
    Software, and to permit third-parties to whom the Software is furnished to
    do so, all subject to the following:

    The copyright notices in the Software and this entire statement, including
    the above license grant, this restriction and the following disclaimer,
    must be included in all copies of the Software, in whole or in part, and
    all derivative works of the Software, unless such copies or derivative
    works are solely in the form of machine-executable object code generated by
    a source language processor.

    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
    FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
    SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
    FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
    ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
    DEALINGS IN THE SOFTWARE.
*/