/*
 * This file is part of ELKI:
 * Environment for Developing KDD-Applications Supported by Index-Structures
 *
 * Copyright (C) 2019
 * ELKI Development Team
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 */
package elki.database.ids;

import org.junit.Test;

import elki.database.ids.DBID;
import elki.database.ids.DBIDUtil;
import elki.database.ids.ModifiableDoubleDBIDList;

/**
 * Test a corner case when sorting: duplicate keys.
 * 
 * @author Erich Schubert
 * @since 0.7.0
 */
public class ModifiableDoubleDBIDListTest {
  @Test(timeout = 100)
  public void testDuplicateKeys() {
    // We need an ide, but no real data.
    DBID id = DBIDUtil.importInteger(1);
    int size = 100000;

    ModifiableDoubleDBIDList list = DBIDUtil.newDistanceDBIDList(size);
    for(int i = 0; i < size; i++) {
      double distance = 0. + (i % 2);
      list.add(distance, id);
    }
    list.sort();
  }
}

@@ -853,16 +853,60 @@
 e.ids;%0A%0A
+import static org.junit.Assert.assertTrue;%0A%0A
 import o
@@ -1189,16 +1189,194 @@
 tTest %7B%0A
+  // Needs to be outside of the timeout below%0A  // Because this may involve scanning for DBIDFactory implementations%0A  private static final DBID id = DBIDUtil.importInteger(1);%0A%0A
   @Test(
@@ -1446,17 +1446,16 @@
 ed an id
-e
 , but no
@@ -1470,49 +1470,8 @@
 ta.%0A
-    DBID id = DBIDUtil.importInteger(1);%0A
     
@@ -1608,92 +1608,265 @@
     
-double distance = 0. + (i %25 2);%0A      list.add(distance, id);%0A    %7D%0A    list.sort();
+list.add(i & 0x1, id);%0A    %7D%0A    list.sort();%0A    double last = Double.NEGATIVE_INFINITY;%0A    for(DoubleDBIDListIter it = list.iter(); it.valid(); it.advance()) %7B%0A      assertTrue(%22Not sorted%22, last %3C= it.doubleValue());%0A      last = it.doubleValue();%0A    %7D
 %0A  %7D

Improve test.