#ifndef UTIL_H
#define UTIL_H

#include <cstring>
#include <memory>
#include <string>
#include <windows.h>

#define CONCAT_IMPL(a, b) a##b
#define CONCAT(a, b) CONCAT_IMPL(a, b)
#define _ CONCAT(unused_, __LINE__)

#define SET_TERMINATE							\
	std::set_terminate([]() noexcept				\
	{								\
		ShowException(						\
		    L"Episode Browser was terminated due to an error: %s", \
		    L"Fatal Error", MB_ICONERROR);			\
		_Exit(1);						\
	})

/* Scope guard. */
template <typename F>
struct Finally
{
	F f;
	inline Finally(F f) noexcept : f(f) {}
	inline ~Finally() { f(); }
};
#define FINALLY Finally _ = [=]()

template <typename T>
inline void Delete(T v) noexcept
{
    delete v;
}

/* Unique is similar to unique_ptr, but it is designed for pointers
 * and handles of type T, where T is not an RAII class. Further, the
 * managed object is assumed to be in an invalid state until checked
 * with Good or Bad. Upon destruction, the object, if valid, is passed
 * to a given destructor function F. */
template <typename T, auto F = Delete<T>>
struct Unique
{
	union { T v; };
	bool ok = false;
	Unique() noexcept {}
	Unique(T v) noexcept : v(v) {}
	Unique& operator =(T v_) noexcept
	{
		if (ok) {
			F(v);
			v.~T();
		}
		v = v_;
		ok = false;
		return *this;
	}
	Unique(Unique&& other) noexcept : v(std::move(other.v)), ok(other.ok)
	{
		other.ok = false;
	}
	Unique& operator =(Unique&& other) noexcept
	{
		if (ok)
			F(v);
		v = std::move(other.v);
		ok = other.ok;
		other.ok = false;
		return *this;
	}
	bool Good(T u) noexcept
	{
		return !(ok = v == u);
	}
	bool Bad(T u) noexcept
	{
		return !(ok = v != u);
	}
	~Unique()
	{
		if (ok) {
			F(v);
			v.~T();
		}
	}
};

/* Buf is a span-like structure of a buffer and its size. */
template <typename T>
struct Buf
{
	T* data;
	size_t c;
	Buf(T* data, size_t c) noexcept : data(data), c(c) {}
	Buf(std::basic_string<T>& s) noexcept : data(s.data()), c(s.capacity()) {}
	template <size_t N> Buf(T (&data)[N]) noexcept : data(data), c(N) {}
	operator T*() noexcept { return data; }
	T& operator *() noexcept { return *data; }
	T& operator [](size_t i) noexcept { return data[i]; }
	Buf<T> operator +(size_t i) noexcept { return {data+i, c-i}; }
	//T operator -(size_t i) { return {data-i, c+i}; }
};

inline int Cmp(const int a, const int b)
{
	if (a == b) return 0;
	if (a > b) return 1;
	return -1;
}

inline size_t Min(size_t a, size_t b)
{
	return a < b? a: b;
}

template <typename T, size_t N>
inline size_t Len(T (&)[N])
{
	return N-1;
}

/* Format wide string. */
template<typename... T>
inline int Swprintf(Buf<wchar_t> buf, const wchar_t* const fmt, T... xs)
{
	return _snwprintf_s(buf, buf.c, _TRUNCATE, fmt, xs...);
}

/* Format static narrow string. */
template<typename... T>
inline int Sprintf(Buf<char> buf, const char* const fmt, T... xs)
{
	return _snprintf_s(buf, buf.c, _TRUNCATE, fmt, xs...);
}

/* Copy to static wide string buffer. */
inline wchar_t* Wcscpy(Buf<wchar_t> dst, const wchar_t* const src)
{
	const size_t len = Min(dst.c, wcslen(src)+1);
	memcpy(dst, src, len*sizeof(wchar_t));
	dst[len-1] = 0;
	return dst;
}

/* Copy to static narrow string buffer. */
inline char* Strcpy(Buf<char> dst, const char* const src)
{
	const size_t len = Min(dst.c, strlen(src)+1);
	memcpy(dst, src, len);
	dst[len-1] = 0;
	return dst;
}

#endif