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

// https://github.com/leonardo-domingues/atrbvh
// http://research.nvidia.com/sites/default/files/publications/karras2012hpg_paper.pdf

#if 0
__forceinline__ __device__ int computeLongestCommonPrefix(
	const uint32_t* sortedKeys,
	uint32_t numOfElems,

	int right = span.y;
	int d = span.z;

	// Calculate the number of identical bits from higher end
	int numIdentical = computeLongestCommonPrefix(sortedKeys, numOfElems, left, right);

