/*

    Copyright (C) 2013 Børre Gaup <borre.gaup@uit.no>

    This file is part of the program wordlist2hunspell.

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

    You should have received a copy of the GNU General Public License along
    with this program; if not, write to the Free Software Foundation, Inc.,
    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.

*/

#include <UnitTest++.h>
#include <iostream>
#include <sstream>

// dirty trick to make private functions available for testing :D
#define private public

// place includes for classes that should be test below this line
#include "../wordlistparsernocompound.h"

extern void debugoutputSetSetMap(std::map<std::set<int>, std::set<int> > uffsetsetmap);
extern void debugoutputStringIntMap(std::map<std::string, int> uffstringintmap);
extern std::istream* setupinputfile();
extern std::string wp2wordlist(std::map<std::string, int> stems, std::map<std::string, int> suffixes,
                        std::map< std::set<int>, std::set<int> > ss);

std::map<std::string, int> nocompoundsetupstemmap()
{
    std::map<std::string, int> stems;

    int i = 1;
    stems.insert(std::pair<std::string, int>("100000-geardásačča", i)); ++i;
    stems.insert(std::pair<std::string, int>("100000-geardásaš", i)); ++i;
    stems.insert(std::pair<std::string, int>("10000-geardásačča", i)); ++i;
    stems.insert(std::pair<std::string, int>("10000-geardásaš", i)); ++i;
    stems.insert(std::pair<std::string, int>("1000-geardásačča", i)); ++i;
    stems.insert(std::pair<std::string, int>("1000-geardásaš", i)); ++i;
    stems.insert(std::pair<std::string, int>("10-Đ", i)); ++i;
    stems.insert(std::pair<std::string, int>("10-Đ-", i)); ++i;
    stems.insert(std::pair<std::string, int>("1-D", i)); ++i;
    stems.insert(std::pair<std::string, int>("1-D-", i)); ++i;
    stems.insert(std::pair<std::string, int>("2-C", i)); ++i;
    stems.insert(std::pair<std::string, int>("2-C-", i)); ++i;
    stems.insert(std::pair<std::string, int>("3-juvllatsihkkel", i)); ++i;
    stems.insert(std::pair<std::string, int>("7. juni-plassen", i)); ++i;
    stems.insert(std::pair<std::string, int>("Aabakken", i)); ++i;
    stems.insert(std::pair<std::string, int>("Aabel", i)); ++i;
    stems.insert(std::pair<std::string, int>("abandonere", i)); ++i;
    stems.insert(std::pair<std::string, int>("aborigiinnalačča", i)); ++i;
    stems.insert(std::pair<std::string, int>("absoluhta", i)); ++i;
    stems.insert(std::pair<std::string, int>("absoluhtalačča", i)); ++i;
    stems.insert(std::pair<std::string, int>("addinbeai", i)); ++i;
    stems.insert(std::pair<std::string, int>("advokáhta gukto", i)); ++i;
    stems.insert(std::pair<std::string, int>("agibeai", i)); ++i;
    stems.insert(std::pair<std::string, int>("a.", i)); ++i;
    stems.insert(std::pair<std::string, int>("almmustusbeai", i)); ++i;
    stems.insert(std::pair<std::string, int>("as", i)); ++i;
    stems.insert(std::pair<std::string, int>("čuohpan", i)); ++i;
    stems.insert(std::pair<std::string, int>("dáppe", i)); ++i;
    stems.insert(std::pair<std::string, int>("dieppe", i)); ++i;
    stems.insert(std::pair<std::string, int>("doppe", i)); ++i;
    stems.insert(std::pair<std::string, int>("NSR", i)); ++i;

    return stems;
}

TEST(NoCompoundTestProcessFileStems)
{
    std::istream* inputfile = setupinputfile();

    WordlistParserNoCompound wp;
    wp.processFile(inputfile);

    std::map<std::string, int> got = wp.getStems();
    std::map<std::string, int> want = nocompoundsetupstemmap();

    CHECK_EQUAL(want.size(), got.size());
    CHECK(equal(want.begin(), want.end(), got.begin()));
}

std::map<std::string, int> nocompoundsuffixmap()
{
    std::map<std::string, int> s;

    int i = 1;
    s.insert(std::pair<std::string, int>("ide\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("id\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("id-\tX", i)); ++i;
    s.insert(std::pair<std::string, int>("iguin\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("0\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("-\tX", i)); ++i;
    s.insert(std::pair<std::string, int>(":ide\tI", i)); ++i;
    s.insert(std::pair<std::string, int>(":id\tI", i)); ++i;
    s.insert(std::pair<std::string, int>(":iguin\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("0\tX", i)); ++i;
    s.insert(std::pair<std::string, int>("aččade\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("aččadet\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("aččaidanguin\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("a\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("a-\tX", i)); ++i;
    s.insert(std::pair<std::string, int>("ii\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("iin\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("ba\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("beahtti\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("behtet\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("dan\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("deaddjái\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("deaddji\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("deaddjin\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("dišgoahtán\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("duvvogoahtán\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("t\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("buččat\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("de\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("det\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("me\tI", i)); ++i;
    s.insert(std::pair<std::string, int>(":in\tX", i)); ++i;
    s.insert(std::pair<std::string, int>(":in-\tX", i)); ++i;
    s.insert(std::pair<std::string, int>(":i\tX", i)); ++i;
    s.insert(std::pair<std::string, int>(":i-\tX", i)); ++i;
    s.insert(std::pair<std::string, int>(":n\tX", i)); ++i;
    s.insert(std::pair<std::string, int>(":n-\tX", i)); ++i;
    s.insert(std::pair<std::string, int>("laččaide\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("laččaid\tI", i)); ++i;
    s.insert(std::pair<std::string, int>("laččaiguin\tI", i)); ++i;
    s.insert(std::pair<std::string, int>(":i\tI", i)); ++i;

    return s;
}

TEST(NoCompoundTestProcessFileSuffixes)
{
    std::istream* inputfile = setupinputfile();

    WordlistParserNoCompound wp;
    wp.processFile(inputfile);

    std::map<std::string, int> want = nocompoundsuffixmap();
    std::map<std::string, int> got = wp.getSuffixMap();

    CHECK_EQUAL(want.size(), got.size());
    CHECK(equal(got.begin(), got.end(), want.begin()));
}

std::set<std::string> nocompoundsetupplxclasses()
{
    std::set<std::string> plxclasses;

    plxclasses.insert("I");
    plxclasses.insert("X");

    return plxclasses;
}

TEST(NoCompoundTestProcessFilePlx)
{
    std::istream* inputfile = setupinputfile();

    WordlistParserNoCompound wp;
    wp.processFile(inputfile);

    std::set<std::string> want = nocompoundsetupplxclasses();
    std::set<std::string> got = wp.getPlxClasses();

    CHECK_EQUAL(want.size(), got.size());
    CHECK(equal(got.begin(), got.end(), want.begin()));
}

TEST(NoCompoundTestProcessFileSuffixStemMap)
{
    std::istream* inputfile = setupinputfile();

    WordlistParserNoCompound wp;
    wp.processFile(inputfile);

    std::string want("100000-geardásaččaide\tI\n100000-geardásaččaid\tI\n100000-geardásaččaid-\tX\n100000-geardásaččaiguin\tI\n100000-geardásačča\tI\n100000-geardásačča-\tX\n1000-geardásaččaid\tI\n10000-geardásaččaid\tI\n10000-geardásačča\tI\n10000-geardásaš\tI\n1000-geardásaš\tI\n1-D\tI\n2-C\tI\n100000-geardásaš\tI\n100000-geardásaš-\tX\n7. juni-plassen\tI\n7. juni-plassen-\tX\n7. juni-plassena\tI\n7. juni-plassena-\tX\n7. juni-plassenii\tI\n7. juni-plasseniin\tI\n10-Đ\tI\n10-Đ:ide\tI\n10-Đ:id\tI\n10-Đ:iguin\tI\nNSR\tI\nNSR:i\tI\nAabel-\tX\naddinbeai-\tX\nagibeai-\tX\nalmmustusbeai-\tX\nAabakken-\tX\nAabakkena\tI\nAabakkena-\tX\nas:ide\tI\nas:id\tI\nas:iguin\tI\n10-Đ-\tX\n1-D-\tX\n2-C-\tX\ndáppe\tX\ndieppe\tX\ndoppe\tX\n3-juvllatsihkkelaččade\tI\n3-juvllatsihkkelaččadet\tI\n3-juvllatsihkkelaččaidanguin\tI\nabandonereba\tI\nabandonerebeahtti\tI\nabandonerebehtet\tI\nabandoneredan\tI\nabandoneredeaddjái\tI\nabandoneredeaddji\tI\nabandoneredeaddjin\tI\nabandoneredišgoahtán\tI\nabandonereduvvogoahtán\tI\naborigiinnalaččat\tI\nabsoluhtalaččat\tI\nabsoluhtabuččat\tI\nadvokáhta guktode\tI\nadvokáhta guktodet\tI\nadvokáhta guktome\tI\na.:in\tX\na.:in-\tX\na.:i\tX\na.:i-\tX\na.:n\tX\na.:n-\tX\nčuohpanlaččaide\tI\nčuohpanlaččaid\tI\nčuohpanlaččaiguin\tI\n");
    std::map< std::set<int>, std::set<int> > ss = wp.getSuffixSetStemSet();

    std::string got = wp2wordlist(wp.getStems(), wp.getSuffixMap(), ss);
    CHECK_EQUAL(want, got);
}