Example usage for org.apache.commons.collections15 Transformer interface-usage

Introduction

In this page you can find the example usage for org.apache.commons.collections15 Transformer interface-usage.

Usage

From source file com.googlecode.sarasvati.visual.jung.NodeShapeTransformer.java

public class NodeShapeTransformer implements Transformer<Node, Shape> {
    protected Transformer<Node, Integer> sizeTrans = new Transformer<Node, Integer>() {
        @Override
        public Integer transform(Node nodeRef) {
            if ("task".equals(nodeRef.getType())) {
                return TaskIcon.WIDTH;

From source file edu.osu.netmotifs.warswap.ui.TransformerMotif.java

public class TransformerMotif implements Transformer<Integer, Point2D> {
    private int motifSize = 3;

    public TransformerMotif(int motifSize) {
        this.motifSize = motifSize;
    }

From source file com.googlecode.sarasvati.visual.jung.NodeLocationTransformer.java

public class NodeLocationTransformer implements Transformer<Node, Point2D> {
    protected GraphTree graphTree;

    public NodeLocationTransformer(GraphTree graphTree) {
        this.graphTree = graphTree;
    }

From source file nz.ac.waikato.modeljunit.gui.visualisaton.EdgeLabelTransformer.java

public class EdgeLabelTransformer<V, E> implements Transformer<Object, String> {
    private boolean show_ = false;
    private VisualizationViewer<Object, Object> vv_;

    public EdgeLabelTransformer(VisualizationViewer<Object, Object> vv) {
        vv_ = vv;

From source file org.inria.myriads.snoozeclient.systemtree.transformers.VertexToolTipTransformer.java

/**
 * 
 * Tooltip transfomer.
 * Tooltip for vertex hovering.
 * 
 * @author msimonin

From source file edu.uci.ics.jung.algorithms.blockmodel.StructurallyEquivalent.java

/**
 * Identifies sets of structurally equivalent vertices in a graph. Vertices <i>
 * i</i> and <i>j</i> are structurally equivalent iff the set of <i>i</i>'s
 * neighbors is identical to the set of <i>j</i>'s neighbors, with the
 * exception of <i>i</i> and <i>j</i> themselves. This algorithm finds all
 * sets of equivalent vertices in O(V^2) time.

From source file cz.cuni.mff.ksi.jinfer.treeruledisplayer.logic.VertexShapeTransformer.java

/**
 * Transformer for Rule Tree Vertex which transform {@link Regexp} into Vertex shape.
 * @author sviro
 */
public class VertexShapeTransformer implements Transformer<Regexp<? extends AbstractNamedNode>, Shape> {
    private final VertexShapeFactory<Regexp<? extends AbstractNamedNode>> shapeFactory;

From source file edu.uci.ics.jung.visualization.renderers.VertexLabelAsShapeRenderer.java

/**
 * Renders Vertex Labels, but can also supply Shapes for vertices.
 * This has the effect of making the vertex label the actual vertex
 * shape. The user will probably want to center the vertex label
 * on the vertex location.
 *

From source file cz.cuni.mff.ksi.jinfer.autoeditor.automatonvisualizer.layouts.transformers.RegexpEdgeLabeller.java

/**
 * Transformation of {@link Step} (in {@link Automaton}&#60;{@link Regexp}&#60;{@link AbstractStructuralNode}&#62;&#62;) to {@link String}.
 * @author rio
 */
public class RegexpEdgeLabeller implements Transformer<Step<Regexp<AbstractStructuralNode>>, String> {

From source file cz.cuni.mff.ksi.jinfer.autoeditor.automatonvisualizer.layouts.transformers.RegexpToStringTransformer.java

/**
 * Transformation of {@link Regexp}&#60;{@link AbstractStructuralNode}&#62; to {@link String}.
 * @author rio
 */
public class RegexpToStringTransformer implements Transformer<Regexp<AbstractStructuralNode>, String> {