mcsorter.h

Doc++,可以根据你的C/C++和java的源码文件中的注释行自动生成Html说明文件的工具

/*
  McSorter.h

  Copyright (c) 1996 Roland Wunderling, Malte Zoeckler
  Copyright (c) 1998 Michael Meeks
  Copyright (c) 1999-2000 Dragos Acostachioaie

  This file is part of DOC++.

  DOC++ 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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/

#ifndef _MC_SORTER_H
#define _MC_SORTER_H

#include <assert.h>

/** @name sorting functions */
//@{
/** Sorts an array #t# holding #n# elements of type #T# using #c# for
    comparisions.

    Class #COMPARATOR# must be provide an overloaded
    #operator()(const T& t1, const T& t2)#, that returns
    \begin{description}
    \item[#<0#]		if #t1# is to appear before #t2#,
    \item[#==0#]	if #t1# and #t2# can appear in any order or
    \item[#>0#]		if #t1# is to appear after #t2#.
    \end{description}
*/
template< class COMPARATOR, class T >
void sort(T *t, int end, COMPARATOR& compare, int start = 0)
{
    int	i0, i1, j;
    double c;

    T work, mid, tmp;

    work = t[start];
    t[start] = t[(start + end) / 2];
    t[(start + end) / 2] = work;

    mid = t[start];
    work = t[end - 1];

    for(i0 = i1 = start, j = end - 1; i1 < j;)
	{
	c = compare(mid, work);
	if(c > 0)
	    {
	    tmp = t[i0];
	    t[i0] = work;
	    i0++;
	    i1++;
	    work = t[i1];
	    t[i1] = tmp;
	    }
	else
	    if(c < 0)
		{
		t[j] = work;
		--j;
		work = t[j];
		}
	    else
		{
		i1++;
		tmp = t[i1];
		t[i1] = work;
		work = tmp;
		}
	}

    if(start < i0 - 1)
	sort(t, i0, compare, start);
    if(i1 + 1 < end)
	sort(t, end, compare, i1 + 1);
}

#ifdef not_true
#ifndef	_CRAYMPP
/** Sorts an array #t# holding #n# elements of type #T#, which must provide an
    #operator>#.
*/
template< class T >
void sort(T *t, int n)
{
    class
	{
	int operator()(T i, T j)
	    {
	    return(i < j) ? -1 : ((j < i) ? 1 : 0);
            }
	} c;
    sort(t, n, c, 0);
}
#endif
#endif
//@}

#endif