-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBucket.java
77 lines (66 loc) · 1.22 KB
/
Bucket.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
import java.util.Iterator;
import java.util.LinkedList;
import java.util.concurrent.locks.*;
//Bucket manages a linked list of words
//Uses a Reentrant read-write lock in order to control concurrency
public class Bucket
{
private LinkedList<String> list;
private ReentrantReadWriteLock rwLock;
Bucket(boolean rw)
{
//create lock for each bucket
rwLock = new ReentrantReadWriteLock();
//create a linkedlist of strings
list = new LinkedList<String>();
}
void putString(String target)
{
//puts string in bucket
list.add(target);
}
String getString(String target)
{
String out = "false";
//returns String if present
if(list.contains(target))
{
out = target;
return out;
}
return out;
}
boolean remove(String target)
{
return list.remove(target);
}
void display()
{
for(Iterator<String> i = list.iterator(); i.hasNext();)
{
String item = i.next();
System.out.print(item + " ");
}
System.out.println();
}
void getLock()
{
//gets lock
rwLock.writeLock().lock();
}
void getReadLock()
{
//gets lock
rwLock.readLock().lock();
}
void unlock()
{
//unlocks lock
rwLock.writeLock().unlock();
}
void unlockRead()
{
//unlocks lock
rwLock.readLock().unlock();
}
}