From 01f25e42f7bc292727bbbd69a9af2c136e902c1e Mon Sep 17 00:00:00 2001
From: jwellbelove <github@wellbelove.co.uk>
Date: Thu, 18 Dec 2014 12:13:05 +0000
Subject: [PATCH] class to typename

---
 algorithm.h | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/algorithm.h b/algorithm.h
index 1f103491..29da512b 100644
--- a/algorithm.h
+++ b/algorithm.h
@@ -163,7 +163,7 @@ namespace etl
   ///\ingroup algorithm
   ///<a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted"></a>
   //***************************************************************************
-  template<class TIterator>
+  template<typename TIterator>
   bool is_sorted(TIterator begin, TIterator end)
   {
     return etl::is_sorted_until(begin, end) == end;
@@ -174,7 +174,7 @@ namespace etl
   ///\ingroup algorithm
   ///<a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted"></a>
   //***************************************************************************
-  template<class TIterator, class TCompare>
+  template<typename TIterator, typename TCompare>
   bool is_sorted(TIterator begin, TIterator end, TCompare compare)
   {
     return etl::is_sorted_until(begin, end, compare) == end;
@@ -422,7 +422,7 @@ namespace etl
   ///<a href="http://en.cppreference.com/w/cpp/algorithm/partition_point"></a>
   ///\ingroup algorithm
   //***************************************************************************
-  template <class TIterator, class TUnaryPredicate>
+  template <typename TIterator, typename TUnaryPredicate>
   TIterator partition_point(TIterator begin, TIterator end, TUnaryPredicate predicate)
   {
     while (begin != end)