Package prefuse.util.collections

Examples of prefuse.util.collections.IntIterator

48
49
50
51
52
53
54
55
56
57
58
       
        // attempt to generate an optimized query plan
        Iterator iter = null;
        if ( ts instanceof Table ) {
            Table t = (Table)ts;
            IntIterator ii = getOptimizedIterator(t,p);
            if ( ii != null )
                iter = t.tuples(ii);
        }
       
        // optimization fails, scan the entire table
View Full Code Here
70
71
72
73
74
75
76
77
78
79
80
     * @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 = null;
        iter = getOptimizedIterator(t, p);
       
        // optimization fails, scan the entire table
        if ( iter == null ) {
            iter = new FilterRowIterator(t.rows(), t, p);
View Full Code Here
168
169
170
171
172
173
174
175
176
177
178
   
    protected static IntIterator getAndIterator(Table t, AndPredicate ap) {
        // possible TODO: add scoring to select best optimized iterator
        // for now just work from the end backwards and take the first
        // optimized iterator we find
        IntIterator rows = null;
        Predicate clause = null;
        for ( int i=ap.size(); --i >= 0; ) {
            clause = ap.get(i);
            if ( (rows=getOptimizedIterator(t,clause)) != null )
                break;
View Full Code Here
135
136
137
138
139
140
141
142
143
144
145
146
147
            m_esch.addColumn(TRGID, String.class);
        }
       
        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
View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
        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();
View Full Code Here
180
181
182
183
184
185
186
187
188
189
190
191
192
     * @param t the input tuple
     * @return an iterator over all AggregateItems that contain the input Tuple
     */
    public Iterator getAggregates(Tuple t) {
        int hash = getHashCode(t);
        IntIterator iit = m_aggregated.getIndex(MEMBER_HASH).rows(hash);
        HashSet set = new HashSet();
        while ( iit.hasNext() ) {
            int r = iit.nextInt();
            set.add(getTuple(m_aggregated.getInt(r, AGGREGATE)));
        }
        return set.iterator();
    }
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
        for ( i=i1; iter.hasNext() && i <= i2; ++i ) {
            assertEquals(((Integer)iter.next()).intValue(), sort[i]);
        }
        assertTrue(!iter.hasNext() && i == i2+1);
       
        IntIterator liter = map.valueRangeIterator(loKey, true, hiKey, false);
        for ( i=i1; liter.hasNext() && i <= i2; ++i ) {
            assertEquals(liter.nextInt(), sort[i]);
        }
        assertTrue(!iter.hasNext() && i == i2+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.