#include <cstdlib>
#include <vector>
#include <iostream>
#include <algorithm>

typedef unsigned int uint;

template<typename T>
class grapher
{
public:
    void push(T sample)
    {
        samples.emplace_back(sample);
    }
 
    virtual void render(uint hei) = 0;

protected:
    std::vector<T> samples;
};

template<typename T>
class consoleGrapher : public grapher<T>
{
public:
    void render(uint hei)
    {
        if (this->samples.size() == 0)
            throw std::length_error("consoleGrapher::render, sample size is 0");
       
        T minelem = *min_element(begin(this->samples), end(this->samples)),
          maxelem = *max_element(begin(this->samples), end(this->samples));
     
        for (float j = 0; j < hei; ++j)
        {
            for (float i = 0; i < this->samples.size(); ++i)
            {
                std::cout << ((this->samples[i] > ((maxelem - minelem) * (j / hei) + minelem)) ? (j > hei - (hei / 2.f) <= 0.f ? "+" : "-") : "x");
            }
            std::cout << std::endl;
        }
    }
};

float f(float x)
{
    return sin(x);
}

int main()
{
    using namespace std;
    const uint size = 500;
 
    consoleGrapher<float> graph;
 
    for (uint x=0; x<size; ++x)
        graph.push(f(x / 40.f));
 
    graph.render(40);
 
    return EXIT_SUCCESS;
}