/
TriGram.java
72 lines (59 loc) · 1.56 KB
/
TriGram.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
// Copyright 2008, 2009 Daniel de Kok
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package eu.danieldk.nlp.jitar.data;
/**
* This class represents a word tri-gram.
*/
public class TriGram {
private final int d_t1;
private final int d_t2;
private final int d_t3;
public TriGram(int t1, int t2, int t3) {
d_t1 = t1;
d_t2 = t2;
d_t3 = t3;
}
@Override
public boolean equals(Object otherObject) {
if (this == otherObject)
return true;
if (otherObject == null)
return false;
if (getClass() != otherObject.getClass())
return false;
TriGram other = (TriGram) otherObject;
return d_t1 == other.d_t1 && d_t2 == other.d_t2 &&
d_t3 == other.d_t3;
}
@Override
public int hashCode() {
int seed = d_t1;
seed ^= d_t2 + 0x9e3779b9 + (seed << 6) + (seed >> 2);
seed ^= d_t3 + 0x9e3779b9 + (seed << 6) + (seed >> 2);
return seed;
}
public int t1() {
return d_t1;
}
public int t2() {
return d_t2;
}
public int t3() {
return d_t3;
}
@Override
public String toString() {
return d_t1 + " " + d_t2 + " " + d_t3;
}
}