Fix hydration LIS computation lookup range

Author: hbirler

src/runtime/internal/dom.ts

@@ -20,7 +20,7 @@ type NodeEx = Node & {
 };
 
 function upper_bound(low: number, high: number, key: (index: number) => number, value: number) {
-	// Return first index of value larger than input value
+	// Return first index of value larger than input value in the range [low, high)
 	while (low < high) {
 		const mid = low + ((high - low) >> 1);
 		if (key(mid) <= value) {
@@ -69,7 +69,7 @@ function init_hydrate(target: NodeEx) {
 		// Find the largest subsequence length such that it ends in a value less than our current value
 
 		// upper_bound returns first greater value, so we subtract one
-		const seqLen = upper_bound(1, 0, idx => children[m[idx]].claim_order, current) - 1;
+		const seqLen = upper_bound(1, longest + 1, idx => children[m[idx]].claim_order, current) - 1;
 
 		p[i] = m[seqLen] + 1;
 
@@ -366,7 +366,7 @@ export function claim_text(nodes: ChildNodeArray, data) {
 	return claim_node<Text>(
 		nodes,
 		(node: ChildNode): node is Text => node.nodeType === 3,
-		(node: Text) => node.data = '' + data,
+		(node: Text) => { node.data = '' + data },
 		() => text(data),
 		true	// Text nodes should not update last index since it is likely not worth it to eliminate an increasing subsequence of actual elements
 	);