--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/org.eclipse.core.databinding/src/org/eclipse/core/internal/databinding/ClassLookupSupport.d	Tue Apr 14 11:35:29 2009 +0200
@@ -0,0 +1,92 @@
+/*******************************************************************************
+ * Copyright (c) 2006 IBM Corporation and others.
+ * All rights reserved. This program and the accompanying materials
+ * are made available under the terms of the Eclipse Public License v1.0
+ * which accompanies this distribution, and is available at
+ * http://www.eclipse.org/legal/epl-v10.html
+ *
+ * Contributors:
+ *     IBM Corporation - initial API and implementation
+ ******************************************************************************/
+
+module org.eclipse.core.internal.databinding.ClassLookupSupport;
+
+import java.lang.all;
+
+import java.util.ArrayList;
+import java.util.Collection;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.Iterator;
+import java.util.List;
+import java.util.Set;
+
+/**
+ * @since 1.0
+ *
+ */
+public class ClassLookupSupport {
+    
+    /*
+     * code copied from AdapterManager.java
+     */
+    private static HashMap classSearchOrderLookup;
+
+    /**
+     * For a given class or interface, return an array containing the given type and all its direct and indirect supertypes.
+     * @param type
+     * @return an array containing the given type and all its direct and indirect supertypes
+     */
+    public static ClassInfo[] getTypeHierarchyFlattened(ClassInfo type) {
+        List classes = null;
+        //cache reference to lookup to protect against concurrent flush
+        HashMap lookup = classSearchOrderLookup;
+        if (lookup !is null)
+            classes = cast(List) lookup.get(type);
+        // compute class order only if it hasn't been cached before
+        if (classes is null) {
+            classes = new ArrayList();
+            computeClassOrder(type, classes);
+            if (lookup is null)
+                classSearchOrderLookup = lookup = new HashMap();
+            lookup.put(type, classes);
+        }
+        return cast(ClassInfo[]) classes.toArray(new ClassInfo[classes.size()]);
+    }
+
+    /**
+     * Builds and returns a table of adapters for the given adaptable type.
+     * The table is keyed by adapter class name. The
+     * value is the <b>sole<b> factory that defines that adapter. Note that
+     * if multiple adapters technically define the same property, only the
+     * first found in the search order is considered.
+     * 
+     * Note that it is important to maintain a consistent class and interface
+     * lookup order. See the class comment for more details.
+     */
+    private static void computeClassOrder(ClassInfo adaptable, Collection classes) {
+        ClassInfo clazz = adaptable;
+        Set seen = new HashSet(4);
+        while (clazz !is null) {
+            classes.add(clazz);
+            computeInterfaceOrder(clazz.getInterfaces(), classes, seen);
+            clazz = clazz.isInterface() ? Object.classinfo : clazz.getSuperclass();
+        }
+    }
+
+    private static void computeInterfaceOrder(ClassInfo[] interfaces, Collection classes, Set seen) {
+        List newInterfaces = new ArrayList(interfaces.length);
+        for (int i = 0; i < interfaces.length; i++) {
+            ClassInfo interfac = interfaces[i];
+            if (seen.add(interfac)) {
+                //note we cannot recurse here without changing the resulting interface order
+                classes.add(interfac);
+                newInterfaces.add(interfac);
+            }
+        }
+        for (Iterator it = newInterfaces.iterator(); it.hasNext();)
+            computeInterfaceOrder((cast(ClassInfo) it.next()).getInterfaces(), classes, seen);
+    }
+
+
+}