IntSpace

object IntSpace
class Object
trait Matchable
class Any

Type members

Classlikes

final case class NDim(dim: Int) extends Space[IntPointNLike, IntHyperCubeN]
Companion:
object
object NDim
Companion:
class
object ThreeDim extends ThreeDim
Companion:
class
sealed trait ThreeDim extends Space[IntPoint3DLike, IntCube]
Companion:
object
object TwoDim extends TwoDim
Companion:
class
sealed trait TwoDim extends Space[IntPoint2DLike, IntSquare]
Companion:
object

Value members

Concrete methods

def binSplit(a: Int, b: Int): Int

A helper method which efficiently calculates the unique integer in an interval [a, b] which has the maximum number of trailing zeros in its binary representation (a and b are integers > 0). This is used by the HyperCube implementations to find the greatest interesting square for two given children.

A helper method which efficiently calculates the unique integer in an interval [a, b] which has the maximum number of trailing zeros in its binary representation (a and b are integers > 0). This is used by the HyperCube implementations to find the greatest interesting square for two given children.

Thanks to Rex Kerr and Daniel Sobral ( http://stackoverflow.com/questions/6156502/integer-in-an-interval-with-maximized-number-of-trailing-zero-bits )