1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
|
From de4089f8cbe0baffe56a363cc3a41595cc8f0809 Mon Sep 17 00:00:00 2001
From: ankurverma85 <31362771+ankurverma85@users.noreply.github.com>
Date: Mon, 10 May 2021 12:50:08 -0700
Subject: [PATCH] GCC11/Libstdc++11 Compilation fixes (#7599)
Authored-by: Ankur Verma <ankurv@microsoft.com>
---
include/onnxruntime/core/graph/graph_nodes.h | 2 +-
onnxruntime/test/providers/cpu/controlflow/loop_test.cc | 1 +
2 files changed, 2 insertions(+), 1 deletion(-)
diff --git a/include/onnxruntime/core/graph/graph_nodes.h b/include/onnxruntime/core/graph/graph_nodes.h
index 422fe9538ea..aec603f7942 100644
--- a/include/onnxruntime/core/graph/graph_nodes.h
+++ b/include/onnxruntime/core/graph/graph_nodes.h
@@ -100,7 +100,7 @@ class ValidNodes {
using const_reference = const T&;
/** Construct a NodeInterator and move to the first valid node. */
- NodeIterator<TIterator>(const TIterator current, const TIterator end, const NodeFilterFunc& filter_fn) noexcept
+ NodeIterator(const TIterator current, const TIterator end, const NodeFilterFunc& filter_fn) noexcept
: current_{current}, end_{end}, apply_filter_{filter_fn != nullptr}, filter_func_{&filter_fn} {
// skip to next valid node, stopping at end if none are found
while (current_ < end && (*current_ == nullptr ||
diff --git a/onnxruntime/test/providers/cpu/controlflow/loop_test.cc b/onnxruntime/test/providers/cpu/controlflow/loop_test.cc
index b058e9a16c7..3cf147e997c 100644
--- a/onnxruntime/test/providers/cpu/controlflow/loop_test.cc
+++ b/onnxruntime/test/providers/cpu/controlflow/loop_test.cc
@@ -2,6 +2,7 @@
// Licensed under the MIT License.
#include <future>
+#include <thread>
#include "gtest/gtest.h"
#include "gmock/gmock.h"
|
