/*
    LA: linear algebra C++ interface library
    Copyright (C) 2008-2023 Jiri Pittner <jiri.pittner@jh-inst.cas.cz> or <jiri@pittnerovi.com>

    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 3 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, see <http://www.gnu.org/licenses/>.
*/

#ifndef _BITVECTOR_H_
#define _BITVECTOR_H_

#include "vec.h"
#include "numbers.h"
#include "laerror.h"
#include <stdint.h>

//TODO: if efficiency is requires, make also a monic_bitvector, which will not store the leading 1 explicitly
//and then the field operations will be done without any resize
//To avoid confusion this class must NOT be derived from bitvector and have only explicit constructor conversion

namespace LA {
//compressed storage of large bit vectors
//let's now use 64-bit blocks exclusively  for simplicity

typedef uint64_t bitvector_block; 

#define blockbits (8*sizeof(bitvector_block))

inline unsigned int bitvector_rounded(unsigned int n)
{
return ((n+blockbits-1)/blockbits)*blockbits; 
}

class bitvector : public NRVec<bitvector_block>
	{
private:
	unsigned int modulo;
public:
	bitvector() : NRVec<bitvector_block>() {};
	explicit bitvector (const unsigned int n):NRVec<bitvector_block>((n+blockbits-1)/blockbits) {modulo=n%blockbits; memset(v,0,nn*sizeof(bitvector_block));};
	bitvector (const bitvector_block a, const unsigned int n):NRVec<bitvector_block>(a,(n+blockbits-1)/blockbits) {modulo=n%blockbits;};
	bitvector(const bitvector &rhs) : NRVec<bitvector_block>(rhs) {modulo=rhs.modulo;};
	explicit bitvector(const uint8_t *data, const unsigned int n): NRVec<bitvector_block>((n+blockbits-1)/blockbits) 
		{
		modulo=n%blockbits;
		if(endianity()) laerror("not portable to big endian");
		else memcpy(&v[0],data,(n+7)/8);
		zero_padding();
		};      
	void getdata(uint8_t *data)
		{
		if(endianity()) laerror("not portable to big endian");
                else memcpy(data,&v[0],(size()+7)/8);
		}

	//operator= seems to be correctly synthetized by the compiler
	//override dereferencing to address single bits, is however possible
	//only in the const context (otherwise we would have to define a type which, when assigned to, changes a single bit - possible but probably inefficient)
	void resize(const unsigned int n, bool preserve=false); //preserve data or clear
	unsigned int size() const {return (nn*blockbits)-blockbits+(modulo?modulo:blockbits);};
	//arguments must be unsigned to keep the resulting assembly code simple and efficient
        const bool operator[](const unsigned int i) const {return (v[i/blockbits] >>(i%blockbits))&1ULL;};
	const bool get(const unsigned int i) const {return (*this)[i];};
	bitvector_block getblock(const unsigned int i) const {return v[i];}; //integer interpretation
	void setblock(const unsigned int i, const bitvector_block b) {v[i]=b;};
	int getblocksize() const {return 8*sizeof(bitvector_block);};
	void set(const unsigned int i) 
		{
#ifdef DEBUG
		if(i>=size()) laerror("bitvector index out of range in");
#endif
		v[i/blockbits] |= (1UL<<(i%blockbits));
		};
	void reset(const unsigned int i) 
		{
#ifdef DEBUG    
                if(i>=size()) laerror("bitvector index out of range in");
#endif
		v[i/blockbits] &= ~(1UL<<(i%blockbits));
		};
	void flip(const unsigned int i) 
		{
#ifdef DEBUG    
                if(i>=size()) laerror("bitvector index out of range in");
#endif
		v[i/blockbits] ^= (1UL<<(i%blockbits));
		};
	const bool assign(const unsigned int i, const bool r) {if(r) set(i); else reset(i); return r;};
	void clear() {copyonwrite(true); memset(v,0,nn*sizeof(bitvector_block));};
	void fill() {memset(v,0xff,nn*sizeof(bitvector_block));};
	void zero_padding() const; 
	bool is_zero() const {zero_padding(); for(int i=0; i<nn; ++i) if(v[i]) return false; return true;};
	bool is_one() const {zero_padding(); if(v[0]!=1) return false; for(int i=1; i<nn; ++i) if(v[i]) return false;return true;};
	bool iszero() const {return is_zero();};
	void randomize();
	bitvector& operator++();
	bitvector& operator--();
	bool operator!=(const bitvector &rhs) const;
	bool operator==(const bitvector &rhs) const {return !(*this != rhs);};
	bool operator>(const bitvector &rhs) const;
	bool operator<(const bitvector &rhs) const;
	bool operator>=(const bitvector &rhs) const {return !(*this < rhs);};
	bool operator<=(const bitvector &rhs) const {return !(*this > rhs);};
	bitvector operator~() const;
	bitvector& operator&=(const bitvector &rhs);
	bitvector& operator|=(const bitvector &rhs);
	bitvector& operator^=(const bitvector &rhs);
	bitvector& operator&=(const bitvector_block rhs) {v[0]&=rhs; return *this;};
        bitvector& operator|=(const bitvector_block rhs) {v[0]|=rhs; return *this;};
        bitvector& operator^=(const bitvector_block rhs) {v[0]^=rhs; return *this;};
	bitvector& operator+=(const bitvector &rhs) {return (*this)^=rhs;}; //addition modulo 2
	bitvector& operator-=(const bitvector &rhs) {return (*this)^=rhs;}; //subtraction modulo 2
	bitvector operator&(const bitvector &rhs) const {return bitvector(*this) &= rhs;};
	bitvector operator|(const bitvector &rhs) const {return bitvector(*this) |= rhs;};
	bitvector operator^(const bitvector &rhs) const {return bitvector(*this) ^= rhs;};
	bitvector operator+(const bitvector &rhs) const {return *this ^ rhs;}; //addition modulo 2
	bitvector operator-(const bitvector &rhs) const {return *this ^ rhs;}; //subtraction modulo 2
	bitvector multiply(const bitvector &rhs, bool autoresize=true) const; //use autoresize=false only if you know it will not overflow!
	bitvector operator*(const bitvector &rhs) const {return multiply(rhs,true);}  //multiplication of polynomials over GF(2) NOTE: naive algorithm, does not employ CLMUL nor fft-like approach, only for short vectors!!!
	bitvector&  operator*=(const bitvector &rhs) {*this = (*this)*rhs; return *this;}
	bitvector pow(unsigned int n) const; 
	bitvector field_mult(const bitvector &rhs, const bitvector &irpolynom) const; //multiplication in GF(2^n)
	bitvector field_inv(const bitvector &irpolynom) const; //multiplication in GF(2^n)
	bitvector field_div(const bitvector &rhs, const bitvector &irpolynom) const {return field_mult(rhs.field_inv(irpolynom),irpolynom);};
	bitvector field_composition(const bitvector &rhs, const bitvector &irpolynom) const;
	bitvector field_pow(unsigned int n, const bitvector &irpolynom) const; 
	bitvector field_sqrt(const bitvector &irpolynom) const;
	bool is_irreducible() const; //test irreducibility of polynomial over GF2
	bitvector division(const bitvector &rhs,  bitvector &remainder) const;
	bitvector operator/(const bitvector &rhs) const {bitvector rem(rhs.size()); return division(rhs,rem);};
	bitvector operator%(const bitvector &rhs) const {bitvector rem(rhs.size()); division(rhs,rem); return rem;};
	bitvector gcd(const bitvector &rhs) const; //as a polynomial over GF2
	bitvector lcm(const bitvector &rhs) const {return (*this)*rhs/this->gcd(rhs);};
	bitvector composition(const bitvector &rhs) const;
        unsigned int bitdiff(const bitvector &y) const; //number of differing bits (Hamming distance)
	unsigned int population(const unsigned int before=0) const; //number of 1's (Hamming weight)
	unsigned int nlz() const; //number of leading zeroes
	unsigned int degree() const {if(iszero()) return 0; else return size()-nlz()-1;}; //interprested as a polynomial over GF(2)
	void truncate(int t=0) {int s=degree()+1; if(t>s) s=t;  resize(s,true);};
	unsigned int ntz() const;  //number of trailing zeroes
	//extended, truncated const i.e. not on *this but return new entity, take care of modulo's bits
	//logical shifts
	bitvector& operator>>=(unsigned int i);
	bitvector& leftshift(unsigned int i, bool autoresize=false);
	bitvector& operator<<=(unsigned int i) {return leftshift(i,true);};
	bitvector operator>>(unsigned int i) const {bitvector r(*this); return r>>=i;};
	bitvector operator<<(unsigned int i) const {bitvector r(*this); return r<<=i;};
	//logical rotations not implemented yet
	//unformatted file IO
	void read(int fd, bool dimensions=1, bool transp=0);
	void write(int fd, bool dimensions=1, bool transp=0);
	};

extern bitvector find_irreducible(int deg, int pop= -1, int nth=1); //degree and requested Hamming weight or -1 for random trial

class bitmatrix : public bitvector
        {
private:
        unsigned int nn,mm;
public:
	unsigned int nrows() const {return nn;}
	unsigned int ncols() const {return mm;}
	bitmatrix() : nn(0),mm(0) {};
	bitmatrix(unsigned int nn0,unsigned int mm0) : nn(nn0),mm(mm0){bitvector::resize(nn*mm,false);};
	void set(const unsigned int i, const unsigned int j) {bitvector::set(i*mm+j);};
	void reset(const unsigned int i, const unsigned int j) {bitvector::reset(i*mm+j);};
	void flip(const unsigned int i, const unsigned int j) {bitvector::flip(i*mm+j);};
	const bool assign(const unsigned int i, const unsigned int j, const bool r) {if(r) bitvector::set(i*mm+j); else bitvector::reset(i*mm+j); return r;};
	const bool operator()(const unsigned int i,  const unsigned int j) const {return bitvector::operator[](i*mm+j);};
	void resize(const unsigned int n, const unsigned int m) {nn=n; mm=m; bitvector::resize(n*m,false);};
};

//expand to separate bytes or ints
template <typename T>
void bitvector_expand(const bitvector &v, NRVec<T> &r)
{
int n=v.size();
r.resize(n);
r.clear();
for(int i=0; i<n; ++i) if(v[i]) r[i]=1;
}

//mantissa of a floating number between 0 and 1
template <typename T>
bitvector mantissa(T x, int nbits, int shift=0)
{
while(shift >0) {x+=x; --shift;}
while(shift <0) {x*=.5; ++shift;}
if(x<0||x>=1) laerror("number not normalized in bitvector mantissa");
bitvector b(nbits);
b.clear();
T y= x+x;
for(int i=0; i<nbits-1; ++i)
	{
	int n= (int) y;
	if(n&1) b.set(i+1);
	y += y;
	}
return b;
}

template <typename T>
void bitvector_decimal(T &x, const bitvector &b, int shift=0) 
{
x=0;
for(int i=b.size()-1; i>=0; --i) if(b[i]) x += 1./(1ULL<<i);
while(shift >0) {x+=x; --shift;}
while(shift <0) {x*=.5; ++shift;}
}


template <typename T>
void bitvector_compress(bitvector &r, const NRVec<T> &v)
{
int n=v.size();
r.resize(n);
r.clear();
for(int i=0; i<n; ++i) if(v[i]) r.set(i);
}


extern std::ostream & operator<<(std::ostream &s, const bitvector &x);
extern std::istream & operator>>(std::istream  &s, bitvector &x);

extern std::ostream & operator<<(std::ostream &s, const bitmatrix &x);
extern std::istream & operator>>(std::istream  &s, bitmatrix &x);



class bitvector_from1 : public bitvector
	{
public:
	bitvector_from1() : bitvector() {};
	bitvector_from1(const bitvector &rhs) :bitvector(rhs) {};
	explicit bitvector_from1(const unsigned int n) : bitvector(n) {};
	const bool operator[](const unsigned int i) {return bitvector::operator[](i-1);};
	void set(const unsigned int i) {bitvector::set(i-1);};
	void reset(const unsigned int i) {bitvector::reset(i-1);};
	const bool get(const unsigned int i) {return bitvector::get(i-1);};
	const bool assign(const unsigned int i, const bool r) {return bitvector::assign(i-1,r);};
	unsigned int population(const unsigned int before=0) const {return bitvector::population(before?before-1:0);};
	};

}//namespace
#endif