Package prefuse.util.collections

Examples of prefuse.util.collections.IntIterator

346
347
348
349
350
351
352
353
354
355
     */
    protected void initLinkTable() {
        // set up cache of node data
        m_links = createLinkTable();
               
        IntIterator edges = getEdgeTable().rows();
        while ( edges.hasNext() ) {
            updateDegrees(edges.nextInt(), 1);
        }
    }
View Full Code Here
214
215
216
217
218
219
220
221
222
223
224
225
226
     */
    public void filterRows() {
        if ( m_parent == null ) return;
       
        CascadedRowManager rowman = (CascadedRowManager)m_rows;
        IntIterator crows = m_rows.rows();
        while ( crows.hasNext() ) {
            int crow = crows.nextInt();
            if ( !m_rowFilter.getBoolean(
                    m_parent.getTuple(rowman.getParentRow(crow))) )
            {
                removeCascadedRow(crow);
            }
View Full Code Here
33
34
35
36
37
38
39
40
41
42
     * 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();
        }
    }
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
69
70
               
                if ( i < 0 ) {
                    System.err.println("catch me - VisualGraph fireGraphEvent");
                }
//                try {
                IntIterator erows = edgeRows(i);
                while ( erows.hasNext() ) {
                    int erow = erows.nextInt();
                    edges.setValidated(erow, false);
                }
//                } catch ( Exception ex ) {
//                  ex.printStackTrace();
//                }
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
64
65
           
            for ( int i=first; i<=last; ++i ) {
                if ( nodes.isValidated(i) )
                    continue; // look only for invalidations
               
                IntIterator erows = edgeRows(i);
                while ( erows.hasNext() ) {
                    int erow = erows.nextInt();
                    edges.setValidated(erow, false);
                }
            }
        }
        // fire the event off to listeners
View Full Code Here
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
   
    /**
     * isValidTree's recursive helper method.
     */
    private void isValidHelper(int node, int[] counts) {
        IntIterator edges = childEdgeRows(node);
        int ncount = 0;
        while ( edges.hasNext() ) {
            // get next edge, increment count
            int edge = edges.nextInt();
            ++ncount; ++counts[0];
            // visit the next edge
            int c = getAdjacentNode(edge, node);
            isValidHelper(c, counts);
            // check the counts
View Full Code Here
391
392
393
394
395
396
397
398
399
400
    /**
     * 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());
        }
    }
View Full Code Here
346
347
348
349
350
351
352
353
354
355
     */
    protected void initLinkTable() {
        // set up cache of node data
        m_links = createLinkTable();
               
        IntIterator edges = getEdgeTable().rows();
        while ( edges.hasNext() ) {
            updateDegrees(edges.nextInt(), 1);
        }
    }
View Full Code Here
215
216
217
218
219
220
221
222
223
224
225
226
227
     */
    public void filterRows() {
        if ( m_parent == null ) return;
       
        CascadedRowManager rowman = (CascadedRowManager)m_rows;
        IntIterator crows = m_rows.rows();
        while ( crows.hasNext() ) {
            int crow = crows.nextInt();
            if ( !m_rowFilter.getBoolean(
                    m_parent.getTuple(rowman.getParentRow(crow))) )
            {
                removeCascadedRow(crow);
            }
View Full Code Here
549
550
551
552
553
554
555
556
557
558
559
560
561
        }
       
        // iterate through nodes, make sure each one has the right
        // number of parents
        int root = getRootRow();
        IntIterator nodes = getNodeTable().rows();
        while ( nodes.hasNext() ) {
            int n = nodes.nextInt();
            int id = getInDegree(n);
            if ( n==root && id > 0 ) {
                s_logger.warning("Root node has a parent.");
                return false;
            } else if ( id > 1 ) {
View Full Code Here
TOP

Related Classes of prefuse.util.collections.IntIterator

  • prefuse.data.CascadedTable
  • prefuse.data.Graph
  • prefuse.data.io.GraphMLReader$GraphMLHandler
  • prefuse.data.Table
  • prefuse.data.Tree
  • prefuse.data.util.FilterIteratorFactory
  • prefuse.data.util.TreeIndex
  • prefuse.util.ui.PrefuseTableModel
  • prefuse.visual.AggregateTable
  • prefuse.visual.VisualGraph
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.