util
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.
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".
An Index over N kinds of things.
An Index over N kinds of things. A little type unsafe.
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.
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
For encoding counters as vectors and decoding vectors back to counters
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.
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.
Class that mimics Java's string interner, but for anything.
Class that mimics Java's string interner, but for anything. Threadsafe.
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
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
A logger that only evaluates parameters lazily if the corresponding log level is enabled.
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
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.
Base class for all option case classes in breeze
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.
An index over pairs from a pair of indexes
Stupid Typesafe logging lib trait isn't serializable.
Stupid Typesafe logging lib trait isn't serializable. This is just a better version.
Synchronized view of an Index for thread-safe access.
Synchronized view of an Index for thread-safe access.
Similar to the TODO expression, except this one is for types.
A Top-K queue keeps a list of the top K elements seen so far as ordered by the given comparator.
A rich iterable extension that adds the topk method.
Array operations on generic arrays, a little faster in general, I hope.
Computes the source file location of the nth parent.
Computes the source file location of the nth parent. 0 is equivalent to LOCATION
Stores various implicits, also available by importing breeze.util._
Utilities for manipulating and creating Index objects.
Utilities and implicits for iterators.
Utilities and implicits for iterators. Nothing major.
This utility class facilitates transparent access of breeze data objects from plain Java without Scala-related Generic complications.
Computes the current source file and line number.
Computes the current source file and line number.
You can write TODO in your code, and get an exception at runtime for any expression.
Class that reads in objects serialized with breeze.util.writeObject, ignoring their serialversionuids, and then writes them to the same file.
You can write XXX in your code and get an exception at runtime for any expression.
Returns a string with info about the available and used space.
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.
this is not a safe thing to do, but sometimes...
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 before this element and all equal or greater are moved behind it. The ordering of the elements in the two partitions is undefined.
Based on the numpy method of the same name. Docs lifted from numpy
Quickselect for linear-time medians, etc.
Quickselect for linear-time medians, etc. See scala.util.Sorting and breeze.util.Sorting
Deserializes an object using java serialization
Deserializes an object using java serialization
prints a and returns it.
Serializes an object using java serialization
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 quickSelectImpl and then re-calculating quickSelectImpl
will be faster than applying quickSelectImpl de-novo to the original unsorted array.
(Since version 0.12) use quickSelect.inPlace instead