File: SyncSortedSet.java

package info (click to toggle)
concurrent-dfsg 1.3.4-4
  • links: PTS, VCS
  • area: main
  • in suites: buster, jessie, jessie-kfreebsd, squeeze, stretch, wheezy
  • size: 976 kB
  • ctags: 2,018
  • sloc: java: 10,704; xml: 49; makefile: 12
file content (125 lines) | stat: -rw-r--r-- 3,265 bytes parent folder | download | duplicates (3)
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
/*
  File: SyncSortedSet.java

  Originally written by Doug Lea and released into the public domain.
  This may be used for any purposes whatsoever without acknowledgment.
  Thanks for the assistance and support of Sun Microsystems Labs,
  and everyone contributing, testing, and using this code.

  History:
  Date       Who                What
   1Aug1998  dl               Create public version
*/

package EDU.oswego.cs.dl.util.concurrent;
import java.util.*;

/**
 * SyncSortedSets wrap Sync-based control around java.util.SortedSets.
 * They support the following additional reader operations over
 * SyncCollection: comparator, subSet, headSet, tailSet, first, last.
 * <p>[<a href="http://gee.cs.oswego.edu/dl/classes/EDU/oswego/cs/dl/util/concurrent/intro.html"> Introduction to this package. </a>]
 * @see SyncCollection
**/


public class SyncSortedSet extends SyncSet implements SortedSet {

  /**
   * Create a new SyncSortedSet protecting the given collection,
   * and using the given sync to control both reader and writer methods.
   * Common, reasonable choices for the sync argument include
   * Mutex, ReentrantLock, and Semaphores initialized to 1.
   **/
  public SyncSortedSet(SortedSet set, Sync sync) {
    super (set, sync);
  }

  /**
   * Create a new SyncSortedSet protecting the given set,
   * and using the given ReadWriteLock to control reader and writer methods.
   **/
  public SyncSortedSet(SortedSet set, ReadWriteLock rwl) {
    super (set, rwl.readLock(), rwl.writeLock());
  }

  /**
   * Create a new SyncSortedSet protecting the given set,
   * and using the given pair of locks to control reader and writer methods.
   **/
  public SyncSortedSet(SortedSet set, Sync readLock, Sync writeLock) {
    super(set, readLock, writeLock);
  }


  protected SortedSet baseSortedSet() {
    return (SortedSet)c_;
  }

  public Comparator comparator() {
    boolean wasInterrupted = beforeRead();
    try {
      return baseSortedSet().comparator();
    }
    finally {
      afterRead(wasInterrupted);
    }
  }

  public Object first() {
    boolean wasInterrupted = beforeRead();
    try {
      return baseSortedSet().first();
    }
    finally {
      afterRead(wasInterrupted);
    }
  }

  public Object last() {
    boolean wasInterrupted = beforeRead();
    try {
      return baseSortedSet().last();
    }
    finally {
      afterRead(wasInterrupted);
    }
  }


  public SortedSet subSet(Object fromElement, Object toElement) {
    boolean wasInterrupted = beforeRead();
    try {
      return new SyncSortedSet(baseSortedSet().subSet(fromElement, toElement),
                               rd_, wr_);
    }
    finally {
      afterRead(wasInterrupted);
    }
  }

  public SortedSet headSet(Object toElement) {
    boolean wasInterrupted = beforeRead();
    try {
      return new SyncSortedSet(baseSortedSet().headSet(toElement),
                               rd_, wr_);
    }
    finally {
      afterRead(wasInterrupted);
    }
  }

  public SortedSet tailSet(Object fromElement) {
    boolean wasInterrupted = beforeRead();
    try {
      return new SyncSortedSet(baseSortedSet().tailSet(fromElement),
                               rd_, wr_);
    }
    finally {
      afterRead(wasInterrupted);
    }
  }

}