load_binary_tree_from_random_access_iterator.h

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.             *
 ***************************************************************************/

#ifndef load_binary_tree_from_random_access_iterator_h
#define load_binary_tree_from_random_access_iterator_h

template< class pnt, class mp, typename to_map_element>
  void breadth_first_load_binary_tree_from_random_access_iterator( pnt begin,  pnt end, mp& container, to_map_element tme)
{
  unsigned long long len = end - begin;
  pnt *pointer_array = new pnt[len];
  unsigned long long i, j;
  for (i=0; i<len; ++i) {
    pointer_array[i] = begin + i;
  }

  if (!container.empty()) {
    container.clear();
  }

  unsigned long long step_size = len;
  j = len;
  while(step_size > 0) {
    for (i = step_size >> 1; i < len; i += step_size) {
      if (pointer_array[i] != end) {
        container.insert( tme( *pointer_array[i]));
        pointer_array[i] = end;
      }
    }
    step_size >>= 1;
  }

  delete[] pointer_array;
}

#endif

---