blob: 62ddbaf8ad3ae6185e10e34741298e6d85012a15 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
package de.lmu.ifi.dbs.elki.database;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2015
Ludwig-Maximilians-Universität München
Lehr- und Forschungseinheit für Datenbanksysteme
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/>.
*/
import org.junit.Test;
import de.lmu.ifi.dbs.elki.JUnit4Test;
import de.lmu.ifi.dbs.elki.database.ids.DBID;
import de.lmu.ifi.dbs.elki.database.ids.DBIDUtil;
import de.lmu.ifi.dbs.elki.database.ids.ModifiableDoubleDBIDList;
/**
* Test a corner case when sorting: duplicate keys.
*
* @author Erich Schubert
* @since 0.4.0
*/
public class SortingDuplicatesTest implements JUnit4Test {
@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();
}
}
|