@Override public IntIterator rows() { return m_table.rows(); }
@Override public IntIterator rows(Predicate arg0) { return super.rows(arg0); }
@Override public IntIterator rows(boolean reverse) { return m_table.rows(reverse); }
/** * Get an iterator over the tuples in this table in reverse order. * @return an iterator over the table tuples in reverse order */ public Iterator tuplesReversed() { return m_tuples.iterator(rows(true)); }
/** * Get an iterator over all node ids (node table row numbers). * @return an iterator over all node ids (node table row numbers) */ public IntIterator nodeRows() { return getNodeTable().rows(); }
/** * Get an iterator over all edge ids (edge table row numbers). * @return an iterator over all edge ids (edge table row numbers) */ public IntIterator edgeRows() { return getEdgeTable().rows(); }
/** * Get an iterator over the tuples in this table. * @return an iterator over the table tuples * @see prefuse.data.tuple.TupleSet#tuples() */ public Iterator tuples() { return m_tuples.iterator(rows()); }
/** * Return a TableIterator over the rows of this table. * @return a TableIterator over this table */ public TableIterator iterator() { return iterator(rows()); }
/** * Get an iterator over the row numbers of this table. * @return an iterator over the rows of this table */ @SuppressWarnings("unchecked") public IntIterator rowIterator() { return new IntIteratorImpl(this.table.rows()); }
/** * Get a filtered iterator over the rows in the given table, * filtered by the given predicate. * @param t the Table to iterate over * @param p the filter predicate * @return a filtered iterator over the table rows */ public static IntIterator rows(Table t, Predicate p) { // attempt to generate an optimized query plan IntIterator iter; iter = getOptimizedIterator(t, p); // optimization fails, scan the entire table if ( iter == null ) { iter = new FilterRowIterator(t.rows(), t, p); } return iter; }
/** * Removes all table rows that meet the input predicate filter. * @param filter a predicate specifying which rows to remove from * the table. */ public void remove(Predicate filter) { for ( IntIterator ii = rows(filter); ii.hasNext(); ) removeRow(ii.nextInt()); }
/** * Initialize mapping between prefuse table rows and the rows reported * by this model. */ private void initRowMap() { m_rowMap = new int[m_table.getRowCount()]; IntIterator rows = m_table.rows(); for ( int i=0; rows.hasNext(); ++i ) { m_rowMap[i] = rows.nextInt(); } }
/** * Clear this table, removing all rows. * @see prefuse.data.tuple.TupleSet#clear() */ public void clear() { IntIterator rows = rows(true); while ( rows.hasNext() ) { removeRow(rows.nextInt()); } }
/** * Get a filtered iterator over the edges and nodes of this graph. * @see prefuse.data.tuple.TupleSet#tuples(prefuse.data.expression.Predicate) */ public Iterator tuples(Predicate filter) { if ( filter == null ) { return tuples(); } else { return new CompositeIterator( m_edgeTuples.iterator(getEdgeTable().rows(filter)), m_nodeTuples.iterator(getNodeTable().rows(filter))); } }
public void endDocument() throws SAXException { // time to actually set up the edges IntIterator rows = m_edges.rows(); while (rows.hasNext()) { int r = rows.nextInt(); String src = m_edges.getString(r, SRCID); if (!m_nodeMap.containsKey(src)) { throw new SAXException( "Tried to create edge with source node id=" + src + " which does not exist."); } int s = ((Integer) m_nodeMap.get(src)).intValue(); m_edges.setInt(r, SRC, s); String trg = m_edges.getString(r, TRGID); if (!m_nodeMap.containsKey(trg)) { throw new SAXException( "Tried to create edge with target node id=" + trg + " which does not exist."); } int t = ((Integer) m_nodeMap.get(trg)).intValue(); m_edges.setInt(r, TRG, t); } m_edges.removeColumn(SRCID); m_edges.removeColumn(TRGID); // now create the graph m_graph = new Graph(m_nodes, m_edges, m_directed); if (m_graphid != null) m_graph.putClientProperty(ID, m_graphid); }
/** * Create a new Tree. * @param nodes the backing table to use for node data. * Node instances of this graph will get their data from this table. * @param edges the backing table to use for edge data. * Edge instances of this graph will get their data from this table. * @param nodeKey data field used to uniquely identify a node. If this * field is null, the node table row numbers will be used * @param sourceKey data field used to denote the source node in an edge * table * @param targetKey data field used to denote the target node in an edge * table */ public Tree(Table nodes, Table edges, String nodeKey, String sourceKey, String targetKey) { super(nodes, edges, false, nodeKey, sourceKey, targetKey); for ( IntIterator rows = nodes.rows(); rows.hasNext(); ) { int n = rows.nextInt(); if ( getParent(n) < 0 ) { m_root = n; break; } } }
/** * Initialize the link table, which holds adjacency lists for this graph. */ protected void initLinkTable() { // set up cache of node data m_links = createLinkTable(); IntIterator edges = getEdgeTable().rows(); while ( edges.hasNext() ) { updateDegrees(edges.nextInt(), 1); } }
for ( IntIterator rows = table.rows(); rows.hasNext(); ) { int row = rows.nextInt(); for ( int i=0; i<table.getColumnCount(); ++i ) {
public void populateTable_OneLinePerState(Table orig_tab) { IntIterator rownumiter; int newrownum, origrownum; rownumiter = orig_tab.rows(); // iterate over everything while (rownumiter.hasNext()) { origrownum = ((Integer)rownumiter.next()).intValue(); newrownum = this.plot_tab.addRow(); this.plot_tab.set(newrownum, "state_name", orig_tab.getString(origrownum, "state_name")); this.plot_tab.set(newrownum, "ycoord", orig_tab.getInt(origrownum, "seqno")); this.plot_tab.set(newrownum,"hostname",orig_tab.getString(origrownum,"hostname")); this.plot_tab.set(newrownum,"friendly_id",orig_tab.getString(origrownum,"friendly_id")); this.plot_tab.set(newrownum,START_FIELD_NAME, orig_tab.getDouble(origrownum,START_FIELD_NAME)); this.plot_tab.set(newrownum,END_FIELD_NAME, orig_tab.getDouble(origrownum,END_FIELD_NAME)); } }
public void populateTable_MapsReducesOnly(Table orig_tab) { IntIterator rownumiter; int newrownum, origrownum; rownumiter = orig_tab.rows( (Predicate) ExpressionParser.parse("[state_name] == 'map' OR [state_name] == 'reduce'") ); while (rownumiter.hasNext()) { origrownum = ((Integer)rownumiter.next()).intValue(); newrownum = this.plot_tab.addRow(); this.plot_tab.set(newrownum, "state_name", orig_tab.getString(origrownum, "state_name")); this.plot_tab.set(newrownum, "ycoord", orig_tab.getInt(origrownum, "seqno")); this.plot_tab.set(newrownum,"hostname",orig_tab.getString(origrownum,"hostname")); this.plot_tab.set(newrownum,"friendly_id",orig_tab.getString(origrownum,"friendly_id")); this.plot_tab.set(newrownum,START_FIELD_NAME, orig_tab.getDouble(origrownum,START_FIELD_NAME)); this.plot_tab.set(newrownum,START_FIELD_NAME, orig_tab.getDouble(origrownum,END_FIELD_NAME)); } }