1 files changed, 110 insertions, 110 deletions
diff --git a/plugins/org.eclipse.net4j.util/src/org/eclipse/net4j/util/ObjectUtil.java b/plugins/org.eclipse.net4j.util/src/org/eclipse/net4j/util/ObjectUtil.java
index 43a51b8dae..b2572ea3ce 100644
--- a/plugins/org.eclipse.net4j.util/src/org/eclipse/net4j/util/ObjectUtil.java
+++ b/plugins/org.eclipse.net4j.util/src/org/eclipse/net4j/util/ObjectUtil.java
@@ -1,110 +1,110 @@
-/*
- * Copyright (c) 2004 - 2012 Eike Stepper (Berlin, Germany) 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:
- *    Eike Stepper - initial API and implementation
- */
-package org.eclipse.net4j.util;
-
-import java.lang.reflect.Array;
-import java.util.Collection;
-import java.util.Map;
-
-/**
- * Various static helper methods.
- * 
- * @author Eike Stepper
- */
-public final class ObjectUtil
-{
-  private ObjectUtil()
-  {
-  }
-
-  public static boolean equals(Object o1, Object o2)
-  {
-    if (o1 == null)
-    {
-      return o2 == null;
-    }
-
-    return o1.equals(o2);
-  }
-
-  public static int hashCode(Object o)
-  {
-    if (o == null)
-    {
-      return 0;
-    }
-
-    return o.hashCode();
-  }
-
-  /**
-   * A collision-free hash code for small sets (<=4) of small, positive integers (<=128)
-   * 
-   * @since 3.2
-   */
-  public static int hashCode(int... values)
-  {
-    int hash = 0;
-    for (int i = 0; i < values.length; i++)
-    {
-      hash += values[i];
-      hash = (hash << 7) - hash;
-    }
-
-    return hash;
-  }
-
-  public static int hashCode(long num)
-  {
-    return (int)(num >> 32) ^ (int)(num & 0xffffffff);
-  }
-
-  @SuppressWarnings("unchecked")
-  public static <T> T[] appendtoArray(T[] array, T... elements)
-  {
-    T[] result = (T[])Array.newInstance(array.getClass().getComponentType(), array.length + elements.length);
-    System.arraycopy(array, 0, result, 0, array.length);
-    System.arraycopy(elements, 0, result, array.length, elements.length);
-    return result;
-  }
-
-  /**
-   * @since 3.1
-   */
-  public static <T> boolean isEmpty(T[] array)
-  {
-    return array == null || array.length == 0;
-  }
-
-  /**
-   * @since 3.1
-   */
-  public static <T extends Map<?, ?>> boolean isEmpty(Map<?, ?> map)
-  {
-    return map == null || map.isEmpty();
-  }
-
-  /**
-   * @since 3.1
-   */
-  public static <T extends Collection<?>> boolean isEmpty(Collection<?> collection)
-  {
-    return collection == null || collection.isEmpty();
-  }
-
-  /**
-   * @since 3.1
-   */
-  public static boolean isEmpty(String string)
-  {
-    return string == null || string.length() == 0;
-  }
-}
+/*
+ * Copyright (c) 2004 - 2012 Eike Stepper (Berlin, Germany) 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:
+ *    Eike Stepper - initial API and implementation
+ */
+package org.eclipse.net4j.util;
+
+import java.lang.reflect.Array;
+import java.util.Collection;
+import java.util.Map;
+
+/**
+ * Various static helper methods.
+ * 
+ * @author Eike Stepper
+ */
+public final class ObjectUtil
+{
+  private ObjectUtil()
+  {
+  }
+
+  public static boolean equals(Object o1, Object o2)
+  {
+    if (o1 == null)
+    {
+      return o2 == null;
+    }
+
+    return o1.equals(o2);
+  }
+
+  public static int hashCode(Object o)
+  {
+    if (o == null)
+    {
+      return 0;
+    }
+
+    return o.hashCode();
+  }
+
+  /**
+   * A collision-free hash code for small sets (<=4) of small, positive integers (<=128)
+   * 
+   * @since 3.2
+   */
+  public static int hashCode(int... values)
+  {
+    int hash = 0;
+    for (int i = 0; i < values.length; i++)
+    {
+      hash += values[i];
+      hash = (hash << 7) - hash;
+    }
+
+    return hash;
+  }
+
+  public static int hashCode(long num)
+  {
+    return (int)(num >> 32) ^ (int)(num & 0xffffffff);
+  }
+
+  @SuppressWarnings("unchecked")
+  public static <T> T[] appendtoArray(T[] array, T... elements)
+  {
+    T[] result = (T[])Array.newInstance(array.getClass().getComponentType(), array.length + elements.length);
+    System.arraycopy(array, 0, result, 0, array.length);
+    System.arraycopy(elements, 0, result, array.length, elements.length);
+    return result;
+  }
+
+  /**
+   * @since 3.1
+   */
+  public static <T> boolean isEmpty(T[] array)
+  {
+    return array == null || array.length == 0;
+  }
+
+  /**
+   * @since 3.1
+   */
+  public static <T extends Map<?, ?>> boolean isEmpty(Map<?, ?> map)
+  {
+    return map == null || map.isEmpty();
+  }
+
+  /**
+   * @since 3.1
+   */
+  public static <T extends Collection<?>> boolean isEmpty(Collection<?> collection)
+  {
+    return collection == null || collection.isEmpty();
+  }
+
+  /**
+   * @since 3.1
+   */
+  public static boolean isEmpty(String string)
+  {
+    return string == null || string.length() == 0;
+  }
+}