Package prefuse.util.collections

Examples of prefuse.util.collections.IntIterator.nextInt()

348
349
350
351
352
353
354
355
356
357
358
        // set up cache of node data
        m_links = createLinkTable();
               
        IntIterator edges = getEdgeTable().rows();
        while ( edges.hasNext() ) {
            updateDegrees(edges.nextInt(), 1);
        }
    }
   
    /**
     * Instantiate and return the link table.
View Full Code Here
216
217
218
219
220
221
222
223
224
225
226
        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
35
36
37
38
39
40
41
42
43
44
45
     */
    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();
        }
    }
   
    /**
     * Get the prefuse table row for a row index into this table model.
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
                    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
55
56
57
58
59
60
61
62
63
64
65
                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
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
585
586
587
588
589
590
591
592
593
594
595
    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
393
394
395
396
397
398
399
400
401
402
403
     * @see prefuse.data.tuple.TupleSet#clear()
     */
    public void clear() {
        IntIterator rows = rows(true);
        while ( rows.hasNext() ) {
            removeRow(rows.nextInt());
        }
    }
   
    /**
     * Indicates if the given row number corresponds to a valid table row.
View Full Code Here
348
349
350
351
352
353
354
355
356
357
358
        // set up cache of node data
        m_links = createLinkTable();
               
        IntIterator edges = getEdgeTable().rows();
        while ( edges.hasNext() ) {
            updateDegrees(edges.nextInt(), 1);
        }
    }
   
    /**
     * Instantiate and return the link table.
View Full Code Here
217
218
219
220
221
222
223
224
225
226
227
        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
TOP
Copyright © 2018 www.massapi.com. 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.