blob: 5cb6c794e823e081431cc44671a971bff104dbff (
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
|
package de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.split;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2012
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 de.lmu.ifi.dbs.elki.database.ids.DBID;
import de.lmu.ifi.dbs.elki.distance.distancevalue.Distance;
import de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.MTreeEntry;
import java.util.ArrayList;
import java.util.List;
import java.util.Set;
/**
* Encapsulates the attributes of an assignment during a split.
*
* @author Elke Achtert
* @param <D> the type of Distance used in the M-Tree
* @param <E> the type of MetricalEntry used in the M-Tree
*/
public class Assignments<D extends Distance<D>, E extends MTreeEntry<D>> {
/**
* The id of the first routing object.
*/
private DBID id1;
/**
* The id of the second routing object.
*/
private DBID id2;
/**
* The first covering radius.
*/
private D firstCoveringRadius;
/**
* The second covering radius.
*/
private D secondCoveringRadius;
/**
* The assignments to the first routing object.
*/
private List<E> firstAssignments;
/**
* The assignments to the second routing object.
*/
private List<E> secondAssignments;
/**
* Provides an assignment during a split of an MTree node.
*
* @param id1 the first routing object
* @param id2 the second routing object
* @param firstCoveringRadius the first covering radius
* @param secondCoveringRadius the second covering radius
* @param firstAssignments the assignments to the first routing object
* @param secondAssignments the assignments to the second routing object
*/
public Assignments(DBID id1, DBID id2, D firstCoveringRadius, D secondCoveringRadius, Set<E> firstAssignments, Set<E> secondAssignments) {
this.id1 = id1;
this.id2 = id2;
this.firstCoveringRadius = firstCoveringRadius;
this.secondCoveringRadius = secondCoveringRadius;
this.firstAssignments = new ArrayList<E>(firstAssignments);
this.secondAssignments = new ArrayList<E>(secondAssignments);
}
/**
* Returns the id of the first routing object.
*
* @return the id of the first routing object
*/
public DBID getFirstRoutingObject() {
return id1;
}
/**
* Returns the id of the second routing object.
*
* @return the id of the second routing object
*/
public DBID getSecondRoutingObject() {
return id2;
}
/**
* Returns the first covering radius.
*
* @return the first covering radius
*/
public D getFirstCoveringRadius() {
return firstCoveringRadius;
}
/**
* Returns the second covering radius.
*
* @return the second covering radius
*/
public D getSecondCoveringRadius() {
return secondCoveringRadius;
}
/**
* Returns the assignments to the first routing object.
*
* @return the assignments to the first routing object
*/
public List<E> getFirstAssignments() {
return firstAssignments;
}
/**
* Returns the assignments to the second routing object.
*
* @return the assignments to the second routing object
*/
public List<E> getSecondAssignments() {
return secondAssignments;
}
}
|
