tmf: Remove unused TmfSortedArray.

This data-structure seems unused.
It's implemented with an insertion sort, and won't scale.

Change-Id: I49ae518a384817c4fd537c989240454e00f6f38b
Signed-off-by: Etienne Bergeron <etienne.bergeron@gmail.com>
Reviewed-on: https://git.eclipse.org/r/18875
Reviewed-by: Matthew Khouzam <matthew.khouzam@ericsson.com>
Tested-by: Hudson CI
Reviewed-by: Bernd Hufmann <bernd.hufmann@ericsson.com>
Reviewed-by: Alexandre Montplaisir <alexmonthy@voxpopuli.im>
IP-Clean: Alexandre Montplaisir <alexmonthy@voxpopuli.im>

diff --git a/org.eclipse.linuxtools.tmf.core/src/org/eclipse/linuxtools/tmf/core/util/TmfSortedArrayList.java b/org.eclipse.linuxtools.tmf.core/src/org/eclipse/linuxtools/tmf/core/util/TmfSortedArrayList.java
deleted file mode 100644 (file)
index a93d4a2..0000000
--- a/org.eclipse.linuxtools.tmf.core/src/org/eclipse/linuxtools/tmf/core/util/TmfSortedArrayList.java
+++ /dev/null
@@ -1,45 +0,0 @@
-/*******************************************************************************
- * Copyright (c) 2011, 2012 Ericsson
- *
- * 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:
- *   Francois Chouinard - Initial API and implementation
- *******************************************************************************/
-
-package org.eclipse.linuxtools.tmf.core.util;
-
-import java.util.ArrayList;
-
-/**
- * Implementation of a sorted array list.
- *
- * @param <T> The array element type
- *
- * @version 1.0
- * @author Francois Chouinard
- */
-
-public class TmfSortedArrayList<T> extends ArrayList<T> {
-    private static final long serialVersionUID = 1L;
-
-    /**
-     * Inserts a new value in the list according to its sorted position.
-     *
-     * @param value A value to insert
-     */
-    @SuppressWarnings("unchecked")
-    public void insertSorted(T value) {
-        add(value);
-        Comparable<T> cmp = (Comparable<T>) value;
-        for (int pos = size() - 1; pos > 0 && cmp.compareTo(get(pos - 1)) < 0; pos--) {
-            T tmp = get(pos);
-            set(pos, get(pos - 1));
-            set(pos - 1, tmp);
-        }
-    }
-
-}