blob: 26983138ff0da984c3e97b4149ec4ebd16b712e8 (
plain) (
blame)
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
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You 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 org.apache.spark.util
import scala.collection.mutable.Set
import scala.collection.JavaConversions
import java.util.concurrent.ConcurrentHashMap
class TimeStampedHashSet[A] extends Set[A] {
val internalMap = new ConcurrentHashMap[A, Long]()
def contains(key: A): Boolean = {
internalMap.contains(key)
}
def iterator: Iterator[A] = {
val jIterator = internalMap.entrySet().iterator()
JavaConversions.asScalaIterator(jIterator).map(_.getKey)
}
override def + (elem: A): Set[A] = {
val newSet = new TimeStampedHashSet[A]
newSet ++= this
newSet += elem
newSet
}
override def - (elem: A): Set[A] = {
val newSet = new TimeStampedHashSet[A]
newSet ++= this
newSet -= elem
newSet
}
override def += (key: A): this.type = {
internalMap.put(key, currentTime)
this
}
override def -= (key: A): this.type = {
internalMap.remove(key)
this
}
override def empty: Set[A] = new TimeStampedHashSet[A]()
override def size(): Int = internalMap.size()
override def foreach[U](f: (A) => U): Unit = {
val iterator = internalMap.entrySet().iterator()
while(iterator.hasNext) {
f(iterator.next.getKey)
}
}
/**
* Removes old values that have timestamp earlier than `threshTime`
*/
def clearOldValues(threshTime: Long) {
val iterator = internalMap.entrySet().iterator()
while(iterator.hasNext) {
val entry = iterator.next()
if (entry.getValue < threshTime) {
iterator.remove()
}
}
}
private def currentTime: Long = System.currentTimeMillis()
}
|
