object SparseVectorQ extends Serializable
The SparseVectorQ
object is the companion object for the SparseVectorQ
class.
- Alphabetic
- By Inheritance
- SparseVectorQ
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
type
RowMap = SortedLinkedHashMap[Int, Rational]
Shorthand type definition for sparse vector
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
++(b: Rational, u: SparseVectorQ): SparseVectorQ
Concatenate scalar 'b' and vector 'u'.
Concatenate scalar 'b' and vector 'u'.
- b
the scalar to be concatenated - first part
- u
the vector to be concatenated - second part
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
apply(xs: Array[String], skip: Int): SparseVectorQ
Create a
SparseVectorQ
from an array ofString
s, skipping the first 'skip' elements.Create a
SparseVectorQ
from an array ofString
s, skipping the first 'skip' elements. If an element is non-numeric, use its hashcode. FIX: Might be better to map non-numericString
s to ordinal values.- xs
the array of the
String
s- skip
the number of elements at the beginning to skip (e.g., id column)
-
def
apply(xs: Array[String]): SparseVectorQ
Create a
SparseVectorQ
from an array ofString
s.Create a
SparseVectorQ
from an array ofString
s.- xs
the array of the
String
s
-
def
apply(x: String, xs: String*): SparseVectorQ
Create a
SparseVectorQ
from one or more values (repeated valuesString
*).Create a
SparseVectorQ
from one or more values (repeated valuesString
*).- x
the first
String
- xs
the rest of the
String
s
-
def
apply(xs: Seq[Rational]): SparseVectorQ
Create a
SparseVectorQ
from a sequence ofRational
s.Create a
SparseVectorQ
from a sequence ofRational
s.- xs
the sequence of the Rational numbers
-
def
apply(x: Rational, xs: Rational*): SparseVectorQ
Create a
SparseVectorQ
from one or more values (repeated valuesRational
*).Create a
SparseVectorQ
from one or more values (repeated valuesRational
*).- x
the first
Rational
number- xs
the rest of the
Rational
numbers
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
range(start: Int, end: Int): SparseVectorQ
Return a
SparseVectorQ
containing a sequence of increasing integers in a range.Return a
SparseVectorQ
containing a sequence of increasing integers in a range.- start
the start value of the vector, inclusive
- end
the end value of the vector, exclusive (i.e., the first value not returned)
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )