Skip to content
Projects
Groups
Snippets
Help
Loading...
Sign in / Register
Toggle navigation
N
ngraph
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Packages
Packages
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
submodule
ngraph
Commits
4f2316e8
Commit
4f2316e8
authored
May 04, 2018
by
Nick Korovaiko
Committed by
Scott Cyphers
May 04, 2018
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
rename const_ops to simplifier_ops (#933)
parent
2ce06602
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
4 additions
and
4 deletions
+4
-4
algebraic_simplification.cpp
src/ngraph/pass/algebraic_simplification.cpp
+4
-4
No files found.
src/ngraph/pass/algebraic_simplification.cpp
View file @
4f2316e8
...
...
@@ -218,7 +218,7 @@ static bool simplify_sum(std::shared_ptr<Node> n)
}
static
std
::
unordered_map
<
std
::
type_index
,
std
::
function
<
bool
(
std
::
shared_ptr
<
Node
>
)
>>
initialize_
const_values_to_op
s
()
initialize_
ops_to_simplifier
s
()
{
return
std
::
unordered_map
<
std
::
type_index
,
std
::
function
<
bool
(
std
::
shared_ptr
<
Node
>
)
>>
({
{
TI
(
op
::
Add
),
simplify_add
},
...
...
@@ -228,7 +228,7 @@ static std::unordered_map<std::type_index, std::function<bool(std::shared_ptr<No
}
static
std
::
unordered_map
<
std
::
type_index
,
std
::
function
<
bool
(
std
::
shared_ptr
<
Node
>
)
>>
ops_to_
const_values
=
initialize_const_values_to_op
s
();
ops_to_
simplifiers
=
initialize_ops_to_simplifier
s
();
bool
ngraph
::
pass
::
AlgebraicSimplification
::
run_on_function
(
std
::
shared_ptr
<
ngraph
::
Function
>
f
)
{
...
...
@@ -241,8 +241,8 @@ bool ngraph::pass::AlgebraicSimplification::run_on_function(std::shared_ptr<ngra
}
const
Node
&
node
=
*
n
;
auto
eh
=
ops_to_
const_value
s
.
find
(
TI
(
node
));
if
(
eh
==
ops_to_
const_value
s
.
end
())
auto
eh
=
ops_to_
simplifier
s
.
find
(
TI
(
node
));
if
(
eh
==
ops_to_
simplifier
s
.
end
())
{
continue
;
}
...
...
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