package org.jetbrains.dokka.test.tools.matchers.content import org.jetbrains.dokka.pages.ContentComposite import org.jetbrains.dokka.pages.ContentNode import org.jetbrains.dokka.pages.ContentText import kotlin.reflect.KClass import kotlin.reflect.full.cast import kotlin.reflect.full.safeCast sealed class MatcherElement class TextMatcher(val text: String) : MatcherElement() open class NodeMatcher( val kclass: KClass, val assertions: T.() -> Unit = {} ) : MatcherElement() { open fun tryMatch(node: ContentNode) { kclass.safeCast(node)?.apply { try { assertions() } catch (e: AssertionError) { throw MatcherError(e.message.orEmpty(), this@NodeMatcher, cause = e) } } ?: throw MatcherError("Expected ${kclass.simpleName} but got: $node", this) } } class CompositeMatcher( kclass: KClass, private val children: List, assertions: T.() -> Unit = {} ) : NodeMatcher(kclass, assertions) { internal val normalizedChildren: List by lazy { children.fold(listOf()) { acc, e -> when { acc.lastOrNull() is Anything && e is Anything -> acc acc.lastOrNull() is TextMatcher && e is TextMatcher -> acc.dropLast(1) + TextMatcher((acc.lastOrNull() as TextMatcher).text + e.text) else -> acc + e } } } override fun tryMatch(node: ContentNode) { super.tryMatch(node) kclass.cast(node).children.asSequence() .filter { it !is ContentText || it.text.isNotBlank() } .fold(FurtherSiblings(normalizedChildren, this).pop()) { acc, n -> acc.next(n) }.finish() } } object Anything : MatcherElement() private sealed class MatchWalkerState { abstract fun next(node: ContentNode): MatchWalkerState abstract fun finish() } private class TextMatcherState( val text: String, val rest: FurtherSiblings, val anchor: TextMatcher ) : MatchWalkerState() { override fun next(node: ContentNode): MatchWalkerState { node as? ContentText ?: throw MatcherError("Expected text: \"$text\" but got $node", anchor) val trimmed = node.text.trim() return when { text == trimmed -> rest.pop() text.startsWith(trimmed) -> TextMatcherState(text.removePrefix(node.text).trim(), rest, anchor) else -> throw MatcherError("Expected text: \"$text\", but got: \"${node.text}\"", anchor) } } override fun finish() = throw MatcherError("\"$text\" was not found" + rest.messageEnd, anchor) } private class EmptyMatcherState(val parent: CompositeMatcher<*>) : MatchWalkerState() { override fun next(node: ContentNode): MatchWalkerState { throw MatcherError("Unexpected $node", parent, anchorAfter = true) } override fun finish() = Unit } private class NodeMatcherState( val matcher: NodeMatcher<*>, val rest: FurtherSiblings ) : MatchWalkerState() { override fun next(node: ContentNode): MatchWalkerState { matcher.tryMatch(node) return rest.pop() } override fun finish() = throw MatcherError("Content of type ${matcher.kclass} was not found" + rest.messageEnd, matcher) } private class SkippingMatcherState( val innerState: MatchWalkerState ) : MatchWalkerState() { override fun next(node: ContentNode): MatchWalkerState = runCatching { innerState.next(node) }.getOrElse { this } override fun finish() = innerState.finish() } private class FurtherSiblings(val list: List, val parent: CompositeMatcher<*>) { fun pop(): MatchWalkerState = when (val head = list.firstOrNull()) { is TextMatcher -> TextMatcherState(head.text.trim(), drop(), head) is NodeMatcher<*> -> NodeMatcherState(head, drop()) is Anything -> SkippingMatcherState(drop().pop()) null -> EmptyMatcherState(parent) } fun drop() = FurtherSiblings(list.drop(1), parent) val messageEnd: String get() = list.filter { it !is Anything } .count().takeIf { it > 0 } ?.let { " and $it further matchers were not satisfied" } ?: "" } internal fun MatcherElement.toDebugString(anchor: MatcherElement?, anchorAfter: Boolean): String { fun Appendable.append(element: MatcherElement, ownPrefix: String, childPrefix: String) { if (anchor != null) { if (element != anchor || anchorAfter) append(" ".repeat(4)) else append("--> ") } append(ownPrefix) when (element) { is Anything -> append("skipAllNotMatching\n") is TextMatcher -> append("\"${element.text}\"\n") is CompositeMatcher<*> -> { append("${element.kclass.simpleName.toString()}\n") if (element.normalizedChildren.isNotEmpty()) { val newOwnPrefix = childPrefix + '\u251c' + '\u2500' + ' ' val lastOwnPrefix = childPrefix + '\u2514' + '\u2500' + ' ' val newChildPrefix = childPrefix + '\u2502' + ' ' + ' ' val lastChildPrefix = childPrefix + ' ' + ' ' + ' ' element.normalizedChildren.forEachIndexed { n, e -> if (n != element.normalizedChildren.lastIndex) append(e, newOwnPrefix, newChildPrefix) else append(e, lastOwnPrefix, lastChildPrefix) } } if (element == anchor && anchorAfter) { append("--> $childPrefix\n") } } is NodeMatcher<*> -> append("${element.kclass.simpleName}\n") } } return buildString { append(this@toDebugString, "", "") } } data class MatcherError( override val message: String, val anchor: MatcherElement, val anchorAfter: Boolean = false, override val cause: Throwable? = null ) : AssertionError(message, cause) // Creating this whole mechanism was most scala-like experience I had since I stopped using scala. // I don't know how I should feel about it.