/*++
Copyright (c) 2017 Microsoft Corporation

Module Name:

    <name>

Abstract:

    <abstract>

Author:

    Lev Nachmanson (levnach)

Revision History:


--*/

#pragma once
#include "util/vector.h"
#include "util/debug.h"
#include <string>
#include <iomanip>
#include "math/lp/lp_utils.h"
#include "math/lp/lp_settings.h"
#include <unordered_set>
namespace lp {

template <typename T> void print_sparse_vector(const vector<T> & t, std::ostream & out);

void print_vector_as_doubles(const vector<mpq> & t, std::ostream & out);
template <typename T>
class indexed_vector {
public:
    // m_index points to non-zero elements of m_data
    vector<T> m_data;
    vector<unsigned> m_index;
    indexed_vector(unsigned data_size) {
        m_data.resize(data_size, numeric_traits<T>::zero());
    }

    indexed_vector& operator=(const indexed_vector<T>& y) {
        for (unsigned i: m_index)
            m_data[i] = zero_of_type<T>();

        m_index = y.m_index;

        m_data.resize(y.data_size());
        for (unsigned i : m_index)
            m_data[i] = y[i];
        return *this;
    }

    bool operator==(const indexed_vector<T>& y) const {
        std::unordered_set<unsigned> y_index;
        for (unsigned i : y.m_index)
            y_index.insert(i);

        std::unordered_set<unsigned> this_index;
        for (unsigned i : m_index)
            this_index.insert(i);

        for (unsigned i : y.m_index) {
            if (this_index.find(i) == this_index.end())
                return false;
        }
           
        for (unsigned i : m_index) {
            if (y_index.find(i) == y_index.end())
                return false;
        }

        return vectors_are_equal(m_data, m_data);

    }

    indexed_vector() = default;

    void resize(unsigned data_size);
    unsigned data_size() const {
        return m_data.size();
    }

    unsigned size() const {
        return m_index.size();
    }

    void set_value(const T& value, unsigned index);
    
    void clear();
    void clear_all();
    const T& operator[] (unsigned i) const {
        return m_data[i];
    }

    T& operator[] (unsigned i)  {
        return m_data[i];
    }

    
    void erase_from_index(unsigned j);
    
    void add_value_at_index(unsigned j, const T& val_to_add) {
        T & v = m_data[j];
        bool was_zero = is_zero(v);
        v += val_to_add;
        if (is_zero(v)) {
            if (!was_zero)
                erase_from_index(j);
        } else {
            if (was_zero)
                m_index.push_back(j);
        }
    }

    struct ival {
        unsigned m_var;
        const T & m_coeff;
        ival(unsigned var, const T & val) : m_var(var), m_coeff(val) {
        }
        unsigned var() const { return m_var;}
        const T & coeff() const { return m_coeff; }
        bool dead() const { return false; }
    };
    
    struct const_iterator {
            // fields
        const unsigned *m_i;
        const indexed_vector& m_v;
        
        //typedefs
            
            
        typedef const_iterator self_type;
        typedef ival value_type;
        typedef const ival reference;
        //        typedef const column_cell* pointer;
        typedef int difference_type;
        typedef std::forward_iterator_tag iterator_category;

        reference operator*() const {
            return ival(*m_i, m_v[*m_i]);
        }        
        self_type operator++() {  self_type i = *this; m_i++; return i;  }
        self_type operator++(int) { m_i++; return *this; }

        const_iterator(const unsigned* it, const indexed_vector& v) :
            m_i(it),
            m_v(v)
        {}
        bool operator==(const self_type &other) const {
            return m_i == other.m_i;
        }
        bool operator!=(const self_type &other) const { return !(*this == other); }
    };

    const_iterator begin() const {
        return const_iterator(m_index.begin(), *this);
    }
        
    const_iterator end() const {
        return const_iterator(m_index.end(), *this);
    }

    
    void print(std::ostream & out);
};
}
