comparable_list.h

#pragma once
 
 
 
#include "comparable_eq_list.h"
 
 
template < class TYPE, class ARG_TYPE = const TYPE &, class LIST_BASE = comparable_eq_list_base < TYPE, ARG_TYPE > >
class comparable_list_base :
   public LIST_BASE
{
public:
 
 
   using BASE_LIST = LIST_BASE;
 
 
   using BASE_LIST::BASE_LIST;
   using BASE_LIST::operator = ;
 
   //comparable_list_base();
   //comparable_list_base(const comparable_list_base & array);
 
   //void quick_sort(bool bAsc = true);
 
   TYPE maximum(TYPE minimum);
 
 
 
};
 
//template < class TYPE, class ARG_TYPE, class LIST_TYPE>
//comparable_list_base<  TYPE,  ARG_TYPE,  LIST_TYPE>::
//comparable_list_base()
//{
//}
 
 
//template < class TYPE, class ARG_TYPE, class LIST_TYPE>
//comparable_list_base<  TYPE,  ARG_TYPE,  LIST_TYPE>::
//comparable_list_base(const comparable_list_base<  TYPE,  ARG_TYPE,  LIST_TYPE> & l) :
//LIST_TYPE(l)
//{
//
//}
 
 
template < class TYPE, class ARG_TYPE, class LIST_TYPE>
TYPE comparable_list_base<  TYPE,  ARG_TYPE,  LIST_TYPE>::
maximum(TYPE maximum)
{
 
   auto p = this->begin();
 
   while(p)
   {
 
      if(*p > maximum)
      {
 
         maximum = *p;
 
      }
 
      p++;
 
   }
 
   return maximum;
 
}
 
 
 
//#include "sort.h"
 
 
 
 
//
//template < class TYPE, class ARG_TYPE, class ARRAY_TYPE>
//void comparable_list_base<  TYPE,  ARG_TYPE,  ARRAY_TYPE>::
//quick_sort(bool bAscendent)
//{
//
//   sort::quick_sort(*this, bAscendent);
//
//}