zhangzengfei
2022-01-10 4496b59ab27d569df1da7ef634e02273b3a9618a
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
package com.basic.security.utils;
 
import java.util.List;
import java.util.Vector;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
 
public class ConcurrentList {
 
    public final Lock lock = new ReentrantLock();
 
    public long setTime = 0;
    public List list = new Vector();
 
    public boolean isEmpty() {
        try {
            lock.lock();
            if (list.size() > 0) {
                return false;
            } else {
                return true;
            }
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            lock.unlock();
        }
        return true;
    }
 
    public Object getFirst() {
        try {
            lock.lock();
            if (list.size() > 0) {
                return list.get(0);
            } else {
                return null;
            }
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            lock.unlock();
        }
        return null;
    }
 
    public void setFirst(Object object) {
        try {
            lock.lock();
            if (list.size() == 0) {
                list.add(object);
                setTime = System.currentTimeMillis();
            }
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            lock.unlock();
        }
    }
 
    public Object getFirst(long timeout) {
        try {
            lock.lock();
            if (list.size() > 0) {
                if (System.currentTimeMillis() - setTime < timeout) {
                    return list.get(0);
                }
            } else {
                return null;
            }
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            lock.unlock();
        }
        return null;
    }
 
    public void removeFirst() {
        try {
            lock.lock();
            if (list.size() > 0) {
                list.remove(0);
                setTime = System.currentTimeMillis();
            }
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            lock.unlock();
        }
    }
}