Examples of org.mcarthur.sandy.gwt.event.list.client.SortedEventList

Package org.mcarthur.sandy.gwt.event.list.client

Examples of org.mcarthur.sandy.gwt.event.list.client.SortedEventList

org.mcarthur.sandy.gwt.event.list.client.SortedEventList
An EventList that maintains a sorted order of objects add to the list. This implementation of List does not maintain all of the List contracts. Mainly, for any method that adds or sets to a specific index the index is ignored to maintain the elements in sorted order.
It is assumed that the {@link Comparator} used to sort implementations will not change it'sbehavior. If you need to change the sort order of a list, use a new Comparator instance.

Note: because a SortedEventList does not respect the index parameter with methods like {@link #add(int,Object)}, {@link #addAll(int,java.util.Collection)}, or {@link #set(int,Object)}some uses of the List may cause an unexpected behavior. A perfect example is {@link java.util.Collections#shuffle(java.util.List)}. Not only does it not make sense to shuffle a sorted list but they way the shuffle method is implemented causes the elements in the sorted list to be either duplicated or removed.
@author Sandy McArthur

        assertEquals(5, fel.toArray().length);
    }


    public void testFoo() {
        final EventList el = EventLists.eventList();
        final SortedEventList sel = EventLists.sortedEventList(el);
        final FilteredEventList fel = EventLists.filteredEventList(sel);


        el.add(new Integer(25));
        el.add(new Integer(33));
        el.add(new Integer(55));
        el.add(new Integer(49));
        el.add(new Integer(32));
        el.add(new Integer(57));


        final Comparator natural = new Comparator() {
            public int compare(final Object o1, final Object o2) {
                return ((Comparable)o1).compareTo(o2);
            }
        };
        final Comparator reverse = new Comparator() {
            public int compare(final Object o1, final Object o2) {
                return natural.compare(o2, o1);
            }
        };


        sel.setComparator(natural);


        final FilteredEventList.Filter filter = new FilteredEventList.Filter() {
            public boolean accept(final Object element) {
                final int i = ((Number)element).intValue();
                return  20 < i && i < 50;
            }
        };


        fel.setFilter(filter);


        final List n1 = new ArrayList(fel);


        sel.setComparator(reverse);


        final List r1 = new ArrayList(fel);


        assertEquals(n1.size(), r1.size());
        assertTrue(n1.containsAll(r1));

View Full Code Here

    public void testClearOfDeeperList() {
        EventList e = null;
        final EventList el = EventLists.eventList(); e = el;
        final List elReplay = new EventListReplayList(el);


        final SortedEventList sel;
        if (true) {
            sel = EventLists.sortedEventList(e);
            // keep a reverse sort
            sel.setComparator(new Comparator() {
                public int compare(final Object o1, final Object o2) {
                    final Comparable c1 = (Comparable)o1;
                    final Comparable c2 = (Comparable)o2;
                    return c2.compareTo(c1);
                }

View Full Code Here


        final EventList el = EventLists.eventList();
        el.add(I0);
        el.add(I20);


        final SortedEventList sel = createBackedSortedEventList(el);


        assertEquals(sel.get(0), I0);
        assertEquals(sel.get(1), I20);


        el.add(I10);
        assertEquals(sel.get(1), I10);
        assertEquals(sel.get(2), I20);


        sel.add(I15);
        assertEquals(sel.get(1), I10);
        assertEquals(sel.get(3), I20);


        sel.add(0, I5);
        assertEquals(sel.get(0), I0);
        assertEquals(sel.get(1), I5);
        assertEquals(sel.get(2), I10);
    }

View Full Code Here

        l.add(I0);
        l.add(I20);
        l.add(I10);
        l.add(I5);


        final SortedEventList sel = EventLists.sortedEventList();
        sel.addAll(l);


        assertEquals(sel.get(0), I0);
        assertEquals(sel.get(1), I5);
        assertEquals(sel.get(2), I10);
        assertEquals(sel.get(3), I20);


        sel.clear();
        l.remove(I20);
        sel.add(I20);
        sel.addAll(1, l);


        assertEquals(sel.get(0), I0);
        assertEquals(sel.get(1), I5);
        assertEquals(sel.get(2), I10);
        assertEquals(sel.get(3), I20);
    }

View Full Code Here

        el.add(I5);
        el.add(I20);
        el.add(I0);


        // Natural sorting by default
        final SortedEventList sel = createBackedSortedEventList(el);


        assertEquals(I0, sel.get(0));
        assertEquals(I5, sel.get(1));
        assertEquals(I10, sel.get(2));
        assertEquals(I20, sel.get(3));
    }

View Full Code Here

        assertEquals(I10, sel.get(2));
        assertEquals(I20, sel.get(3));
    }


    public void testIndexOf() {
        final SortedEventList sel = EventLists.sortedEventList();


        sel.add(I20);
        sel.add(I5);
        sel.add(I10);


        assertEquals(0, sel.indexOf(I5));
        assertEquals(1, sel.indexOf(I10));
        assertEquals(2, sel.indexOf(I20));
        assertEquals(-1, sel.indexOf(I0));
    }

View Full Code Here

        el.add(I10);
        el.add(I5);
        el.add(I20);
        el.add(I0);


        final SortedEventList sel = createBackedSortedEventList(el);


        sel.remove(2);
        assertFalse(el.contains(I10));


        el.remove(I20);
        assertFalse(el.contains(I20));
    }

View Full Code Here

        el.add(I10);
        el.add(I5);
        el.add(I20);
        el.add(I0);


        final SortedEventList sel = createBackedSortedEventList(el);


        ListEventListener lel = new ListEventListener() {
            private int count = 0;
            public void listChanged(final ListEvent listEvent) {
                switch (count++) {
                    case 0:
                        assertEquals(ListEvent.createChanged(el, 0), listEvent);
                        break;
                    case 1:
                        assertNull(listEvent);
                        break;
                    default:
                        fail("Unexpected: " + listEvent);
                }
            }
        };
        ListEventListener slel = new ListEventListener() {
            private int count = 0;
            public void listChanged(final ListEvent listEvent) {
                switch (count++) {
                    case 0:
                        assertEquals(ListEvent.createRemoved(sel, 2), listEvent);
                        break;
                    case 1:
                        assertEquals(ListEvent.createAdded(sel, 3), listEvent);
                        break;
                    case 2:
                        assertNull(listEvent);
                        break;
                    default:
                        fail("Unexpected: " + listEvent);
                }
            }
        };
        el.addListEventListener(lel);
        sel.addListEventListener(slel);
        sel.set(2, I25);
        lel.listChanged(null);
        slel.listChanged(null);
        el.removeListEventListener(lel);
        sel.removeListEventListener(slel);
        assertEquals(I25, el.get(0));
        assertEquals(I25, sel.get(3));
    }

View Full Code Here


        final EventList deepest = EventLists.eventList();
        deepest.add("hello");
        deepest.add("world");


        final SortedEventList sel = createBackedSortedEventList(deepest);


        sel.addListEventListener(new ListEventListener() {


            public void listChanged(final ListEvent listEvent) {
                //System.out.println("list changed: " + listEvent + " size = " + sel.size());
                // assertEquals(0, sel.size());
                for (Iterator iter = sel.iterator(); iter.hasNext();) {
                    final Object element = iter.next();
                }


            }

View Full Code Here

            public boolean accept(final Object element) {
                return ((Number)element).intValue() % 2 == 0;
            }
        });


        final SortedEventList sel = createBackedSortedEventList(fel);


        sel.sort();


        assertEquals(10, el.size());
        assertEquals(5, fel.size());
        assertEquals(5, sel.size());
        assertTrue(el.containsAll(fel));
        assertTrue(el.containsAll(sel));
        assertTrue(fel.containsAll(sel));
        assertTrue(sel.containsAll(fel));


        final List sorted = new ArrayList(sel);
        Collections.sort(sorted);
        assertEquals(sorted, sel);

View Full Code Here

0 1

TOP

Related Classes of org.mcarthur.sandy.gwt.event.list.client.SortedEventList

org.mcarthur.sandy.gwt.event.list.test.FilteredEventListTest

org.mcarthur.sandy.gwt.event.list.test.RangedEventListTest

org.mcarthur.sandy.gwt.event.list.test.SortedEventListTest

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.