diff options
| author | Hieu Hoang <hieuhoang@gmail.com> | 2022-01-07 00:53:24 +0300 |
|---|---|---|
| committer | Hieu Hoang <hieuhoang@gmail.com> | 2022-01-07 00:53:24 +0300 |
| commit | ba9cc85194892e613137e95c92ca9894b93c0d28 (patch) | |
| tree | 3dd45ebc46b16392537797b44076f6da22f9d32f | |
| parent | ddbbf4c7da343ef37a1d9f2fdd9d7547c411b33e (diff) | |
clang once again
| -rw-r--r-- | phrase-extract/syntax-common/tree-inl.h | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/phrase-extract/syntax-common/tree-inl.h b/phrase-extract/syntax-common/tree-inl.h index 811bae2d2..2dae0acb1 100644 --- a/phrase-extract/syntax-common/tree-inl.h +++ b/phrase-extract/syntax-common/tree-inl.h @@ -73,7 +73,7 @@ Tree<T>::PreOrderIter<V>::PreOrderIter(V &t) template<typename T> template<typename V> -Tree<T>::PreOrderIter<V> &Tree<T>::PreOrderIter<V>::operator++() { +typename Tree<T>::template PreOrderIter<V> &Tree<T>::PreOrderIter<V>::operator++() { // If the current node has children then visit the left-most child next. if (!node_->children().empty()) { index_stack_.push(0); @@ -100,7 +100,7 @@ Tree<T>::PreOrderIter<V> &Tree<T>::PreOrderIter<V>::operator++() { template<typename T> template<typename V> -Tree<T>::PreOrderIter<V> Tree<T>::PreOrderIter<V>::operator++(int) { +typename Tree<T>::template PreOrderIter<V> Tree<T>::PreOrderIter<V>::operator++(int) { PreOrderIter tmp(*this); ++*this; return tmp; @@ -162,7 +162,7 @@ Tree<T>::LeafIter<V>::LeafIter(V &t) template<typename T> template<typename V> -Tree<T>::LeafIter<V> &Tree<T>::LeafIter<V>::operator++() { +typename Tree<T>::template LeafIter<V> &Tree<T>::LeafIter<V>::operator++() { // Try node's ancestors until either a node is found with a sibling to the // right or we reach the root (in which case the traversal is complete). V *ancestor = node_->parent_; @@ -187,7 +187,7 @@ Tree<T>::LeafIter<V> &Tree<T>::LeafIter<V>::operator++() { template<typename T> template<typename V> -Tree<T>::LeafIter<V> Tree<T>::LeafIter<V>::operator++(int) { +typename Tree<T>::template LeafIter<V> Tree<T>::LeafIter<V>::operator++(int) { LeafIter tmp(*this); ++*this; return tmp; |