Page Menu
Home
c4science
Search
Configure Global Search
Log In
Files
F80255650
node_group_inline_impl.cc
No One
Temporary
Actions
Download File
Edit File
Delete File
View Transforms
Subscribe
Mute Notifications
Award Token
Subscribers
None
File Metadata
Details
File Info
Storage
Attached
Created
Fri, Aug 30, 17:58
Size
3 KB
Mime Type
text/x-c++
Expires
Sun, Sep 1, 17:58 (2 d)
Engine
blob
Format
Raw Data
Handle
20028751
Attached To
rAKA akantu
node_group_inline_impl.cc
View Options
/**
* @file node_group_inline_impl.cc
*
* @author Nicolas Richart <nicolas.richart@epfl.ch>
*
* @date creation: Fri Jun 18 2010
* @date last modification: Tue Dec 08 2015
*
* @brief Node group inline function definitions
*
* @section LICENSE
*
* Copyright (©) 2010-2012, 2014, 2015 EPFL (Ecole Polytechnique Fédérale de
* Lausanne) Laboratory (LSMS - Laboratoire de Simulation en Mécanique des
* Solides)
*
* Akantu is free software: you can redistribute it and/or modify it under the
* terms of the GNU Lesser General Public License as published by the Free
* Software Foundation, either version 3 of the License, or (at your option) any
* later version.
*
* Akantu 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 Lesser General Public License for more
* details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Akantu. If not, see <http://www.gnu.org/licenses/>.
*
*/
/* -------------------------------------------------------------------------- */
namespace
akantu
{
/* -------------------------------------------------------------------------- */
inline
NodeGroup
::
const_node_iterator
NodeGroup
::
begin
()
const
{
return
node_group
.
begin
();
}
/* -------------------------------------------------------------------------- */
inline
NodeGroup
::
const_node_iterator
NodeGroup
::
end
()
const
{
return
node_group
.
end
();
}
/* -------------------------------------------------------------------------- */
inline
NodeGroup
::
const_node_iterator
NodeGroup
::
add
(
UInt
node
,
bool
check_for_duplicate
)
{
if
(
check_for_duplicate
)
{
const_node_iterator
it
=
std
::
find
(
begin
(),
end
(),
node
);
if
(
it
==
node_group
.
end
())
{
node_group
.
push_back
(
node
);
return
(
node_group
.
end
()
-
1
);
}
return
it
;
}
else
{
node_group
.
push_back
(
node
);
return
(
node_group
.
end
()
-
1
);
}
}
/* -------------------------------------------------------------------------- */
inline
void
NodeGroup
::
remove
(
UInt
node
)
{
Array
<
UInt
>::
iterator
<>
it
=
this
->
node_group
.
begin
();
Array
<
UInt
>::
iterator
<>
end
=
this
->
node_group
.
end
();
AKANTU_DEBUG_ASSERT
(
it
!=
end
,
"The node group is empty!!"
);
for
(;
it
!=
node_group
.
end
();
++
it
)
{
if
(
*
it
==
node
)
{
it
=
node_group
.
erase
(
it
);
}
}
AKANTU_DEBUG_ASSERT
(
it
!=
end
,
"The node was not found!"
);
}
/* -------------------------------------------------------------------------- */
inline
UInt
NodeGroup
::
size
()
const
{
return
node_group
.
size
();
}
/* -------------------------------------------------------------------------- */
struct
FilterFunctor
;
template
<
typename
T
>
void
NodeGroup
::
applyNodeFilter
(
T
&
filter
)
{
AKANTU_DEBUG_IN
();
AKANTU_DEBUG_ASSERT
(
T
::
type
==
FilterFunctor
::
_node_filter_functor
,
"NodeFilter can only apply node filter functor"
);
Array
<
UInt
>::
iterator
<>
it
=
this
->
node_group
.
begin
();
for
(;
it
!=
node_group
.
end
();
++
it
)
{
/// filter == true -> keep node
if
(
!
filter
(
*
it
))
{
it
=
node_group
.
erase
(
it
);
}
}
AKANTU_DEBUG_OUT
();
}
}
// akantu
Event Timeline
Log In to Comment