コード例 #1
0
ファイル: TreeIndex.java プロジェクト: netsym/primogeni
  /** @see prefuse.data.util.Index#index() */
  public void index() {
    m_index.clear();

    // iterate over all valid values, adding them to the index
    int idx = getColumnIndex();
    m_colidx = idx;
    IntIterator rows = m_rows.rows();

    if (m_index instanceof IntIntSortedMap) {
      IntIntSortedMap map = (IntIntSortedMap) m_index;
      while (rows.hasNext()) {
        int r = rows.nextInt();
        map.put(m_col.getInt(m_table.getColumnRow(r, idx)), r);
      }
    } else if (m_index instanceof LongIntSortedMap) {
      LongIntSortedMap map = (LongIntSortedMap) m_index;
      while (rows.hasNext()) {
        int r = rows.nextInt();
        map.put(m_col.getLong(m_table.getColumnRow(r, idx)), r);
      }
    } else if (m_index instanceof FloatIntSortedMap) {
      FloatIntSortedMap map = (FloatIntSortedMap) m_index;
      while (rows.hasNext()) {
        int r = rows.nextInt();
        map.put(m_col.getFloat(m_table.getColumnRow(r, idx)), r);
      }
    } else if (m_index instanceof DoubleIntSortedMap) {
      DoubleIntSortedMap map = (DoubleIntSortedMap) m_index;
      while (rows.hasNext()) {
        int r = rows.nextInt();
        map.put(m_col.getDouble(m_table.getColumnRow(r, idx)), r);
      }
    } else if (m_index instanceof BooleanIntSortedMap) {
      BooleanIntSortedMap map = (BooleanIntSortedMap) m_index;
      while (rows.hasNext()) {
        int r = rows.nextInt();
        map.put(m_col.getBoolean(m_table.getColumnRow(r, idx)), r);
      }
    } else if (m_index instanceof ObjectIntSortedMap) {
      ObjectIntSortedMap map = (ObjectIntSortedMap) m_index;
      while (rows.hasNext()) {
        int r = rows.nextInt();
        map.put(m_col.get(m_table.getColumnRow(r, idx)), r);
      }
    } else {
      throw new IllegalStateException();
    }

    m_reindex = false;
  }
コード例 #2
0
ファイル: TreeIndex.java プロジェクト: netsym/primogeni
  /** @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);
    }
  }
コード例 #3
0
ファイル: TreeIndex.java プロジェクト: netsym/primogeni
  private void rowChanged(int row, boolean insert) {
    // make sure we access the right column value
    int crow = m_rows.getColumnRow(row, getColumnIndex());

    if (m_index instanceof IntIntSortedMap) {
      IntIntSortedMap map = (IntIntSortedMap) m_index;
      int key = m_col.getInt(row);
      if (insert) map.put(key, row);
      else map.remove(key, row);
    } else if (m_index instanceof LongIntSortedMap) {
      LongIntSortedMap map = (LongIntSortedMap) m_index;
      long key = m_col.getLong(crow);
      if (insert) map.put(key, row);
      else map.remove(key, row);
    } else if (m_index instanceof FloatIntSortedMap) {
      FloatIntSortedMap map = (FloatIntSortedMap) m_index;
      float key = m_col.getFloat(crow);
      if (insert) map.put(key, row);
      else map.remove(key, row);
    } else if (m_index instanceof DoubleIntSortedMap) {
      DoubleIntSortedMap map = (DoubleIntSortedMap) m_index;
      double key = m_col.getDouble(crow);
      if (insert) map.put(key, row);
      else map.remove(key, row);
    } else if (m_index instanceof BooleanIntSortedMap) {
      BooleanIntSortedMap map = (BooleanIntSortedMap) m_index;
      boolean key = m_col.getBoolean(crow);
      if (insert) map.put(key, row);
      else map.remove(key, row);
    } else if (m_index instanceof ObjectIntSortedMap) {
      ObjectIntSortedMap map = (ObjectIntSortedMap) m_index;
      Object key = m_col.get(crow);
      if (insert) map.put(key, row);
      else map.remove(key, row);
    } else {
      throw new IllegalStateException();
    }
  }
コード例 #4
0
ファイル: TreeIndex.java プロジェクト: netsym/primogeni
 /** @see prefuse.data.util.Index#get(double) */
 public int get(double x) {
   DoubleIntSortedMap index = (DoubleIntSortedMap) m_index;
   return index.get(x);
 }
コード例 #5
0
ファイル: TreeIndex.java プロジェクト: netsym/primogeni
 /**
  * @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);
 }