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
|
/*
* Copyright (c) 2002, 2018, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code 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 General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package gc.gctests.WeakReferenceGC;
class node {
byte [] arr;
node next;
node prev;
node(){ arr = new byte[100]; }
}
public class CircularLinkedList implements Cloneable {
private node Root;
public void addElement() {
node newnode;
newnode = new node();
if (Root == null){
Root = newnode;
Root.next = Root;
Root.prev = Root;
} else{
newnode.next = Root.next;
Root.next.prev = newnode;
Root.next = newnode;
newnode.prev = Root;
}
}
public void addNelements(int n) {
for (int i = 0; i < n ; i++)
addElement();
}
public int elementCount() {
node p;
int count;
p = Root;
count = 0;
do {
p = p.prev;
count++;
}while(p != Root);
return count;
}
public Object clone() {
node p;
p = Root;
if ( p == null ) return null;
CircularLinkedList clone = new CircularLinkedList();
do {
clone.addElement();
p = p.prev;
} while(p != Root);
return clone;
}
}
|
