test_search.C

Go to the documentation of this file.

 
/* Aleph-w
 
     / \  | | ___ _ __ | |__      __      __
    / _ \ | |/ _ \ '_ \| '_ \ ____\ \ /\ / / Data structures & Algorithms
   / ___ \| |  __/ |_) | | | |_____\ V  V /  version 1.9c
  /_/   \_\_|\___| .__/|_| |_|      \_/\_/   https://github.com/lrleon/Aleph-w
                 |_|         
 
  This file is part of Aleph-w library
 
  Copyright (c) 2002-2018 Leandro Rabindranath Leon 
 
  This program is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
 
  This program is distributed in the hope that it will be useful, but
  WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  General Public License for more details.
 
  You should have received a copy of the GNU General Public License
  along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
 
# include <iostream>
# include <tpl_sort_utils.H>
 
using namespace std;
 
int main()
{
  {
    Dnode<int> list;
 
    for (int i = 0; i < 100; i++)
      list.insert( new Dnode<int> (i) );
 
    sequential_search<int, Aleph::less<int> >(list, 10);
  }
 
  {
    DynDlist<int> list;
 
    for (int i = 0; i < 100; i++)
      list.insert(i);
 
    int * ptr = sequential_search (list, 10);
 
    cout << *ptr << endl;
 
    ptr = search_extreme(list);
 
    cout << *ptr << endl;
 
    ptr = search_max(list);
 
    cout << *ptr << endl;
  }
 
}