Package prefuse.data

Examples of prefuse.data.Table

11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
import test.prefuse.TestConfig;

public class GraphTest extends TestCase implements GraphTestData {

    public static Graph getTestCaseGraph() {
        Table nodes = new Table(NNODES, NNODECOLS);
        for ( int c=0; c<NNODECOLS; ++c ) {
            nodes.addColumn(NHEADERS[c], NTYPES[c]);
            for ( int r=0; r<NNODES; ++r ) {
                nodes.set(r, NHEADERS[c], NODES[c][r]);
            }
        }
       
        Table edges = new Table(NEDGES, NEDGECOLS);
        for ( int c=0; c<NEDGECOLS; ++c ) {
            edges.addColumn(EHEADERS[c], ETYPES[c]);
            for ( int r=0; r<NEDGES; ++r ) {
                edges.set(r, EHEADERS[c], EDGES[c][r]);
            }
        }
       
        return new Graph(nodes, edges, false,
                NHEADERS[0], EHEADERS[0], EHEADERS[1]);
View Full Code Here
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
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
    }
   
    public void testGraph() {
        boolean verbose = TestConfig.verbose();
       
        Table nodes = graph.getNodeTable();
        Table edges = graph.getEdgeTable();
       
        // check the basics
        assertEquals(NNODES, graph.getNodeCount());
        assertEquals(NEDGES, graph.getEdgeCount());
        assertEquals(NHEADERS[0], graph.getNodeKeyField());
        assertEquals(EHEADERS[0], graph.getEdgeSourceField());
        assertEquals(EHEADERS[1], graph.getEdgeTargetField());
       
        // check all nodes, basic data
        Iterator niter = graph.nodes();
        while ( niter.hasNext() ) {
            Node node = (Node)niter.next();
            int nrow = node.getRow();

            if ( verbose ) System.out.print(nrow+"\t");
           
            // check data members
            for ( int i=0; i<NNODECOLS; ++i ) {
                assertEquals(NODES[i][nrow], node.get(NHEADERS[i]));
                assertEquals(NODES[i][nrow], nodes.get(nrow, NHEADERS[i]));
                if ( verbose ) System.out.print(NHEADERS[i]+":"+NODES[i][nrow]+"\t");
            }
           
            if ( verbose ) {
                System.out.print("in:"+node.getInDegree());
                System.out.print("\t");
                System.out.print("out:"+node.getOutDegree());
                System.out.println();
            }
           
            // check degrees
            assertEquals(node.getInDegree(),      INDEGREE[nrow]);
            assertEquals(graph.getInDegree(nrow),  INDEGREE[nrow]);
            assertEquals(node.getOutDegree(),     OUTDEGREE[nrow]);
            assertEquals(graph.getOutDegree(nrow), OUTDEGREE[nrow]);
           
            // check edges
            Iterator eiter = node.inEdges();
            while ( eiter.hasNext() ) {
                Edge edge = (Edge)eiter.next();
                int erow = edge.getRow();
                assertEquals(nrow, edge.getTargetNode().getRow());
                assertEquals(nrow, graph.getTargetNode(erow));
            }
            eiter = node.outEdges();
            while ( eiter.hasNext() ) {
                Edge edge = (Edge)eiter.next();
                int erow = edge.getRow();
                assertEquals(nrow, edge.getSourceNode().getRow());
                assertEquals(nrow, graph.getSourceNode(erow));
            }
        }
       
        // check all edges, basic data
        Iterator eiter = graph.edges();
        while ( eiter.hasNext() ) {
            Edge edge = (Edge)eiter.next();
            int erow = edge.getRow();
           
            // check data members
            for ( int i=0; i<NEDGECOLS; ++i ) {
                assertEquals(EDGES[i][erow], edge.get(EHEADERS[i]));
                assertEquals(EDGES[i][erow], edges.get(erow, EHEADERS[i]));
            }
           
            // check nodes
            Node s = edge.getSourceNode();
            int srow = s.getRow();
            assertEquals(srow, graph.getSourceNode(erow));
            int sk = nodes.getInt(srow, NHEADERS[0]);
            assertEquals(sk, edges.getInt(erow, EHEADERS[0]));
           
            Node t = edge.getTargetNode();
            int trow = t.getRow();
            assertEquals(trow, graph.getTargetNode(erow));
            int tk = nodes.getInt(trow, NHEADERS[0]);
            assertEquals(tk, edges.getInt(erow, EHEADERS[1]));
           
            assertEquals(srow, edge.getAdjacentNode(t).getRow());
            assertEquals(trow, edge.getAdjacentNode(s).getRow());
            assertEquals(srow, graph.getAdjacentNode(erow, trow));
            assertEquals(trow, graph.getAdjacentNode(erow, srow));
View Full Code Here
223
224
225
226
227
228
229
230
231
232
233
234
        Arrays.fill(baseline, b);
       
        m_model.setValueRange(0, maxValue, 0, maxValue);
       
        // perform second walk to compute polygon layout
        Table t = (Table)m_vis.getGroup(m_group);
        Iterator iter = t.tuplesReversed();
        while ( iter.hasNext() ) {
            VisualItem item = (VisualItem)iter.next();
            if ( !item.isVisible() ) continue;
           
            float height = 0;
View Full Code Here
18
19
20
21
22
23
24
25
26
27
28
29
30
31
    int cols[] = { -1, NCOLS+1, 2*NCOLS };
   
    Table t;
   
    public static Table getTestCaseTable() {
        Table t = new Table(NROWS, NCOLS);
        for ( int c=0; c<NCOLS; ++c ) {
            t.addColumn(HEADERS[c], TYPES[c]);
            for ( int r=0; r<NROWS; ++r ) {
                t.set(r, HEADERS[c], TABLE[c][r]);
            }
        }
        return t;
    }
View Full Code Here
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
        TupleSet source = getSourceData(group);
        if ( source == null ) return null;
       
        // first get the source table and row value
        int row = item.getRow();
        Table t = item.getTable();
        while ( t instanceof VisualTable ) {
            VisualTable vt = (VisualTable)t;
            row = vt.getParentRow(row);
            t   = vt.getParentTable();
        }
       
        // now get the appropriate source tuple
        // graphs maintain their own tuple managers so treat them specially
        String cgroup = PrefuseLib.getChildGroup(group);
        if ( cgroup != null ) {
            String pgroup = PrefuseLib.getParentGroup(group);
            Graph g = (Graph)getSourceData(pgroup);
            if ( t == g.getNodeTable() ) {
                return g.getNode(row);
            } else {
                return g.getEdge(row);
            }
        } else {
            return t.getTuple(row);
        }
    }
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
127
128
129
        frame.setVisible(true);
    }
   
    public static JComponent demo() {
        String datafile = "/amazon.txt";
        Table data = null;
        try {
            data = (new DelimitedTextTableReader()).readTable(datafile);
            data.addColumn("image","CONCAT('/images/',id,'.01.MZZZZZZZ.jpg')");
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(1);
        }
        return new DataMountain(data);
View Full Code Here
TOP

Related Classes of prefuse.data.Table

  • org.apache.hadoop.chukwa.analysis.salsa.visualization.Heatmap
  • org.apache.hadoop.chukwa.analysis.salsa.visualization.Swimlanes
  • org.apache.hadoop.chukwa.analysis.salsa.visualization.Swimlanes$MapReduceSwimlanes
  • org.cishell.testing.convertertester.core.tester.graphcomparison.DefaultGraphComparer
  • org.cishell.testing.convertertester.core.tester.graphcomparison.GraphComparerTester
  • org.cishell.testing.convertertester.core.tester.graphcomparison.TableUtil
  • org.cishell.testing.convertertester.core.tester2.graphcomparison.IdsNotPreservedComparer
  • org.cishell.testing.convertertester.core.tester2.graphcomparison.IdsPreservedComparer
  • org.cishell.utilities.TableUtilities
  • org.cishell.utilities.TableUtilitiesTests
    • 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.