Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
C
CGoGN
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Service Desk
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Operations
Operations
Incidents
Environments
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
KennethVanhoey
CGoGN
Commits
d73104f4
Commit
d73104f4
authored
Oct 08, 2012
by
Kenneth Vanhoey
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Add Tensor class
parent
b1e33042
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
404 additions
and
0 deletions
+404
-0
include/Geometry/tensor.h
include/Geometry/tensor.h
+236
-0
include/Geometry/tensor.hpp
include/Geometry/tensor.hpp
+168
-0
No files found.
include/Geometry/tensor.h
0 → 100644
View file @
d73104f4
/*******************************************************************************
* CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps *
* version 0.1 *
* Copyright (C) 2009-2012, IGG Team, LSIIT, University of Strasbourg *
* *
* This library 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 2.1 of the License, or (at your *
* option) any later version. *
* *
* This library 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 this library; if not, write to the Free Software Foundation, *
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. *
* *
* Web site: http://cgogn.unistra.fr/ *
* Contact information: cgogn@unistra.fr *
* *
*******************************************************************************/
#ifndef TENSOR_H_
#define TENSOR_H_
/*!
* \file tensor.h
*/
namespace
CGoGN
{
namespace
Geom
{
/*! \class Tensor tensor.h
*
* \brief Class for representing cubic tensors of static size and dynamic order.
*
* A cubic Tensor of size SIZE and order ORDER has
* SIZE x SIZE x ... x SIZE (ORDER times) = SIZE^ORDER elements.
*
* \tparam REAL the floating point arithmetics to use
* \tparam SIZE the base size of the Tensor
*/
template
<
unsigned
int
SIZE
,
typename
REAL
>
class
Tensor
{
private:
unsigned
int
m_order
;
REAL
*
m_data
;
public:
/**********************************************/
/* CONSTRUCTORS */
/**********************************************/
/**
* \brief Default constructor
*
* Tensor class default constructor
*/
Tensor
()
;
/**
* \brief Copy constructor
*
* Tensor class copy constructor
*
* \param T the tensor to copy
*/
Tensor
(
const
Tensor
&
T
)
;
/**
* \brief Constructor
*
* Tensor class order constructor
*
* \param order the desired order of the Tensor
*/
Tensor
(
unsigned
int
order
)
;
/**
* \brief Destructor
*
* Tensor class destructor
*/
~
Tensor
()
;
/**********************************************/
/* MODIFIERS */
/**********************************************/
/**
* \brief Modifier: set all to zero
*
* sets all elements to zero
*/
void
zero
()
;
/**
* \brief Modifier: set identity
*
* Sets diagonal elements to one
*/
void
identity
()
;
/**
* \brief Modifier: copy Tensor
*
* copies argument into current instance
*
* \param T the tensor to copy
*/
void
operator
=
(
const
Tensor
&
T
)
;
/**********************************************/
/* ACCESSORS */
/**********************************************/
/**
* \brief Accessor: get element
*
* \param p=(p0, ..., pn) the nD index to access
*
* \return const reference to the value stored at index p
*/
const
REAL
&
operator
()(
std
::
vector
<
unsigned
int
>
p
)
const
;
/**
* \brief Accessor: get element
*
* \param p=(p0, ..., pn) the nD index to access
*
* \return reference to the value stored at index p
*/
REAL
&
operator
()(
std
::
vector
<
unsigned
int
>
p
)
;
/**
* \brief Accessor: get element
*
* \param k the 1D array index to access
*
* \return const reference to the value stored at index k in the array
*/
const
REAL
&
operator
[](
unsigned
int
k
)
const
;
/**
* \brief Accessor: get element
*
* \param k the 1D array index to access
*
* \return reference to the value stored at index k in the 1D array representing the tensor
*/
REAL
&
operator
[](
unsigned
int
k
)
;
/**
* \brief Accessor: get amount of elements in tensor
*
* \return the amount of elements in the tensor
*/
unsigned
int
nbElem
()
const
;
/**
* \brief Accessor: get order of tensor
*
* \return const ref to the order of the tensor
*/
const
unsigned
int
&
order
()
const
;
/**********************************************/
/* UTILITY FUNCTIONS */
/**********************************************/
/**
* \brief Utility: increment nD index
*
* Tool for incrementing the nD index (p0,...,pn) depending on the size
*
* \return true if final index not reached
*/
static
bool
incremIndex
(
std
::
vector
<
unsigned
int
>&
p
)
;
/**********************************************/
/* STREAM OPERATORS */
/**********************************************/
/**
* \brief Stream operator: write
*
* Writes the tensor in an output text stream
*/
friend
std
::
ostream
&
operator
<<
(
std
::
ostream
&
out
,
const
Tensor
<
SIZE
,
REAL
>&
T
)
{
out
<<
"Tensor of order "
<<
T
.
order
()
<<
" and size "
<<
SIZE
<<
std
::
endl
;
for
(
unsigned
int
i
=
0
;
i
<
T
.
nbElem
()
;
++
i
)
{
out
<<
T
[
i
]
<<
" "
;
if
((
i
%
SIZE
)
==
(
SIZE
-
1
))
out
<<
std
::
endl
;
}
return
out
;
}
private:
/**********************************************/
/* UTILITY FUNCTIONS */
/**********************************************/
/**
* \brief Utility: convert nD to 1D index
*
* Tool for converting an nD index (p0,...,pn) to a 1d array index
*
* \return 1d index
*/
unsigned
int
getIndex
(
std
::
vector
<
unsigned
int
>
p
)
const
;
}
;
/**********************************************/
/* SOME USEFUL TYPEDEFS */
/**********************************************/
typedef
Tensor
<
2
,
float
>
Tensor2f
;
typedef
Tensor
<
2
,
double
>
Tensor2d
;
typedef
Tensor
<
3
,
float
>
Tensor3f
;
typedef
Tensor
<
3
,
double
>
Tensor3d
;
}
/* namespace Geom */
}
/* namespace CGoGN */
#include "tensor.hpp"
#endif
/* TENSOR_H_ */
include/Geometry/tensor.hpp
0 → 100644
View file @
d73104f4
/*******************************************************************************
* CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps *
* version 0.1 *
* Copyright (C) 2009-2012, IGG Team, LSIIT, University of Strasbourg *
* *
* This library 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 2.1 of the License, or (at your *
* option) any later version. *
* *
* This library 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 this library; if not, write to the Free Software Foundation, *
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. *
* *
* Web site: http://cgogn.unistra.fr/ *
* Contact information: cgogn@unistra.fr *
* *
*******************************************************************************/
/* \file tensor.hpp */
namespace
CGoGN
{
namespace
Geom
{
template
<
unsigned
int
SIZE
,
typename
REAL
>
Tensor
<
SIZE
,
REAL
>::
Tensor
()
:
m_order
(
0
)
{
m_data
=
new
REAL
[
1
]
;
}
template
<
unsigned
int
SIZE
,
typename
REAL
>
Tensor
<
SIZE
,
REAL
>::
Tensor
(
const
Tensor
&
T
)
:
m_order
(
T
.
m_order
)
{
m_data
=
new
REAL
[
T
.
nbElem
()]
;
}
template
<
unsigned
int
SIZE
,
typename
REAL
>
Tensor
<
SIZE
,
REAL
>::
Tensor
(
unsigned
int
order
)
:
m_order
(
order
)
{
m_data
=
new
REAL
[(
unsigned
int
)
pow
(
SIZE
,
m_order
)]
;
}
template
<
unsigned
int
SIZE
,
typename
REAL
>
Tensor
<
SIZE
,
REAL
>::~
Tensor
()
{
delete
[]
m_data
;
}
template
<
unsigned
int
SIZE
,
typename
REAL
>
void
Tensor
<
SIZE
,
REAL
>::
identity
()
{
unsigned
int
offset
=
0
;
for
(
unsigned
int
i
=
0
;
i
<
SIZE
;
++
i
)
m_data
[
SIZE
*
i
+
offset
++
]
=
1
;
assert
(
offset
==
SIZE
)
;
}
template
<
unsigned
int
SIZE
,
typename
REAL
>
void
Tensor
<
SIZE
,
REAL
>::
operator
=
(
const
Tensor
&
T
)
{
m_order
=
T
.
m_order
;
m_data
=
new
REAL
[
T
.
nbElem
()]
;
for
(
unsigned
int
i
=
0
;
i
<
T
.
nbElem
()
;
++
i
)
m_data
[
i
]
=
T
[
i
]
;
}
template
<
unsigned
int
SIZE
,
typename
REAL
>
void
Tensor
<
SIZE
,
REAL
>::
zero
()
{
for
(
unsigned
int
i
=
0
;
i
<
(
unsigned
int
)
pow
(
SIZE
,
m_order
)
;
++
i
)
{
m_data
[
i
]
=
0
;
}
}
template
<
unsigned
int
SIZE
,
typename
REAL
>
const
REAL
&
Tensor
<
SIZE
,
REAL
>::
operator
()(
std
::
vector
<
unsigned
int
>
p
)
const
{
assert
(
p
.
size
()
==
m_order
||
!
"Tensor::operator(): order does not correspond to argument"
)
;
return
m_data
[
getIndex
(
p
)]
;
}
template
<
unsigned
int
SIZE
,
typename
REAL
>
REAL
&
Tensor
<
SIZE
,
REAL
>::
operator
()(
std
::
vector
<
unsigned
int
>
p
)
{
assert
(
p
.
size
()
==
m_order
||
!
"Tensor::operator(): order does not correspond to argument"
)
;
return
m_data
[
getIndex
(
p
)]
;
}
template
<
unsigned
int
SIZE
,
typename
REAL
>
unsigned
int
Tensor
<
SIZE
,
REAL
>::
getIndex
(
std
::
vector
<
unsigned
int
>
p
)
const
{
assert
(
p
.
size
()
==
m_order
||
!
"Tensor::getIndex: order does not correspond to argument"
)
;
if
(
p
.
size
()
!=
m_order
)
return
-
1
;
unsigned
int
res
=
0
;
unsigned
int
prod
=
1
;
for
(
unsigned
int
i
=
0
;
i
<
m_order
;
++
i
)
{
assert
(
p
[
i
]
<
SIZE
||
!
"Tensor::getIndex: given index has out of bound values (higher then tensor SIZE)"
)
;
res
+=
p
[
i
]
*
prod
;
prod
*=
SIZE
;
}
return
res
;
}
template
<
unsigned
int
SIZE
,
typename
REAL
>
const
unsigned
int
&
Tensor
<
SIZE
,
REAL
>::
order
()
const
{
return
m_order
;
}
template
<
unsigned
int
SIZE
,
typename
REAL
>
unsigned
int
Tensor
<
SIZE
,
REAL
>::
nbElem
()
const
{
return
pow
(
SIZE
,
m_order
)
;
}
template
<
unsigned
int
SIZE
,
typename
REAL
>
REAL
&
Tensor
<
SIZE
,
REAL
>::
operator
[](
unsigned
int
k
)
{
assert
(
k
<
nbElem
()
||
!
"Tensor::operator[] out of bound value requested"
)
;
return
m_data
[
k
]
;
}
template
<
unsigned
int
SIZE
,
typename
REAL
>
const
REAL
&
Tensor
<
SIZE
,
REAL
>::
operator
[](
unsigned
int
k
)
const
{
assert
(
k
<
nbElem
()
||
!
"Tensor::operator[] out of bound value requested"
)
;
return
m_data
[
k
]
;
}
template
<
unsigned
int
SIZE
,
typename
REAL
>
bool
Tensor
<
SIZE
,
REAL
>::
incremIndex
(
std
::
vector
<
unsigned
int
>&
p
)
{
unsigned
int
i
=
0
;
while
(
i
<
p
.
size
())
{
p
[
i
]
=
(
p
[
i
]
+
1
)
%
SIZE
;
if
(
p
[
i
]
!=
0
)
// if no overflow
return
true
;
++
i
;
}
return
false
;
}
}
/* namespace Geom */
}
/* namespace CGoGN */
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment