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 org.eclipse.titanium.graph.components.EdgeStroke.java

/**
 * This class can makes edges colored red more emphasized, by doubling their width.
 * 
 * @author Kristof Szabados
 */
public class EdgeStroke<E> implements Transformer<E, Stroke> {

From source file graph.util.VertexShapeSizeAspect.java

/**
 * Controls the shape, size, and aspect ratio for each vertex.
 * 
 * @author Joshua O'Madadhain
 */
public class VertexShapeSizeAspect<V, E> extends AbstractVertexShapeTransformer<V>

From source file inet.CalculationNetworkEditor.Transformers.EdgeStrokeTransformer.java

/**
 *
 * @author andre
 */
public class EdgeStrokeTransformer<V, E> implements Transformer<E, Stroke> {
    private float dash[] = { 10.0f };

From source file logicProteinHypernetwork.analysis.complexes.NetworkEntitiesToSubnetwork.java

/**
 * Transforms a network entities into a protein subnetwork
 *
 * @author Johannes Kster <johannes.koester@tu-dortmund.de>
 */
public class NetworkEntitiesToSubnetwork implements Transformer<Iterable<NetworkEntity>, ProteinSubnetwork> {

From source file edu.uci.ics.jung.visualization.decorators.DirectionalEdgeArrowTransformer.java

/**
 * Returns wedge arrows for undirected edges and notched arrows
 * for directed edges, of the specified dimensions.
 * 
 * @author Joshua O'Madadhain
 */

From source file edu.zju.cs.ooobgy.visualization.decorators.DirectionalEdgeArrowTransformer.java

/**
 * Returns wedge arrows for undirected edges and notched arrows
 * for directed edges, of the specified dimensions.
 * 
 * @author Joshua O'Madadhain
 */

From source file logicProteinHypernetwork.analysis.complexes.ComplexToMinimalNetworkStates.java

/**
 * Transforms complexes to sets of minimal network states.
 * 
 * @author Johannes Kster <johannes.koester@tu-dortmund.de>
 */
public class ComplexToMinimalNetworkStates implements Transformer<Complex, Collection<MinimalNetworkState>> {

From source file edu.uci.ics.jung.algorithms.cluster.WeakComponentClusterer.java

/**
 * Finds all weak components in a graph as sets of vertex sets.  A weak component is defined as
 * a maximal subgraph in which all pairs of vertices in the subgraph are reachable from one
 * another in the underlying undirected subgraph.
 * <p>This implementation identifies components as sets of vertex sets.  
 * To create the induced graphs from any or all of these vertex sets,

From source file logicProteinHypernetwork.formulas.NetworkEntityToMinimalNetworkStateFormula.java

/**
 * Generates a minimal network state formula for a network entity.
 *
 * @author Johannes Kster <johannes.koester@tu-dortmund.de>
 */
public class NetworkEntityToMinimalNetworkStateFormula

From source file gov.nih.nci.cabig.caaers.web.fields.RepeatingFieldGroupTransformer.java

/**
 * @author Rhett Sutphin
 */
public class RepeatingFieldGroupTransformer implements Transformer<String, InputFieldGroup> {
    private static final Log log = LogFactory.getLog(RepeatingFieldGroupTransformer.class);