File: CaretLinkedList.cxx

package info (click to toggle)
caret 5.6.4~dfsg.1-3
  • links: PTS, VCS
  • area: main
  • in suites: jessie, jessie-kfreebsd, wheezy
  • size: 31,904 kB
  • ctags: 28,901
  • sloc: cpp: 378,050; python: 6,718; ansic: 5,507; makefile: 333; sh: 46
file content (201 lines) | stat: -rw-r--r-- 3,288 bytes parent folder | download | duplicates (2)
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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
/*LICENSE_START*/
/*
 *  Copyright 1995-2002 Washington University School of Medicine
 *
 *  http://brainmap.wustl.edu
 *
 *  This file is part of CARET.
 *
 *  CARET 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.
 * 
 *  CARET 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 CARET; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 */
/*LICENSE_END*/

#include "CaretLinkedList.h"

/**
 * Constructor.
 */
CaretLinkedList::Node::Node()
{
   next = 0;
   prev = 0;
}

/**
 * Destructor.
 */
CaretLinkedList::Node::~Node()
{
}            

//*******************************************************************************

/**
 * Constructor.
 */
CaretLinkedList::CaretLinkedList()
{
   front = 0;
   back  = 0;
}

/**
 * Destructor.
 */
CaretLinkedList::~CaretLinkedList()
{
   front = 0;
   back  = 0;
}

/** 
 * clear the list.
 */
void 
CaretLinkedList::clear()
{
   Node* n = front;
   while (n != 0) {
      Node* temp = n->next;
      delete n;
      n = temp;
   }
   front = 0;
   back  = 0;
}
      
/**
 * see if an item is already in the list.
 */
bool 
CaretLinkedList::isInList(Node* n)
{
   Node* l = front;
   while (l != 0) {
      if (l == n) {
         return true;
      }
      l = l->next;
   }
   return false;
}

/**
 * add to front of list (list passed has all elements removed).
 */
void 
CaretLinkedList::pushFront(CaretLinkedList* list)
{
   if (list->front == 0) {
      return;
   }
   
   if (front == 0) {
      front = list->front;
      back  = list->back;
   }
   else {
      Node* n = list->back;
      n->next = front;
      front->prev = n;
      front = list->front;
   }
   list->front = 0;
   list->back  = 0;
}

/**
 * add to front of list.
 */
void 
CaretLinkedList::pushFront(Node* n)
{
   if (front != 0) {
      front->prev = n;
   }
   
   n->next = front;
   n->prev = 0;
   front = n;
   if (back == 0) {
      back = n;
   }
}

/**
 * add to end of list.
 */
void 
CaretLinkedList::pushBack(Node* n)
{
   if (back != 0) {
      back->next = n;
   }
   
   n->prev = back;
   n->next = 0;
   back = n;
   if (front == 0) {
      front = n;
   }
}

/**
 * remove a node from the list.
 */
void 
CaretLinkedList::remove(Node* n, const bool deleteNode)
{
   Node* nextNode = n->next;
   Node* prevNode = n->prev;

   if (prevNode != 0) {
      prevNode->next = nextNode;
   }
   if (nextNode != 0) {
      nextNode->prev = prevNode;
   }
   
   if (front == n) {
      front = nextNode;
   }
   if (back == n) {
      back = prevNode;
   }
   
   n->next = 0;
   n->prev = 0;
   if (deleteNode) {
      delete n;
   }
}

/**
 * get number of nodes in list.
 */
int 
CaretLinkedList::size()
{
   int cnt = 0;
   
   Node* n = front;
   while (n != 0) {
      cnt++;
      n = n->next;
   }
   
   return cnt;
}