-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathManageQueue.java
More file actions
111 lines (99 loc) · 2.48 KB
/
Copy pathManageQueue.java
File metadata and controls
111 lines (99 loc) · 2.48 KB
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
package com.core.utils;
import java.util.ArrayDeque;
import java.util.ArrayList;
/**
* @author ManhKM on 6/21/2022
* @project Java-Utils
*/
public class ManageQueue {
private ArrayDeque<Object> queue = new ArrayDeque<>();
public boolean Add(ArrayList<Object> l, boolean isNotify){
boolean is = false;
try {
synchronized (queue) {
queue.addAll(l);
if (isNotify) {
queue.notify();
}
}
is = true;
}catch(Exception e) {
e.printStackTrace();
}
return is;
}
public boolean Add(Object o, boolean isNotify) {
boolean is = false;
try {
synchronized (queue) {
queue.add(o);
if (isNotify) {
queue.notify();
}
}
is = true;
}catch(Exception e) {
e.printStackTrace();
}
return is;
}
public void reAdd(ArrayList<Object> l) {
try {
synchronized (queue) {
queue.addAll(l);
}
}catch(Exception e) {
e.printStackTrace();
}
}
public void reAdd(Object o) {
try {
synchronized (queue) {
queue.add(o);
}
}catch(Exception e) {
e.printStackTrace();
}
}
public void waitQueue(int time_out) {
try{
if (queue.isEmpty()) {
synchronized (queue) {
queue.wait(time_out);
}
}
}catch(Exception e) {
e.printStackTrace();
}
}
public void waitNew(int time_out) {
try{
synchronized (queue) {
queue.wait(time_out);
}
}catch(Exception e) {
e.printStackTrace();
}
}
//Get Queue:
public ArrayList<Object> getQueue(int max) {
ArrayList<Object> l = new ArrayList<Object>();
try{
if (queue.isEmpty()) return l;
int n = 0;
synchronized (queue) {
while (!queue.isEmpty() && n < max) {
n ++;
Object o = queue.remove();
if (o!=null) l.add(o);
}
}
} catch (Exception e) {
e.printStackTrace();
}
return l;
}
public int getSize() {
return queue.size();
}
}