aGrUM
3.2.0
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
link_tpl.h
Go to the documentation of this file.
1
/****************************************************************************
2
* This file is part of the aGrUM/pyAgrum library. *
3
* *
4
* Copyright (c) 2005-2026 by *
5
* - Pierre-Henri WUILLEMIN(_at_LIP6) *
6
* - Christophe GONZALES(_at_AMU) *
7
* *
8
* The aGrUM/pyAgrum library is free software; you can redistribute it *
9
* and/or modify it under the terms of either : *
10
* *
11
* - the GNU Lesser General Public License as published by *
12
* the Free Software Foundation, either version 3 of the License, *
13
* or (at your option) any later version, *
14
* - the MIT license (MIT), *
15
* - or both in dual license, as here. *
16
* *
17
* (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html) *
18
* *
19
* This aGrUM/pyAgrum library is distributed in the hope that it will be *
20
* useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *
21
* INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
22
* FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE *
23
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
24
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, *
25
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *
26
* OTHER DEALINGS IN THE SOFTWARE. *
27
* *
28
* See LICENCES for more details. *
29
* *
30
* SPDX-FileCopyrightText: Copyright 2005-2026 *
31
* - Pierre-Henri WUILLEMIN(_at_LIP6) *
32
* - Christophe GONZALES(_at_AMU) *
33
* SPDX-License-Identifier: LGPL-3.0-or-later OR MIT *
34
* *
35
* Contact : info_at_agrum_dot_org *
36
* homepage : http://agrum.gitlab.io *
37
* gitlab : https://gitlab.com/agrumery/agrum *
38
* *
39
****************************************************************************/
40
41
#pragma once
42
43
53
54
#include <
agrum/base/multidim/utils/FunctionGraphUtilities/link.h
>
55
56
namespace
gum
{
57
58
// Constructor
59
template
<
typename
T >
60
Link< T >::Link
(
const
T& elem) :
_element_
(elem) {
61
GUM_CONSTRUCTOR(
Link
);
62
}
63
64
// Constructor
65
template
<
typename
T >
66
Link< T >::Link
(
const
T& elem,
Link< T >
*
nextLink
) :
_element_
(elem),
_nextLink_
(
nextLink
) {
67
GUM_CONSTRUCTOR(
Link
);
68
}
69
70
// Destructor
71
template
<
typename
T >
72
Link< T >::~Link
() {
73
GUM_DESTRUCTOR(
Link
);
74
}
75
76
template
<
typename
T >
77
void
*
Link< T >::operator
new
(
size_t
s) {
78
return
SmallObjectAllocator::instance
().
allocate
(
Size
(s));
79
}
80
81
template
<
typename
T >
82
void
Link< T >::operator
delete
(
void
* p) {
83
SmallObjectAllocator::instance
().
deallocate
(p,
sizeof
(
Link< T >
));
84
}
85
86
template
<
typename
T >
87
const
T&
Link< T >::element
()
const
{
88
return
_element_
;
89
}
90
91
template
<
typename
T >
92
T&
Link< T >::element
() {
93
return
_element_
;
94
}
95
96
template
<
typename
T >
97
const
Link< T >
*
Link< T >::nextLink
()
const
{
98
return
_nextLink_
;
99
}
100
101
template
<
typename
T >
102
Link< T >
*
Link< T >::nextLink
() {
103
return
_nextLink_
;
104
}
105
106
template
<
typename
T >
107
void
Link< T >::setNextLink
(
Link< T >
* newLink) {
108
_nextLink_
= newLink;
109
}
110
111
// Constructor
112
template
<
typename
T >
113
LinkedList< T >::LinkedList
() {
114
GUM_CONSTRUCTOR(
LinkedList
);
115
_firstLink_ =
nullptr
;
116
}
117
118
// Destructor
119
template
<
typename
T >
120
LinkedList< T >::~LinkedList
() {
121
clear
();
122
GUM_DESTRUCTOR(
LinkedList
);
123
}
124
125
template
<
typename
T >
126
void
*
LinkedList< T >::operator
new
(
size_t
s) {
127
return
SmallObjectAllocator::instance
().
allocate
(
Size
(s));
128
}
129
130
template
<
typename
T >
131
void
LinkedList< T >::operator
delete
(
void
* p) {
132
SmallObjectAllocator::instance
().
deallocate
(p,
sizeof
(
LinkedList< T >
));
133
}
134
135
template
<
typename
T >
136
const
Link< T >
*
LinkedList< T >::list
()
const
{
137
return
_firstLink_
;
138
}
139
140
template
<
typename
T >
141
Link< T >
*
LinkedList< T >::list
() {
142
return
_firstLink_
;
143
}
144
145
template
<
typename
T >
146
void
LinkedList< T >::clear
() {
147
Link< T >
* curLink =
_firstLink_
;
148
Link< T >
* nl =
nullptr
;
149
while
(curLink) {
150
nl = curLink->
nextLink
();
151
delete
curLink;
152
curLink = nl;
153
}
154
}
155
156
template
<
typename
T >
157
void
LinkedList< T >::addLink
(
const
T& elem) {
158
Link< T >
* newLink =
new
Link< T >
(elem,
_firstLink_
);
159
_firstLink_
= newLink;
160
}
161
162
template
<
typename
T >
163
void
LinkedList< T >::searchAndRemoveLink
(
const
T& elem) {
164
Link< T >
* curLink =
_firstLink_
;
165
Link< T >
* prevLink =
nullptr
;
166
while
(curLink && curLink->
element
() != elem) {
167
prevLink = curLink;
168
curLink = curLink->
nextLink
();
169
}
170
if
(curLink) {
171
if
(prevLink) prevLink->
setNextLink
(curLink->
nextLink
());
172
else
_firstLink_
= curLink->
nextLink
();
173
delete
curLink;
174
}
175
}
176
177
}
// namespace gum
gum::Link
Link of a chain list allocated using the SmallObjectAllocator.
Definition
link.h:72
gum::Link::_nextLink_
Link< T > * _nextLink_
The next link in the list.
Definition
link.h:142
gum::Link::element
const T & element() const
Returns the element stored in this link.
Definition
link_tpl.h:87
gum::Link::~Link
~Link()
Destructor.
Definition
link_tpl.h:72
gum::Link::setNextLink
void setNextLink(Link< T > *newLink)
Sets the next link.
Definition
link_tpl.h:107
gum::Link::_element_
T _element_
The element embedded in this link.
Definition
link.h:139
gum::Link::nextLink
const Link< T > * nextLink() const
Returns next link.
Definition
link_tpl.h:97
gum::Link::Link
Link(const T &elem)
Constructor.
Definition
link_tpl.h:60
gum::LinkedList
Chain list allocated using the SmallObjectAllocator.
Definition
link.h:155
gum::LinkedList::addLink
void addLink(const T &elem)
Adds a link.
Definition
link_tpl.h:157
gum::LinkedList::list
const Link< T > * list() const
Returns the first link in the chained list.
Definition
link_tpl.h:136
gum::LinkedList::LinkedList
LinkedList()
Constructor.
Definition
link_tpl.h:113
gum::LinkedList::~LinkedList
~LinkedList()
Destructor.
Definition
link_tpl.h:120
gum::LinkedList::clear
void clear()
Clears the list.
Definition
link_tpl.h:146
gum::LinkedList::_firstLink_
Link< T > * _firstLink_
The first link of our list.
Definition
link.h:217
gum::LinkedList::searchAndRemoveLink
void searchAndRemoveLink(const T &elem)
Removes a element from the list.
Definition
link_tpl.h:163
gum::SmallObjectAllocator::instance
static SmallObjectAllocator & instance()
Definition
smallObjectAllocator_inl.h:96
gum::SmallObjectAllocator::allocate
void * allocate(const size_t &objectSize)
Allocates a block.
Definition
smallObjectAllocator.cpp:72
gum::SmallObjectAllocator::deallocate
void deallocate(void *pDeallocatedObject, const size_t &objectSize)
Deallocates an object.
Definition
smallObjectAllocator_inl.h:116
gum::Size
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition
types.h:74
link.h
Headers of the Link and LinkedList classes.
gum
gum is the global namespace for all aGrUM entities
Definition
agrum.h:46
aGrUM
3.2.0
© PHW&CG&others - 2022
DoXyGeN 1.18.0