package util
- Alphabetic
- By Inheritance
- util
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
- implicit final class AwesomeBitSet extends AnyVal
- implicit final class AwesomeScalaBitSet extends AnyVal
-
class
BloomFilter[T] extends (T) ⇒ Boolean with Serializable
A BloomFilter is an approximate set that sometimes gives false positives.
A BloomFilter is an approximate set that sometimes gives false positives. That is, if bf(x) returns true, then it might have been added to the set. If it returns false, then it definitely has not. This is useful for caching and approximation.
- Annotations
- @SerialVersionUID()
-
trait
CachedHashCode extends AnyRef
Mixin for case classes that compute their hashcode once, and then cache it.
Mixin for case classes that compute their hashcode once, and then cache it. Only good if the case class is immutable, and its contents are also immutable "all the way down".
-
final
class
CompositeIndex[U] extends Index[(Int, U)]
An Index over N kinds of things.
An Index over N kinds of things. A little type unsafe.
- Annotations
- @SerialVersionUID()
-
class
DenseIntIndex extends Index[Int]
For use when we need an index, but we already have (densely packed) positive ints and don't want hash overhead.
For use when we need an index, but we already have (densely packed) positive ints and don't want hash overhead.
- Annotations
- @SerialVersionUID()
- trait DoubleImplicits extends AnyRef
-
class
EitherIndex[L, R] extends Index[Either[L, R]]
An Index over two kinds of things.
An Index over two kinds of things. Layout is straightforward: The first left.size entries are from the left index, while the next right.size are from the right index. Values are wrapped in Left/Right
- Annotations
- @SerialVersionUID()
-
trait
Encoder[T] extends AnyRef
For encoding counters as vectors and decoding vectors back to counters
- implicit final class FileUtil extends AnyVal
-
class
HashIndex[T] extends MutableIndex[T] with Serializable
Class that builds a 1-to-1 mapping between Ints and T's, which is very useful for efficiency concerns.
Class that builds a 1-to-1 mapping between Ints and T's, which is very useful for efficiency concerns.
Two extra views are provided: the index.synchronized view enables threadsafe access and the index.immutable view keeps prevents the (view) from being updated.
- Annotations
- @SerialVersionUID()
-
trait
Index[T] extends Iterable[T] with (T) ⇒ Int with Serializable
Trait that marks an O(1) bidirectional map between Ints (increasing from 0) and T's.
Trait that marks an O(1) bidirectional map between Ints (increasing from 0) and T's. This class is used, for example, to efficiently build unique vector space mappings for strings. The methods in this trait do not mutate the underlying index. Use either a MutableIndex or one of the companion object constructor methods to build an index.
- Annotations
- @SerialVersionUID()
-
class
Interner[T] extends (T) ⇒ T with Serializable
Class that mimics Java's string interner, but for anything.
Class that mimics Java's string interner, but for anything. Threadsafe.
- Annotations
- @SerialVersionUID()
-
trait
Isomorphism[T, U] extends Serializable
An Isomorphism is defined by a reversible transformation between two types.
An Isomorphism is defined by a reversible transformation between two types. useful when one set of implicits is easily defined for some type, but not for some other type
- Annotations
- @SerialVersionUID()
-
class
IsomorphismIndex[T, U] extends Index[U] with Serializable
Maps an index of type T to an index of type U using an isomorphism implicit
Maps an index of type T to an index of type U using an isomorphism implicit
- Annotations
- @SerialVersionUID()
- trait IteratorImplicits extends AnyRef
-
class
LazyLogger extends Serializable
A logger that only evaluates parameters lazily if the corresponding log level is enabled.
-
trait
Lens[T, U] extends AnyRef
A Lens defines a functional way of handling getters/setters.
A Lens defines a functional way of handling getters/setters. They're useful for extending transformations on a part of a case class to the whole case class by updating that one component
-
trait
MutableIndex[T] extends Index[T]
An Index that contains an extra method: index that adds the given element (if necessary), returning its (possibly new) position in the index.
An Index that contains an extra method: index that adds the given element (if necessary), returning its (possibly new) position in the index.
- Annotations
- @SerialVersionUID()
-
abstract
class
Opt extends AnyRef
Base class for all option case classes in breeze
-
class
OptionIndex[T] extends Index[Option[T]]
Lifts an index of T into an index of Option[T] .
Lifts an index of T into an index of Option[T] . The last element is None. Everything else is as you expect.
- Annotations
- @SerialVersionUID()
-
class
PairIndex[T, U] extends Index[(T, U)]
An index over pairs from a pair of indexes
- class SeqExtras[T] extends AnyRef
-
trait
SerializableLogging extends Serializable
Stupid Typesafe logging lib trait isn't serializable.
Stupid Typesafe logging lib trait isn't serializable. This is just a better version.
-
trait
SynchronizedIndex[T] extends Index[T]
Synchronized view of an Index for thread-safe access.
Synchronized view of an Index for thread-safe access.
- Annotations
- @SerialVersionUID()
-
type
TODO = Nothing
Similar to the TODO expression, except this one is for types.
-
class
TopK[T] extends Iterable[T]
A Top-K queue keeps a list of the top K elements seen so far as ordered by the given comparator.
-
class
TopKIterable[T] extends AnyRef
A rich iterable extension that adds the topk method.
- class TopKIterator[T] extends AnyRef
Value Members
-
def
CALLER(nth: Int): String
Computes the source file location of the nth parent.
Computes the source file location of the nth parent. 0 is equivalent to LOCATION
- Annotations
- @noinline()
-
def
LOCATION: String
Computes the current source file and line number.
Computes the current source file and line number.
- Annotations
- @noinline()
-
def
TODO: Nothing
You can write TODO in your code, and get an exception at runtime for any expression.
-
def
XXX: Nothing
You can write XXX in your code and get an exception at runtime for any expression.
- implicit def _bitsetcbf[U]: BuildFrom[BitSet, U, Set[U]]
- implicit def arraySeqExtras[T](s: Array[T]): SeqExtras[T]
- def deserializeFromBytes[T](bytes: Array[Byte]): T
-
def
memoryString: String
Returns a string with info about the available and used space.
-
def
nonstupidObjectInputStream(stream: InputStream, ignoreSerialVersionUID: Boolean = false): ObjectInputStream
For reasons that are best described as asinine, ObjectInputStream does not take into account Thread.currentThread.getContextClassLoader.
For reasons that are best described as asinine, ObjectInputStream does not take into account Thread.currentThread.getContextClassLoader. This fixes that.
- ignoreSerialVersionUID
this is not a safe thing to do, but sometimes...
-
def
readObject[T](loc: File, ignoreSerialVersionUID: Boolean): T
Deserializes an object using java serialization
-
def
readObject[T](loc: File): T
Deserializes an object using java serialization
- implicit def seqExtras[T](s: Seq[T]): SeqExtras[T]
- def serializeToBytes[T](obj: T): Array[Byte]
-
def
trace[T](a: T): T
prints a and returns it.
-
def
writeObject[T](out: File, parser: T): Unit
Serializes an object using java serialization
-
object
ArrayUtil
Array operations on generic arrays, a little faster in general, I hope.
- object BloomFilter extends Serializable
- object Encoder
- object EnumerationIndex
- object HashIndex extends SerializableLogging
-
object
Implicits extends DoubleImplicits with IteratorImplicits
Stores various implicits, also available by importing breeze.util._
-
object
Index extends Serializable
Utilities for manipulating and creating Index objects.
- object Interner extends Serializable
- object Isomorphism extends Serializable
-
object
Iterators
Utilities and implicits for iterators.
Utilities and implicits for iterators. Nothing major.
-
object
JavaArrayOps
This utility class facilitates transparent access of breeze data objects from plain Java without Scala-related Generic complications.
- object Lens
- object Profiling
- object ReflectionUtil
- object Sorting
- object Terminal
- object TopK
- object TopKImplicits
-
object
UpdateSerializedObjects
Class that reads in objects serialized with breeze.util.writeObject, ignoring their serialversionuids, and then writes them to the same file.
-
object
partition extends UFunc
Creates a copy of the array with its elements rearranged in such a way that the value of the element in kth position is in the position it would be in a sorted array.
Creates a copy of the array with its elements rearranged in such a way that the value of the element in kth position is in the position it would be in a sorted array. All elements smaller than the kth element are moved to the start of the array, all greater are moved to the end. Equal elements will be on the immeditate left or right. The ordering of the elements in the two partitions is undefined.
Based on the numpy method of the same name. Docs lifted from numpy
-
object
quickSelect extends UFunc
Quickselect for linear-time medians, etc.
Quickselect for linear-time medians, etc. See scala.util.Sorting and breeze.util.Sorting
Deprecated Value Members
-
object
quickSelectImpl extends UFunc
quickSelectImpl does not clone the input array before doing a quickSelect-sort but instead swaps in place, and therefore, allows other functions to access the intermediate results of the sorting procedure.
quickSelectImpl does not clone the input array before doing a quickSelect-sort but instead swaps in place, and therefore, allows other functions to access the intermediate results of the sorting procedure.
After quickSelectImpl is run, it is guaranteed that the input array will be swapped around such that every number left of position will be equal or smaller than the element at position, and every number right of position will be equal or larger than the element at position.
This can be useful when further using the intermediate results downstream. For example, appending an element or updating an element to an array which has already been through
quickSelectImpland then re-calculatingquickSelectImplwill be faster than applying quickSelectImpl de-novo to the original unsorted array.- Annotations
- @deprecated
- Deprecated
(Since version 0.12) use quickSelect.inPlace instead