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
|
/*******************************************************************************
* 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. *
*******************************************************************************/
#ifndef QUEUE_H
#define QUEUE_H
/** Defines how many items can be stored in a single queue */
#define MAX_QUEUE_SIZE 500
/**
* queue_item_t
*
* An item from a queue.
*/
typedef struct queue_item_s {
int Priority; /**< the priority of this item; 0 is the highest priority */
char *Line; /**< the string which is associated with this item */
} queue_item_t;
/**
* CQueue
*
* A queue which can be used for storing strings.
*/
class SBNCAPI CQueue {
CVector<queue_item_t> m_Items; /**< the items which are in the queue */
public:
RESULT<char *> DequeueItem(void);
RESULT<const char *> PeekItem(void) const;
RESULT<bool> QueueItem(const char *Line);
RESULT<bool> QueueItemNext(const char *Line);
int GetLength(void) const;
void Clear(void);
};
#endif /* QUEUE_H */
|