org.apache.sysml.runtime.matrix.data

Class SparseRow

java.lang.Object

org.apache.sysml.runtime.matrix.data.SparseRow

All Implemented Interfaces:

Serializable

public class SparseRow
extends Object
implements Serializable

See Also:

Serialized Form

Field Summary

Fields

Modifier and Type	Field and Description
static int	initialCapacity

Constructor Summary

Constructors

Constructor and Description
SparseRow()
SparseRow(int capacity)
SparseRow(int estnnz, int maxnnz)
SparseRow(SparseRow that)

Method Summary

Modifier and Type	Method and Description
void	append(int col, double v)
int	capacity()
void	compact() In-place compaction of non-zero-entries; removes zero entries and shifts non-zero entries to the left if necessary.
void	copy(SparseRow that)
void	deleteIndexRange(int lowerCol, int upperCol)
double	get(int col)
int[]	indexes()
boolean	isEmpty()
void	recap(int newCap)
void	reset(int estnns, int maxnns)
int	searchIndexesFirstGT(int col)
int	searchIndexesFirstGTE(int col)
int	searchIndexesFirstLTE(int col)
boolean	set(int col, double v)
void	setIndexes(int[] i)
void	setIndexRange(int lowerCol, int upperCol, double[] v, int vix, int len) Inserts a dense vector into a column range; calling this methods helps to avoid repeated shifting of remaining values/indexes for every set value.
void	setSize(int newsize)
void	setValues(double[] d)
int	size()
void	sort() In-place sort of column-index value pairs in order to allow binary search after constant-time append was used for reading unordered sparse rows.
String	toString()
double[]	values()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

initialCapacity

public static final int initialCapacity

See Also:

Constant Field Values

Constructor Detail

SparseRow

public SparseRow()

SparseRow

public SparseRow(int capacity)

SparseRow

public SparseRow(int estnnz,
                 int maxnnz)

SparseRow

public SparseRow(SparseRow that)

Method Detail

size

public int size()

setSize

public void setSize(int newsize)

isEmpty

public boolean isEmpty()

values

public double[] values()

indexes

public int[] indexes()

setValues

public void setValues(double[] d)

setIndexes

public void setIndexes(int[] i)

capacity

public int capacity()

copy

public void copy(SparseRow that)

reset

public void reset(int estnns,
                  int maxnns)

recap

public void recap(int newCap)

compact

public void compact()

In-place compaction of non-zero-entries; removes zero entries and shifts non-zero entries to the left if necessary.

set

public boolean set(int col,
                   double v)

append

public void append(int col,
                   double v)

get

public double get(int col)

searchIndexesFirstLTE

public int searchIndexesFirstLTE(int col)

searchIndexesFirstGTE

public int searchIndexesFirstGTE(int col)

searchIndexesFirstGT

public int searchIndexesFirstGT(int col)

deleteIndexRange

public void deleteIndexRange(int lowerCol,
                             int upperCol)

setIndexRange

public void setIndexRange(int lowerCol,
                          int upperCol,
                          double[] v,
                          int vix,
                          int len)

Inserts a dense vector into a column range; calling this methods helps to avoid repeated shifting of remaining values/indexes for every set value.

Parameters:

lowerCol - lower column index

upperCol - upper column index

v - dense vector

vix - ?

len - ?

sort

public void sort()

In-place sort of column-index value pairs in order to allow binary search after constant-time append was used for reading unordered sparse rows. We first check if already sorted and subsequently sort if necessary in order to get O(n) bestcase. Note: In-place sort necessary in order to guarantee the memory estimate for operations that implicitly read that data set.

toString

public String toString()

Overrides:

toString in class Object