 	}
 
 	// Search back to find exact bound with binary search.
-	// 2TŌɏ߂.
+	// 2分探索で厳密に上限を決める.
 	int l = 0;
 	int t = lmax;
 	do

		auto lcp = computeLongestCommonPrefix(sortedKeys, numOfElems, i, i + (start + t) * d, key1);
		if (lcp > nodeLcp)
		{
			// 蒷LogestCommonPrefix̂ŁAʒuɈړ.
			start += t;
		}
		divisor *= 2;

	}

	// Find other end using binary search
	// 2分探索で厳密に上限を決める.
	int lowest = 0;
	int t = lMax;
	while (t > 1)
