module workspaced.dparseext;

import std.algorithm;
import std.array;
import std.experimental.logger;
import std.string;

import dparse.ast;
import dparse.lexer;
import dparse.parser;
import dparse.rollback_allocator;
import dsymbol.builtin.names;

string makeString(in IdentifierOrTemplateChain c)
{
	return c.identifiersOrTemplateInstances.map!(a => a.identifier.text).join(".");
}

string astToString(T, Args...)(in T ast, Args args)
{
	import dparse.formatter : Formatter;

	if (!ast)
		return null;

	auto app = appender!string();
	auto formatter = new Formatter!(typeof(app))(app);
	formatter.format(ast, args);
	return app.data;
}

string paramsToString(Dec)(const Dec dec)
{
	import dparse.formatter : Formatter;

	auto app = appender!string();
	auto formatter = new Formatter!(typeof(app))(app);

	static if (is(Dec == FunctionDeclaration) || is(Dec == Constructor))
	{
		formatter.format(dec.parameters);
	}
	else static if (is(Dec == TemplateDeclaration))
	{
		formatter.format(dec.templateParameters);
	}

	return app.data;
}

/// Other tokens
private enum dynamicTokens = [
		"specialTokenSequence", "comment", "identifier", "scriptLine",
		"whitespace", "doubleLiteral", "floatLiteral", "idoubleLiteral",
		"ifloatLiteral", "intLiteral", "longLiteral", "realLiteral",
		"irealLiteral", "uintLiteral", "ulongLiteral", "characterLiteral",
		"dstringLiteral", "stringLiteral", "wstringLiteral"
	];

string tokenText(const Token token)
{
	switch (token.type)
	{
		static foreach (T; dynamicTokens)
		{
	case tok!T:
		}
		return token.text;
	default:
		return str(token.type);
	}
}

size_t textLength(const Token token)
{
	return token.tokenText.length;
}

bool isSomeString(const Token token)
{
	switch (token.type)
	{
	case tok!"characterLiteral":
	case tok!"dstringLiteral":
	case tok!"stringLiteral":
	case tok!"wstringLiteral":
		return true;
	default:
		return false;
	}
}

bool isLikeIdentifier(const Token token)
{
	import workspaced.helpers;

	auto text = token.tokenText;
	return text.length && text[0].isIdentifierChar;
}

/// Performs a binary search to find the token containing the search location.
/// Params:
///   tokens = the token array to search in.
///   bytes  = the byte index the token should be in.
/// Returns: the index of the token inside the given tokens array which
/// contains the character specified at the given byte. This will be the first
/// token that is `tok.index == bytes` or before the next token that is too far.
/// If no tokens match, this will return `tokens.length`.
///
/// This is equivalent to the following code:
/// ---
/// foreach (i, tok; tokens)
/// {
/// 	if (tok.index == bytes)
/// 		return i;
/// 	else if (tok.index > bytes)
/// 		return i - 1;
/// }
/// return tokens.length;
/// ---
size_t tokenIndexAtByteIndex(scope const(Token)[] tokens, size_t bytes)
out (v; v <= tokens.length)
{
	if (!tokens.length || tokens[0].index >= bytes)
		return 0;

	// find where to start using binary search
	size_t l = 0;
	size_t r = tokens.length - 1;
	while (l < r)
	{
		size_t m = (l + r) / 2;
		if (tokens[m].index < bytes)
			l = m + 1;
		else
			r = m - 1;
	}
	size_t start = r;

	// search remaining with linear search
	foreach (i, tok; tokens[start .. $])
	{
		if (tok.index == bytes)
			return start + i;
		else if (tok.index > bytes)
			return start + i - 1;
	}
	return tokens.length;
}

/// ditto
size_t tokenIndexAtPosition(scope const(Token)[] tokens, uint line, uint column)
out (v; v <= tokens.length)
{
	int cmp(Token token)
	{
		if (token.line != line)
			return token.line < line ? -1 : 1;
		else if (token.column != column)
			return token.column < column ? -1 : 1;
		else
			return 0;
	}

	if (!tokens.length || cmp(tokens[0]) >= 0)
		return 0;

	// find where to start using binary search
	size_t l = 0;
	size_t r = tokens.length - 1;
	while (l < r)
	{
		size_t m = (l + r) / 2;
		if (cmp(tokens[m]) < 0)
			l = m + 1;
		else
			r = m - 1;
	}
	size_t start = r;

	// search remaining with linear search
	foreach (i, tok; tokens[start .. $])
	{
		if (cmp(tok) == 0)
			return start + i;
		else if (cmp(tok) > 0)
			return start + i - 1;
	}
	return tokens.length;
}

///
unittest
{
	StringCache stringCache = StringCache(StringCache.defaultBucketCount);
	const(Token)[] tokens = getTokensForParser(cast(ubyte[]) `module foo.bar;

// ok
void main(string[] args)
{
}

/// documentation
void foo()
{
}
`, LexerConfig.init, &stringCache);

	auto get(size_t bytes)
	{
		auto i = tokens.tokenIndexAtByteIndex(bytes);
		if (i == tokens.length)
			return tok!"__EOF__";
		return tokens[i].type;
	}

	assert(get(0) == tok!"module");
	assert(get(4) == tok!"module");
	assert(get(6) == tok!"module");
	assert(get(7) == tok!"identifier");
	assert(get(9) == tok!"identifier");
	assert(get(10) == tok!".");
	assert(get(11) == tok!"identifier");
	assert(get(16) == tok!";");
	assert(get(49) == tok!"{");
	assert(get(48) == tok!"{");
	assert(get(47) == tok!")");
	assert(get(1000) == tok!"__EOF__");

	// TODO: process trivia fields in libdparse >=0.15.0 when it releases
	//assert(get(20) == tok!"comment");
	assert(get(20) == tok!";");

	// assert(get(57) == tok!"comment");
}

bool isSomeString(const IdType type)
{
	switch (type)
	{
	case tok!"stringLiteral":
	case tok!"wstringLiteral":
	case tok!"dstringLiteral":
		return true;
	default:
		return false;
	}
}

/// Tries to evaluate an expression if it evaluates to a string.
/// Returns: `null` if the resulting value is not a string or could not be
/// evaluated.
string evaluateExpressionString(const PrimaryExpression expr)
in (expr !is null)
{
	return evaluateExpressionString(expr.primary);
}

/// ditto
string evaluateExpressionString(const UnaryExpression expr)
in (expr !is null)
{
	if (expr.primaryExpression)
		return evaluateExpressionString(expr.primaryExpression);
	else
		return null;
}

/// ditto
string evaluateExpressionString(const ExpressionNode expr)
in (expr !is null)
{
	// maybe we want to support simple concatenation here some time

	if (auto unary = cast(UnaryExpression) expr)
		return evaluateExpressionString(unary);
	else
		return null;
}

/// ditto
string evaluateExpressionString(const Token token)
{
	import dparse.strings : unescapeString, isStringLiteral;

	switch (token.type)
	{
	case tok!"stringLiteral":
	case tok!"wstringLiteral":
	case tok!"dstringLiteral":
		auto str = token.text;

		// we want to unquote here
		// foreach because implicit concatenation can combine multiple strings
		auto ret = appender!string;
		scope StringCache cache = StringCache(16);
		LexerConfig config;
		config.commentBehavior = CommentBehavior.noIntern;
		config.stringBehavior = StringBehavior.source;
		config.whitespaceBehavior = WhitespaceBehavior.skip;
		config.fileName = "evaluate-string-stdin";
		foreach (t; DLexer(str, config, &cache))
		{
			switch (t.type)
			{
			case tok!"stringLiteral":
			case tok!"wstringLiteral":
			case tok!"dstringLiteral":
				if (t.text.isStringLiteral)
				{
					ret ~= unescapeString(t.text);
				}
				else
				{
					debug
					{
						throw new Exception("Invalid stringLiteral in stringLiteral token: `" ~ t.text ~ '`');
					}
					else
					{
						warningf("Invalid stringLiteral in stringLiteral token: `%s`", t.text);
						return str;
					}
				}
				break;
			default:
				// unexpected token, return input because it might already be
				// unescaped
				return str;
			}
		}

		return ret.data;
	default:
		return null;
	}
}

/// Finds the deepest non-null node of any BaseNode. (like visiting the tree)
/// Aborts on types that contain `DeclarationOrStatement` or `Declaration[]`
/// fields.
/// Useful for getting the IfStatement out of a DeclarationOrStatement without
/// traversing its children.
BaseNode findDeepestNonBlockNode(T : BaseNode)(T ast)
{
	static assert(!is(T == BaseNode), "Passed in a BaseNode, that's probably not what you wanted to do (pass in the most specific type you have)");
	bool nonProcess = false;
	foreach (member; ast.tupleof)
	{
		static if (is(typeof(member) : DeclarationOrStatement)
			|| is(typeof(member) : Declaration[]))
		{
			nonProcess = true;
		}
	}

	if (nonProcess)
		return ast;

	foreach (member; ast.tupleof)
	{
		static if (is(typeof(member) : BaseNode))
		{
			if (member !is null)
			{
				return findDeepestNonBlockNode(member);
			}
		}
	}
	return ast;
}

/// Gets the final `else` block of an if. Will return a node of type
/// `IfStatement` if it's an `else if` block. Returns null if there is no single
/// else statement.
BaseNode getIfElse(IfStatement ifStmt)
{
	if (!ifStmt.elseStatement)
		return null;

	while (true)
	{
		auto elseStmt = ifStmt.elseStatement;
		if (!elseStmt)
			return ifStmt;

		auto stmtInElse = elseStmt.findDeepestNonBlockNode;
		assert(stmtInElse !is elseStmt);

		if (cast(IfStatement)stmtInElse)
			ifStmt = cast(IfStatement)stmtInElse;
		else
			return stmtInElse;
	}
}

unittest
{
	StringCache stringCache = StringCache(StringCache.defaultBucketCount);
	RollbackAllocator rba;
	IfStatement parseIfStmt(string code)
	{
		const(Token)[] tokens = getTokensForParser(cast(ubyte[])code, LexerConfig.init, &stringCache);
		auto parser = new Parser();
		parser.tokens = tokens;
		parser.allocator = &rba;
		return parser.parseIfStatement();
	}

	alias p = parseIfStmt;
	assert(getIfElse(p("if (x) {}")) is null);
	assert(getIfElse(p("if (x) {} else if (y) {}")) !is null);
	assert(cast(IfStatement)getIfElse(p("if (x) {} else if (y) {}")) !is null, typeid(getIfElse(p("if (x) {} else if (y) {}"))).name);
	assert(getIfElse(p("if (x) {} else if (y) {} else {}")) !is null);
	assert(cast(IfStatement)getIfElse(p("if (x) {} else if (y) {} else {}")) is null);
}

C[] substr(C)(C[] s, size_t[2] range)
{
	return substr(s, range[0], range[1]);
}

C[] substr(C)(C[] s, size_t start, size_t end)
{
	if (!s.length)
		return s;
	if (start < 0)
		start = 0;
	if (start >= s.length)
		start = s.length - 1; // @suppress(dscanner.suspicious.length_subtraction)
	if (end > s.length)
		end = s.length;
	if (end < start)
		return s[start .. start];
	return s[start .. end];
}