import java.util.Arrays;

import java.util.LinkedHashMap;

    public void testOrderWebFragmentsRelative4() {

        // Linear order, expected result is input order reversed

        b.addAfterOrdering("a");

        c.addAfterOrdering("b");

        for (String toRemove: Arrays.asList("d", "e", "f")) {

            fragments.remove(toRemove);

        }

        // create a reverse list of fragments

        Map<String, WebXml> fragmentsInReverse = new LinkedHashMap<String, WebXml>();

        fragmentsInReverse.put("c", c);

        fragmentsInReverse.put("b", b);

        fragmentsInReverse.put("a", a);

        Set<WebXml> ordered = WebXml.orderWebFragments(app, fragmentsInReverse);

        Iterator<WebXml> iter = ordered.iterator();

        // A number of orders are possible but the algorithm is deterministic

        // and this order is valid. If this fails after a change to the

        // algorithm, then check to see if the new order is also valid.

        assertEquals(a,iter.next());

        assertEquals(b,iter.next());

        assertEquals(c,iter.next());

    }

  @Test