Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
pugs
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
GitLab community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
code
pugs
Commits
ddea58da
Commit
ddea58da
authored
Apr 29, 2021
by
Stéphane Del Pino
Browse files
Options
Downloads
Patches
Plain Diff
Move misplaced code
parent
f5b7ac85
No related branches found
No related tags found
1 merge request
!89
Add missing compatibility check when affecting lists to R^d or R^dxd
Changes
2
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
src/language/node_processor/BinaryExpressionProcessor.hpp
+112
-0
112 additions, 0 deletions
src/language/node_processor/BinaryExpressionProcessor.hpp
src/language/utils/BinaryOperatorProcessorBuilder.hpp
+0
-114
0 additions, 114 deletions
src/language/utils/BinaryOperatorProcessorBuilder.hpp
with
112 additions
and
114 deletions
src/language/node_processor/BinaryExpressionProcessor.hpp
+
112
−
0
View file @
ddea58da
...
...
@@ -8,6 +8,9 @@
#include
<type_traits>
template
<
typename
DataType
>
class
DataHandler
;
template
<
typename
Op
>
struct
BinOp
;
...
...
@@ -201,4 +204,113 @@ struct BinaryExpressionProcessor final : public INodeProcessor
BinaryExpressionProcessor
(
ASTNode
&
node
)
:
m_node
{
node
}
{}
};
template
<
typename
BinaryOpT
,
typename
ValueT
,
typename
A_DataT
,
typename
B_DataT
>
struct
BinaryExpressionProcessor
<
BinaryOpT
,
std
::
shared_ptr
<
ValueT
>
,
std
::
shared_ptr
<
A_DataT
>
,
std
::
shared_ptr
<
B_DataT
>>
final
:
public
INodeProcessor
{
private:
ASTNode
&
m_node
;
PUGS_INLINE
DataVariant
_eval
(
const
DataVariant
&
a
,
const
DataVariant
&
b
)
{
const
auto
&
embedded_a
=
std
::
get
<
EmbeddedData
>
(
a
);
const
auto
&
embedded_b
=
std
::
get
<
EmbeddedData
>
(
b
);
std
::
shared_ptr
a_ptr
=
dynamic_cast
<
const
DataHandler
<
A_DataT
>&>
(
embedded_a
.
get
()).
data_ptr
();
std
::
shared_ptr
b_ptr
=
dynamic_cast
<
const
DataHandler
<
B_DataT
>&>
(
embedded_b
.
get
()).
data_ptr
();
return
EmbeddedData
(
std
::
make_shared
<
DataHandler
<
ValueT
>>
(
BinOp
<
BinaryOpT
>
().
eval
(
a_ptr
,
b_ptr
)));
}
public
:
DataVariant
execute
(
ExecutionPolicy
&
exec_policy
)
{
try
{
return
this
->
_eval
(
m_node
.
children
[
0
]
->
execute
(
exec_policy
),
m_node
.
children
[
1
]
->
execute
(
exec_policy
));
}
catch
(
const
NormalError
&
error
)
{
throw
ParseError
(
error
.
what
(),
m_node
.
begin
());
}
}
BinaryExpressionProcessor
(
ASTNode
&
node
)
:
m_node
{
node
}
{}
};
template
<
typename
BinaryOpT
,
typename
ValueT
,
typename
A_DataT
,
typename
B_DataT
>
struct
BinaryExpressionProcessor
<
BinaryOpT
,
std
::
shared_ptr
<
ValueT
>
,
A_DataT
,
std
::
shared_ptr
<
B_DataT
>>
final
:
public
INodeProcessor
{
private:
ASTNode
&
m_node
;
PUGS_INLINE
DataVariant
_eval
(
const
DataVariant
&
a
,
const
DataVariant
&
b
)
{
if
constexpr
((
std
::
is_arithmetic_v
<
A_DataT
>
)
or
(
is_tiny_vector_v
<
A_DataT
>
)
or
(
is_tiny_matrix_v
<
A_DataT
>
))
{
const
auto
&
a_value
=
std
::
get
<
A_DataT
>
(
a
);
const
auto
&
embedded_b
=
std
::
get
<
EmbeddedData
>
(
b
);
std
::
shared_ptr
b_ptr
=
dynamic_cast
<
const
DataHandler
<
B_DataT
>&>
(
embedded_b
.
get
()).
data_ptr
();
return
EmbeddedData
(
std
::
make_shared
<
DataHandler
<
ValueT
>>
(
BinOp
<
BinaryOpT
>
().
eval
(
a_value
,
b_ptr
)));
}
else
{
static_assert
(
std
::
is_arithmetic_v
<
A_DataT
>
,
"invalid left hand side type"
);
}
}
public
:
DataVariant
execute
(
ExecutionPolicy
&
exec_policy
)
{
try
{
return
this
->
_eval
(
m_node
.
children
[
0
]
->
execute
(
exec_policy
),
m_node
.
children
[
1
]
->
execute
(
exec_policy
));
}
catch
(
const
NormalError
&
error
)
{
throw
ParseError
(
error
.
what
(),
m_node
.
begin
());
}
}
BinaryExpressionProcessor
(
ASTNode
&
node
)
:
m_node
{
node
}
{}
};
template
<
typename
BinaryOpT
,
typename
ValueT
,
typename
A_DataT
,
typename
B_DataT
>
struct
BinaryExpressionProcessor
<
BinaryOpT
,
std
::
shared_ptr
<
ValueT
>
,
std
::
shared_ptr
<
A_DataT
>
,
B_DataT
>
final
:
public
INodeProcessor
{
private:
ASTNode
&
m_node
;
PUGS_INLINE
DataVariant
_eval
(
const
DataVariant
&
a
,
const
DataVariant
&
b
)
{
if
constexpr
((
std
::
is_arithmetic_v
<
B_DataT
>
)
or
(
is_tiny_matrix_v
<
B_DataT
>
)
or
(
is_tiny_vector_v
<
B_DataT
>
))
{
const
auto
&
embedded_a
=
std
::
get
<
EmbeddedData
>
(
a
);
const
auto
&
b_value
=
std
::
get
<
B_DataT
>
(
b
);
std
::
shared_ptr
a_ptr
=
dynamic_cast
<
const
DataHandler
<
A_DataT
>&>
(
embedded_a
.
get
()).
data_ptr
();
return
EmbeddedData
(
std
::
make_shared
<
DataHandler
<
ValueT
>>
(
BinOp
<
BinaryOpT
>
().
eval
(
a_ptr
,
b_value
)));
}
else
{
static_assert
(
std
::
is_arithmetic_v
<
B_DataT
>
,
"invalid right hand side type"
);
}
}
public
:
DataVariant
execute
(
ExecutionPolicy
&
exec_policy
)
{
try
{
return
this
->
_eval
(
m_node
.
children
[
0
]
->
execute
(
exec_policy
),
m_node
.
children
[
1
]
->
execute
(
exec_policy
));
}
catch
(
const
NormalError
&
error
)
{
throw
ParseError
(
error
.
what
(),
m_node
.
begin
());
}
}
BinaryExpressionProcessor
(
ASTNode
&
node
)
:
m_node
{
node
}
{}
};
#endif // BINARY_EXPRESSION_PROCESSOR_HPP
This diff is collapsed.
Click to expand it.
src/language/utils/BinaryOperatorProcessorBuilder.hpp
+
0
−
114
View file @
ddea58da
...
...
@@ -8,11 +8,6 @@
#include
<language/utils/IBinaryOperatorProcessorBuilder.hpp>
#include
<language/utils/ParseError.hpp>
#include
<type_traits>
template
<
typename
DataType
>
class
DataHandler
;
template
<
typename
OperatorT
,
typename
ValueT
,
typename
A_DataT
,
typename
B_DataT
>
class
BinaryOperatorProcessorBuilder
final
:
public
IBinaryOperatorProcessorBuilder
{
...
...
@@ -44,113 +39,4 @@ class BinaryOperatorProcessorBuilder final : public IBinaryOperatorProcessorBuil
}
};
template
<
typename
BinaryOpT
,
typename
ValueT
,
typename
A_DataT
,
typename
B_DataT
>
struct
BinaryExpressionProcessor
<
BinaryOpT
,
std
::
shared_ptr
<
ValueT
>
,
std
::
shared_ptr
<
A_DataT
>
,
std
::
shared_ptr
<
B_DataT
>>
final
:
public
INodeProcessor
{
private:
ASTNode
&
m_node
;
PUGS_INLINE
DataVariant
_eval
(
const
DataVariant
&
a
,
const
DataVariant
&
b
)
{
const
auto
&
embedded_a
=
std
::
get
<
EmbeddedData
>
(
a
);
const
auto
&
embedded_b
=
std
::
get
<
EmbeddedData
>
(
b
);
std
::
shared_ptr
a_ptr
=
dynamic_cast
<
const
DataHandler
<
A_DataT
>&>
(
embedded_a
.
get
()).
data_ptr
();
std
::
shared_ptr
b_ptr
=
dynamic_cast
<
const
DataHandler
<
B_DataT
>&>
(
embedded_b
.
get
()).
data_ptr
();
return
EmbeddedData
(
std
::
make_shared
<
DataHandler
<
ValueT
>>
(
BinOp
<
BinaryOpT
>
().
eval
(
a_ptr
,
b_ptr
)));
}
public
:
DataVariant
execute
(
ExecutionPolicy
&
exec_policy
)
{
try
{
return
this
->
_eval
(
m_node
.
children
[
0
]
->
execute
(
exec_policy
),
m_node
.
children
[
1
]
->
execute
(
exec_policy
));
}
catch
(
const
NormalError
&
error
)
{
throw
ParseError
(
error
.
what
(),
m_node
.
begin
());
}
}
BinaryExpressionProcessor
(
ASTNode
&
node
)
:
m_node
{
node
}
{}
};
template
<
typename
BinaryOpT
,
typename
ValueT
,
typename
A_DataT
,
typename
B_DataT
>
struct
BinaryExpressionProcessor
<
BinaryOpT
,
std
::
shared_ptr
<
ValueT
>
,
A_DataT
,
std
::
shared_ptr
<
B_DataT
>>
final
:
public
INodeProcessor
{
private:
ASTNode
&
m_node
;
PUGS_INLINE
DataVariant
_eval
(
const
DataVariant
&
a
,
const
DataVariant
&
b
)
{
if
constexpr
((
std
::
is_arithmetic_v
<
A_DataT
>
)
or
(
is_tiny_vector_v
<
A_DataT
>
)
or
(
is_tiny_matrix_v
<
A_DataT
>
))
{
const
auto
&
a_value
=
std
::
get
<
A_DataT
>
(
a
);
const
auto
&
embedded_b
=
std
::
get
<
EmbeddedData
>
(
b
);
std
::
shared_ptr
b_ptr
=
dynamic_cast
<
const
DataHandler
<
B_DataT
>&>
(
embedded_b
.
get
()).
data_ptr
();
return
EmbeddedData
(
std
::
make_shared
<
DataHandler
<
ValueT
>>
(
BinOp
<
BinaryOpT
>
().
eval
(
a_value
,
b_ptr
)));
}
else
{
static_assert
(
std
::
is_arithmetic_v
<
A_DataT
>
,
"invalid left hand side type"
);
}
}
public
:
DataVariant
execute
(
ExecutionPolicy
&
exec_policy
)
{
try
{
return
this
->
_eval
(
m_node
.
children
[
0
]
->
execute
(
exec_policy
),
m_node
.
children
[
1
]
->
execute
(
exec_policy
));
}
catch
(
const
NormalError
&
error
)
{
throw
ParseError
(
error
.
what
(),
m_node
.
begin
());
}
}
BinaryExpressionProcessor
(
ASTNode
&
node
)
:
m_node
{
node
}
{}
};
template
<
typename
BinaryOpT
,
typename
ValueT
,
typename
A_DataT
,
typename
B_DataT
>
struct
BinaryExpressionProcessor
<
BinaryOpT
,
std
::
shared_ptr
<
ValueT
>
,
std
::
shared_ptr
<
A_DataT
>
,
B_DataT
>
final
:
public
INodeProcessor
{
private:
ASTNode
&
m_node
;
PUGS_INLINE
DataVariant
_eval
(
const
DataVariant
&
a
,
const
DataVariant
&
b
)
{
if
constexpr
((
std
::
is_arithmetic_v
<
B_DataT
>
)
or
(
is_tiny_matrix_v
<
B_DataT
>
)
or
(
is_tiny_vector_v
<
B_DataT
>
))
{
const
auto
&
embedded_a
=
std
::
get
<
EmbeddedData
>
(
a
);
const
auto
&
b_value
=
std
::
get
<
B_DataT
>
(
b
);
std
::
shared_ptr
a_ptr
=
dynamic_cast
<
const
DataHandler
<
A_DataT
>&>
(
embedded_a
.
get
()).
data_ptr
();
return
EmbeddedData
(
std
::
make_shared
<
DataHandler
<
ValueT
>>
(
BinOp
<
BinaryOpT
>
().
eval
(
a_ptr
,
b_value
)));
}
else
{
static_assert
(
std
::
is_arithmetic_v
<
B_DataT
>
,
"invalid right hand side type"
);
}
}
public
:
DataVariant
execute
(
ExecutionPolicy
&
exec_policy
)
{
try
{
return
this
->
_eval
(
m_node
.
children
[
0
]
->
execute
(
exec_policy
),
m_node
.
children
[
1
]
->
execute
(
exec_policy
));
}
catch
(
const
NormalError
&
error
)
{
throw
ParseError
(
error
.
what
(),
m_node
.
begin
());
}
}
BinaryExpressionProcessor
(
ASTNode
&
node
)
:
m_node
{
node
}
{}
};
#endif // BINARY_OPERATOR_PROCESSOR_BUILDER_HPP
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment