/************************************************************************
 ************************************************************************
    FAUST compiler
    Copyright (C) 2003-2018 GRAME, Centre National de Creation Musicale
    ---------------------------------------------------------------------
    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU Lesser General Public License as published by
    the Free Software Foundation; either version 2.1 of the License, or
    (at your option) any later version.

    This program 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 Lesser General Public License for more details.

    You should have received a copy of the GNU Lesser General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 ************************************************************************
 ************************************************************************/

#include <algorithm>
#include <iostream>

#include "exception.hh"
#include "splitSchema.h"

using namespace std;

/**
 * Creates a new split schema. Cables are enlarged to dWire.
 * The horizontal gap between the two subschema is such that
 * the connections are not too sloppy.
 */
schema* makeSplitSchema(schema* s1, schema* s2)
{
    // make sure a and b are at least dWire large
    schema* a = makeEnlargedSchema(s1, dWire);
    schema* b = makeEnlargedSchema(s2, dWire);

    // horizontal gap to avoid too sloppy connections
    double hgap = (a->height() + b->height()) / 4;

    return new splitSchema(a, b, hgap);
}

/**
 * Constructor for a split schema s1 <: s2 where the outputs
 * of s1 are distributed to the inputs of s2. The constructor is
 * private in order to enforce the usage of makeSplitSchema
 */
splitSchema::splitSchema(schema* s1, schema* s2, double hgap)
    : schema(s1->inputs(), s2->outputs(), s1->width() + s2->width() + hgap,
             max(s1->height(), s2->height())),
      fSchema1(s1),
      fSchema2(s2),
      fHorzGap(hgap)
{
}

/**
 * Places the two subschema horizontaly, centered, with enough gap for
 * the connections
 */
void splitSchema::place(double ox, double oy, int orientation)
{
    beginPlace(ox, oy, orientation);

    double dy1 = max(0.0, fSchema2->height() - fSchema1->height()) / 2.0;
    double dy2 = max(0.0, fSchema1->height() - fSchema2->height()) / 2.0;

    if (orientation == kLeftRight) {
        fSchema1->place(ox, oy + dy1, orientation);
        fSchema2->place(ox + fSchema1->width() + fHorzGap, oy + dy2, orientation);
    } else {
        fSchema2->place(ox, oy + dy2, orientation);
        fSchema1->place(ox + fSchema2->width() + fHorzGap, oy + dy1, orientation);
    }
    endPlace();
}

/**
 * The inputs of s1 <: s2 are the inputs of s1
 */
point splitSchema::inputPoint(unsigned int i) const
{
    return fSchema1->inputPoint(i);
}

/**
 * The outputs of s1 <: s2 are the outputs of s2
 */
point splitSchema::outputPoint(unsigned int i) const
{
    return fSchema2->outputPoint(i);
}

/**
 * Draw the two sub schema and the connections between them
 */
void splitSchema::draw(device& dev)
{
    faustassert(placed());

    // draw the two subdiagrams
    fSchema1->draw(dev);
    fSchema2->draw(dev);

    unsigned int r = fSchema1->outputs();
    faustassert(r > 0);
#if 0
    // draw the connections between them
    for (unsigned int i=0; i<fSchema2->inputs(); i++) {
        point p = fSchema1->outputPoint(i%r);
        point q = fSchema2->inputPoint(i);
        if(p.z>0) {
            dev.trait(p.x, p.y, q.x, q.y);
        }
    }
#endif
}

/**
 * Draw the two sub schema and the connections between them
 */
void splitSchema::collectTraits(collector& c)
{
    faustassert(placed());

    // draw the two subdiagrams
    fSchema1->collectTraits(c);
    fSchema2->collectTraits(c);

    unsigned int r = fSchema1->outputs();
    faustassert(r > 0);

    // draw the connections between them
    for (unsigned int i = 0; i < fSchema2->inputs(); i++) {
        point p = fSchema1->outputPoint(i % r);
        point q = fSchema2->inputPoint(i);
        c.addTrait(trait(point(p.x, p.y), point(q.x, q.y)));
    }
}
