object Z3 extends ZN
- Alphabetic
- By Inheritance
- Z3
- ZN
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- val BitsPerDimension: Int
- val Dimensions: Int
- val MaxMask: Long
- val TotalBits: Int
-
def
apply(x: Int, y: Int, z: Int): Z3
So this represents the order of the tuple, but the bits will be encoded in reverse order: ....z1y1x1z0y0x0 This is a little confusing.
- def apply(zvalue: Long): Z3
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @HotSpotIntrinsicCandidate()
-
def
combine(z: Long): Int
combine every third bit to form a value.
-
def
contains(range: ZRange, value: Long): Boolean
Is the value contained in the range.
-
def
contains(range: ZRange, value: ZRange): Boolean
Is the value contained in the range.
Is the value contained in the range. Considers user-space.
- range
range
- value
value to be tested
- Definition Classes
- ZN
-
def
cut(r: ZRange, xd: Long, inRange: Boolean): List[ZRange]
Cuts Z-Range in two and trims based on user space, can be used to perform augmented binary search
Cuts Z-Range in two and trims based on user space, can be used to perform augmented binary search
- Definition Classes
- ZN
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
longestCommonPrefix(values: Long*): ZPrefix
Calculates the longest common binary prefix between two z longs
Calculates the longest common binary prefix between two z longs
- returns
(common prefix, number of bits in common)
- Definition Classes
- ZN
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
overlaps(range: ZRange, value: ZRange): Boolean
Does the value overlap with the range.
-
def
split(value: Long): Long
insert 00 between every bit in value.
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- def unapply(z: Z3): Option[(Int, Int, Int)]
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
zdivide(p: Long, rmin: Long, rmax: Long): (Long, Long)
Returns (litmax, bigmin) for the given range and point
Returns (litmax, bigmin) for the given range and point
- p
point
- rmin
minimum value
- rmax
maximum value
- returns
(litmax, bigmin)
- Definition Classes
- ZN
-
def
zranges(zbounds: Array[ZRange], precision: Int = 64, maxRanges: Option[Int] = None, maxRecurse: Option[Int] = Some(ZN.DefaultRecurse)): Seq[IndexRange]
Calculates ranges in index space that match any of the input bounds.
Calculates ranges in index space that match any of the input bounds. Uses breadth-first searching to allow a limit on the number of ranges returned.
To improve performance, the following decisions have been made: uses loops instead of foreach/maps uses java queues instead of scala queues allocates initial sequences of decent size sorts once at the end before merging
- zbounds
search space
- precision
precision to consider, in bits (max 64)
- maxRanges
loose cap on the number of ranges to return. A higher number of ranges will have less false positives, but require more processing.
- maxRecurse
max levels of recursion to apply before stopping
- returns
ranges covering the search space
- Definition Classes
- ZN
-
def
zranges(zbounds: ZRange, precision: Int, maxRanges: Option[Int]): Seq[IndexRange]
- Definition Classes
- ZN
-
def
zranges(zbounds: ZRange, precision: Int): Seq[IndexRange]
- Definition Classes
- ZN
-
def
zranges(zbounds: ZRange): Seq[IndexRange]
- Definition Classes
- ZN
Deprecated Value Members
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] ) @Deprecated
- Deprecated