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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
/*******************************************************************************
* shroudBNC - an object-oriented framework for IRC *
* Copyright (C) 2005-2014 Gunnar Beutner *
* *
* This program is free software; you can redistribute it and/or *
* modify it under the terms of the GNU General Public License *
* as published by the Free Software Foundation; either version 2 *
* of the License, or (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the Free Software *
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
*******************************************************************************/
#include "StdAfx.h"
/**
* PeekItems
*
* Retrieves the next item from the queue without removing it.
*/
RESULT<const char *> CQueue::PeekItem(void) const {
int LowestPriority = 99999;
queue_item_t *ThatItem = NULL;
for (int i = 0; i < m_Items.GetLength(); i++) {
if (m_Items[i].Priority < LowestPriority) {
LowestPriority = m_Items[i].Priority;
ThatItem = m_Items.GetAddressOf(i);
}
}
if (ThatItem != NULL) {
RETURN(const char *, ThatItem->Line);
} else {
THROW(const char *, Generic_Unknown, "The queue is empty.");
}
}
/**
* DequeueItem
*
* Retrieves the next item from the queue and removes it.
*/
RESULT<char *> CQueue::DequeueItem(void) {
int Index = 0;
queue_item_t *Item = NULL;
char *Line;
for (int i = 0; i < m_Items.GetLength(); i++) {
if (Item == NULL || m_Items[i].Priority < Item->Priority) {
Item = m_Items.GetAddressOf(i);
Index = i;
}
}
if (Item != NULL) {
Line = Item->Line;
m_Items.Remove(Index);
RETURN(char *, Line);
} else {
THROW(char *, Generic_Unknown, "The queue is empty.");
}
}
/**
* QueueItem
*
* Inserts a new item at the end of the queue.
*
* @param Line the item which is to be inserted
*/
RESULT<bool> CQueue::QueueItem(const char *Line) {
queue_item_t Item;
if (Line == NULL) {
THROW(bool, Generic_InvalidArgument, "Line cannot be NULL.");
}
// ignore new items if the queue is full
if (m_Items.GetLength() >= MAX_QUEUE_SIZE) {
THROW(bool, Generic_Unknown, "The queue is full.");
}
Item.Line = strdup(Line);
if (AllocFailed(Item.Line)) {
THROW(bool, Generic_OutOfMemory, "strdup() failed.");
}
Item.Priority = 0;
for (int i = 0; i < m_Items.GetLength(); i++) {
m_Items[i].Priority--;
}
return m_Items.Insert(Item);
}
/**
* QueueItemNext
*
* Inserts a new item at the front of the queue.
*
* @param Line the item which is to be inserted
*/
RESULT<bool> CQueue::QueueItemNext(const char *Line) {
for (int i = 0; i < m_Items.GetLength(); i++) {
m_Items[i].Priority += 2;
}
return QueueItem(Line);
}
/**
* GetLength
*
* Returns the number of items which are in the queue.
*/
int CQueue::GetLength(void) const {
return m_Items.GetLength();
}
/**
* Clear
*
* Removes all items from the queue.
*/
void CQueue::Clear(void) {
for (int i = 0; i < m_Items.GetLength(); i++) {
free(m_Items[i].Line);
}
m_Items.Clear();
}
|