sorter.h File Reference

sorter. More...

#include "abacus/array.h"
#include "abacus/sorter.inc"

Go to the source code of this file.

Classes
class	ABA_SORTER< ItemType, KeyType >
	This class implements several functions for sorting arrays according to increasing keys. More...

---

Detailed Description

sorter.

Author:

Matthias Elf

This class implements several functions for sorting arrays according to increasing keys. We encapsulate these functions in order to avoid name conflicts. Moreover, instead of local variables in the sorting functions we can provide within the class variables for swapping in order to speed up the sorting.

The sorting functions do not keep the elements of the array storing the keys in place but resort it in parallel with the array storing the items.

License:

This file is part of ABACUS - A Branch And CUt System Copyright (C) 1995 - 2003 University of Cologne, Germany

This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version.

This library 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 Lesser General Public License for more details.

You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA

See also:

http://www.gnu.org/copyleft/gpl.html

Definition in file sorter.h.

---