Package org.eclipse.ui.internal.texteditor.rulers

Examples of org.eclipse.ui.internal.texteditor.rulers.DAG$MultiMap


     * map.
     *
     * @return the map to be tested
     */
    public MultiMap makeFullMap() {
        MultiMap m = makeEmptyMap();
        addSampleMappings(m);
        return m;
    }
View Full Code Here


    /**
     * Test to ensure that makeEmptyMap and makeFull returns a new non-null
     * map with each invocation.
     */
    public void testMakeMap() {
        MultiMap em = makeEmptyMap();
        assertTrue("failure in test: makeEmptyMap must return a non-null map.", em != null);

        MultiMap em2 = makeEmptyMap();
        assertTrue("failure in test: makeEmptyMap must return a non-null map.", em != null);

        assertTrue("failure in test: makeEmptyMap must return a new map " + "with each invocation.", em != em2);

        MultiMap fm = makeFullMap();
        assertTrue("failure in test: makeFullMap must return a non-null map.", fm != null);

        MultiMap fm2 = makeFullMap();
        assertTrue("failure in test: makeFullMap must return a non-null map.", fm != null);

        assertTrue("failure in test: makeFullMap must return a new map " + "with each invocation.", fm != fm2);
    }
View Full Code Here

     * Tests Map.putAll(map)
     */
    public void testMapPutAll() {
        if (!isPutAddSupported()) {
            if (!isPutChangeSupported()) {
                MultiMap temp = makeFullMap();
                resetEmpty();
                try {
                    map.putAll(temp);
                    fail("Expected UnsupportedOperationException on putAll");
                } catch (UnsupportedOperationException ex) {
                }
            }
            return;
        }

        resetEmpty();

        MultiMap m2 = makeFullMap();

        map.putAll(m2);
        confirmed.putAll(m2);
        verify();

        resetEmpty();

        m2 = makeConfirmedMap();
        Object[] keys = getSampleKeys();
        Object[] values = getSampleValues();
        for (int i = 0; i < keys.length; i++) {
            m2.put(keys[i], values[i]);
        }

        map.putAll(m2);
        confirmed.putAll(m2);
        verify();
View Full Code Here

     * @return an array of Map.Entry of those keys to those values
     */
    private Map.Entry[] makeEntryArray(Object[] keys, Object[] values) {
        Map.Entry[] result = new Map.Entry[keys.length];
        for (int i = 0; i < keys.length; i++) {
            MultiMap map = makeConfirmedMap();
            map.put(keys[i], values[i]);
            result[i] = (Map.Entry) map.entrySet().iterator().next();
        }
        return result;
    }
View Full Code Here

    for (int i= 0; i < array.length; i++) {
      RulerColumnDescriptor desc= (RulerColumnDescriptor) array[i];
      descriptorsById.put(desc.getId(), desc);
    }
   
    DAG dag= new DAG();
    for (int i= 0; i < array.length; i++) {
      RulerColumnDescriptor desc= (RulerColumnDescriptor) array[i];
      dag.addVertex(desc);
     
      Set before= desc.getPlacement().getConstraints();
      for (Iterator it= before.iterator(); it.hasNext();) {
        RulerColumnPlacementConstraint constraint= (RulerColumnPlacementConstraint) it.next();
        String id= constraint.getId();
        RulerColumnDescriptor target= (RulerColumnDescriptor) descriptorsById.get(id);
        if (target == null) {
          noteUnknownTarget(desc, id);
        } else {
          boolean success;
          if (constraint.isBefore())
            success= dag.addEdge(desc, target);
          else
            success= dag.addEdge(target, desc);
          if (!success)
            noteCycle(desc, target);
        }
      }
    }
   
    Comparator gravityComp= new Comparator() {
      public int compare(Object o1, Object o2) {
        float diff= ((RulerColumnDescriptor) o1).getPlacement().getGravity() - ((RulerColumnDescriptor) o2).getPlacement().getGravity();
        if (diff == 0)
          return 0;
        if (diff < 0)
          return -1;
        return 1;
      }
    };
   
    /* Topological sort - always select the source with the least gravity */
    Set toProcess= dag.getSources();
    int index= 0;
    while (!toProcess.isEmpty()) {
      Object next= Collections.min(toProcess, gravityComp);
      array[index]= next;
      index++;
      dag.removeVertex(next);
      toProcess= dag.getSources();
    }
    Assert.isTrue(index == array.length);
   
    ListIterator it= descriptors.listIterator();
    for (int i= 0; i < index; i++) {
View Full Code Here

    for (int i= 0; i < array.length; i++) {
      RulerColumnDescriptor desc= (RulerColumnDescriptor) array[i];
      descriptorsById.put(desc.getId(), desc);
    }

    DAG dag= new DAG();
    for (int i= 0; i < array.length; i++) {
      RulerColumnDescriptor desc= (RulerColumnDescriptor) array[i];
      dag.addVertex(desc);

      Set before= desc.getPlacement().getConstraints();
      for (Iterator it= before.iterator(); it.hasNext();) {
        RulerColumnPlacementConstraint constraint= (RulerColumnPlacementConstraint) it.next();
        String id= constraint.getId();
        RulerColumnDescriptor target= (RulerColumnDescriptor) descriptorsById.get(id);
        if (target == null) {
          noteUnknownTarget(desc, id);
        } else {
          boolean success;
          if (constraint.isBefore())
            success= dag.addEdge(desc, target);
          else
            success= dag.addEdge(target, desc);
          if (!success)
            noteCycle(desc, target);
        }
      }
    }

    Comparator gravityComp= new Comparator() {
      public int compare(Object o1, Object o2) {
        float diff= ((RulerColumnDescriptor) o1).getPlacement().getGravity() - ((RulerColumnDescriptor) o2).getPlacement().getGravity();
        if (diff == 0)
          return 0;
        if (diff < 0)
          return -1;
        return 1;
      }
    };

    /* Topological sort - always select the source with the least gravity */
    Set toProcess= dag.getSources();
    int index= 0;
    while (!toProcess.isEmpty()) {
      Object next= Collections.min(toProcess, gravityComp);
      array[index]= next;
      index++;
      dag.removeVertex(next);
      toProcess= dag.getSources();
    }
    Assert.isTrue(index == array.length);

    ListIterator it= descriptors.listIterator();
    for (int i= 0; i < index; i++) {
View Full Code Here

TOP

Related Classes of org.eclipse.ui.internal.texteditor.rulers.DAG$MultiMap

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.