Package org.apache.commons.collections15

Examples of org.apache.commons.collections15.Transformer

172
173
174
175
176
177
178
179
180
181
182
     *
     * @param i the Iterator to "filter"
     * @return "filtered" iterator
     */
    protected FilterIterator makeBlockAllFilter(Iterator i) {
        Predicate pred = new Predicate() {
            public boolean evaluate(Object x) {
                return false;
            }
        };
        return new FilterIterator(i, pred);
View Full Code Here
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
            assertTrue("NoSuchElementException must be thrown", e.getClass().equals((new NoSuchElementException()).getClass()));
        }
    }

    public void testReset() {
        ResettableListIterator it = (ResettableListIterator) makeObject();

        assertEquals(true, it.hasNext());
        assertEquals(false, it.hasPrevious());
        assertEquals(testValue, it.next());
        assertEquals(false, it.hasNext());
        assertEquals(true, it.hasPrevious());

        it.reset();

        assertEquals(true, it.hasNext());
        assertEquals(false, it.hasPrevious());
        assertEquals(testValue, it.next());
        assertEquals(false, it.hasNext());
        assertEquals(true, it.hasPrevious());

        it.reset();
        it.reset();

        assertEquals(true, it.hasNext());
    }
View Full Code Here
190
191
192
193
194
195
196
197
198
199
200
            }

            vv.setBackground(Color.WHITE);


            Transformer labelTransformer = new ChainedTransformer<String, String>(new Transformer[]{
                        new ToStringLabeller<Node>() {

                            public String transform(Node v) {
                                return v.getLabel();
                                //return ((primitives.graph.Node)(v.getVertex())).getLabel();
View Full Code Here
21
22
23
24
25
26
27
28
29
30
31
    DirectedSparseGraph result = new DirectedSparseGraph();

     if ( model instanceof ChainedTransformer)
     {
       Transformer[] transformers = ((ChainedTransformer) model).getTransformers();
       Transformer lastTransformer = null;
       int counter = 0;
       for ( Transformer transformer: transformers)
       {
         result.addVertex(transformer);
         if ( lastTransformer != null)
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
            edgesWeigth.put(edgeName, Util.stringToInteger(columns[4]));

            graphMulti.addEdge(edgeName, commiter1, commiter2, type);
        }

        Transformer trans = createWeigthTransformer(graphMulti, edgesWeigth);

        BetweennessCentrality<String, String> btwGen = new BetweennessCentrality<>(graphMulti, trans);
        ClosenessCentrality<String, String> clsGen = new ClosenessCentrality<>(graphMulti, trans);
        DegreeScorer<String> dgrGen = new DegreeScorer<>(graphMulti);
View Full Code Here
81
82
83
84
85
86
87
     * their natural ordering.
     */
    @SuppressWarnings("unchecked")
    public SortedSparseMultigraph()
    {
        this(new ComparableComparator(), new ComparableComparator());
    }
View Full Code Here
172
173
174
175
176
177
178
179
180
181
182
        } catch (BufferUnderflowException ex) {
        }
    }

    public void testBasicComparatorOps() {
        PriorityBuffer heap = new PriorityBuffer(new ReverseComparator(new ComparableComparator()));

        assertTrue("heap should be empty after create", heap.isEmpty());

        try {
            heap.get();
View Full Code Here
46
47
48
49
50
51
52
     * OrderedMap uses TreeMap as its known comparison.
     *
     * @return a map that is known to be valid
     */
    public Map makeConfirmedMap() {
        return new TreeMap(new NullComparator(ComparableComparator.getInstance()));
    }
View Full Code Here
55
56
57
58
59
60
61
62
     * The only confirmed collection we have that is ordered is the sorted one.
     * Thus, sort the keys.
     */
    public Object[] getSampleKeys() {
        List list = new ArrayList(Arrays.asList(super.getSampleKeys()));
        Collections.sort(list, new NullComparator(ComparableComparator.getInstance()));
        return list.toArray();
    }
View Full Code Here
172
173
174
175
176
177
178
179
180
181
182
        } catch (BufferUnderflowException ex) {
        }
    }

    public void testBasicComparatorOps() {
        PriorityBuffer heap = new PriorityBuffer(new ReverseComparator(new ComparableComparator()));

        assertTrue("heap should be empty after create", heap.isEmpty());

        try {
            heap.get();
View Full Code Here
TOP

Related Classes of org.apache.commons.collections15.Transformer

  • edu.uci.ics.jung.samples.PluggableRendererDemo
  • junit.framework.TestSuite
  • org.apache.commons.collections15.ArrayStack
  • org.apache.commons.collections15.Bag
  • org.apache.commons.collections15.bag.AbstractTestBag
  • org.apache.commons.collections15.bag.HashBag
  • org.apache.commons.collections15.bag.TestPredicatedBag
  • org.apache.commons.collections15.bag.TestPredicatedSortedBag
  • org.apache.commons.collections15.bag.TestTreeBag
  • org.apache.commons.collections15.bag.TestTypedBag
    • 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.