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
|
/*
FALCON - The Falcon Programming Language.
FILE: ltree.cpp
Strong list definition
-------------------------------------------------------------------
Author: Giancarlo Niccolai
Begin: Sat Feb 26 2005
-------------------------------------------------------------------
(C) Copyright 2004: the FALCON developers (see list in AUTHORS file)
See LICENSE file for licensing details.
*/
/** \file
Strong list definitions
*/
#include <falcon/setup.h>
#include <falcon/ltree.h>
namespace Falcon {
void StrongList::push_front( SLElement *elem )
{
elem->next( m_head );
elem->prev(0);
if( m_tail == 0 )
m_tail = elem;
else
m_head->prev( elem );
m_head = elem;
elem->owner( this );
m_size++;
}
void StrongList::push_back( SLElement *elem )
{
elem->next( 0 );
elem->prev( m_tail );
if( m_head == 0 )
m_head = elem;
else
m_tail->next( elem );
m_tail = elem;
elem->owner( this );
m_size++;
}
SLElement *StrongList::pop_front()
{
SLElement *h = m_head;
if (m_head != 0 ) {
m_head = m_head->next();
if ( m_head != 0 )
m_head->prev(0);
else
m_tail = 0;
m_size--;
h->owner( 0 );
}
return h;
}
SLElement *StrongList::pop_back()
{
SLElement *t = m_tail;
if (m_tail != 0 ) {
m_tail = m_tail->prev();
if ( m_tail != 0 )
m_tail->next(0);
else
m_head = 0;
m_size--;
t->owner( 0 );
}
return t;
}
void StrongList::remove( SLElement *elem )
{
if ( m_size == 0 || elem->owner() != this ) return;
if ( elem == m_head ) {
m_head = elem->next();
}
else {
elem->prev()->next( elem->next() );
}
if ( elem == m_tail ) {
m_tail = elem->prev();
}
else {
elem->next()->prev( elem->prev() );
}
m_size--;
elem->owner( 0 );
}
}
/* end of ltree.cpp */
|
