1 /*
2  * Copyright (c) 2005, 2018, Oracle and/or its affiliates. All rights reserved.
3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4  *
5  * This code is free software; you can redistribute it and/or modify it
6  * under the terms of the GNU General Public License version 2 only, as
7  * published by the Free Software Foundation.
8  *
9  * This code is distributed in the hope that it will be useful, but WITHOUT
10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
12  * version 2 for more details (a copy is included in the LICENSE file that
13  * accompanied this code).
14  *
15  * You should have received a copy of the GNU General Public License version
16  * 2 along with this work; if not, write to the Free Software Foundation,
17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18  *
19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20  * or visit www.oracle.com if you need additional information or have any
21  * questions.
22  */
23 
24 package nsk.share.gc;
25 
26 public final class IndexPair {
27         private int i, j;
28 
IndexPair(int i, int j)29         public IndexPair(int i, int j) {
30                 setI(i);
31                 setJ(j);
32         }
33 
getI()34         public int getI() {
35                 return i;
36         }
37 
setI(int i)38         public void setI(int i) {
39                 this.i = i;
40         }
41 
getJ()42         public int getJ() {
43                 return j;
44         }
45 
setJ(int j)46         public void setJ(int j) {
47                 this.j = j;
48         }
49 
equals(IndexPair pair)50         public boolean equals(IndexPair pair) {
51                 return (this.i == pair.i && this.j == pair.j);
52         }
53 
equals(Object o)54         public boolean equals(Object o) {
55                 return o instanceof IndexPair && equals((IndexPair) o);
56         }
57 
hashCode()58         public int hashCode() {
59                 return i << 16 + j;
60         }
61 }
62