blob: 8781c1475f6bed4852cb51074e6a55825d14bc54 (
plain)
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
|
using System;
namespace XUtliPoolLib
{
public class SimpleQueue
{
public bool HasData
{
get
{
return this.Root != null;
}
}
private IQueueObject Root = null;
private IQueueObject Last = null;
public void Clear()
{
IQueueObject next;
for (IQueueObject queueObject = this.Root; queueObject != null; queueObject = next)
{
next = queueObject.next;
queueObject.next = null;
}
this.Root = null;
this.Last = null;
}
public void Enqueue(IQueueObject obj)
{
bool flag = obj != null;
if (flag)
{
obj.next = null;
bool flag2 = this.Root == null;
if (flag2)
{
this.Root = obj;
this.Last = this.Root;
}
else
{
bool flag3 = this.Last != null;
if (flag3)
{
this.Last.next = obj;
this.Last = obj;
}
else
{
XSingleton<XDebug>.singleton.AddErrorLog("queue state error", null, null, null, null, null);
}
}
}
else
{
XSingleton<XDebug>.singleton.AddWarningLog("can not enqueue null object", null, null, null, null, null);
}
}
public T Dequeue<T>() where T : IQueueObject, new()
{
IQueueObject queueObject = null;
bool flag = this.Root != null;
if (flag)
{
queueObject = this.Root;
this.Root = this.Root.next;
}
bool flag2 = this.Root == null;
if (flag2)
{
this.Last = null;
}
return (T)((object)queueObject);
}
}
}
|
