treeindex.java
来自「用applet实现很多应用小程序」· Java 代码 · 共 533 行 · 第 1/2 页
JAVA
533 行
if ( row < 0 ) return; // invalid row value
((LongIntSortedMap)m_index).remove(prev, row);
((LongIntSortedMap)m_index).put(src.getLong(idx), row);
}
/**
* @see prefuse.data.event.ColumnListener#columnChanged(prefuse.data.column.Column, int, float)
*/
public void columnChanged(Column src, int idx, float prev) {
int row = m_rows.getTableRow(idx, getColumnIndex());
if ( row < 0 ) return; // invalid row value
((FloatIntSortedMap)m_index).remove(prev, row);
((FloatIntSortedMap)m_index).put(src.getFloat(idx), row);
}
/**
* @see prefuse.data.event.ColumnListener#columnChanged(prefuse.data.column.Column, int, double)
*/
public void columnChanged(Column src, int idx, double prev) {
int row = m_rows.getTableRow(idx, getColumnIndex());
if ( row < 0 ) return; // invalid row value
((DoubleIntSortedMap)m_index).remove(prev, row);
((DoubleIntSortedMap)m_index).put(src.getDouble(idx), row);
}
/**
* @see prefuse.data.event.ColumnListener#columnChanged(prefuse.data.column.Column, int, java.lang.Object)
*/
public void columnChanged(Column src, int idx, Object prev) {
int row = m_rows.getTableRow(idx, getColumnIndex());
if ( row < 0 ) return; // invalid row value
((ObjectIntSortedMap)m_index).remove(prev, row);
((ObjectIntSortedMap)m_index).put(src.get(idx), row);
}
// ------------------------------------------------------------------------
// Retrieval Methods
/**
* @see prefuse.data.util.Index#minimum()
*/
public int minimum() {
return m_index.getMinimum();
}
/**
* @see prefuse.data.util.Index#maximum()
*/
public int maximum() {
return m_index.getMaximum();
}
/**
* @see prefuse.data.util.Index#median()
*/
public int median() {
return m_index.getMedian();
}
/**
* @see prefuse.data.util.Index#uniqueCount()
*/
public int uniqueCount() {
return m_index.getUniqueCount();
}
// ------------------------------------------------------------------------
/**
* @see prefuse.data.util.Index#allRows(int)
*/
public IntIterator allRows(int type) {
boolean ascending = (type & Index.TYPE_ASCENDING) > 0;
return m_index.valueIterator(ascending);
}
/**
* @see prefuse.data.util.Index#rows(java.lang.Object, java.lang.Object, int)
*/
public IntIterator rows(Object lo, Object hi, int type) {
if ( !(m_index instanceof ObjectIntSortedMap) )
throw new IllegalStateException();
boolean reverse = (type & Index.TYPE_DESCENDING) > 0;
boolean linc = (type & Index.TYPE_LEFT_INCLUSIVE) > 0;
boolean hinc = (type & Index.TYPE_RIGHT_INCLUSIVE) > 0;
if ( lo == null ) lo = ObjectIntSortedMap.MIN_KEY;
if ( hi == null ) hi = ObjectIntSortedMap.MAX_KEY;
ObjectIntSortedMap index = (ObjectIntSortedMap)m_index;
if ( reverse ) {
return index.valueRangeIterator(hi, hinc, lo, linc);
} else {
return index.valueRangeIterator(lo, linc, hi, hinc);
}
}
/**
* @see prefuse.data.util.Index#rows(int, int, int)
*/
public IntIterator rows(int lo, int hi, int type) {
if ( !(m_index instanceof IntIntSortedMap) )
throw new IllegalStateException();
boolean reverse = (type & Index.TYPE_DESCENDING) > 0;
boolean linc = (type & Index.TYPE_LEFT_INCLUSIVE) > 0;
boolean hinc = (type & Index.TYPE_RIGHT_INCLUSIVE) > 0;
IntIntSortedMap index = (IntIntSortedMap)m_index;
if ( reverse ) {
return index.valueRangeIterator(hi, hinc, lo, linc);
} else {
return index.valueRangeIterator(lo, linc, hi, hinc);
}
}
/**
* @see prefuse.data.util.Index#rows(long, long, int)
*/
public IntIterator rows(long lo, long hi, int type) {
if ( !(m_index instanceof LongIntSortedMap) )
throw new IllegalStateException();
boolean reverse = (type & Index.TYPE_DESCENDING) > 0;
boolean linc = (type & Index.TYPE_LEFT_INCLUSIVE) > 0;
boolean hinc = (type & Index.TYPE_RIGHT_INCLUSIVE) > 0;
LongIntSortedMap index = (LongIntSortedMap)m_index;
if ( reverse ) {
return index.valueRangeIterator(hi, hinc, lo, linc);
} else {
return index.valueRangeIterator(lo, linc, hi, hinc);
}
}
/**
* @see prefuse.data.util.Index#rows(float, float, int)
*/
public IntIterator rows(float lo, float hi, int type) {
if ( !(m_index instanceof FloatIntSortedMap) )
throw new IllegalStateException();
boolean reverse = (type & Index.TYPE_DESCENDING) > 0;
boolean linc = (type & Index.TYPE_LEFT_INCLUSIVE) > 0;
boolean hinc = (type & Index.TYPE_RIGHT_INCLUSIVE) > 0;
FloatIntSortedMap index = (FloatIntSortedMap)m_index;
if ( reverse ) {
return index.valueRangeIterator(hi, hinc, lo, linc);
} else {
return index.valueRangeIterator(lo, linc, hi, hinc);
}
}
/**
* @see prefuse.data.util.Index#rows(double, double, int)
*/
public IntIterator rows(double lo, double hi, int type) {
if ( !(m_index instanceof DoubleIntSortedMap) )
throw new IllegalStateException();
boolean reverse = (type & Index.TYPE_DESCENDING) > 0;
boolean linc = (type & Index.TYPE_LEFT_INCLUSIVE) > 0;
boolean hinc = (type & Index.TYPE_RIGHT_INCLUSIVE) > 0;
DoubleIntSortedMap index = (DoubleIntSortedMap)m_index;
if ( reverse ) {
return index.valueRangeIterator(hi, hinc, lo, linc);
} else {
return index.valueRangeIterator(lo, linc, hi, hinc);
}
}
// ------------------------------------------------------------------------
/**
* @see prefuse.data.util.Index#rows(int)
*/
public IntIterator rows(int val) {
return rows(val, val, Index.TYPE_AII);
}
/**
* @see prefuse.data.util.Index#rows(long)
*/
public IntIterator rows(long val) {
return rows(val, val, Index.TYPE_AII);
}
/**
* @see prefuse.data.util.Index#rows(float)
*/
public IntIterator rows(float val) {
return rows(val, val, Index.TYPE_AII);
}
/**
* @see prefuse.data.util.Index#rows(double)
*/
public IntIterator rows(double val) {
return rows(val, val, Index.TYPE_AII);
}
/**
* @see prefuse.data.util.Index#rows(boolean)
*/
public IntIterator rows(boolean val) {
if ( !(m_index instanceof BooleanIntSortedMap) )
throw new IllegalStateException();
BooleanIntSortedMap index = (BooleanIntSortedMap)m_index;
return index.valueRangeIterator(val, true, val, true);
}
/**
* @see prefuse.data.util.Index#rows(java.lang.Object)
*/
public IntIterator rows(Object val) {
return rows(val, val, Index.TYPE_AII);
}
// ------------------------------------------------------------------------
/**
* @see prefuse.data.util.Index#get(double)
*/
public int get(double x) {
DoubleIntSortedMap index = (DoubleIntSortedMap)m_index;
return index.get(x);
}
/**
* @see prefuse.data.util.Index#get(float)
*/
public int get(float x) {
FloatIntSortedMap index = (FloatIntSortedMap)m_index;
return index.get(x);
}
/**
* @see prefuse.data.util.Index#get(int)
*/
public int get(int x) {
IntIntSortedMap index = (IntIntSortedMap)m_index;
return index.get(x);
}
/**
* @see prefuse.data.util.Index#get(long)
*/
public int get(long x) {
LongIntSortedMap index = (LongIntSortedMap)m_index;
return index.get(x);
}
/**
* @see prefuse.data.util.Index#get(java.lang.Object)
*/
public int get(Object x) {
ObjectIntSortedMap index = (ObjectIntSortedMap)m_index;
return index.get(x);
}
} // end of class ColumnIndex
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?