demo_load_map_from_slist.cpp

Go to the documentation of this file.

/***************************************************************************
 *   Copyright (C) 2009 by Clark Sims                                      *
 *   http://AcumenSoftwareInc.com/WhoWeAre/Clark_Sims3.html                *
 *   ClarkSims@AcumenSoftwareInc.com                                       *
 *                                                                         *
 *   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 2 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, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
 ***************************************************************************/

#include "load_binary_tree_from_forward_iterator.h"

#include <iostream>
#include <string>
#include <map>
#include <iterator>
#include <ext/slist>

using namespace std;
using namespace __gnu_cxx;

struct employee {
  int ssn;
  string name;

  bool operator< ( const employee& rhs) const
  {
    return ssn < rhs.ssn;
  }

  friend ostream& operator << ( ostream& os, const employee& e);
};

ostream& operator << ( ostream& os, const employee& e) {
  os << "{ " << e.ssn << ", " << e.name << "}";
  return os;
}

std::pair<int,employee> create_map_pair( const employee& e)
{
  return std::make_pair( e.ssn, e);
}

ostream& operator << ( ostream& os, const std::pair<int,employee>& e) {
  os << e.second;
  return os;
}

struct Create_Map_Pair {
  int id_offset;

  Create_Map_Pair( int id_offset) : id_offset( id_offset)
  {
  }

  Create_Map_Pair( const Create_Map_Pair& rhs) : id_offset( rhs.id_offset) {
  }

  inline std::pair<int,employee> operator()( const employee& e)
  {
    return std::make_pair( e.ssn + id_offset, e);
  }
};

employee workers[] = {
  { 1,   "Jack"},
  { 2,   "Harry"},
  { 3,   "Joe"},
  { 4,   "Jack"},
  { 5,   "Harry"},
  { 6,   "Joe"},
  { 7,   "Jack"},
  { 8,   "Harry"},
  { 9,   "Joe"},
};

int main() {
  map<int,employee> a_map;

  size_t number_workers = sizeof(workers) / sizeof(employee);
  const slist<employee> Workers( &workers[0], &workers[number_workers]);

  Create_Map_Pair cmp( 1000);

  breadth_first_load_binary_tree_from_forward_iterator( Workers.begin(), Workers.end(), a_map, cmp);

  cout << "results from calling functor cmp for a map" << endl;
  std::copy(a_map.begin(), a_map.end(), std::ostream_iterator<std::pair<int,employee> >(std::cout, "\n"));

  breadth_first_load_binary_tree_from_forward_iterator( Workers.begin(), Workers.end(), a_map, create_map_pair);

  cout << "results from calling function create_map_pair a map" << endl;
  std::copy(a_map.begin(), a_map.end(), std::ostream_iterator<std::pair<int,employee> >(std::cout, "\n"));

  multimap<int,employee> a_multimap;

  breadth_first_load_binary_tree_from_forward_iterator( Workers.begin(), Workers.end(), a_multimap, cmp);

  cout << "results from calling functor cmp for a multimap" << endl;
  std::copy(a_multimap.begin(), a_multimap.end(), std::ostream_iterator<std::pair<int,employee> >(std::cout, "\n"));

  cout << "results from calling function create_map_pair a multimap" << endl;
  std::copy(a_multimap.begin(), a_multimap.end(), std::ostream_iterator<std::pair<int,employee> >(std::cout, "\n"));


  return 0;
}

---