/* Copyright (C) 2014
 * swift Project Community / Contributors
 *
 * This file is part of swift project. It is subject to the license terms in the LICENSE file found in the top-level
 * directory of this distribution and at http://www.swift-project.org/license.html. No part of swift project,
 * including this file, may be copied, modified, propagated, or distributed except according to the terms
 * contained in the LICENSE file.
 */

#include "samplesalgorithm.h"
#include "blackmisc/algorithm.h"
#include "blackmisc/sequence.h"
#include "blackmisc/collection.h"
#include <QDebug>
#include <QString>
#include <numeric>

namespace BlackMiscTest
{

    /*
     * Samples
     */
    int CSamplesAlgorithm::samples()
    {
        BlackMisc::CSequence<int> seq;
        for (int i = 1; i <= 100; ++i)
        {
            seq.push_back(i);
        }
        const int samples = 200;
        BlackMisc::CSequence<int> means;
        {
            for (int i = 0; i < samples; ++i)
            {
                auto randoms = seq.randomElements(10);
                means.push_back(std::accumulate(randoms.cbegin(), randoms.cend(), 0) / 10);
            }
            int mean = std::accumulate(means.cbegin(), means.cend(), 0) / samples;
            int stdDev = std::sqrt(std::accumulate(means.cbegin(), means.cend(), 0, [ & ](int a, int n) { return a + (n - mean) * (n - mean); }) / samples);
            qDebug() << "randomElements";
            qDebug() << "means:" << means;
            qDebug() << "mean of the means:" << mean;
            qDebug() << "std deviation of the means:" << stdDev;
        }
        means.clear();
        {
            for (int i = 0; i < samples; ++i)
            {
                auto randoms = seq.sampleElements(10);
                means.push_back(std::accumulate(randoms.cbegin(), randoms.cend(), 0) / 10);
            }
            int mean = std::accumulate(means.cbegin(), means.cend(), 0) / samples;
            int stdDev = std::sqrt(std::accumulate(means.cbegin(), means.cend(), 0, [ & ](int a, int n) { return a + (n - mean) * (n - mean); }) / samples);
            qDebug() << "sampleElements";
            qDebug() << "means:" << means;
            qDebug() << "mean of the means:" << mean;
            qDebug() << "std deviation of the means:" << stdDev;
        }

        QStringList src { "a1", "a2", "a3", "b1", "b2", "b3", "c1", "c2", "c3" };
        std::random_shuffle(src.begin(), src.end());
        qDebug() << src;
        qDebug() << "topologicallySortedInsert";
        QStringList dst;
        int count = 0;
        auto cmp = [ & ](const QString &a, const QString &b) { count++; return a[0] == b[0] && a[1] < b[1]; };
        for (const auto &s : src) { BlackMisc::topologicallySortedInsert(dst, s, cmp); }
        qDebug() << count << "comparisons";
        qDebug() << dst;
        qDebug() << "topologicalSort";
        count = 0;
        BlackMisc::topologicalSort(dst.begin(), dst.end(), cmp);
        qDebug() << count << "comparisons";
        qDebug() << dst;

        return 0;
    }

} // namespace