File: linkedlist.h

package info (click to toggle)
crtmpserver 1.0~dfsg-3
  • links: PTS, VCS
  • area: main
  • in suites: wheezy
  • size: 4,336 kB
  • sloc: cpp: 56,354; sh: 411; makefile: 21
file content (80 lines) | stat: -rw-r--r-- 1,954 bytes parent folder | download | duplicates (4)
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
/* 
 *  Copyright (c) 2010,
 *  Gavriloaie Eugen-Andrei (shiretu@gmail.com)
 *  
 *  This file is part of crtmpserver.
 *  crtmpserver 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 3 of the License, or
 *  (at your option) any later version.
 *  
 *  crtmpserver 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 crtmpserver.  If not, see <http://www.gnu.org/licenses/>.
 */


#ifndef _LINKEDLIST_H
#define	_LINKEDLIST_H

#include <stdlib.h>

template<typename T>
struct LinkedListNode {
	LinkedListNode<T> *pPrev;
	LinkedListNode<T> *pNext;
	T info;
};

template<typename T>
LinkedListNode<T> *AddLinkedList(LinkedListNode<T> *pTo, T info, bool after) {
	LinkedListNode<T> *pResult = new LinkedListNode<T>;
	pResult->pNext = NULL;
	pResult->pPrev = NULL;
	pResult->info = info;

	if (pTo != NULL) {
		if (after) {
			pTo->pNext = pResult;
			pResult->pPrev = pTo;
		} else {
			pResult->pNext = pTo;
			pTo->pPrev = pResult;
		}
	}

	return pResult;
}

template<typename T>
LinkedListNode<T> *LastLinkedList(LinkedListNode<T> *pNode) {
	while (pNode != NULL) {
		if (pNode->pNext == NULL)
			return pNode;
		pNode = pNode->pNext;
	}
	return NULL;
}

template<typename T>
LinkedListNode<T> *RemoveLinkedList(LinkedListNode<T> *pNode) {
	LinkedListNode<T> *pPrev = pNode->pPrev;
	LinkedListNode<T> *pNext = pNode->pNext;
	if (pPrev != NULL)
		pPrev->pNext = pNext;
	if (pNext != NULL)
		pNext->pPrev = pPrev;
	delete pNode;
	if (pPrev != NULL)
		return LastLinkedList<T > (pPrev);
	return LastLinkedList<T > (pNext);
}


#endif	/* _LINKEDLIST_H */