hyzboy/CMUtil
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

updated codes of SortBase

Browse Source
This commit is contained in:
hyzboy 2024-12-12 13:21:34 +08:00
parent a7f4afab80
commit 6582b635c9
1 changed files with 165 additions and 156 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
inc/hgl/util/sort/Sort.h
View File

@ -1,10 +1,11 @@
#ifndef HGL_ALGORITHM_SORT_INCLUDE
#define HGL_ALGORITHM_SORT_INCLUDE
#pragma once
#include<hgl/CompOperator.h>
#include<hgl/Comparator.h>
#include<hgl/type/List.h>
#include<string.h>
namespace hgl
{
template<typename T> class SortBase
{
protected:
@ -12,17 +13,24 @@ protected:
T *buffer; //数据
int number; //数据个数
Comparator<T> *comp; //比较函数类
ItemComparator<T> *comp; //比较函数类
public:
SortBase(ItemComparator<T> *c)
{
buffer=nullptr;
number=0;
comp=c;
}
/**
* 本类构造函数
* @param buf 数据缓冲区
* @param n 数据个数
* @param c 数据大小比较类
*/
SortBase(T *buf,int n,Comparator<T> *c)
SortBase(T *buf,int n,ItemComparator<T> *c)
{
buffer =buf;
number =n;
@ -105,7 +113,7 @@ public:
* @param n 数据个数
* @param c 数据大小比较类
*/
HeapSort(T *buf,int n,Comparator<T> *c=new Comparator<T>()):SortBase<T>(buf,n,c)
HeapSort(T *buf,int n,ItemComparator<T> *c=new ItemComparator<T>()):SortBase<T>(buf,n,c)
{
}
@ -132,7 +140,7 @@ public:
};//class HeapSort:public SortBase<T>
template<typename T>
bool Sort(T *data,int count,Comparator<T> *comp)
bool Sort(T *data,int count,ItemComparator<T> *comp)
{
HeapSort<T> hs(data,count,comp);
@ -151,7 +159,7 @@ bool Sort(T *data,int count)
template<typename T>
bool Sort(hgl::DataArray<T> &list,Comparator<T> *comp)
bool Sort(hgl::DataArray<T> &list,ItemComparator<T> *comp)
{
return Sort(list.GetData(),
list.GetCount(),
@ -161,14 +169,14 @@ bool Sort(hgl::DataArray<T> &list,Comparator<T> *comp)
template<typename T>
bool Sort(hgl::DataArray<T> &list)
{
Comparator<T> rnc;
ItemComparator<T> rnc;
return Sort<T>(list,&rnc);
}
/*
//仅实现模拟虚拟成员函数即可，无需整个类重载
template<> int Comparator<BagCell>::compare(const BagCell &it1,const BagCell &it2) const
template<> int ItemComparator<BagCell>::compare(const BagCell &it1,const BagCell &it2) const
{
int r=it1.GetItemID()-it2.GetItemID();
@ -187,4 +195,5 @@ void BagManage::Sort()
hgl::Sort<BagCell>(cell_list,BAG_SLOT_COUNT,&comp_baginfo);
}
*/
#endif//HGL_ALGORITHM_SORT_INCLUDE
}//namespace hgl