-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSimilarBean.java
102 lines (58 loc) · 1.71 KB
/
SimilarBean.java
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
package com.esu.edu.recommendation.cf;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
public class SimilarBean {
private int uId;
private double sim;
public SimilarBean(int uId,double sim){
this.uId=uId;
this.sim=sim;
}
public int getuId() {
return uId;
}
@Override
public String toString() {
return "SimilarBean [uId=" + uId + ", sim=" + sim + "]";
}
public void setuId(int uId) {
this.uId = uId;
}
public double getSim() {
return sim;
}
public void setSim(double sim) {
this.sim = sim;
}
public static void main(String[] args){
List<SimilarBean> neighbor= new ArrayList<SimilarBean>();
SimilarBean s1= new SimilarBean(1,0.998);
SimilarBean s2= new SimilarBean(10,1.998);
SimilarBean s3= new SimilarBean(8,0.01);
SimilarBean s4= new SimilarBean(3,0.222);
SimilarBean s5= new SimilarBean(16,2.998);
neighbor.add(s1);
neighbor.add(s2);
neighbor.add(s3);
neighbor.add(s4);
neighbor.add(s5);
for(int i=0;i<neighbor.size();i++)
System.out.println(neighbor.get(i));
Collections.sort(neighbor,new Comparator<SimilarBean>(){
public int compare(SimilarBean arg0, SimilarBean arg1) {
return arg0.getSim() > arg1.getSim() ? 1 : -1;
}
});
System.out.println("-----------------------------------------------");
for(int i=0;i<neighbor.size();i++)
System.out.println(neighbor.get(i));
System.out.println("-----------------------------------------------");
SimilarBean s6= new SimilarBean(100,0.19);
neighbor.remove(0);
neighbor.add(s6);
for(int i=0;i<neighbor.size();i++)
System.out.println(neighbor.get(i));
}
}