Example usage for org.apache.commons.collections15 Transformer transform

Introduction

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

Prototype

public O transform(I input);

Source Link

Document

Transforms the input object (leaving it unchanged) into some output object.

Usage

From source file:vnreal.algorithms.utils.MiscelFunctions.java

public static <T extends Comparable<T>, C extends AbstractConstraint, N extends Node<C>, L extends Link<C>> T findMinValueOfNode(
        Network<C, N, L> network, Transformer<N, T> transformer, T maxValue) {
    T minValue = maxValue;/*w w  w . ja  v a  2 s .c  om*/
    for (N node : network.getVertices()) {
        T current = transformer.transform(node);
        // minValue > current
        if (minValue.compareTo(current) > 0) {
            minValue = current;
        }
    }

    return minValue;
}

From source file:vnreal.algorithms.utils.MiscelFunctions.java

public static <T extends Comparable<T>, C extends AbstractConstraint, N extends Node<C>, L extends Link<C>> T findMinValueOfLink(
        Network<C, N, L> network, Transformer<L, T> transformer, T maxValue) {
    T minValue = maxValue;//from   w  w w .j  av a 2 s .com
    for (L node : network.getEdges()) {
        T current = transformer.transform(node);
        // minValue > current
        if (minValue.compareTo(current) > 0) {
            minValue = current;
        }
    }

    return minValue;
}

From source file:vnreal.algorithms.utils.MiscelFunctions.java

public static <T extends Comparable<T>, C extends AbstractConstraint, N extends Node<C>, L extends Link<C>> MinMax<T> findMinMaxValueOfLink(
        Network<C, N, L> network, Transformer<L, T> transformer, T minValue, T maxValue) {
    // ????/* w  ww.java 2  s.  c  om*/
    MinMax<T> minMax = new MinMax<T>(maxValue, minValue);
    for (L node : network.getEdges()) {
        T current = transformer.transform(node);
        // minValue > current
        if (minMax.min.compareTo(current) > 0) {
            minMax.min = current;
        }
        if (minMax.max.compareTo(current) < 0) {
            minMax.max = current;
        }
    }

    return minMax;
}

From source file:vnreal.algorithms.utils.MiscelFunctions.java

public static <T extends Comparable<T>, C extends AbstractConstraint, N extends Node<C>, L extends Link<C>> MinMax<T> findMinMaxValueOfNode(
        Network<C, N, L> network, Transformer<N, T> transformer, T minValue, T maxValue) {
    // ????//from   w  ww  . j  a v a  2  s.  com
    MinMax<T> minMax = new MinMax<T>(maxValue, minValue);
    for (N node : network.getVertices()) {
        T current = transformer.transform(node);
        // minValue > current
        if (minMax.min.compareTo(current) > 0) {
            minMax.min = current;
        }
        if (minMax.max.compareTo(current) < 0) {
            minMax.max = current;
        }
    }

    return minMax;
}