Package prefuse.data.tuple

Examples of prefuse.data.tuple.TupleSet.addTuple()


            new TupleSetListener() {
                public void tupleSetChanged(TupleSet t, Tuple[] add, Tuple[] rem) {
                    TupleSet linearInterp = m_vis.getGroup(linear);
                    if ( add.length < 1 ) return; linearInterp.clear();
                    for ( Node n = (Node)add[0]; n!=null; n=n.getParent() )
                        linearInterp.addTuple(n);
                }
            }
        );
       
        //==== Create a highlight group for adding borders based on citation count
View Full Code Here


                    curFocus = item;
                    ts.setTuple(item);
                } else if ( ts.containsTuple(item) ) {
                    ts.removeTuple(item);
                } else {
                    ts.addTuple(item);
                }
                runActivity(vis);
               
            } else if ( e.isControlDown() ) {
                Visualization vis = item.getVisualization();
View Full Code Here

       
        m_vt0 = vt.getItem(0);
        m_vn0 = (NodeItem)vg.getNode(0);
       
        TupleSet ts = m_vis.getFocusGroup(Visualization.FOCUS_ITEMS);
        ts.addTuple(m_vt0);
        ts.addTuple(m_vn0);
    }
   
    public void testRepeatGroup() {
      Table t = new Table();
View Full Code Here

        m_vt0 = vt.getItem(0);
        m_vn0 = (NodeItem)vg.getNode(0);
       
        TupleSet ts = m_vis.getFocusGroup(Visualization.FOCUS_ITEMS);
        ts.addTuple(m_vt0);
        ts.addTuple(m_vn0);
    }
   
    public void testRepeatGroup() {
      Table t = new Table();
      Graph g = new Graph();
View Full Code Here

            new TupleSetListener() {
                public void tupleSetChanged(TupleSet t, Tuple[] add, Tuple[] rem) {
                    TupleSet linearInterp = m_vis.getGroup(linear);
                    if ( add.length < 1 ) return; linearInterp.clear();
                    for ( Node n = (Node)add[0]; n!=null; n=n.getParent() )
                        linearInterp.addTuple(n);
                }
            }
        );
       
        SearchTupleSet search = new PrefixSearchTupleSet();
View Full Code Here

               
                // invalidate changed tuples, add them all to the focus set
                focus.clear();
                for ( int i=0; i<add.length; ++i ) {
                    ((VisualItem)add[i]).setValidated(false);
                    focus.addTuple(add[i]);
                }
                for ( int i=0; i<rem.length; ++i ) {
                    ((VisualItem)rem[i]).setValidated(false);
                    focus.addTuple(rem[i]);
                }
View Full Code Here

                    ((VisualItem)add[i]).setValidated(false);
                    focus.addTuple(add[i]);
                }
                for ( int i=0; i<rem.length; ++i ) {
                    ((VisualItem)rem[i]).setValidated(false);
                    focus.addTuple(rem[i]);
                }
               
                m_vis.run("update");
                m_vis.run("animate");
            }
View Full Code Here

        TupleSet ts = (TupleSet)m_source.get(field);
        if ( ts == null ) {
            ts = new DefaultTupleSet();
            m_source.put(field, ts);
        }
        ts.addTuple(t);
    }

    /**
     * @see prefuse.data.search.SearchTupleSet#unindex(prefuse.data.Tuple, java.lang.String)
     */
 
View Full Code Here

                    TupleSet linearInterp = vis.getGroup(Constants.LINEAR);
                    if (add.length < 1)
                        return;
                    linearInterp.clear();
                    for (Node n = (Node) add[0]; n != null; n = n.getParent())
                        linearInterp.addTuple(n);
                }
            }
        );       
    }
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.