// TODO: Replace `cout, printf` with sprintf&fputs and custom buffers

#ifndef _TABLE_H
#define _TABLE_H

#include "types.h"
#include "vector_type.hpp"
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdarg>
#include <vector>
#include <string_view>
#include "io.h"
#include "hasher.h"

#undef ERROR
template <typename T>
class vector_type;
template <>
class vector_type<void>;

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
namespace types {
	enum Type_t;
	template <typename T>
	struct Types;
	template <class T1, class T2, class ...Ts>
	struct Coercion;
}
#endif
struct ColRef_cstorage {
	void* container;
	unsigned int size, capacity;
	const char* name;
	int ty; // what if enum is not int?
};

template <template <class...> class VT, class T, 
	std::enable_if_t<std::is_base_of_v<vector_base<T>, VT<T>>>* = nullptr>
std::ostream& operator<<(std::ostream& os, const VT<T>& v)
{
	v.out();
	return os;
}

#ifdef __AQ__HAS__INT128__
std::ostream& operator<<(std::ostream& os, __int128& v);
std::ostream& operator<<(std::ostream& os, __uint128_t& v);
#endif

std::ostream& operator<<(std::ostream& os, int8_t& v);
std::ostream& operator<<(std::ostream& os, uint8_t& v);
std::ostream& operator<<(std::ostream& os, types::date_t& v);
std::ostream& operator<<(std::ostream& os, types::time_t& v);
std::ostream& operator<<(std::ostream& os, types::timestamp_t& v);

template<class T>
struct TableStats {
	T minima = 0;
	unsigned char bits = 255;
};

template<typename _Ty>
class ColView;
template<typename _Ty>
class ColRef : public vector_type<_Ty>
{
public:
	typedef ColRef<_Ty> Decayed_t;
	const char* name;
	types::Type_t ty = types::Type_t::ERROR;
	TableStats<_Ty> stats;
	bool populate_stats() {
		if constexpr (std::is_integral_v<_Ty>) {
			if (stats.bits <= 128) return true;
			stats.minima = std::numeric_limits<_Ty>::max();
			_Ty maxima = std::numeric_limits<_Ty>::min();
			for (uint32_t i = 0; i < this->size; ++i) {
				if (this->container[i] < stats.minima) 
					stats.minima = this->container[i];
				else if (this->container[i] > maxima) 
					maxima = this->container[i];
			}
			stats.bits = ceil(log2(maxima - stats.minima));
			return true;
		}
		return false;
	}
	ColRef(const ColRef<_Ty>& vt) : vector_type<_Ty>(vt) {}
	ColRef(ColRef<_Ty>&& vt) : vector_type<_Ty>(std::move(vt)) {}
	ColRef() : vector_type<_Ty>(0), name("") {}
	ColRef(const uint32_t& size, const char* name = "") : vector_type<_Ty>(size), name(name) {}
	ColRef(const char* name) : name(name) {}
	ColRef(const uint32_t size, void* data, const char* name = "") : vector_type<_Ty>(size, data), name(name) {}
	void init(const char* name = "") { ty = types::Types<_Ty>::getType();  this->size = this->capacity = 0; this->container = 0; this->name = name; }
	void initfrom(uint32_t sz, void* container, const char* name = "") {
		ty = types::Types<_Ty>::getType();
		this->size = sz;
		this->capacity = 0;
		this->container = (_Ty*)container;
		this->name = name;
	}
	template<template <typename> class VT, typename T>
	void initfrom(VT<T>&& v, const char* name = "") {
		ty = types::Types<_Ty>::getType();
		this->size = v.size;
		this->capacity = v.capacity;
		this->container = (_Ty*)(v.container);
		this->name = name;
		v.capacity = 0;
	}
	template<template <typename> class VT, typename T>
	void initfrom(VT<T>& v, const char* name = "") {
		ty = types::Types<_Ty>::getType();
		this->size = v.size;
		this->capacity = 0;
		this->container = (_Ty*)(v.container);
		this->name = name;
		v.capacity = 0;
	}
	template<template <typename> class VT, typename T>
	void initfrom(const VT<T>& v, const char* name = "") {
		ty = types::Types<_Ty>::getType();
		this->size = v.size;
		this->capacity = 0;
		this->container = (_Ty*)(v.container);
		this->name = name;
	}
	void initfrom(vectortype_cstorage v, const char* name = "") {
		ty = types::Types<_Ty>::getType();
		this->size = v.size;
		this->capacity = v.capacity;
		this->container = (_Ty*)v.container;
		this->name = name;
	}
	template<typename T>
	void initfrom(const T& v, const char* name = "") {
		ty = types::Types<_Ty>::getType();
		this->size = 0;
		this->capacity = 0;
		this->emplace_back(v);
		this->name = name;
	}
	template <class T>
	ColRef<_Ty>& operator =(ColRef<T>&& vt) {
		this->container = (_Ty*)vt.container;
		this->size = vt.size;
		this->capacity = vt.capacity;
		vt.capacity = 0; // rvalue's 
		return *this;
	}
	template <class T>
	ColRef<_Ty> getRef(){
		return ColRef<_Ty>(this->size, this->container, this->name);
	}
	ColRef(const char* name, types::Type_t ty) : name(name), ty(ty) {}
	using vector_type<_Ty>::operator[];
	//using vector_type<_Ty>::operator=;
	using vector_type<_Ty>::subvec;
	using vector_type<_Ty>::subvec_memcpy;
	using vector_type<_Ty>::subvec_deep;
	ColRef<_Ty>& operator= (const _Ty& vt) {
		vector_type<_Ty>::operator=(vt);
		return *this;
	}
	ColRef<_Ty>& operator =(const ColRef<_Ty>& vt) {
		vector_type<_Ty>::operator=(vt);
		return *this;
	}
	ColRef<_Ty>& operator =(ColRef<_Ty>&& vt) noexcept {
		vector_type<_Ty>::operator=(std::move(vt));
		return *this;
	
	}
	//  ColView<_Ty> operator [](vector_type<uint32_t>& idxs) const {
	//  	return ColView<_Ty>(*this, idxs);
	// }
	//  ColView<_Ty> operator [](const vector_type<uint32_t>& idxs) const {
	//  	return ColView<_Ty>(*this, idxs);
	//  }
	vector_type<_Ty> operator[](vector_type<uint32_t>& idxs) const {
		vector_type<_Ty> ret(idxs.size);
		for (uint32_t i = 0; i < idxs.size; ++i)
			ret.container[i] = this->container[idxs[i]];
		return ret;
	}
	vector_type<_Ty> operator [](const std::vector<bool>& idxs) const {
		vector_type<_Ty> ret (this->size);
		uint32_t i = 0;
		for(const auto& f : idxs){
			if(f) ret.emplace_back(this->operator[](i));
			++i;
		}
		return ret;
	}
	void out(uint32_t n = 1000, const char* sep = " ") const {
		const char* more = "";
		if (n < this->size)
			more = " ... ";
		else
			n = this->size;

		std::cout << '(';
		if (n > 0)
		{
			uint32_t i = 0;
			for (; i < n - 1; ++i)
				std::cout << this->operator[](i) << sep;
			std::cout << this->operator[](i);
		}
		std::cout << more;
		std::cout << ')';
	}
	template<typename T>
	ColRef<T> scast();

	ColRef<_Ty>* rename(const char* name) {
		this->name = name;
		return this;
	}
	static ColRef<vector_type<_Ty>> pack(uint32_t cnt, ...){
		va_list cols;
		va_start(cols, cnt);
		ColRef<_Ty> *col = (ColRef<_Ty>*)malloc(sizeof(ColRef<_Ty>) * cnt);
		for (uint32_t i = 0; i < cnt; ++i){
			ColRef_cstorage tmp = va_arg(cols, ColRef_cstorage);
			memcpy(&col[i], &tmp, sizeof(ColRef_cstorage));
			col[i].capacity = 0;
		}
		va_end(cols);
		if(cnt > 0){
			auto sz = col[0].size;
			ColRef<vector_type<_Ty>> ret(sz);
			for(uint32_t i = 0; i < sz; ++i){
				decltype(auto) v = ret[i];
				v.size = cnt;
				v.capacity = cnt;
				v.container = (_Ty*)malloc(sizeof(_Ty) * cnt);
				for(uint32_t j = 0; j < cnt; ++j) {
					v.container[j] = col[j][i];
				}
			}
			free(col);
			return ret;
		}
		else 
			return ColRef<vector_type<_Ty>>();
	}
	ColRef_cstorage s() {
		return *(ColRef_cstorage*)(this);
	}
	// defined in table_ext_monetdb.hpp
	void* monetdb_get_col(void** gc_vecs, uint32_t& cnt);
	
};
template<>
class ColRef<void> : public ColRef<int> {};

template<typename _Ty>
class ColView : public vector_base<_Ty> {
public:
	typedef ColRef<_Ty> Decayed_t;
	const uint32_t size;
	const ColRef<_Ty>& orig;
	vector_type<uint32_t> idxs;
	ColView(const ColRef<_Ty>& orig, vector_type<uint32_t>&& idxs) : orig(orig), size(idxs.size), idxs(std::move(idxs)) {}
	ColView(const ColRef<_Ty>& orig, const vector_type<uint32_t>& idxs) : orig(orig), idxs(idxs), size(idxs.size) {}
	ColView(const ColView<_Ty>& orig, const vector_type<uint32_t>& idxs) : orig(orig.orig), idxs(idxs), size(idxs.size) {
		for (uint32_t i = 0; i < size; ++i)
			idxs[i] = orig.idxs[idxs[i]];
	}
	_Ty& operator [](const uint32_t& i) const {
		return orig[idxs[i]];
	}
	struct Iterator_t {
		const uint32_t* val;
		const ColRef<_Ty>& orig;
		constexpr Iterator_t(const uint32_t* val, const ColRef<_Ty>& orig) noexcept : val(val), orig(orig) {}
		_Ty& operator*() { return orig[*val]; }
		bool operator != (const Iterator_t& rhs) const { return rhs.val != val; }
		bool operator == (const Iterator_t& rhs) const { return rhs.val == val; }
		size_t operator - (const Iterator_t& rhs) const { return val - rhs.val; }
		Iterator_t& operator++ () {
			++val;
			return *this;
		}
		Iterator_t operator++ (int) {
			Iterator_t tmp = *this;
			++val;
			return tmp;
		}
	};
	Iterator_t begin() const {
		return Iterator_t(idxs.begin(), orig);
	}
	Iterator_t end() const {
		return Iterator_t(idxs.end(), orig);
	}
	void out(uint32_t n = 1000, const char* sep = " ") const {
		n = n > size ? size : n;
		std::cout << '(';
		for (uint32_t i = 0; i < n; ++i)
			std::cout << this->operator[](i) << sep;
		std::cout << ')';
	}
	operator ColRef<_Ty>() {
		auto ret = ColRef<_Ty>(size);
		for (uint32_t i = 0; i < size; ++i)
			ret[i] = orig[idxs[i]];
		return ret;
	}

	ColView<_Ty> subvec(uint32_t start, uint32_t end) const {
		uint32_t len = end - start;
		return ColView<_Ty>(orig, idxs.subvec(start, end));
	}

	ColRef<_Ty> subvec_deep(uint32_t start, uint32_t end) const {
		uint32_t len = end - start;
		ColRef<_Ty> subvec(len);
		for (uint32_t i = 0; i < len; ++i)
			subvec[i] = operator[](i);
		return subvec;
	}
	std::unordered_set<_Ty> distinct_common() {
		return std::unordered_set<_Ty> {begin(), end()};
	}
	uint32_t distinct_size() {
		return distinct_common().size();
	}
	ColRef<_Ty> distinct() {
		auto set = distinct_common();
		ColRef<_Ty> ret(set.size());
		uint32_t i = 0;
		for (auto& val : set)
			ret.container[i++] = val;
		return ret;
	}
	inline ColRef<_Ty> subvec(uint32_t start = 0) { return subvec_deep(start, size); }
};

template <class Type>
struct decayed_impl<ColView, Type> { typedef ColRef<Type> type; };

template<typename _Ty>
template<typename T>
inline ColRef<T> ColRef<_Ty>::scast()
{
	this->ty = types::Types<T>::getType();
	return *(ColRef<T> *)this;
}
using uColRef = ColRef<void>;

template<class ...Types> struct TableInfo;
template<class ...Types> struct TableView;

template <long long _Index, bool order = true, class... _Types>
constexpr auto& get(const TableInfo<_Types...>& table) noexcept {
	if constexpr (order)
		return *(ColRef<std::tuple_element_t<_Index, std::tuple<_Types...>>> *) & (table.colrefs[_Index]);
	else
		return *(ColRef<std::tuple_element_t<-1 - _Index, std::tuple<_Types...>>> *) & (table.colrefs[-1 - _Index]);
}

template <long long _Index, class... _Types>
constexpr ColRef<std::tuple_element_t<_Index, std::tuple<_Types...>>>& get(const TableView<_Types...>& table) noexcept {
	return *(ColRef<std::tuple_element_t<_Index, std::tuple<_Types...>>> *) & (table.info.colrefs[_Index]);
}

template <class V>
struct is_vector_impl<ColRef<V>> : std::true_type {};
template <class V>
struct is_vector_impl<ColView<V>> : std::true_type {};
template <class V>
struct is_vector_impl<vector_type<V>> : std::true_type {};

template<class ...Types>
struct TableInfo {
	const char* name;
	ColRef<void>* colrefs;
	uint32_t n_cols;
	typedef std::tuple<Types...> tuple_type;
	void print(const char* __restrict sep, const char* __restrict end) const;

	template <class ...Types2>
	struct lineage_t {
		TableInfo<Types...>* this_table;
		TableInfo<Types2...>* table;
		vector_type<uint32_t> rid;
		constexpr lineage_t(TableInfo<Types...>* this_table, TableInfo<Types2...>* table)
			: this_table(this_table), table(table), rid(0) {}
		constexpr lineage_t() : this_table(0), table(0), rid(0) {}

		template <int col>
		inline auto& get(uint32_t idx) {
			return get<col>(*table)[rid[idx]];
		}
		void emplace_back(const uint32_t& v) {
			rid.emplace_back(v);
		}
	};

	template<class ...Types2>
	auto bind(TableInfo<Types2...>* table2) {
		return lineage_t(this, table2);
	}

	template <size_t i = 0>
	auto& get_col() {
		return *reinterpret_cast<ColRef<std::tuple_element_t <i, tuple_type>>*>(colrefs + i);
	}

	template <size_t j = 0>
	typename std::enable_if<j == sizeof...(Types) - 1, void>::type print_impl(const uint32_t& i, const char* __restrict sep = " ") const;
	template <size_t j = 0>
	typename std::enable_if < j < sizeof...(Types) - 1, void>::type print_impl(const uint32_t& i, const char* __restrict sep = " ") const;
	template <size_t ...Idxs>
	struct GetTypes {
		typedef typename std::tuple<typename std::tuple_element<Idxs, tuple_type>::type ...> type;
	};

	template <size_t ...Idxs>
	using getRecordType = typename GetTypes<Idxs...>::type;
	TableInfo(const char* name, uint32_t n_cols);
	TableInfo(const char* name = "", const char** col_names = nullptr);
	template <int prog = 0>
	inline void materialize(const vector_type<uint32_t>& idxs, TableInfo<Types...>* tbl = nullptr) { // inplace materialize
		if constexpr (prog == 0) tbl = (tbl == 0 ? this : tbl);
		if constexpr (prog == sizeof...(Types)) return;
		else {
			auto& col = get<prog>(*this);
			auto new_col = decays<decltype(col)>{ idxs.size };
			for (uint32_t i = 0; i < idxs.size; ++i)
				new_col[i] = col[idxs[i]];
			get<prog>(*tbl) = new_col;
			materialize<prog + 1>(idxs, tbl);
		}
	}
	inline TableInfo<Types...>* materialize_copy(const vector_type<uint32_t>& idxs) {
		auto tbl = new TableInfo<Types...>(this->name, sizeof...(Types));
		materialize<0>(idxs, tbl);
		return tbl;
	}
	template<int ...cols>
	inline vector_type<uint32_t>* order_by(vector_type<uint32_t>* ord = nullptr) {
		if (!ord) {
			ord = new vector_type<uint32_t>(colrefs[0].size);
			for (uint32_t i = 0; i < colrefs[0].size; ++i)
				(*ord)[i] = i;
		}
		std::sort(ord->begin(), ord->end(), [this](const uint32_t& lhs, const uint32_t& rhs) {
			return
				std::forward_as_tuple((cols >= 0 ? get<cols, (cols >= 0)>(*this)[lhs] : -get<cols, (cols >= 0)>(*this)[lhs]) ...)
				<
				std::forward_as_tuple((cols >= 0 ? get<cols, (cols >= 0)>(*this)[rhs] : -get<cols, (cols >= 0)>(*this)[rhs]) ...);
			});
		return ord;
	}
	template <int ...cols>
	auto order_by_view() {
		return TableView<Types...>(order_by<cols...>(), *this);
	}

	// Print 2 -- generate printf string first, supports flattening, supports sprintf/printf/fprintf
	template <int col, int ...rem_cols, class Fn, class ...__Types>
	inline void print2_impl(Fn func, const uint32_t& i, const __Types& ... args) const {
		using this_type = typename std::tuple_element<col, tuple_type>::type;
		const auto& this_value = get<col>(*this)[i];
		const auto& next = [&](auto& v) {
			if constexpr (sizeof...(rem_cols) == 0)
				func(args..., print_hook(v));
			else
				print2_impl<rem_cols...>(func, i, args ..., print_hook(v));
		};
		if constexpr (is_vector_type<this_type>)
			for (uint32_t j = 0; j < this_value.size; ++j)
				next(this_value[j]);
		else
			next(this_value);
	}
	std::string get_header_string(const char* __restrict sep, const char* __restrict end) const {
		std::string header_string = std::string();
		for (uint32_t i = 0; i < sizeof...(Types); ++i)
			header_string += std::string(this->colrefs[i].name) + sep + '|' + sep;
		if (const size_t l_sep = strlen(sep) + 1; header_string.size() >= l_sep)
			header_string.resize(header_string.size() - l_sep);
		header_string += end + std::string(header_string.size(), '=') + end;
		return header_string;
	}
	template <int ...cols>
	void print2(const char* __restrict sep = ",", const char* __restrict end = "\n",
		const vector_type<uint32_t>* __restrict view = nullptr, 
		FILE* __restrict fp = nullptr, uint32_t limit = std::numeric_limits<uint32_t>::max()
		) const {

		std::string printf_string =
			generate_printf_string<typename std::tuple_element<cols, tuple_type>::type ...>(sep, end);
		// puts(printf_string.c_str());
		std::string header_string = std::string();
		constexpr static int a_cols[] = { cols... };
		if (fp == nullptr){
			header_string = get_header_string(sep, end);
			header_string.resize(header_string.size() - strlen(end));
		}
		else {
			for (int i = 0; i < sizeof...(cols); ++i)
				header_string += std::string(this->colrefs[a_cols[i]].name) + sep;
			const size_t l_sep = strlen(sep);
			if (header_string.size() - l_sep >= 0)
				header_string.resize(header_string.size() - l_sep);
		}
		
		const auto& prt_loop = [&fp, &view, &printf_string, *this, &limit](const auto& f) {
#ifdef __AQ__HAS__INT128__			
			constexpr auto num_hge = count_type<__int128_t, __uint128_t>((tuple_type*)(0));
#else
			constexpr auto num_hge = 0;
#endif
			constexpr auto num_date = count_type<types::date_t>((tuple_type*)(0));
			constexpr auto num_time = count_type<types::time_t>((tuple_type*)(0));
			constexpr auto num_timestamp = count_type<types::timestamp_t>((tuple_type*)(0));
			char cbuf[ num_hge * 41 
				+ num_time * types::time_t::string_length() 
				+ num_date * types::date_t::string_length() 
				+ num_timestamp * types::timestamp_t::string_length() 
				+ 1 // padding for msvc not allowing empty arrays
			];
			setgbuf(cbuf);
			
			if (view){
				uint32_t outsz = limit > view->size ? view->size : limit;
				for (uint32_t i = 0; i < outsz; ++i) {
					print2_impl<cols...>(f, (*view)[i], printf_string.c_str());
					setgbuf();
				}
			}
			else{
				uint32_t outsz = limit > colrefs[0].size ? colrefs[0].size : limit;
				for (uint32_t i = 0; i < outsz; ++i) {
					print2_impl<cols...>(f, i, printf_string.c_str());
					setgbuf();
				}
			}
		};

		if (fp)
		{
			fprintf(fp, "%s%s", header_string.c_str(), end);
			prt_loop([&fp](auto... args) { fprintf(fp, args...); });
		}
		else {
			printf("%s%s", header_string.c_str(), end);
			prt_loop(printf);
		}
	}
	template <int ...vals> struct applier {
		constexpr static void apply(const TableInfo<Types...>& t, const char* __restrict sep = ",", const char* __restrict end = "\n",
			const vector_type<uint32_t>* __restrict view = nullptr, FILE* __restrict fp = nullptr, uint32_t limit = std::numeric_limits<uint32_t>::max()
			) 
		{
			t.template print2<vals ...>(sep, end, view, fp, limit);
		}
	};

	inline void printall(const char* __restrict sep = ",", const char* __restrict end = "\n",
		const vector_type<uint32_t>* __restrict view = nullptr, FILE* __restrict fp = nullptr, 
		uint32_t limit = std::numeric_limits<uint32_t>::max() ) const {
		applyIntegerSequence<sizeof...(Types), applier>::apply(*this, sep, end, view, fp, limit);
	}

	TableInfo<Types...>* rename(const char* name) {
		this->name = name;
		return this;
	}
	template <size_t ...Is>
	void inline
		reserve(std::index_sequence<Is...>, uint32_t size) {
		const auto& assign_sz = [&size](auto& col) {
			col.size = size;
			col.grow();
		};
		(assign_sz(get_col<Is>()), ...);
	}
	template <size_t ...Is>
	decltype(auto) inline
		get_record(std::index_sequence<Is...>, uint32_t i) {
		return std::forward_as_tuple(get_col<Is>()[i] ...);
	}
	template <size_t ...Is>
	void inline
		set_record(std::index_sequence<Is...>, const tuple_type& t, uint32_t i) {
		const auto& assign_field =
			[](auto& l, const auto& r) {
			l = r;
		};
		(assign_field(get_col<Is>()[i], std::get<Is>(t)), ...);
	}
	TableInfo<Types ...>* distinct() {
		std::unordered_set<tuple_type> d_records;
		std::make_index_sequence<sizeof...(Types)> seq;
		d_records.reserve(colrefs[0].size);
		for (uint32_t j = 0; j < colrefs[0].size; ++j) {
			d_records.insert(get_record(seq, j));
		}
		reserve(seq, d_records.size());
		uint32_t i = 0;
		for (const auto& dr : d_records) {
			set_record(seq, dr, i++);
		}
		return this;
	}
	// defined in monetdb_conn.cpp
	void monetdb_append_table(void* srv, const char* alt_name = nullptr);
};


template<class ...Types>
struct TableView {
	typedef std::tuple<Types...> tuple_type;
	const vector_type<uint32_t>* idxs;
	const TableInfo<Types...>& info;
	constexpr TableView(const vector_type<uint32_t>* idxs, const TableInfo<Types...>& info) noexcept : idxs(idxs), info(info) {}
	void print(const char* __restrict sep, const char* __restrict end) const;
	template <size_t j = 0>
	typename std::enable_if<j == sizeof...(Types) - 1, void>::type print_impl(const uint32_t& i, const char* __restrict sep = " ") const;
	template <size_t j = 0>
	typename std::enable_if < j < sizeof...(Types) - 1, void>::type print_impl(const uint32_t& i, const char* __restrict sep = " ") const;

	template <size_t ...Is>
	decltype(auto) inline
		get_record(std::index_sequence<Is...>, uint32_t i) {
		return std::forward_as_tuple(info.template get_col<Is>()[idxs[i]] ...);
	}

	TableInfo<Types ...>* get_tableinfo(const char* name = nullptr, const char** names = nullptr) {
		if (name == nullptr)
			name = info.name;

		const char* info_names[sizeof...(Types)];
		if (name == nullptr) {
			for (uint32_t i = 0; i < sizeof...(Types); ++i)
				info_names[i] = info.colrefs[i].name;
			names = info_names;
		}

		return new TableInfo<Types ...>(name, names);
	}

	TableInfo<Types ...>* materialize(const char* name = nullptr, const char** names = nullptr) {
		std::make_index_sequence<sizeof...(Types)> seq;
		auto table = get_tableinfo(name, names);
		table->reserve(seq, idxs->size);
		for (uint32_t i = 0; i < idxs->size; ++i) {
			table->set_record(get_record(i));
		}
		return table;
	}

	TableInfo<Types ...>* distinct(const char* name = nullptr, const char** names = nullptr) {
		std::unordered_set<tuple_type> d_records;
		std::make_index_sequence<sizeof...(Types)> seq;

		for (uint32_t j = 0; j < idxs->size; ++j) {
			d_records.insert(get_record(seq, j));
		}

		TableInfo<Types ...>* ret = get_tableinfo(name, names);
		ret->reserve(seq, d_records.size());
		uint32_t i = 0;
		for (const auto& dr : d_records) {
			ret->set_record(seq, dr, i++);
		}
		return ret;
	}

	~TableView() {
		delete idxs;
	}
};

template <class T>
constexpr static bool is_vector(const ColRef<T>&) {
	return true;
}
template <class T>
constexpr static bool is_vector(const vector_type<T>&) {
	return true;
}

template<class ...Types>
TableInfo<Types...>::TableInfo(const char* name, uint32_t n_cols) : name(name), n_cols(n_cols) {
	this->colrefs = (ColRef<void>*)malloc(sizeof(ColRef<void>) * n_cols);
	for (uint32_t i = 0; i < n_cols; ++i) {
		this->colrefs[i].init();
	}
}
template<class ...Types>
TableInfo<Types...>::TableInfo(const char* name, const char** col_names) : name(name), n_cols(sizeof...(Types)) {
	this->colrefs = (ColRef<void>*)malloc(sizeof(ColRef<void>) * this->n_cols);
	for (uint32_t i = 0; i < n_cols; ++i) {
		this->colrefs[i].init(col_names ? col_names[i] : "");
	}
}
template <class ...Types>
template <size_t j>
inline typename std::enable_if<j == sizeof...(Types) - 1, void>::type
TableView<Types ...>::print_impl(const uint32_t& i, const char* __restrict sep) const {
	std::cout << (get<j>(*this))[(*idxs)[i]];
}

template<class ...Types>
template<size_t j>
inline typename std::enable_if < j < sizeof...(Types) - 1, void>::type
	TableView<Types...>::print_impl(const uint32_t& i, const char* __restrict sep) const
{
	std::cout << (get<j>(*this))[(*idxs)[i]] << sep;
	print_impl<j + 1>(i, sep);
}

template<class ...Types>
inline void TableView<Types...>::print(const char* __restrict sep, const char* __restrict end) const {
	std::string header_string = info.get_header_string(sep, end);
	std::cout << header_string.c_str();

	uint32_t n_rows = 0;
	if (info.colrefs[0].size > 0)
		n_rows = info.colrefs[0].size;
	for (uint32_t i = 0; i < n_rows; ++i) {
		print_impl(i);
		std::cout << end;
	}
}
template <class ...Types>
template <size_t j>
inline typename std::enable_if<j == sizeof...(Types) - 1, void>::type
TableInfo<Types ...>::print_impl(const uint32_t& i, const char* __restrict sep) const {
	decltype(auto) t = (get<j>(*this))[i];
//	print(t);
	std::cout << t;
}

template<class ...Types>
template<size_t j>
inline typename std::enable_if < j < sizeof...(Types) - 1, void>::type
	TableInfo<Types...>::print_impl(const uint32_t& i, const char* __restrict sep) const
{
	std::cout << (get<j>(*this))[i] << sep;
	print_impl<j + 1>(i, sep);
}

template<class ...Types>
inline void TableInfo<Types...>::print(const char* __restrict sep, const char* __restrict end) const {

	//printall(sep, end);
	std::string header_string = get_header_string(sep, end);
	std::cout << header_string.c_str();

	uint32_t n_rows = 0;
	if (n_cols > 0 && colrefs[0].size > 0)
		n_rows = colrefs[0].size;
	for (uint32_t i = 0; i < n_rows; ++i) {
		print_impl(i);
		std::cout << end;
	}
}

// use std::is_base_of here and all vt classes should derive from vector_base
template <class T1,
			template<typename> class VT,
			class TRet>
using test_vt_support = typename std::enable_if_t<
					std::is_base_of_v<vector_base<T1>, VT<T1>>, 
					TRet>;


template <class T1, class T2, template<typename> class VT, 
			test_vt_support<T1, VT, void>* = nullptr>
using get_autoext_type = 
		decayed_t<VT, typename types::Coercion<T1, T2>::type>;

template <class T1, class T2, template<typename> class VT, 
		test_vt_support<T1, VT, void>* = nullptr>
using get_long_type = 
		decayed_t<VT, types::GetLongType<typename types::Coercion<T1, T2>::type>>;

template <class T1, class T2, template<typename> class VT,
		test_vt_support<T1, VT, void>* = nullptr>
using get_fp_type = 
		decayed_t<VT, types::GetFPType<typename types::Coercion<T1, T2>::type>>;

template <class T1, 
			template<typename> class VT, template<typename> class VT2,
			class TRet>
using test_vt_support2 = typename std::enable_if_t<
				std::is_base_of_v<vector_base<T1>, VT<T1>> &&
				std::is_base_of_v<vector_base<T1>, VT2<T1>>, 
				TRet >;

template <class T1, class T2,
			template<typename> class VT, template<typename> class VT2, 
			test_vt_support2<T1, VT, VT2, void>* = nullptr >
using get_autoext_type2 = 
		decayed_t<VT, typename types::Coercion<T1, T2>::type>;

template <class T1, class T2,
			template<typename> class VT, template<typename> class VT2, 
			test_vt_support2<T1, VT, VT2, void>* = nullptr >
using get_long_type2 = 
		decayed_t<VT, types::GetLongType<typename types::Coercion<T1, T2>::type>>;

template <class T1, class T2,
			template<typename> class VT, template<typename> class VT2, 
			test_vt_support2<T1, VT, VT2, void>* = nullptr >
using get_fp_type2 = 
		decayed_t<VT, types::GetFPType<typename types::Coercion<T1, T2>::type>>;

template <class T1, class T2, template<typename> class VT, template<typename> class VT2>
get_autoext_type2<T1, T2, VT, VT2>
operator -(const VT<T1>& lhs, const VT2<T2>& rhs) {
	auto ret = get_autoext_type2<T1, T2, VT, VT2>(lhs.size);
	for (uint32_t i = 0; i < lhs.size; ++i)
		ret[i] = lhs[i] - rhs[i];
	return ret;
}
template <class T1, class T2, template<typename> class VT>
get_autoext_type<T1, T2, VT>
operator -(const VT<T1>& lhs, const T2& rhs) {
	auto ret = get_autoext_type<T1, T2, VT>(lhs.size);
	for (uint32_t i = 0; i < lhs.size; ++i)
		ret[i] = lhs[i] - rhs;
	return ret;
}
template <class T1, class T2, template<typename> class VT>
get_autoext_type<T1, T2, VT>
operator -(const T2& lhs, const VT<T1>& rhs) {
	auto ret = get_autoext_type<T1, T2, VT>(rhs.size);
	for (uint32_t i = 0; i < rhs.size; ++i)
		ret[i] = lhs - rhs[i];
	return ret;
}
template <class T1, class T2, template<typename> class VT, template<typename> class VT2>
get_autoext_type2<T1, T2, VT, VT2>
operator +(const VT<T1>& lhs, const VT2<T2>& rhs) {
	auto ret = get_autoext_type2<T1, T2, VT, VT2>(lhs.size);
	for (uint32_t i = 0; i < lhs.size; ++i)
		ret[i] = lhs[i] + rhs[i];
	return ret;
}
template <class T1, class T2, template<typename> class VT>
get_autoext_type<T1, T2, VT> 
operator +(const VT<T1>& lhs, const T2& rhs) {
	auto ret = get_autoext_type<T1, T2, VT>(lhs.size);
	for (uint32_t i = 0; i < lhs.size; ++i)
		ret[i] = lhs[i] + rhs;
	return ret;
}
template <class T1, class T2, template<typename> class VT>
get_autoext_type<T1, T2, VT> 
operator +(const T2& lhs, const VT<T1>& rhs) {
	auto ret = get_autoext_type<T1, T2, VT> (rhs.size);
	for (uint32_t i = 0; i < rhs.size; ++i)
		ret[i] = lhs + rhs[i];
	return ret;
}
template <class T1, class T2, template<typename> class VT, template<typename> class VT2>
get_long_type2<T1, T2, VT, VT2> 
operator *(const VT<T1>& lhs, const VT2<T2>& rhs) {
	auto ret = get_long_type2<T1, T2, VT, VT2>(lhs.size);
	for (uint32_t i = 0; i < lhs.size; ++i)
		ret[i] = lhs[i] * rhs[i];
	return ret;
}
template <class T1, class T2, template<typename> class VT>
get_long_type<T1, T2, VT>
operator *(const VT<T1>& lhs, const T2& rhs) {
	auto ret = get_long_type<T1, T2, VT>(lhs.size);
	for (uint32_t i = 0; i < lhs.size; ++i)
		ret[i] = lhs[i] * rhs;
	return ret;
}
template <class T1, class T2, template<typename> class VT>
get_long_type<T1, T2, VT>
operator *(const T2& lhs, const VT<T1>& rhs) {
	auto ret = get_long_type<T1, T2, VT>(rhs.size);
	for (uint32_t i = 0; i < rhs.size; ++i)
		ret[i] = lhs * rhs[i];
	return ret;
}
template <class T1, class T2, template<typename> class VT, template<typename> class VT2>
get_fp_type2<T1, T2, VT, VT2>
operator /(const VT<T1>& lhs, const VT2<T2>& rhs) {
	auto ret = get_fp_type2<T1, T2, VT, VT2>(lhs.size);
	for (uint32_t i = 0; i < lhs.size; ++i)
		ret[i] = lhs[i] / rhs[i];
	return ret;
}
template <class T1, class T2, template<typename> class VT>
get_fp_type<T1, T2, VT> 
operator /(const VT<T1>& lhs, const T2& rhs) {
	auto ret = get_fp_type<T1, T2, VT>(lhs.size);
	for (uint32_t i = 0; i < lhs.size; ++i)
		ret[i] = lhs[i] / rhs;
	return ret;
}
template <class T1, class T2, template<typename> class VT>
get_fp_type<T1, T2, VT> 
operator /(const T2& lhs, const VT<T1>& rhs) {
	auto ret = get_fp_type<T1, T2, VT>(rhs.size);
	for (uint32_t i = 0; i < rhs.size; ++i)
		ret[i] = lhs / rhs[i];
	return ret;
}

template <class T1, class T2, template<typename> class VT, template<typename> class VT2>
VT<bool> operator >(const VT<T1>& lhs, const VT2<T2>& rhs) {
	auto ret = VT<bool>(lhs.size);
	for (uint32_t i = 0; i < lhs.size; ++i)
		ret[i] = lhs[i] > rhs[i];
	return ret;
}
template <class T1, class T2, template<typename> class VT>
VT<bool> operator >(const VT<T1>& lhs, const T2& rhs) {
	auto ret = VT<bool>(lhs.size);
	for (uint32_t i = 0; i < lhs.size; ++i)
		ret[i] = lhs[i] > rhs;
	return ret;
}
template <class T1, class T2, template<typename> class VT>
VT<bool> operator >(const T2& lhs, const VT<T1>& rhs) {
	auto ret = VT<bool>(rhs.size);
	for (uint32_t i = 0; i < rhs.size; ++i)
		ret[i] = lhs > rhs[i];
	return ret;
}

#define _AQ_OP_(x) __AQ_OP__##x
#define __AQ_OP__add +
#define __AQ_OP__minus -
#define __AQ_OP__mul *
#define __AQ_OP__div /
#define __AQ_OP__and &
#define __AQ_OP__or |
#define __AQ_OP__xor ^
#define __AQ_OP__gt >
#define __AQ_OP__lt <
#define __AQ_OP__gte >=
#define __AQ_OP__lte <=
#define __AQ_OP__eq ==
#define __AQ_OP__neq !=

#define __D_AQOP(x) \
template <class T1, class T2, template<typename> class VT, class Ret>\
void aqop_##x (const VT<T1>& lhs, const VT<T2>& rhs, Ret& ret){\
	for (uint32_t i = 0; i < ret.size; ++i)\
		ret[i] = lhs[i] _AQ_OP_(x) rhs[i];\
}

__D_AQOP(add)
__D_AQOP(minus)
__D_AQOP(mul)
__D_AQOP(div)
__D_AQOP(and)
__D_AQOP(or)
__D_AQOP(xor)
__D_AQOP(gt)
__D_AQOP(lt)
__D_AQOP(gte)
__D_AQOP(lte)
__D_AQOP(eq)
__D_AQOP(neq)


template <class ...Types>
void print(const TableInfo<Types...>& v, const char* delimiter = " ", const char* endline = "\n") {
	v.print(delimiter, endline);
}
template <class ...Types>
void print(const TableView<Types...>& v, const char* delimiter = " ", const char* endline = "\n") {
	v.print(delimiter, endline);
}

template <class T>
void print(const T& v, const char* delimiter = " ") {
	std::cout << v << delimiter;
	// printf(types::printf_str[types::Types<T>::getType()], v);
}

#ifdef __AQ__HAS__INT128__
template <>
void print<__int128_t>(const __int128_t& v, const char* delimiter);
template <>
void print<__uint128_t>(const __uint128_t& v, const char* delimiter);
#endif
template <>
void print<bool>(const bool& v, const char* delimiter);
template <class T>
void inline print_impl(const T& v, const char* delimiter, const char* endline) {
	for (const auto& vi : v) {
		print(vi);
		std::cout << delimiter;
		// printf("%s", delimiter);
	}
	std::cout << endline;
	//printf("%s", endline);
}

template <class T, template<typename> class VT>
typename std::enable_if<!std::is_same<VT<T>, TableInfo<T>>::value>::type
print(const VT<T>& v, const char* delimiter = " ", const char* endline = "\n") {
	print_impl(v, delimiter, endline);
}


#endif