Compare commits

10 Commits

Author SHA1 Message Date
/* User with id == 0 is a fake user from git author */ sauron
a4c6342573 commit 2025-08-18 00:18 edit ZCppMain/ZtCObjList.H : add ZtCExamObjList 2025-08-18 00:29:37 +09:00
/* User with id == 0 is a fake user from git author */ sauron
af60e817f3 commit 2025-08-17 16:01 edit ZCppMain/ZtCStringEx.H : correct double TypeLength typedef 2025-08-17 16:01:36 +09:00
/* User with id == 0 is a fake user from git author */ sauron
a878376507 commit 2025-08-17 15:25 edit ZCppMain/ZtCSortObjList.H : add 'include ZCppMain/ZtCArray.H and ZCppMain/ZtCArray.H 2025-08-17 15:44:23 +09:00
/* User with id == 0 is a fake user from git author */ sauron
b56e7a66c0 commit 2025-08-17 15:25 edit ZCppMain/ZtCObjList.H : __ZCPPMAIIN__ZTCOBJLIST_H__ => __ZCPPMAIN__ZTCOBJLIST_H__ 2025-08-17 15:32:44 +09:00
/* User with id == 0 is a fake user from git author */ sauron
69b2ed8018 commit 2025-08-17 15:25 edit ZCppMain/ZtCSortObjList.H : add ZNsExam::ZtCSortIntList 2025-08-17 15:26:37 +09:00
/* User with id == 0 is a fake user from git author */ sauron
1dd4a87e75 commit 2025-08-17 02:54 utf8 변환 : some files 2025-08-17 02:54:18 +09:00
/* User with id == 0 is a fake user from git author */ sauron
95527d0544 commit 2025-08-17 02:51 utf8 변환 : ZCppMain/ZtCSortObjList.H 2025-08-17 02:51:48 +09:00
/* User with id == 0 is a fake user from git author */ sauron
d67337476f commit 2025-08-17 02:47 is coding ZCppMain/ZtCSortObjList.H 시험이 필요 2025-08-17 02:48:15 +09:00
/* User with id == 0 is a fake user from git author */ sauron
56fe854723 commit 2025-08-16 34:34 edit ZCppMain/ZtCLoadDataBlock.H
ZCLoadDataBlock1 과 ZCLoadDataBlock2 의 소속을 ZNsExam 에서 ZNsExam::ZtCDummy 로 옮김
2025-08-17 01:06:21 +09:00
/* User with id == 0 is a fake user from git author */ sauron
f7636ecc5d commit 2025-08-16 34:34
git add ZCppMain/ZMainHead.H
git add ZCppMain/ZtCArray.H
git add ZCppMain/ZtCObjList.H
git add ZCppMain/ZMainAVL.H
git add ZCppMain/ZMainHeadEx.H
git add ZCppMain/ZMainXhtml.H
git add ZCppMain/ZtCLoadDataBlock.H
git add ZCppMain/ZtCMainChars.H
git add ZCppMain/ZtCObjAVL.H
git add ZCppMain/ZtCStringEx.H
git add ZCppMain/ZtCTreeData.H
2025-08-16 23:35:44 +09:00
12 changed files with 30676 additions and 1315 deletions

360
ZCppMain/ZMainAVL.H Normal file
View File

@ -0,0 +1,360 @@

#ifndef __ZCPPMAIN_ZMAINAVL_H__
#define __ZCPPMAIN_ZMAINAVL_H__
#include "ZCppMain/ZMainHead.H"
namespace ZNsMain
{
namespace ZNsEnum
{
enum ZEAVL_INSERT
{
ZEAVL_INSERT_RIGHT = +1,
ZEAVL_INSERT_OK = 0, /* 삽입 후의 평형계수가 0 이다. */
ZEAVL_INSERT_LEFT = -1,
ZEAVL_INSERT_NONE = -2 /* 삽입 안 됨 */
};/*
enum ZEAVL_INSERT*/
}/*
namespace ZNsEnum*/
namespace ZNsInterface
{
template<typename TypeArg> class ZtCAVL_BASE
{
protected:
template<typename TNode> void OnEqual(TypeArg AR_Data, TNode* AP_Node)
{
}/*
template<typename TNode> void OnEqual(TypeArg AR_Data, TNode* AP_Node) */
template<typename TKey, typename TNode> void OnEqualKey(TKey AR_Key, TNode* AP_Node)
{
}/*
template<typename TKey, typename TNode> void OnEqualKey(TKey AR_Key, TNode* AP_Node) */
protected:
};/*
template<typename TypeArg> class ZtCAVL_BASE*/
/*//////////////////////////////////////////////////////////////////////////
■ 아래 ZtCAVL_NodeBase<> 의 각 멤버 함수는 ZtCAVL_BASE<> 의 멤버 함수보다
인수가 하나 줄어든 것을 볼 수 있다. ZtCAVL_BASE<> 에서 같은 이름의 함수를
자연스럽게 호출할 수 있게 한 것이다. 따라서 ZtCAVL_BASE<> 의 멤버 함수에
서, AP_Node->OnEqual() 등으로 ZtCAVL_NodeBase<> 의 멤버 함수를 호출해 주
지 않으면, ZtCAVL_NodeBase<> 의 멤버는 어디에서도 호출되지 않는다. 왜 최초
에 이런 식으로 설계했을까. 한참 생각했는데, 아마 ZtCAVL_Multi_BASE<> 와
ZtCAVL_Multi_NodeBase<> 를 사용할려고 그랬을 것이다.
-- 2012-09-03 19:20:00
//////////////////////////////////////////////////////////////////////////*/
template<typename TNodeArg> class ZtCAVL_NodeBase
{
protected:
void OnEqual(TNodeArg AR_Data)
{
}/*
void OnEqual(TNodeArg AR_Data)*/
template<typename TKey> void OnEqualKey(TKey AR_Key)
{
}/*
template<typename TKey> void OnEqualKey(TKey AR_Key)*/
protected:
};/*
template<typename TNodeArg> class ZtCAVL_NodeBase*/
template<typename TypeArg> class ZtCAVL_Multi_BASE
{
protected:
template<typename TNode> void OnEqual(TypeArg AR_Data, TNode* AP_Node)
{
AP_Node->OnEqual(AR_Data);
}/*
template<typename TNode> void OnEqual(TypeArg AR_Data, TNode* AP_Node) */
template<typename TKey, typename TNode> void OnEqualKey(TKey AR_Key, TNode* AP_Node)
{
AP_Node->OnEqualKey(AR_Key);
}/*
template<typename TKey, typename TNode> void OnEqualKey(TKey AR_Key, TNode* AP_Node) */
protected:
};/*
template<typename TypeArg> class ZtCAVL_Multi_BASE*/
/*//////////////////////////////////////////////////////////////
■ ZtCAVL_Multi_NodeBase template 로 multi set/map 을 구성하는 경우,
ZtCAVL_Multi_NodeBase::TypeEqual 자료형에 접근하는 예.
class CTypeMy
{
public:
typedef CLargeAVL<some param> CLargeMap;
typedef typename CLargeMap::ZCNode::TypeEqual TypeEqual;
}
//////////////////////////////////////////////////////////////*/
template< typename TNodeArg, typename TEqualList
>
class ZtCAVL_Multi_NodeBase ////////////////////
{
public :
typedef TEqualList TypeEqual;
protected:
TEqualList mo_EqualList;
public :
void OnEqual(TNodeArg AR_Data)
{
mo_EqualList.push_back(AR_Data);
}/*
void OnEqual(TNodeArg AR_Data)*/
template<typename TKey> void OnEqualKey(TKey AR_Key)
{
mo_EqualList.push_back(AR_Key);
}/*
template<typename TKey> void OnEqualKey(TKey AR_Key) */
const TEqualList& GetCEqualList() const
{
return mo_EqualList;
}/*
const TEqualList& GetCEqualList() const*/
public:
};/*
template< typename TNodeArg, typename TEqualList
>
class ZtCAVL_Multi_NodeBase //////////////////*/
/*/////////////////////////////////////////////////////////////////////
■ AVL 트리의 데이타 타입이 포인터인 경우, 포인터를 정수처럼 다루어서
비교 연산자를 정의하는 클래스 템플릿이다.
/////////////////////////////////////////////////////////////////////*/
template<typename TData> class ZtCAVL_PtrLongData
{
public :
typedef TData* TypeData;
protected:
TData* mp_CData;
public :
ZtCAVL_PtrLongData()
{
mp_CData=0;
}/*
ZtCAVL_PtrLongData()*/
TData* GetDataPtr() const
{
return mp_CData;
}/*
TData* GetDataPtr() const*/
void SetDataPtr(TData* AP_CData)
{
mp_CData=AP_CData;
}/*
void SetDataPtr(TData* AP_CData)*/
operator ZNsMain::ZTypIntPtr() const
{
return mp_CData;
}/*
operator ZNsMain::ZTypIntPtr() const*/
ZtCAVL_PtrLongData& operator=(const ZtCAVL_PtrLongData& rhs)
{
mp_CData=rhs.mp_CData; return *this;
}/*
ZtCAVL_PtrLongData& operator=(const ZtCAVL_PtrLongData& rhs)*/
ZtCAVL_PtrLongData& operator=(const TData* AP_CData)
{
mp_CData=const_cast<TData*>(AP_CData); return *this;
}/*
ZtCAVL_PtrLongData& operator=(const TData* AP_CData)*/
bool operator==(const ZtCAVL_PtrLongData& rhs) const{return mp_CData==rhs.mp_CData;}
bool operator> (const ZtCAVL_PtrLongData& rhs) const{return (ZNsMain::ZTypIntPtr)mp_CData > (ZNsMain::ZTypIntPtr)rhs.mp_CData;}
bool operator< (const ZtCAVL_PtrLongData& rhs) const{return (ZNsMain::ZTypIntPtr)mp_CData < (ZNsMain::ZTypIntPtr)rhs.mp_CData;}
bool operator==(const TData* AP_CData) const{return mp_CData==AP_CData;}
bool operator> (const TData* AP_CData) const{return (ZNsMain::ZTypIntPtr)mp_CData > (ZNsMain::ZTypIntPtr)AP_CData;}
bool operator< (const TData* AP_CData) const{return (ZNsMain::ZTypIntPtr)mp_CData < (ZNsMain::ZTypIntPtr)AP_CData;}
protected:
};/*
template<typename TData> class ZtCAVL_PtrLongData*/
/* int, long 같이 비교연산이 가능한 primitive 타입이나 object 를
key 로 가지고 있는 경우에, 해당 AVL 트리의 노드 데이타로 바로
쓸 수 있도록 wrap 한 클래스 템플릿 */
template< typename TKeyData ,
typename TMainData,
typename TKeyArg =const TKeyData &,
typename TMainArg=const TMainData&
>
class ZtCAVL_KeyData //////////////////////////
{
public :
typedef TKeyData TypeKey ;
typedef TMainData TypeData;
protected:
TKeyData mo_CKeyData ; mutable
TMainData mo_CMainData;
public :
ZtCAVL_KeyData(){}
ZtCAVL_KeyData(TKeyArg AO_TKeyArg)
{
mo_CKeyData=AO_TKeyArg;
}/*
ZtCAVL_KeyData(TKeyArg AO_TKeyArg)*/
ZtCAVL_KeyData(TKeyArg AO_TKeyArg, TMainArg AO_TMainArg)
{
mo_CKeyData =AO_TKeyArg ;
mo_CMainData=AO_TMainArg;
}/*
ZtCAVL_KeyData(TKeyArg AO_TKeyArg, TMainArg AO_TMainArg)*/
TKeyArg GetCKeyData () const{return mo_CKeyData ;}
TMainArg GetCMainData () const{return mo_CMainData;}
TMainData& GetCMainDataRef() const{return mo_CMainData;}
void SetCMainData(TMainArg AO_TRealArg) const
{
mo_CMainData=AO_TRealArg;
}/*
void SetCMainData(TMainArg AO_TRealArg) const*/
void SetKeyData(TKeyArg AO_TKeylArg)
{
mo_CKeyData=AO_TKeylArg;
}/*
void SetKeyData(TKeyArg AO_TKeylArg)*/
bool operator==(const ZtCAVL_KeyData& rhs) const{return mo_CKeyData==rhs.mo_CKeyData;}
bool operator> (const ZtCAVL_KeyData& rhs) const{return mo_CKeyData> rhs.mo_CKeyData;}
bool operator< (const ZtCAVL_KeyData& rhs) const{return mo_CKeyData< rhs.mo_CKeyData;}
bool operator==(TKeyArg AO_TPrimitive) const{return mo_CKeyData==AO_TPrimitive;}
bool operator> (TKeyArg AO_TPrimitive) const{return mo_CKeyData> AO_TPrimitive;}
bool operator< (TKeyArg AO_TPrimitive) const{return mo_CKeyData< AO_TPrimitive;}
ZtCAVL_KeyData& operator=(const ZtCAVL_KeyData& rhs)
{
if(this==&rhs) return *this;
mo_CKeyData =rhs.mo_CKeyData ;
mo_CMainData=rhs.mo_CMainData; return *this;
}/*
ZtCAVL_KeyData& operator=(const ZtCAVL_KeyData& rhs)*/
ZtCAVL_KeyData& operator=(TKeyArg AO_TPrimitive)
{
mo_CKeyData=AO_TPrimitive; return *this;
}/*
ZtCAVL_KeyData& operator=(TKeyArg AO_TPrimitive)*/
public:
};/*
template< typename TKeyData ,
typename TMainData,
typename TKeyArg =const TKeyData &,
typename TMainArg=const TMainData&
>
class ZtCAVL_KeyData ////////////////////////*/
}/*
namespace ZNsInterface*/
/*/////////////////////////////////////////////////////////////////////////////////////
■ mulit set 으로 활용하는 예제코드
ZNsMain::CLargeAVL ///////////////////////////////////
<
int,
int,
ZNsMain::ZNsInterface::ZtCAVL_Multi_BASE<int>,
ZNsMain::ZNsInterface::ZtCAVL_Multi_NodeBase<int, ZNsMain::ZtCDoubleList<int> >
>
VO_CLargeAvl_Multi; //////////////////////////////////
VO_CLargeAvl_Multi.AddData(1);
VO_CLargeAvl_Multi.AddData(2);
VO_CLargeAvl_Multi.AddData(2);
VO_CLargeAvl_Multi.AddData(2);
VO_CLargeAvl_Multi.AddData(2);
/////////////////////////////////////////////////////////////////////////////////////*/
namespace NsType
{
template< typename TStringData, //= ZNsMain::ZtCStringBase<char> ,
typename TEnvVar , //= ZNsMain::ZNsCGI::ZNsBase::ZtCEnvVar<TStringData>,
typename TEnvVarSet //= ZNsMain::ZtCObjAVL<TEnvVar>
>
class ZtCTypeEnvVarSet /*############################################################*/
{
public:
typedef TStringData ZCStringData;
typedef TEnvVar ZCEnvVar ;
typedef TEnvVarSet ZCEnvVarSet ;
typedef typename ZCEnvVarSet ::ZCNode ZCEnvVarNode;
typedef typename ZCStringData::ZCMainChars ZCMainChars ;
typedef typename ZCStringData::TypeChar TypeChar ;
typedef typename ZCStringData::TypeLength TypeLength ;
public:
};/*
template< typename TStringData, //= ZNsMain::ZtCStringBase<char> ,
typename TEnvVar , //= ZNsMain::ZNsCGI::ZNsBase::ZtCEnvVar<TStringData>,
typename TEnvVarSet //= NsCPP::ZtCObjAVL<TEnvVar>
>
class ZtCTypeEnvVarSet /*############################################################*/
}/*
namespace NsType*/
}/*
namespace ZNsMain */
#endif // __ZCPPMAIN_ZMAINAVL_H__

File diff suppressed because it is too large Load Diff

7194
ZCppMain/ZMainHeadEx.H Normal file

File diff suppressed because it is too large Load Diff

38
ZCppMain/ZMainXhtml.H Normal file
View File

@ -0,0 +1,38 @@

#ifndef __ZCPPMAIIN__ZMAINXHTML_H__
#define __ZCPPMAIIN__ZMAINXHTML_H__
namespace ZNsMain
{
template<typename TStringData> TStringData& ZftConvertXhtml(TStringData& ARR_CString)
{
/* 데이타를 그대로 클라이언트에 전송하면
HTML 태그와 혼동될 수 있는데 이를 방지하기 위해
적절히 인코딩한다.
*/
return ARR_CString.
Replace("&" ,"&amp;" ). Replace("<" ,"&lt;" ).
Replace(">" ,"&gt;" ). Replace(" " ,"&nbsp;" ).
Replace("\n","<br />" );
}/*
template<typename TStringData> static TStringData& ConvertXhtml(TStringData& ARR_CString) */
template<typename TStringData> TStringData& ZftConvertXhtmlAtt(TStringData& ARR_CString)
{
// X(H)TML 의 속성에 올 수 있는 값으로 인코딩한다.
return ARR_CString.
Replace("&" ,"&amp;" ). Replace("<" ,"&lt;" ).
Replace(">" ,"&gt;" ). Replace("\"","&quot;" ).
Replace("\r","&#xA;" ). Replace("\n","&#xD;" );
}/*
template<typename TStringData> TStringData& ZftConvertXhtmlAtt(TStringData& ARR_CString) */
}/*
namespace ZNsMain*/
#endif // __ZCPPMAIIN__ZMAINXHTML_H__

View File

@ -1,7 +1,7 @@

#ifndef __ZTCARRAY_H__
#define __ZTCARRAY_H__
#ifndef __ZCPPMAIIN__ZTCARRAY_H__
#define __ZCPPMAIIN__ZTCARRAY_H__
#include "ZCppMain/ZMainHead.H"
@ -10,15 +10,17 @@
namespace ZNsMain
{
template< typename Type ,
typename TypeArg=const Type&,
template< typename TType ,
typename TTypArg=const TType&,
typename TSize =long
>
class ZtCArray /////////////////////////
class ZtCArray //////////////////////////
{
public:
typedef TType Type ;
typedef TType TypeData;
typedef TTypArg TypeArg ;
typedef TSize TypeSize;
typedef Type TypeData;
typedef ZtCArray ZCArray ;
public:
class ZCIterator;
@ -428,9 +430,8 @@ namespace ZNsMain
++VP_TypeArr;
/* ZtCTypeData 으로 인해서, AO_Functor 이 함수일 때 뿐이 아니라,
operator() 연산자를 가진 object 포인터일 때도 사용할 수 있게 되었다.
*/
/* ZtCTypeData 으로 인해서, AO_Functor 이 함수일 때뿐이 아니라,
operator() 연산자를 가진 object 포인터일 때도 사용할 수 있게 되었다. */
}/*
__for0(TypeSize, i, ml_UseSize)*/
}/*
@ -459,10 +460,87 @@ namespace ZNsMain
형태를 사용하면 좋을 것 같다. -- 2014-06-16 23:11:00
ZCCheckRef::PassData() 으로 인해, 인수를 ZtCRef 클래스를 이용해 인수를 참조
로 넘길 수 있게 되었다. -- 2021-03-10 16:56
ZCCheckRef::PassData() 으로 인해, 인수를 ZtCRef 클래스를 이용해 인수를 참조
로 넘길 수 있게 되었다. -- 2021-03-10 16:56
이제는 ZtCRef 과 ZCCheckRef 클래스 템플릿을 사용하면 된다. -- 2021-03-11 11:00
이제는 ZtCRef 과 ZCCheckRef 클래스 템플릿을 사용하면 된다. -- 2021-03-11 11:00
이제는 ZftMCR() 과 ZftMCP() 을 사용하면 된다. -- 2025-08-07 17:55
■ 예제1 -- 2025-08-07 17:35
#include <iostream>
#include "ZCppMain/ZtCArray.H"
using namespace std ;
using namespace ZNsMain;
int main()
{
ZtCArray<int> myArray;
myArray.AddTail(10);
myArray.AddTail(20);
myArray.AddTail(30);
myArray.AddTail(40);
class CHelpObj
{
public:
CHelpObj()
{
}
CHelpObj(const CHelpObj& rhs)
{
cout<<"* CHelpObj(const CHelpObj& rhs)"<<endl;
}
public:
}; CHelpObj VO_CHelpObj; cout<<"VO_CHelpObj Ptr : "<<&VO_CHelpObj<<endl;
struct StFunctor
{
static void ShowElement(int ArgiValue){cout<<"#1 Value="<<ArgiValue<<endl;}
};
struct StFunctor2
{
static void ShowElement(int ArgiValue, CHelpObj)
{cout<<"#2 Value="<<ArgiValue<<", CHelpObj Addr=None"<<" With CHelpObj"<<endl;}
};
struct StFunctor3
{
static void ShowElement(int ArgiValue, CHelpObj& AR_CHelpObj)
{cout<<"#3 Value="<<ArgiValue<<", HelpObj Ptr="<<&AR_CHelpObj<<" With CHelpObj Ref"<<endl;}
};
struct StFunctor4
{
static void ShowElement(int ArgiValue, CHelpObj& AR_CHelpObj)
{cout<<"#4 Value="<<ArgiValue<<", HelpObj Ptr="<<&AR_CHelpObj<<" With CHelpObj in Ptr"<<endl;}
};
struct StFunctor5
{
static void ShowElement(int ArgiValue, CHelpObj& AR_CHelpObj, CHelpObj& AR_CHelpObj2)
{cout<<"#5 Value="<<ArgiValue<<", HelpObj Ptr="<<&AR_CHelpObj<<" With CHelpObj Ref 2"<<endl;}
};
struct StFunctor6
{
static void ShowElement(int ArgiValue, CHelpObj& AR_CHelpObj, CHelpObj AO_CHelpObj2)
{cout<<"#6 Value="<<ArgiValue<<", HelpObj Ptr="<<&AR_CHelpObj<<" With CHelpObj Half Ref"<<endl;}
};
myArray.IterElement(StFunctor ::ShowElement);
myArray.IterElement(StFunctor2::ShowElement, VO_CHelpObj );
myArray.IterElement(StFunctor3::ShowElement, ZftMCR(VO_CHelpObj) );
myArray.IterElement(StFunctor4::ShowElement, ZftMCP(VO_CHelpObj) );
myArray.IterElement(StFunctor5::ShowElement, ZftMCP(VO_CHelpObj), ZftMCP(VO_CHelpObj) );
myArray.IterElement(StFunctor6::ShowElement, ZftMCP(VO_CHelpObj), VO_CHelpObj );
return 0;
}
/////////////////////////////////////////////////////////////////////////////*/
@ -474,9 +552,9 @@ namespace ZNsMain
__for0(TypeSize, i, ml_UseSize)
{
ZNsMain::ZtCTypeData<TFunctor>::GetObjRef(AO_Functor)
(
*VP_TypeArr, ZCCheckRef::PassData(AO_TypeHelp)
);
(
*VP_TypeArr, ZCCheckRef::PassData(AO_TypeHelp)
);
++VP_TypeArr; ///////////////////////////////////////
}/*
__for0(TypeSize, i, ml_UseSize)*/
@ -486,8 +564,7 @@ namespace ZNsMain
template<typename TFunctor, typename TTypeHelp1, typename TTypeHelp2>
void IterElement(TFunctor AO_Functor,
TTypeHelp1 AO_TypeHelp1, TTypeHelp2 AO_TypeHelp2)
void IterElement(TFunctor AO_Functor, TTypeHelp1 AO_TypeHelp1, TTypeHelp2 AO_TypeHelp2)
{
/*/////////////////////////////////////////////////////////////////////////////
@ -531,8 +608,7 @@ namespace ZNsMain
__for0(TypeSize, i, ml_UseSize)*/
}/*
template<typename TFunctor, typename TTypeHelp1, typename TTypeHelp2>
void IterElement(TFunctor AO_Functor,
TTypeHelp1 AO_TypeHelp1, TTypeHelp2 AO_TypeHelp2)*/
void IterElement(TFunctor AO_Functor, TTypeHelp1 AO_TypeHelp1, TTypeHelp2 AO_TypeHelp2)*/
/*///////////////////////////////////////////////////////////////////////////
@ -540,32 +616,92 @@ namespace ZNsMain
■ IterElement() 예제.
#include <iostream>
#include "ZCArray.H"
#include "ZCppMain/ZtCArray.H"
using namespace std ;
using namespace ZNsMain;
int main()
{
std:: ZtCArray<int> myArray;
typedef ZtCArray<int> CArray ;
typedef CArray::IterEasy IterEasy;
myArray.AddTail(10);
myArray.AddTail(20);
myArray.AddTail(30);
myArray.AddTail(40);
CArray VO_Array;
VO_Array.AddTail(10);
VO_Array.AddTail(20);
VO_Array.AddTail(30);
VO_Array.AddTail(40);
class CHelpObj
{
public:
CHelpObj()
{
}
CHelpObj(const CHelpObj& rhs)
{
cout<<"* CHelpObj(const CHelpObj& rhs)"<<endl;
}
public:
}; CHelpObj VO_CHelpObj; cout<<"VO_CHelpObj Ptr : "<<&VO_CHelpObj<<endl;
struct StFunctor
{
static void ShowElement(int ArgiValue){cout<<"# Value="<<ArgiValue<<endl;}
static void ShowElement(int ArgiValue){cout<<"#1 Value="<<ArgiValue<<endl;}
};
struct StFunctor2
{
static void ShowElement(int ArgiValue, CHelpObj)
{cout<<"#2 Value="<<ArgiValue<<", CHelpObj Addr=None"<<" With CHelpObj"<<endl;}
};
struct StFunctor3
{
static void ShowElement(int ArgiValue, CHelpObj& AR_CHelpObj)
{cout<<"#3 Value="<<ArgiValue<<", HelpObj Ptr="<<&AR_CHelpObj<<" With CHelpObj Ref"<<endl;}
};
struct StFunctor4
{
static void ShowElement(int ArgiValue, CHelpObj& AR_CHelpObj)
{cout<<"#4 Value="<<ArgiValue<<", HelpObj Ptr="<<&AR_CHelpObj<<" With CHelpObj in Ptr"<<endl;}
};
struct StFunctor5
{
static void ShowElement(int ArgiValue, CHelpObj& AR_CHelpObj, CHelpObj& AR_CHelpObj2)
{cout<<"#5 Value="<<ArgiValue<<", HelpObj Ptr="<<&AR_CHelpObj<<" With CHelpObj Ref 2"<<endl;}
};
struct StFunctor6
{
static void ShowElement(int ArgiValue, CHelpObj& AR_CHelpObj, CHelpObj AO_CHelpObj2)
{cout<<"#6 Value="<<ArgiValue<<", HelpObj Ptr="<<&AR_CHelpObj<<" With CHelpObj Half Ref"<<endl;}
};
myArray.IterElement(StFunctor::ShowElement);
VO_Array.IterElement(StFunctor ::ShowElement);
VO_Array.IterElement(StFunctor2::ShowElement, VO_CHelpObj );
VO_Array.IterElement(StFunctor3::ShowElement, ZftMCR(VO_CHelpObj) );
VO_Array.IterElement(StFunctor4::ShowElement, ZftMCP(VO_CHelpObj) );
VO_Array.IterElement(StFunctor5::ShowElement, ZftMCP(VO_CHelpObj), ZftMCP(VO_CHelpObj) );
VO_Array.IterElement(StFunctor6::ShowElement, ZftMCP(VO_CHelpObj), VO_CHelpObj );
IterEasy VH_Iter = VO_Array.ItHEasy();
__for1(int, i, VO_Array.size())
{
cout<<i<<"th value="<<VO_Array.ItD(VH_Iter)<<endl; VO_Array.ItNext(VH_Iter);
}
return 0;
}
■ -- 2014-06-16 23:34:00
■ -- 2025-08-07 18:03:00
///////////////////////////////////////////////////////////////////////////*/
@ -596,163 +732,77 @@ namespace ZNsMain
const IterEasyID GetHeadIterEasyID() const{return (IterEasyID) mp_TypeArr ;}
const IterEasyID GetTailIterEasyID() const{return (IterEasyID)(mp_TypeArr+ml_UseSize-1);}
IterEasyID ItHead() {return GetHeadIterEasyID();}
IterEasyID ItTail() {return GetTailIterEasyID();}
void MoveNextIter(Type*& APR_CType ) const{++APR_CType ;}
void MoveNextIter(iterator& ARR_CIterator) const{++ARR_CIterator;}
void MoveNextIter(IterEasyID& AI_IterEasyID) const
{ MoveNextIter((Type*&)AI_IterEasyID); }
void MoveNextIter(const Type*& APR_CType ) const{++APR_CType ;}
void MoveNextIter(const iterator& ARR_CIterator) const{++ARR_CIterator;}
void MoveNextIter(const IterEasyID& AI_IterEasyID)
const{ MoveNextIter((const Type*&)AI_IterEasyID); }
const IterEasyID ItHead() const{return GetHeadIterEasyID();}
const IterEasyID ItTail() const{return GetTailIterEasyID();}
void MovePrevIter(Type*& APR_CType ) const{--APR_CType ;}
void MovePrevIter(iterator& ARR_CIterator) const{--ARR_CIterator;}
void MovePrevIter(IterEasyID& AI_IterEasyID) const
{ MovePrevIter((Type*&)AI_IterEasyID); }
void MovePrevIter(const Type*& APR_CType ) const{--APR_CType ;}
void MovePrevIter(const iterator& ARR_CIterator) const{--ARR_CIterator;}
void MovePrevIter(const IterEasyID& AI_IterEasyID)
const{ MovePrevIter((const Type*&)AI_IterEasyID); }
void MoveNextIter(Type*& APR_CType) const
{
++APR_CType;
}/*
void MoveNextIter(Type*& APR_CType) const*/
void MoveNextIter(iterator& ARR_CIterator) const
{
++ARR_CIterator;
}/*
void MoveNextIter(iterator& ARR_CIterator) const*/
void MoveNextIter(IterEasyID& AI_IterEasyID) const
{
MoveNextIter((Type*&)AI_IterEasyID);
}/*
void MoveNextIter(IterEasyID& AI_IterEasyID) const*/
void MoveNextIter(const Type*& APR_CType) const
{
++APR_CType;
}/*
void MoveNextIter(const Type*& APR_CType) const*/
void MoveNextIter(const iterator& ARR_CIterator) const
{
++ARR_CIterator;
}/*
void MoveNextIter(const iterator& ARR_CIterator) const*/
void MoveNextIter(const IterEasyID& AI_IterEasyID) const
{
MoveNextIter((const Type*&)AI_IterEasyID);
}/*
void MoveNextIter(const IterEasyID& AI_IterEasyID) const*/
void MovePrevIter(Type*& APR_CType) const
{
--APR_CType;
}/*
void MovePrevIter(Type*& APR_CType) const*/
void MovePrevIter(iterator& ARR_CIterator) const
{
--ARR_CIterator;
}/*
void MovePrevIter(iterator& ARR_CIterator) const*/
void MovePrevIter(IterEasyID& AI_IterEasyID) const
{
MovePrevIter((Type*&)AI_IterEasyID);
}/*
void MovePrevIter(IterEasyID& AI_IterEasyID) const*/
void MovePrevIter(const Type*& APR_CType) const
{
--APR_CType;
}/*
void MovePrevIter(const Type*& APR_CType)*/
void MovePrevIter(const iterator& ARR_CIterator) const
{
--ARR_CIterator;
}/*
void MovePrevIter(const iterator& ARR_CIterator) const*/
void MovePrevIter(const IterEasyID& AI_IterEasyID) const
{
MovePrevIter((const Type*&)AI_IterEasyID);
}/*
void MovePrevIter(const IterEasyID& AI_IterEasyID) const*/
Type& GetDataInIter(Type* AP_CType)
{
return *AP_CType;
}/*
Type& GetDataInIter(Type* AP_CType)*/
Type& GetDataInIter(iterator& ARR_CIterator)
{
return *ARR_CIterator;
}/*
Type& GetDataInIter(iterator& ARR_CIterator)*/
Type& GetDataInIter(IterEasyID AI_IterEasyID)
{
return *(Type*)AI_IterEasyID;
}/*
Type& GetDataInIter(IterEasyID AI_IterEasyID)*/
const Type& GetDataInIter(const Type* AP_CType) const
{
return *AP_CType;
}/*
const Type& GetDataInIter(const Type* AP_CType) const*/
const Type& GetDataInIter(const iterator& ARR_CIterator) const
{
return *ARR_CIterator;
}/*
const Type& GetDataInIter(const iterator& ARR_CIterator) const*/
Type& GetDataInIter(Type* AP_CType ){return *AP_CType ;}
Type& GetDataInIter(iterator& ARR_CIterator){return *ARR_CIterator ;}
Type& GetDataInIter(IterEasyID AI_IterEasyID){return *(Type*)AI_IterEasyID;}
const Type& GetDataInIter(const Type* AP_CType ) const{return *AP_CType;}
const Type& GetDataInIter(const iterator& ARR_CIterator) const{return *ARR_CIterator;}
const Type& GetDataInIter(const IterEasyID AI_IterEasyID) const
{
return *(const Type*)AI_IterEasyID;
}/*
const Type& GetDataInIter(const IterEasyID AI_IterEasyID) const*/
{ return *(const Type*)AI_IterEasyID; }
Type& GetDataInIter(Type* AP_Type, TypeSize AI_FarNum)
{
return *(AP_Type + AI_FarNum);
}/*
Type& GetDataInIter(Type* AP_Type, TypeSize AI_FarNum)*/
Type& GetDataInIter(iterator& ARR_CIterator, TypeSize AI_FarNum)
{
return *(ARR_CIterator+AI_FarNum);
}/*
Type& GetDataInIter(iterator& ARR_CIterator, TypeSize AI_FarNum)*/
Type& GetDataInIter(Type* AP_Type , TypeSize AI_FarNum)
{ return *(AP_Type + AI_FarNum) ; }
Type& GetDataInIter(iterator& ARR_CIterator , TypeSize AI_FarNum)
{ return *(ARR_CIterator+AI_FarNum) ; }
Type& GetDataInIter(IterEasyID ARRI_IterEasyID, TypeSize AI_FarNum)
{
return GetDataInIter((Type*)ARRI_IterEasyID, AI_FarNum);
}/*
Type& GetDataInIter(IterEasyID ARRI_IterEasyID, TypeSize AI_FarNum)*/
const Type& GetDataInIter(const Type* AP_Type, TypeSize AI_FarNum) const
{
return *(AP_Type + AI_FarNum);
}/*
const Type& GetDataInIter(const Type* AP_Type, TypeSize AI_FarNum) const*/
{ return GetDataInIter((Type*)ARRI_IterEasyID, AI_FarNum); }
const Type& GetDataInIter(const Type* AP_Type , TypeSize AI_FarNum) const
{ return *(AP_Type + AI_FarNum); }
const Type& GetDataInIter(iterator& ARR_CIterator, TypeSize AI_FarNum) const
{
return *(ARR_CIterator+AI_FarNum);
}/*
const Type& GetDataInIter(iterator& ARR_CIterator, TypeSize AI_FarNum) const*/
{ return *(ARR_CIterator+AI_FarNum); }
const Type& GetDataInIter(const IterEasyID ARRI_IterEasyID, TypeSize AI_FarNum) const
{
return GetDataInIter((const Type*)ARRI_IterEasyID, AI_FarNum);
}/*
const Type& GetDataInIter(const IterEasyID ARRI_IterEasyID, TypeSize AI_FarNum) const*/
{ return GetDataInIter((const Type*)ARRI_IterEasyID, AI_FarNum); }
// 아래 ItD() 함수는 GetDataInIter() 를 짧게 줄인 것이다.
Type* ItHEasy (){return mp_TypeArr ;}
Type* ItTEasy (){return mp_TypeArr+ml_UseSize-1 ;}
IterEasyID ItHID(){return (IterEasyID) mp_TypeArr ;}
IterEasyID ItTID(){return (IterEasyID)(mp_TypeArr+ml_UseSize-1);}
const Type* ItHEasy () const{return mp_TypeArr ;}
const Type* ItTEasy () const{return mp_TypeArr+ml_UseSize-1 ;}
const IterEasyID ItHID() const{return (IterEasyID) mp_TypeArr ;}
const IterEasyID ItTID() const{return (IterEasyID)(mp_TypeArr+ml_UseSize-1);}
void ItNext(Type*& APR_CType ) const{++APR_CType ;}
void ItNext(iterator& ARR_CIterator) const{++ARR_CIterator;}
void ItNext(IterEasyID& AI_IterEasyID) const
{ ItNext((Type*&)AI_IterEasyID); }
void ItNext(const Type*& APR_CType ) const{++APR_CType ;}
void ItNext(const iterator& ARR_CIterator) const{++ARR_CIterator;}
void ItNext(const IterEasyID& AI_IterEasyID)
const{ ItNext((const Type*&)AI_IterEasyID); }
void ItPrev(Type*& APR_CType ) const{--APR_CType ;}
void ItPrev(iterator& ARR_CIterator) const{--ARR_CIterator;}
void ItPrev(IterEasyID& AI_IterEasyID) const
{ ItPrev((Type*&)AI_IterEasyID); }
void ItPrev(const Type*& APR_CType ) const{--APR_CType ;}
void ItPrev(const iterator& ARR_CIterator) const{--ARR_CIterator;}
void ItPrev(const IterEasyID& AI_IterEasyID)
const{ ItPrev((const Type*&)AI_IterEasyID); }
Type& ItD(Type* AP_Type ){return GetDataInIter(AP_Type );}
Type& ItD(iterator& ARR_CIterator ){return GetDataInIter(ARR_CIterator );}
@ -770,11 +820,11 @@ namespace ZNsMain
public:
};/*
template< typename Type ,
typename TypeArg=const Type&,
template< typename TType ,
typename TTypArg=const TType&,
typename TSize =long
>
class ZtCArray ////////////////////////*/
class ZtCArray /////////////////////////*/
//////////////////////////////////////////////
@ -787,21 +837,22 @@ namespace ZNsMain
/*////////////////////////////////////////////////////////////////////
■ class ZtCArrayFixed<> 는 배열 메모리를 자체 할당하지 않고,
■ class ZtCArrayOut<> 는 배열 메모리를 자체 할당하지 않고,
이미 외부에서 new 나 정적으로 선언되어 있는 배열을 사용한다.
따라서 ZtCArrayFixed<> 내부에서 임의로 배열 크기를 조절할 수 없다.
따라서 ZtCArrayOut<> 내부에서 임의로 배열 크기를 조절할 수 없다.
-- 2011-08-05 20:40:00
////////////////////////////////////////////////////////////////////*/
template< typename Type,
template< typename TType,
typename TSize=long
>
class ZtCArrayFixed ///////////
class ZtCArrayOut /////////////
{
public:
typedef Type TypeData;
typedef TType Type ;
typedef Type TypeData;
public:
typedef const Type* const_iterator;
typedef Type* iterator;
@ -810,11 +861,11 @@ namespace ZNsMain
TSize ml_UseSize;
public:
ZtCArrayFixed()
ZtCArrayOut()
{
Init(0, 0);
}
ZtCArrayFixed(TypeData* AP_DataArr, TSize AL_ArrSize)
ZtCArrayOut(TypeData* AP_DataArr, TSize AL_ArrSize)
{
Init(AP_DataArr, AL_ArrSize);
}
@ -985,13 +1036,134 @@ namespace ZNsMain
public:
};/*
template< typename Type,
template< typename TType,
typename TSize=long
>
class ZtCArrayFixed /////////*/
class ZtCArrayOut ///////////*/
template< typename TTypeOjb, ZTypLong ATI_Length=1
>
class ZtCArrayStack //////////////////////////////
{
public :
typedef TTypeOjb TypeData ;
typedef ZTypLong TypeSize ;
public :
enum{ EAllSize=ATI_Length } ;
private:
TypeData moa_Data[ATI_Length] ;
TypeSize ml_UseSize ; // moa_Data 의 실제 사용 길이
public :
ZtCArrayStack(TypeSize AL_StackSize)
{
ml_UseSize = 0;
}/*
ZtCArrayStack(TypeSize AL_StackSize)*/
ZtCArrayStack& operator=(const ZtCArrayStack& rhs)
{
clear(); return (*this)(rhs.data(),rhs.size());
}/*
ZtCArrayStack& operator=(const ZtCArrayStack& rhs)*/
ZtCArrayStack& operator()(const TypeData* AP_Data, TypeSize AL_Length)
{
if(AL_Length<1){ return *this; }
if(AL_Length+ml_UseSize > EAllSize)
{
AL_Length = EAllSize - ml_UseSize;
if(AL_Length<1) return *this;
}/*
if(AL_Length+ml_UseSize > EAllSize)*/
TypeData* VP_Dest= moa_Data+ml_UseSize; const
TypeData* VP_Src = AP_Data ;
ml_UseSize += AL_Length ;
while(--AL_Length>=0)
*VP_Dest++ = *VP_Src++ ;
*VP_Dest=0; return *this;
}/*
ZtCArrayStack& operator()(const TypeData* AP_Data, TypeSize AL_Length)*/
TypeSize GetSize() const
{
return ml_UseSize;
}/*
TypeSize GetSize() const*/
TypeSize GetEmptySize() const
{
return EAllSize - ml_UseSize ;
}/*
TypeSize GetEmptySize() const*/
TypeData* GetData()
{
return moa_Data;
}/*
TypeData* GetData()*/
const TypeData* GetData() const
{
return moa_Data;
}/*
const TypeData* GetData() const*/
void MemCopy(TypeData* AP_Data, TypeSize AL_Length)
{
if(AL_Length<1 || ml_UseSize<1)
return;
if(AL_Length>=ml_UseSize )
::memcpy(AP_Data, moa_Data, sizeof(TypeData)*ml_UseSize);
else
::memcpy(AP_Data, moa_Data, sizeof(TypeData)*AL_Length );
//else
}/*
void MemCopy(TypeData* AP_Data, TypeSize AL_Length)*/
TypeSize size() const
{
return ml_UseSize;
}/*
TypeSize size() const*/
TypeData* data()
{
return moa_Data;
}/*
TypeData* data()*/
const TypeData* data() const
{
return moa_Data;
}/*
const TypeData* data() const*/
void clear()
{
// add codes
}/*
void clear()*/
public:
};/*
template< typename TTypeOjb, typename ZTypLong ATI_Length=1
>
class ZtCArrayStack /////////////////////////////////////*/
}/*
namespace ZNsMain*/
#endif //__ZTCARRAY_H__
#endif //__ZCPPMAIIN__ZTCARRAY_H__

1865
ZCppMain/ZtCLoadDataBlock.H Normal file

File diff suppressed because it is too large Load Diff

7212
ZCppMain/ZtCMainChars.H Normal file

File diff suppressed because it is too large Load Diff

2483
ZCppMain/ZtCObjAVL.H Normal file

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

View File

@ -1,15 +1,843 @@

#ifndef __ZCPPMAIN__ZCSORT_LIST_H__
#define __ZCPPMAIN__ZCSORT_LIST_H__
#include "ZCppMain/ZMainHead.H"
/*////////////////////////////////////////////////////
■ CDoublieList.H 와 CObjList.H 가 include 한다.
-- 2013-04-30 22:57:00
ZtCArray.H 와 ZtCObjList.H 가 include 한다.
-- 2025-08-17 14:37:00
현재는 ZtCArray.H 와 ZtCObjList.H 를 include 한다.
-- 2025-08-17 15:42:00
////////////////////////////////////////////////////*/
#include "ZCppMain/ZtCArray.H"
#include "ZCppMain/ZtCObjList.H"
namespace ZNsMain
{
template<typename TypeObjList> class ZtCSortObjList
// 양방향 연결리스트에 대한 정렬 클래스이다.
template<typename TTypObjList> class ZtCSortObjList
{
public :
typedef typename TTypObjList::ZCLink ZCLink ;
typedef typename TTypObjList::TypeData TypeData;
typedef typename TTypObjList::TypeArg TypeArg ;
typedef typename TTypObjList::TypeSize TypeSize;
private:
static inline bool IsMore(TypeArg AR_LeftType, TypeArg AR_RightType)
{
/* IsMore() 함수와 IsLess() 는 QuickSort() 멤버 함수에서 쓰는
함수 포인터에 대입하기 위해서 정의하였다. */
return AR_LeftType > AR_RightType ;
}/*
static inline bool IsMore(TypeArg AR_LeftType, TypeArg AR_RightType)*/
static inline bool IsLess(TypeArg AR_LeftType, TypeArg AR_RightType)
{
return AR_LeftType < AR_RightType ;
}/*
static inline bool IsLess(TypeArg AR_LeftType, TypeArg AR_RightType)*/
static inline void SwapLinkPtr(ZCLink*& APR_LinkI, ZCLink*& APR_LinkJ)
{
ZCLink* VP_Temp=APR_LinkI; APR_LinkI=APR_LinkJ; APR_LinkJ=VP_Temp;
}/*
static inline void SwapLinkPtr( ZCLink*& APR_LinkI, ZCLink*& APR_LinkJ) */
template
<typename TTypFuncIsMore, typename TTypFuncIsLess>
static void QuickSort
(
TTypFuncIsMore APF_IsMore ,
TTypFuncIsLess APF_IsLess ,
ZCLink* APA_LinkPtrArr[],
TypeSize AL_FirstIndex ,
TypeSize AL_LastIndex
)
/*##################################################*/
{
if(AL_FirstIndex<AL_LastIndex)
{
TypeSize i=AL_FirstIndex ;
TypeSize j=AL_LastIndex+1 ;
ZCLink* VP_PivotLinkPtr=APA_LinkPtrArr[i];
do //////
{
while(AL_LastIndex >i && APF_IsLess(APA_LinkPtrArr[++i]->GetData(), VP_PivotLinkPtr->GetData()));
while(AL_FirstIndex<j && APF_IsMore(APA_LinkPtrArr[--j]->GetData(), VP_PivotLinkPtr->GetData()));
if(i<j) SwapLinkPtr(APA_LinkPtrArr[i], APA_LinkPtrArr[j]);
}
while(i<j);
/* SwapLinkPtr(APA_LinkPtrArr[AL_FirstIndex], APA_LinkPtrArr[j]);
위 코드 보다 아래처럼 2 줄로 쓰는게 별도의 스택 변수를 사용하지
않아서 좋다.
*/
APA_LinkPtrArr[AL_FirstIndex]=APA_LinkPtrArr[j];
APA_LinkPtrArr[j ]=VP_PivotLinkPtr ;
QuickSort(APF_IsMore, APF_IsLess, APA_LinkPtrArr, AL_FirstIndex, j-1 );
QuickSort(APF_IsMore, APF_IsLess, APA_LinkPtrArr, j+1, AL_LastIndex);
}/*
if(AL_FirstIndex<AL_LastIndex)*/
}/*
template
<typename TTypFuncIsMore, typename TTypFuncIsLess>
static void QuickSort
(
TTypFuncIsMore APF_IsMore ,
TTypFuncIsLess APF_IsLess ,
ZCLink* APA_LinkPtrArr[],
TypeSize AL_FirstIndex ,
TypeSize AL_LastIndex
)
###########################################################*/
static void QuickSortAsc
(
ZCLink* APA_LinkPtrArr[], TypeSize AL_FirstIndex, TypeSize AL_LastIndex
)
/*####################*/
{
if(AL_FirstIndex<AL_LastIndex)
{
TypeSize i=AL_FirstIndex ;
TypeSize j=AL_LastIndex+1 ;
ZCLink* VP_PivotLinkPtr=APA_LinkPtrArr[i];
do ////
{
while(AL_LastIndex >i && APA_LinkPtrArr[++i]->GetData() < VP_PivotLinkPtr->GetData());
while(AL_FirstIndex<j && APA_LinkPtrArr[--j]->GetData() > VP_PivotLinkPtr->GetData());
if(i<j) SwapLinkPtr(APA_LinkPtrArr[i], APA_LinkPtrArr[j]);
}
while(i<j);
/* SwapLinkPtr(APA_LinkPtrArr[AL_FirstIndex], APA_LinkPtrArr[j]);
위 코드 보다 아래처럼 2 줄로 쓰는게 별도의 스택 변수를 사용하지 않아서 좋다.*/
APA_LinkPtrArr[AL_FirstIndex]=APA_LinkPtrArr[j];
APA_LinkPtrArr[j ]=VP_PivotLinkPtr ;
QuickSortAsc(APA_LinkPtrArr, AL_FirstIndex, j-1 );
QuickSortAsc(APA_LinkPtrArr, j+1, AL_LastIndex);
}/*
if(AL_FirstIndex<AL_LastIndex)*/
}/*
static void QuickSortAsc
(
ZCLink* APA_LinkPtrArr[], TypeSize AL_FirstIndex, TypeSize AL_LastIndex
)
/*####################*/
static void QuickSortDesc
(
ZCLink* APA_LinkPtrArr[], TypeSize AL_FirstIndex, TypeSize AL_LastIndex
)
/*#####################*/
{
if(AL_FirstIndex<AL_LastIndex)
{
TypeSize i=AL_FirstIndex ;
TypeSize j=AL_LastIndex+1;
ZCLink* VP_PivotLinkPtr=APA_LinkPtrArr[i];
do //////
{
while(AL_LastIndex >i && APA_LinkPtrArr[++i]->GetData() > VP_PivotLinkPtr->GetData());
while(AL_FirstIndex<j && APA_LinkPtrArr[--j]->GetData() < VP_PivotLinkPtr->GetData());
if(i<j) SwapLinkPtr(APA_LinkPtrArr[i], APA_LinkPtrArr[j]);
}
while(i<j);
/* SwapLinkPtr(APA_LinkPtrArr[AL_FirstIndex], APA_LinkPtrArr[j]);
위 코드 보다 아래처럼 2 줄로 쓰는게 별도의 스택 변수를 사용하지
않아서 좋다.
*/
APA_LinkPtrArr[AL_FirstIndex]=APA_LinkPtrArr[j];
APA_LinkPtrArr[j ]=VP_PivotLinkPtr ;
QuickSortDesc(APA_LinkPtrArr, AL_FirstIndex, j-1);
QuickSortDesc(APA_LinkPtrArr, j+1, AL_LastIndex);
}/*
if(AL_FirstIndex<AL_LastIndex)*/
}/*
static void QuickSortDesc
(
ZCLink* APA_LinkPtrArr[], TypeSize AL_FirstIndex, TypeSize AL_LastIndex
)
/*#####################*/
/*private:*/
public :
static void QuickSort(TTypObjList& ARR_CObjList, bool AB_IsAscending=true)
{
if(ARR_CObjList.GetSize()<=1) return;
TypeSize VL_SortSize = ARR_CObjList.GetSize() ;
ZCLink** VPP_LinkPtrArr = new ZCLink*[VL_SortSize];
if(VPP_LinkPtrArr==0)
{
// Add codes for memory over
return;
}/*
if(VPP_LinkPtrArr==0)*/
ZCLink* VP_TempLink =
ARR_CObjList.GetHeadLinkPtr();
TypeSize i=0 ;
for(; i<VL_SortSize; ++i)
{
VPP_LinkPtrArr[i] =VP_TempLink;
VP_TempLink =VP_TempLink->GetNextPtr();
}/*
for(; i<VL_SortSize; ++i)*/
if(AB_IsAscending==true)
QuickSortAsc (VPP_LinkPtrArr, 0, VL_SortSize-1);
else QuickSortDesc(VPP_LinkPtrArr, 0, VL_SortSize-1);
for(i=1; i<VL_SortSize; ++i) // VL_SortSize-1 번 순환
{
ZCLink::JoinLink(VPP_LinkPtrArr[i-1], VPP_LinkPtrArr[i]);
}/*
//////////////////////////*/
ZCLink::MakeCircle
(VPP_LinkPtrArr[0], VPP_LinkPtrArr[VL_SortSize-1]);
ARR_CObjList.mp_HeadLink = VPP_LinkPtrArr[0];
delete[] VPP_LinkPtrArr; ////////////////////
}/*
static void QuickSort(TTypObjList& ARR_CObjList, bool AB_IsAscending=true)*/
template
<typename TTypFuncIsMore, typename TTypFuncIsLess>
static void QuickSort
(
TTypObjList& ARR_CObjList ,
TTypFuncIsMore APF_IsMore ,
TTypFuncIsLess APF_IsLess
)
//////////////////////////////////////////////////////
{
if(ARR_CObjList.GetSize()<=1) return;
TypeSize VL_SortSize = ARR_CObjList.GetSize() ;
ZCLink** VPP_LinkPtrArr= new ZCLink*[VL_SortSize];
if(VPP_LinkPtrArr==0)
{
// Add codes for memory over
return;
}/*
if(VPP_LinkPtrArr==0)*/
ZCLink* VP_TempLink =
ARR_CObjList.GetHeadLinkPtr();
TypeSize i=0 ;
for(; i<VL_SortSize; ++i)
{
VPP_LinkPtrArr[i]=VP_TempLink;
VP_TempLink =VP_TempLink->GetNextPtr();
}/*
///////////////////////*/
QuickSort
(APF_IsMore, APF_IsLess, VPP_LinkPtrArr, 0, VL_SortSize-1);
for(i=1; i<VL_SortSize; ++i) // VL_SortSize-1 번 순환
{
ZCLink::JoinLink(VPP_LinkPtrArr[i-1], VPP_LinkPtrArr[i]);
}/*
//////////////////////////*/
ZCLink::MakeCircle
(VPP_LinkPtrArr[0], VPP_LinkPtrArr[VL_SortSize-1]);
ARR_CObjList.mp_HeadLink = VPP_LinkPtrArr[0];
delete[] VPP_LinkPtrArr; ////////////////////
}/*
template
<typename TTypFuncIsMore, typename TTypFuncIsLess>
static void QuickSort
(
TTypObjList& ARR_CObjList ,
TTypFuncIsMore APF_IsMore ,
TTypFuncIsLess APF_IsLess
)
////////////////////////////////////////////////////*/
static void QuickSortPart /*########################*/
(
TTypObjList& ARR_CObjList,
ZCLink* AP_HeadLink ,
TypeSize AL_HeadPos ,
ZCLink* AP_TailLink ,
TypeSize AL_TailPos ,
bool AB_IsAscending=true
)
/*##################################################*/
{
// AP_HeadLink 부터 AP_TailLink 까지만 정렬
#ifdef _DEBUG
if(ARR_CObjList.IsEmpty()==true || ARR_CObjList.Find(AP_HeadLink)!=AL_HeadPos || ARR_CObjList.Find(AP_TailLink)!=AL_TailPos || AL_HeadPos>AL_TailPos)
{
std::fstream fileout("DEBUG.txt",std::ios::out | std::ios::app);
fileout<<std::endl<<"File : "<<__FILE__<<std::endl<<"Line : "<<__LINE__<<std::endl;
fileout<<"Error !! In static void QuickSortPart("<<endl
<<" TTypObjList& ARR_CObjList,"<<endl
<<" ZCLink* AP_HeadLink ,"<<endl
<<" TypeSize AL_HeadPos ,"<<endl
<<" ZCLink* AP_TailLink ,"<<endl
<<" TypeSize AL_TailPos ,"<<endl
<<" bool AB_IsAscending=true )"<<endl
<<"Parameters are not valid"<<endl;
fileout.close();
exit(1);
}/*
if(ARR_CObjList.IsEmpty()==true || ARR_CObjList.Find(AP_HeadLink)!=AL_HeadPos || ARR_CObjList.Find(AP_TailLink)!=AL_TailPos || AL_HeadPos>AL_TailPos)*/
#endif //_DEBUG
if(AL_HeadPos==1 && AL_TailPos==ARR_CObjList.GetSize())
{
QuickSort(ARR_CObjList, AB_IsAscending); return;
}/*
if(AL_HeadPos==1 && AL_TailPos==ARR_CObjList.GetSize())*/
ZCLink* VP_PrevHead=AP_HeadLink->GetPrevPtr();
ZCLink* VP_NextTail=AP_TailLink->GetNextPtr();
TypeSize VL_SortSize=AL_TailPos-AL_HeadPos+1 ;
ZCLink** VPP_LinkPtrArr = new ZCLink*[VL_SortSize];
if(VPP_LinkPtrArr==0)
{
// Add codes for memory over
return;
}/*
if(VPP_LinkPtrArr==0)*/
ZCLink* VP_TempLink = AP_HeadLink; TypeSize i=0;
for(; i<VL_SortSize; ++i)
{
VPP_LinkPtrArr[i]=VP_TempLink;
VP_TempLink =VP_TempLink->GetNextPtr();
}/*
///////////////////////*/
if(AB_IsAscending==true)
QuickSortAsc (VPP_LinkPtrArr, 0, VL_SortSize-1);
else QuickSortDesc(VPP_LinkPtrArr, 0, VL_SortSize-1);
for(i=1; i<VL_SortSize; ++i) // VL_SortSize-1 번 순환
{
ZCLink::JoinLink(VPP_LinkPtrArr[i-1], VPP_LinkPtrArr[i]);
}/*
//////////////////////////*/
ZCLink::JoinLink(VP_PrevHead /*##########*/ , VPP_LinkPtrArr[0]);
ZCLink::JoinLink(VPP_LinkPtrArr[VL_SortSize-1], VP_NextTail );
if(AL_HeadPos==1)
ARR_CObjList.mp_HeadLink=VPP_LinkPtrArr[0];
delete[] VPP_LinkPtrArr; //////////////////////
}/*
static void QuickSortPart ############################
(
TTypObjList& ARR_CObjList,
ZCLink* AP_HeadLink ,
TypeSize AL_HeadPos ,
ZCLink* AP_TailLink ,
TypeSize AL_TailPos ,
bool AB_IsAscending=true
)
/*##################################################*/
static void MergeSort
(TTypObjList& ARR_AddList, TTypObjList& ARR_CutList, bool AB_IsAscending=true)
/*#################*/
{
/*/////////////////////////////////////////////////////////////////////////////
■ 연결리스트 ARR_AddList 와 ARR_CutList 는 이미 정렬되어 있는 것으로 간주하여
병합 정렬을 실시한다. ARR_CutList 의 앞 링크부터 차례로 끊어 ARR_AddList 의
적당한 링크에 삽입한다. 이 병합 정렬은 ARR_AddList 가 오름차순으로 정렬되어
있다면 ARR_CutList 도 오름차순으로 정렬되어 있어야 하고, AB_IsAscending 도
true 여야 원하는 결과를 얻을 수 있다.
/////////////////////////////////////////////////////////////////////////////*/
if( &ARR_AddList==&ARR_CutList ||
ARR_AddList.mp_HeadLink==0 ||
ARR_CutList.mp_HeadLink==0 ) return ;
/* 먼저 각 리스크를 삭제하는 신호를 보낸다. 진짜로 삭제하는 것은 아니지만,
링크를 이동시키는 과정에서 발생할 수 있는 에러를 막는데는 도움이 된다. */
ARR_AddList.OnDelete( ARR_AddList.mp_HeadLink, 1,
ARR_AddList.mp_HeadLink->mp_PrevLink, ARR_AddList.ml_Size );
ARR_CutList.OnDelete( ARR_CutList.mp_HeadLink, 1,
ARR_CutList.mp_HeadLink->mp_PrevLink, ARR_CutList.ml_Size );
bool (*pf_IsTrueValue)(TypeArg AR_Left,TypeArg rRigh);
if(AB_IsAscending==true)
pf_IsTrueValue=IsMore;
else pf_IsTrueValue=IsLess;
if(pf_IsTrueValue(ARR_AddList.GetTailData(), ARR_CutList.GetHeadData())==false)
{
ARR_AddList.JoinTail(ARR_CutList); return; // 이때는 더 이상 비교할 필요가 없다.
}/*
if(pf_IsTrueValue(ARR_AddList.GetTailData(), ARR_CutList.GetHeadData())==false)*/
ZCLink* VP_LhsTail =ARR_AddList.mp_HeadLink->mp_PrevLink;
ZCLink* VP_LhsTemp =ARR_AddList.mp_HeadLink;
ZCLink* VP_RhsHead =ARR_CutList.mp_HeadLink;
TypeSize VL_LhsTempPos=1 ; // VP_LhsTemp 의 위치
bool VB_IsMoved =false;
ZCLink* VP_TempLink =0 ;
do //////
{
if(pf_IsTrueValue(VP_LhsTemp->GetData(), VP_RhsHead->GetData())==true)
{
VP_TempLink=VP_RhsHead ;
VP_RhsHead =VP_RhsHead->mp_NextLink;
ARR_AddList.JoinBefore ////////////////////
(
ARR_CutList.CutLink(VP_TempLink,1),
VP_LhsTemp,
VL_LhsTempPos
);
///////////////////////////////////////////
/* VP_LhsTemp 앞에 링크가 하나 삽입되었으므로,
VP_LhsTemp 의 위치값을 하나 증가시킨다. */
++VL_LhsTempPos; VB_IsMoved=true;
}/*
if(pf_IsTrueValue(VP_LhsTemp->GetData(), VP_RhsHead->GetData())==true)*/
if(ARR_CutList.mp_HeadLink==0) return;
if(VP_LhsTemp==VP_LhsTail)
{
ARR_AddList.JoinTail(ARR_CutList); return;
}/*
if(VP_LhsTemp==VP_LhsTail)*/
if(VB_IsMoved==false)
{
VP_LhsTemp=VP_LhsTemp->mp_NextLink; ++VL_LhsTempPos;
}
else
{
VB_IsMoved=false;
}
}
while(true);
}/*
static void MergeSort
(TTypObjList& ARR_AddList, TTypObjList& ARR_CutList, bool AB_IsAscending=true)
/*#################*/
template<typename TFunctor> void MakeUnique( /*############*/
TTypObjList& ARR_CObjList ,
TFunctor AR_Functor ,
bool AB_IsSorted =false,
bool AB_IsAscending=true
/*#########*/ ) /*#########################################*/
{
// ARR_CObjList 의 각 노드를 유일하게 만든다.
if(AB_IsSorted==false)
QuickSort(ARR_CObjList,AB_IsAscending);
TypeSize VL_LoopSize= ARR_CObjList.GetSize() ;
TypeSize VL_Index = 1 ;
ZCLink* VP_HeadLink= ARR_CObjList.GetHeadLinkPtr();
ZCLink* VP_CutLink = 0 ;
/* VL_LoopSize-1 번 순환하며 같은 원소가 이웃한다면
앞뒤 노드에 대해 어떤 처리를 하고 뒤쪽의 노드를 삭제한다. */
for(TypeSize i=1; i<VL_LoopSize; ++i)
{
if(VP_HeadLink->GetData()==VP_HeadLink->GetNextPtr()->GetData())
{
AR_Functor //////////////////////////
(
VP_HeadLink->GetData(), VP_HeadLink->GetNextPtr()->GetData()
);
VP_CutLink=VP_HeadLink->GetNextPtr();
ARR_CObjList.Delete(VP_CutLink, VL_Index+1);
}
else
{
(VP_HeadLink=VP_HeadLink->GetNextPtr(), ++VL_Index);
}
}/*
for(TypeSize i=1; i<VL_LoopSize; ++i)*/
}/*
template<typename TFunctor> void MakeUnique( ################
TFunctor AR_Functor ,
bool AB_IsSorted=false ,
bool AB_IsAscending=true
################# ) #######################################*/
static void MakeUnique( /*#################################*/
TTypObjList& ARR_CObjList ,
bool AB_IsSorted =false,
bool AB_IsAscending=true
/*#########*/ ) /*#########################################*/
{
// ARR_CObjList 의 각 노드를 유일하게 만든다.
if(AB_IsSorted==false)
QuickSort(ARR_CObjList,AB_IsAscending);
TypeSize VL_LoopSize =ARR_CObjList.GetSize() ;
TypeSize VL_Index =1 ;
ZCLink* VP_HeadLink =ARR_CObjList.GetHeadLinkPtr();
ZCLink* VP_CutLink =0 ;
/* VL_LoopSize-1 번 순환하며 같은 원소가 이웃한다면
뒤쪽의 노드를 삭제한다.
*/
for(TypeSize i=1; i<VL_LoopSize; ++i)
{
if(VP_HeadLink->GetData()==VP_HeadLink->GetNextPtr()->GetData())
{
VP_CutLink = VP_HeadLink->GetNextPtr() ;
ARR_CObjList.Delete(VP_CutLink, VL_Index+1);
}
else
{
(VP_HeadLink=VP_HeadLink->GetNextPtr(), ++VL_Index);
}
}/*
for(TypeSize i=1; i<VL_LoopSize; ++i)*/
}/*
static void MakeUnique( #####################################
TTypObjList& ARR_CObjList ,
bool AB_IsSorted =false,
bool AB_IsAscending=true
############# ) ###########################################*/
template<typename TFunctor> static void SplitGroup( /*#####*/
TTypObjList& ARR_CObjList ,
TFunctor AR_Functor ,
bool AB_IsSorted =false,
bool AB_IsAscending=true
/*#########*/ ) /*#########################################*/
{
/* ARR_CObjList 의 각 노드를 같은 것끼리 그룹으로 묵어서
묶여진 리스트에 대해 AR_Functor 를 수행한다.
*/
if(ARR_CObjList.IsEmpty()) return;
if(AB_IsSorted==false)
{
QuickSort(ARR_CObjList, AB_IsAscending); // 정렬이 안되었으면 정렬을 하고...
}/*
if(AB_IsSorted==false)*/
TypeSize VL_LoopSize=ARR_CObjList.GetSize() ;
TypeSize VL_TailPos =1 ;
ZCLink* VP_CutHead =ARR_CObjList.GetHeadLinkPtr();
ZCLink* VP_CutTail =VP_CutHead ;
ZCLink* VP_CutTemp =VP_CutTail->GetNextPtr() ;
// VL_LoopSize-1 번 순환
for(TypeSize i=2; i<=VL_LoopSize; ++i)
{
if(VP_CutTail->GetData()==VP_CutTemp->GetData())
{
VP_CutTail=VP_CutTemp ;
VP_CutTemp=VP_CutTemp->GetNextPtr() ;
++VL_TailPos;
}
else // VP_CutTail->GetData()!=VP_CutTemp->GetData()
{
/* 다음 노드와 다르면 이전 노드들은 서로 같다는 것이다.
이전 노드들은 functor 로 처리를 넘긴다. functor 는
넘겨받은 리스트를 반드시 써야(삭제해야) 한다. CutLink()
멤버 함수는 내부에 정적 리스트 개체를 가지고 있는데
여기에 쓸데없는 자료가 남겨져서는 안되기 때문이다. */
AR_Functor //////////////////////////////////////
(
ARR_CObjList.CutLink
(
VP_CutHead, 1, VP_CutTail, VL_TailPos
)
);
/////////////////////////////////////////////////
VP_CutHead =VP_CutTemp;
VP_CutTail =VP_CutTemp;
VP_CutTemp =VP_CutTemp->GetNextPtr();
VL_TailPos =1 ;
}/*
else // VP_CutTail->GetData()!=VP_CutTemp->GetData()*/
}/*
for(TypeSize i=2; i<=VL_LoopSize; ++i)*/
if(ARR_CObjList.IsEmpty()==false) AR_Functor(ARR_CObjList);
}/*
template<typename TFunctor> static void SplitGroup( ##########
TTypObjList& ARR_CObjList ,
TFunctor AR_Functor ,
bool AB_IsSorted=false ,
bool AB_IsAscending=true
############# ) ############################################*/
public:
};/*
template<typename TypeObjList> class ZtCSortObjList*/
template<typename TTypObjList> class ZtCSortObjList */
namespace ZNsExam
{
template<typename TTypeInt=int> class ZtExamSortIntList
{
public:
static void ShowElemnet(int AI_Element)
{
cout<<"* Element : "<<AI_Element<<endl;
}
///////////////////////////////////////
static int Main(int AI_ArgCnt=0, const char* APP_ArgVal[]=0)
{
using namespace std; typedef ZNsMain::
ZtCObjList<TTypeInt, TTypeInt> CObjList ;
CObjList VO_CIntList; ///////////////////////////
VO_CIntList.AddTail(10); VO_CIntList.AddTail(1 );
VO_CIntList.AddTail(6 ); VO_CIntList.AddTail(4 );
VO_CIntList.AddTail(7 ); VO_CIntList.AddTail(2 );
VO_CIntList.AddTail(8 ); VO_CIntList.AddTail(5 );
VO_CIntList.AddTail(9 ); VO_CIntList.AddTail(3 );
cout<<"# Sort ASC" <<endl; ZtCSortObjList<CObjList>::
QuickSort(RR(VO_CIntList), true ); VO_CIntList.IterElement(ShowElemnet);
cout<<"# Sort DESC"<<endl; ZtCSortObjList<CObjList>::
QuickSort(RR(VO_CIntList), false); VO_CIntList.IterElement(ShowElemnet);
return 0 ;
}/*
static int Main(int AI_ArgCnt=0, const char* APP_ArgVal[]=0)*/
public:
};/*
template<typename TTypeInt=int> class ZtExamSortIntList*/
}/*
namespace ZNsExam*/
// 단방향 연결리스트에 대한 정렬 클래스이다.
template<typename TTypObjList> class ZtCSortSimList
{
public :
typedef typename TTypObjList::ZCLink ZCLink ;
typedef typename TTypObjList::TypeData TypeData ;
typedef typename TTypObjList::TypeArg TypeArg ;
typedef typename TTypObjList::TypeSize TypeSize ;
private:
static inline void SwapLinkPtr(ZCLink*& APR_LinkI, ZCLink*& APR_LinkJ)
{
ZCLink*
VP_Temp =APR_LinkI;
APR_LinkI=APR_LinkJ;
APR_LinkJ=VP_Temp;
}/*
static inline void SwapLinkPtr( ZCLink*& APR_LinkI, ZCLink*& APR_LinkJ) */
template
<typename TTypFuncIsMore, typename TTypFuncIsLess>
static void QuickSort
(
TTypFuncIsMore APF_IsMore ,
TTypFuncIsLess APF_IsLess ,
ZCLink* APA_LinkPtrArr[],
TypeSize AL_FirstIndex ,
TypeSize AL_LastIndex
)
/*##################################################*/
{
if(AL_FirstIndex<AL_LastIndex)
{
TypeSize i=AL_FirstIndex ;
TypeSize j=AL_LastIndex+1 ;
ZCLink* VP_PivotLinkPtr=APA_LinkPtrArr[i];
do //////
{
while(AL_LastIndex >i && APF_IsLess(APA_LinkPtrArr[++i]->GetData(), VP_PivotLinkPtr->GetData()));
while(AL_FirstIndex<j && APF_IsMore(APA_LinkPtrArr[--j]->GetData(), VP_PivotLinkPtr->GetData()));
if(i<j) SwapLinkPtr(APA_LinkPtrArr[i], APA_LinkPtrArr[j]);
}
while(i<j);
/* SwapLinkPtr(APA_LinkPtrArr[AL_FirstIndex],APA_LinkPtrArr[j]);
위 코드 보다 아래처럼 2 줄로 쓰는게 별도의 스택 변수를 사용하지
않아서 좋다.
*/
APA_LinkPtrArr[AL_FirstIndex]=APA_LinkPtrArr[j];
APA_LinkPtrArr[j ]=VP_PivotLinkPtr ;
QuickSort(APF_IsMore, APF_IsLess, APA_LinkPtrArr, AL_FirstIndex, j-1 );
QuickSort(APF_IsMore, APF_IsLess, APA_LinkPtrArr, j+1, AL_LastIndex);
}/*
if(AL_FirstIndex<AL_LastIndex)*/
}/*
template
<typename TTypFuncIsMore, typename TTypFuncIsLess>
static void QuickSort
(
TTypFuncIsMore APF_IsMore ,
TTypFuncIsLess APF_IsLess ,
ZCLink* APA_LinkPtrArr[],
TypeSize AL_FirstIndex ,
TypeSize AL_LastIndex
)
/*##################################################*/
/*private:*/
public :
template
<typename TTypFuncIsMore, typename TTypFuncIsLess>
static void QuickSort
(
TTypObjList& ARR_CObjList,
TTypFuncIsMore APF_IsMore ,
TTypFuncIsLess APF_IsLess
)
/*##################################################*/
{
if(ARR_CObjList.GetSize()<=1) return;
TypeSize VL_SortSize = ARR_CObjList.GetSize() ;
ZCLink** VPP_LinkPtrArr = new ZCLink*[VL_SortSize];
if(VPP_LinkPtrArr==0)
{
// Add codes for memory over
return;
}/*
if(VPP_LinkPtrArr==0)*/
ZCLink* VP_TempLink =
ARR_CObjList.GetHeadLinkPtr();
TypeSize i=0 ;
for(; i<VL_SortSize; ++i)
{
VPP_LinkPtrArr[i]=VP_TempLink ;
VP_TempLink =VP_TempLink->GetNextPtr();
}
/////////////////////////
QuickSort(APF_IsMore, APF_IsLess, VPP_LinkPtrArr, 0, VL_SortSize-1);
for(i=1; i<VL_SortSize; ++i) // VL_SortSize-1 번 순환
{
ZCLink::JoinLink(VPP_LinkPtrArr[i-1], VPP_LinkPtrArr[i]);
}
////////////////////////////
#if(_CODE_OLD_) // 아래 코드만 빠진다.
ZCLink::MakeCircle(VPP_LinkPtrArr[0], VPP_LinkPtrArr[VL_SortSize-1]);
#else
ARR_CObjList.mp_HeadLink=VPP_LinkPtrArr[0] ;
ARR_CObjList.mp_TailLink=VPP_LinkPtrArr[VL_SortSize-1];
#endif
delete[] VPP_LinkPtrArr;
}/*
template<typename TTypFuncIsMore, typename TTypFuncIsLess>
static void QuickSort(TTypObjList& ARR_CObjList, TTypFuncIsMore APF_IsMore, TTypFuncIsLess APF_IsLess) */
public:
};/*
template<typename TTypObjList> class ZtCSortSimList */
}/*
namespace ZNsMain*/
#endif //__ZCPPMAIN__ZCSORT_LIST_H__

8275
ZCppMain/ZtCStringEx.H Normal file

File diff suppressed because it is too large Load Diff

993
ZCppMain/ZtCTreeData.H Normal file
View File

@ -0,0 +1,993 @@

#ifndef __ZCPPMAIN__ZCTREEDATA_H__
#define __ZCPPMAIN__ZCTREEDATA_H__
#include "ZCppMain/ZtCObjList.H"
namespace ZNsMain
{
namespace ZNsView
{
template< typename TypeData, typename TypeSize=int
>
class ZtCViewTreeData ////////////////////////////
{
private:
void ShowDepth(TypeSize AI_Depth)
{
__for1(TypeSize, i, AI_Depth) cout<<" ";
}/*
void ShowDepth(TypeSize AI_Depth)*/
public :
ZNsMain::ZNsEnum::ZERun OnDataStart(TypeSize AI_Depth)
{
ShowDepth(AI_Depth); cout<<"▷ OnDataStart:"<<endl;
return ZNsMain::ZNsEnum::ZERun_OK;
}
ZNsMain::ZNsEnum::ZERun OnDataBody(TypeData& AR_TypeData, TypeSize AI_Depth, TypeSize AI_Index=0)
{
ShowDepth(AI_Depth); cout<<" ※ Index="<<AI_Index<<": "<<AR_TypeData<<endl;
return ZNsMain::ZNsEnum::ZERun_OK;
}
ZNsMain::ZNsEnum::ZERun OnDataClose(TypeSize AI_Depth)
{
ShowDepth(AI_Depth); cout<<"◁ OnDataClose:"<<endl;
return ZNsMain::ZNsEnum::ZERun_OK;
}
ZNsMain::ZNsEnum::ZERun OnSubNodeStart(TypeSize AI_Depth, TypeSize AI_NodeCnt)
{
if(AI_NodeCnt<1){ return ZNsMain::ZNsEnum::ZERun_OK; }
ShowDepth(AI_Depth); cout<<"▶ OnSubNodeStart:"<<endl;
return ZNsMain::ZNsEnum::ZERun_OK;
}
ZNsMain::ZNsEnum::ZERun OnSubNodeClose(TypeSize AI_Depth, TypeSize AI_NodeCnt)
{
if(AI_NodeCnt<1){ return ZNsMain::ZNsEnum::ZERun_OK; }
ShowDepth(AI_Depth); cout<<"◀ OnSubNodeClose:"<<endl;
return ZNsMain::ZNsEnum::ZERun_OK;
}/*
ZNsMain::ZNsEnum::ZERun OnSubNodeClose(TypeSize AI_Depth, TypeSize AI_NodeCnt)*/
public:
};/*
template< typename TypeData, typename TypeSize=int
>
class ZtCViewTreeData //////////////////////////*/
}/*
namespace ZNsView*/
namespace ZNsType
{
/*/////////////////////////////////////////////////////////////////////////////////////
■ class ZtCTypeTreeData 템플릿은 정의에서 또 다른 템플릿(list 등의 컨테이너 템플릿)을
포함하고 있음을 눈여겨 보자. 이것을 ZtCTreeData<> 에서 활용하는 부분은 아래처럼
typedef typename TTypeTreeData::template ZtCTypeClass<ZCNode1>::TypeData ZCNode1List;
typedef typename TTypeTreeData::template ZtCTypeClass<ZCNode2>::TypeData ZCNode2List;
다소 복잡해 보인다.
-- 2011-11-01 14:39:00
/////////////////////////////////////////////////////////////////////////////////////*/
template<typename TTypeSize=long> class ZtCTypeTreeData
{
public:
typedef TTypeSize TypeSize;
public:
template< typename TType ,
typename TTypeArg =const TType& ,
typename TTypeAlloc=ZNsMain::ZCAllocator,
typename TTypeInit =ZNsMain::ZtCInit<TType>
>
class ZtCTypeClass /////////////////////////////////
{
public:
typedef TTypeAlloc TypeAlloc;
typedef TTypeInit TypeInit ;
public:
typedef ZNsMain::ZtCObjList
<TType, TTypeArg, TTypeAlloc, TTypeInit, TTypeSize>
TypeList; /////////////////
public:
};/*
template< typename TType ,
typename TTypeArg =const TType& ,
typename TTypeAlloc=ZNsMain::ZCAllocator,
typename TTypeInit =ZNsMain::ZtCInit<TType>
>
class ZtCTypeClass ///////////////////////////////*/
public:
};/*
template<typename TTypeSize=long> class ZtCTypeTreeData*/
}/*
namespace ZNsType*/
template< typename TType ,
typename TTypeInit =ZNsMain::ZtCInit<TType>,
typename TTypeTreeData=ZNsType::ZtCTypeTreeData<long>
>
class ZtCTreeData /*###########################################*/
{
public:
class ZCNode1; class ZCNode2; class ZCNodeInfo;
public:
typedef TType TypeData ;
typedef TTypeInit ZCTypeInit ;
typedef TTypeTreeData ZCTypeTreeData;
public:
typedef typename TTypeTreeData::TypeSize TypeSize ;
typedef typename TTypeTreeData::template
ZtCTypeClass<ZCNode1>::TypeList ZCNode1List ;
typedef typename TTypeTreeData::template
ZtCTypeClass<ZCNode2>::TypeList ZCNode2List ;
public:
typedef ZCNode1 ZCNode ;
typedef ZCNode1List ZCNodeList ;
public:
typedef typename ZCNodeList::ZCLink ZCNodeLink;
typedef typename ZCNodeList::iterator IterOfNode;
public:
class ZCNode1 : public ZCTypeInit
{
public :
friend class ZCNodeInfo;
private:
ZCNode* mp_HighNode ;
TypeData mo_TypeData ;
ZCNode2List mo_CNodeList;
public :
ZCNode1()
{
mp_HighNode=0; this->ZCTypeInit::OnInit(mo_TypeData);
}/*
ZCNode1()*/
~ZCNode1()
{
mp_HighNode=0; this->ZCTypeInit::OnFini(mo_TypeData);
}/*
~ZCNode1()*/
ZCNode* GetHighNodePtr () {return (ZCNode*)mp_HighNode;}
const ZCNode* GetHighNodePtr ()const{return (ZCNode*)mp_HighNode;}
TypeData& GetData () {return mo_TypeData;}
const TypeData& GetData ()const{return mo_TypeData;}
const ZCNodeList& GetCNodeList()const{return (ZCNodeList&)mo_CNodeList;}
TypeSize GetNodeCnt(){return mo_CNodeList.size();}
void DeleteCNodeList(){mo_CNodeList.DeleteAll();}
void clear (){mo_CNodeList.DeleteAll();}
ZCNode& AddSubNode()
{
ZCNode* VP_CNode=(ZCNode*)&(**mo_CNodeList.AddTailDef());
VP_CNode->mp_HighNode=(ZCNode*)this; return *VP_CNode ;
}/*
ZCNode& AddSubNode()*/
ZCNodeInfo GetHeadNodeIter()
{
return ZCNodeInfo((ZCNode*)this, ((ZCNodeList&)mo_CNodeList).GetHeadLinkPtr());
}/*
ZCNodeInfo GetHeadNodeIter()*/
/*//////////////////////////////////////////////////////////////////////////////
■ TViewClass 의 interface
ZNsMain::ZNsEnum::ZERun OnDataBody(TypeData, TypeSize AI_Depth, TypeSize AI_Index=0)
ZNsMain::ZNsEnum::ZERun OnSubNodeStart(int AI_Depth, int AI_NodeCnt)
ZNsMain::ZNsEnum::ZERun OnSubNodeClose(int AI_Depth, int AI_NodeCnt)
-- 2011-10-31 21:53:00
//////////////////////////////////////////////////////////////////////////////*/
template<typename TViewClass> ZNsMain::ZNsEnum::ZERun IterPreOrder
( TViewClass& AR_CViewClass, TypeSize AI_StartDepth=0, TypeSize AI_NodeIndex=0 )
/*##############################################################*/
{
const bool CB_DoStop = ///////////////////////////////
(
AR_CViewClass.OnDataBody
(mo_TypeData, AI_StartDepth, AI_NodeIndex)
== ZNsMain::ZNsEnum::ZERun_NO
);
//////////////////////////////////////////////////////
if(CB_DoStop) return ZNsMain::ZNsEnum::ZERun_NO;
TypeSize VL_NodeCnt= ((ZCNodeList&)mo_CNodeList).size () ;
IterOfNode VO_iter_Node(((ZCNodeList&)mo_CNodeList).begin());
if ( AR_CViewClass. //////////////////////////////////////
OnSubNodeStart(AI_StartDepth, VL_NodeCnt)==
ZNsMain::ZNsEnum::ZERun_NO
)
{ return ZNsMain::ZNsEnum::ZERun_NO; } //////////////////////
++AI_StartDepth;
{
__for1(TypeSize, i, VL_NodeCnt)
{
const bool CB_DoStop =
(
((ZCNodeList&)mo_CNodeList).ItD(VO_iter_Node).
IterPreOrder<TViewClass>
(AR_CViewClass, AI_StartDepth, i)
== ZNsMain::ZNsEnum::ZERun_NO
);
//////////////////////
if(CB_DoStop) return ZNsMain::ZNsEnum::ZERun_NO;
((ZCNodeList&)mo_CNodeList).MoveNextIter(RR(VO_iter_Node));
}/*
__for1(TypeSize, i, VL_NodeCnt)*/
}
--AI_StartDepth;
const ZNsMain::ZNsEnum::ZERun CE_ERun =
AR_CViewClass.OnSubNodeClose(AI_StartDepth, VL_NodeCnt);
if(CE_ERun==ZNsMain::ZNsEnum::ZERun_NO)
return ZNsMain::ZNsEnum::ZERun_NO; /////////////////////
return ZNsMain::ZNsEnum::ZERun_OK;
}/*
template<typename TViewClass> ZNsMain::ZNsEnum::ZERun IterPreOrder
(TViewClass& AR_CViewClass, TypeSize AI_StartDepth=0, TypeSize AI_NodeIndex=0)
/*##############################################################*/
template<typename TViewClass> ZNsMain::ZNsEnum::ZERun IterPostOrder
( TViewClass& AR_CViewClass, TypeSize AI_StartDepth=0, TypeSize AI_NodeIndex=0 )
/*###############################################################*/
{
TypeSize VL_NodeCnt = ((ZCNodeList&)mo_CNodeList).size () ;
IterOfNode VO_iter_Node(((ZCNodeList&)mo_CNodeList).begin());
if(AR_CViewClass.OnSubNodeStart
(AI_StartDepth, VL_NodeCnt)==ZNsMain::ZNsEnum::ZERun_NO)
{ return ZNsMain::ZNsEnum::ZERun_NO; }
++AI_StartDepth; /*####################*/
{
__for1(TypeSize, i, VL_NodeCnt)
{
const bool CB_DoStop =
(
((ZCNodeList&)mo_CNodeList).ItD(VO_iter_Node).
IterPostOrder<TViewClass>(AR_CViewClass, AI_StartDepth, i)
== ZNsMain::ZNsEnum::ZERun_NO
);
//////////////////////
if(CB_DoStop) return ZNsMain::ZNsEnum::ZERun_NO;
((ZCNodeList&)mo_CNodeList).MoveNextIter(VO_iter_Node);
}/*
__for1(TypeSize, i, VL_NodeCnt)*/
}
--AI_StartDepth; /*####################*/
if(AR_CViewClass.OnSubNodeClose
(AI_StartDepth, VL_NodeCnt)==ZNsMain::ZNsEnum::ZERun_NO)
{ return ZNsMain::ZNsEnum::ZERun_NO; }
const bool CB_DoStop = /////////////////////////
(
AR_CViewClass.OnDataBody
( mo_TypeData, AI_StartDepth, AI_NodeIndex )
==ZNsMain::ZNsEnum::ZERun_NO
) ;
////////////////////////////////////////////////
if(CB_DoStop)
{ return ZNsMain::ZNsEnum::ZERun_NO; }
return ZNsMain::ZNsEnum::ZERun_OK;
}/*
template<typename TViewClass> ZNsMain::ZNsEnum::ZERun IterPostOrder
(TViewClass& AR_CViewClass, TypeSize AI_StartDepth=0, TypeSize AI_NodeIndex=0)
/*###############################################################*/
public:
};/*
class ZCNode1*/
class ZCNode2 : public ZCTypeInit
{
public :
friend class ZCNodeInfo;
private:
ZCNode* mp_HighNode ;
TypeData mo_TypeData ;
ZCNode1List mo_CNodeList;
public :
ZCNode2()
{
mp_HighNode=0; this->ZCTypeInit::OnInit(mo_TypeData);
}/*
ZCNode2()*/
~ZCNode2()
{
mp_HighNode=0; this->ZCTypeInit::OnFini(mo_TypeData);
}/*
~ZCNode2()*/
ZCNode* GetHighNodePtr () {return (ZCNode*)mp_HighNode;}
const ZCNode* GetHighNodePtr ()const{return (ZCNode*)mp_HighNode;}
TypeData& GetData () {return mo_TypeData ;}
const TypeData& GetData ()const{return mo_TypeData ;}
const ZCNodeList& GetCNodeList()const{return (ZCNodeList&)mo_CNodeList;}
TypeSize GetNodeCnt(){return mo_CNodeList.size();}
void DeleteCNodeList(){mo_CNodeList.DeleteAll();}
void clear (){mo_CNodeList.DeleteAll();}
ZCNode& AddSubNode()
{
ZCNode* VP_CNode=(ZCNode*)&(**mo_CNodeList.AddTailDef());
VP_CNode->mp_HighNode=(ZCNode*)this; return *VP_CNode ;
}/*
ZCNode& AddSubNode()*/
ZCNodeInfo GetHeadNodeIter()
{
return ZCNodeInfo((ZCNode*)this, ((ZCNodeList&)mo_CNodeList).GetHeadLinkPtr());
}/*
ZCNodeInfo GetHeadNodeIter()*/
/*//////////////////////////////////////////////////////////////////////////////////////////////
■ ZCNode1 과 ZCNode2 가 동일한 구조이므로, ZCNode2 에서는 IterPreOrder() 와 IterPostOrder() 를
정의할 필요없다. ZCNode2 이 ZCNode1 로 형변환되어서 ZCNode1 의 IterPreOrder() 와 IterPostOrder()
을 사용할 것이기 때문이다.
-- 2011-11-01 10:40:00
//////////////////////////////////////////////////////////////////////////////////////////////*/
public:
};/*
class ZCNode2*/
class ZCNodeInfo
{
private:
ZCNode* mp_NowNodeWrap;
ZCNodeLink* mp_NowNodeLink;
public :
ZCNodeInfo(ZCNode* AP_CNode=0, ZCNodeLink* AP_CNodeLink=0)
{
mp_NowNodeWrap=AP_CNode; mp_NowNodeLink=AP_CNodeLink;
}/*
ZCNodeInfo(ZCNode* AP_CNode=0, ZCNodeLink* AP_CNodeLink=0)*/
ZCNode* GetNowNodeWrap(){return mp_NowNodeWrap;}
ZCNodeLink* GetNowNodeLink(){return mp_NowNodeLink;}
bool DeleteNode()
{
if(mp_NowNodeWrap==0 || mp_NowNodeLink==0) return false;
((ZCNodeList&)(mp_NowNodeWrap->mo_CNodeList)).
DeleteLink(mp_NowNodeLink);
mp_NowNodeLink=0; return true; ///////////////
}/*
bool DeleteNode()*/
ZCNodeInfo& operator ++ (int)
{mp_NowNodeWrap->mo_CNodeList.MoveNextIter(mp_NowNodeLink); return *this;}
ZCNode& operator*() {return mp_NowNodeWrap->mo_CNodeList.ItD(mp_NowNodeLink);}
const ZCNode& operator*()const{return mp_NowNodeWrap->mo_CNodeList.ItD(mp_NowNodeLink);}
public:
};/*
class ZCNodeInfo*/
/*public :*/
private:
ZCNode mo_RootNode;
public :
ZCNode& GetRootNode() {return mo_RootNode;}
const ZCNode& GetRootNode()const{return mo_RootNode;}
void DeleteAll(){mo_RootNode.clear();}
void clear (){mo_RootNode.clear();}
/*/////////////////////////////////////////////////////////////////////////////////////////
■ 위 clear() 함수는 mo_RootNode.clear() 를 호출하고 있는데, 만약 mo_RootNode.mo_TypeData
가 컨테이너 인 경우, mo_TypeData 를 추가로 초기화하는 코드가 필요할 수 있다. 이에 대해서
는 CXmlInfo_T<>::clear() 을 참고한다.
-- 2012-10-12 13:20:00
/////////////////////////////////////////////////////////////////////////////////////////*/
template<typename TViewClass> void IterPreOrder(TViewClass& AR_CViewClass)
{
mo_RootNode.IterPreOrder<TViewClass>(AR_CViewClass, 0, 0);
}/*
template<typename TViewClass> void IterPreOrder(TViewClass& AR_CViewClass) */
template<typename TViewClass> void IterPostOrder(TViewClass& AR_CViewClass)
{
mo_RootNode.IterPostOrder<TViewClass>(AR_CViewClass, 0, 0);
}/*
template<typename TViewClass> void IterPostOrder(TViewClass& AR_CViewClass) */
public:
};/*
template< typename TType ,
typename TTypeInit =ZNsMain::ZtCInit<TType>,
typename TTypeTreeData=ZNsType::ZtCTypeTreeData<long>
>
class ZtCTreeData #############################################*/
/*///////////////////////////////////////////////////////////////
■ class ZtCTreeData 예제 -- 2015-08-14 14:00
#include <iostream>
#include "ZCppMain/ZtCTreeData.H"
using namespace std ;
using namespace ZNsMain;
typedef ZtCStringBase<char> CStringBase ;
typedef ZtCTreeData<CStringBase> CStrTreeData ;
typedef CStrTreeData::ZCNode CNodeCStr ;
typedef ZNsMain::ZNsView::
ZtCViewTreeData<CStringBase> CViewTreeData;
int main()
{
CStringBase VO_CStringBase ;
CStrTreeData VO_CStrTreeData ;
CViewTreeData VO_CViewTreeData;
CNodeCStr& VO_CNodeCStr1 = VO_CStrTreeData.GetRootNode().AddSubNode();
CNodeCStr& VO_CNodeCStr2 = VO_CStrTreeData.GetRootNode().AddSubNode();
CNodeCStr& VO_CNodeCStr3 = VO_CStrTreeData.GetRootNode().AddSubNode();
CNodeCStr& VO_CNodeCStr11 = VO_CNodeCStr1 .AddSubNode();
CNodeCStr& VO_CNodeCStr12 = VO_CNodeCStr1 .AddSubNode();
CNodeCStr& VO_CNodeCStr121= VO_CNodeCStr12.AddSubNode();
CNodeCStr& VO_CNodeCStr122= VO_CNodeCStr12.AddSubNode();
CNodeCStr& VO_CNodeCStr21 = VO_CNodeCStr2 .AddSubNode();
CNodeCStr& VO_CNodeCStr22 = VO_CNodeCStr2 .AddSubNode();
VO_CStrTreeData.GetRootNode().GetData()="## Root Node ##";
VO_CNodeCStr1 . GetData()="Node1" ;
VO_CNodeCStr2 . GetData()="Node2" ;
VO_CNodeCStr3 . GetData()="Node3" ;
VO_CNodeCStr11. GetData()="Node11" ;
VO_CNodeCStr12. GetData()="Node12" ;
VO_CNodeCStr21. GetData()="Node21" ;
VO_CNodeCStr22. GetData()="Node22" ;
VO_CNodeCStr121.GetData()="Node121";
VO_CNodeCStr122.GetData()="Node122";
cout<<"# Pre Order"<<endl;
VO_CStrTreeData.IterPreOrder (VO_CViewTreeData);
cout<<"# Post Order" <<endl;
VO_CStrTreeData.IterPostOrder(VO_CViewTreeData);
}
□ 출력
# Pre Order
※ Index=0: ## Root Node ##
▶ OnSubNodeStart:
※ Index=1: Node1
▶ OnSubNodeStart:
※ Index=1: Node11
※ Index=2: Node12
▶ OnSubNodeStart:
※ Index=1: Node121
※ Index=2: Node122
◀ OnSubNodeClose:
◀ OnSubNodeClose:
※ Index=2: Node2
▶ OnSubNodeStart:
※ Index=1: Node21
※ Index=2: Node22
◀ OnSubNodeClose:
※ Index=3: Node3
◀ OnSubNodeClose:
# Post Order
▶ OnSubNodeStart:
▶ OnSubNodeStart:
※ Index=1: Node11
▶ OnSubNodeStart:
※ Index=1: Node121
※ Index=2: Node122
◀ OnSubNodeClose:
※ Index=2: Node12
◀ OnSubNodeClose:
※ Index=1: Node1
▶ OnSubNodeStart:
※ Index=1: Node21
※ Index=2: Node22
◀ OnSubNodeClose:
※ Index=2: Node2
※ Index=3: Node3
◀ OnSubNodeClose:
※ Index=0: ## Root Node ##
///////////////////////////////////////////////////////////////*/
/*///////////////////////////////////////////////////////////////
■ class ZtCTreeData <>::ZCNode1 에는 mo_TypeData 이 있다면,
class ZtCTreeDataEx<>::ZCNode1 에는 mo_CDataList 이 있다.
///////////////////////////////////////////////////////////////*/
template< typename TType,
typename TTypeTreeData=ZNsType::ZtCTypeTreeData<long>
>
class ZtCTreeDataEx /*#########################################*/
{
public:
typedef TType TypeData ;
typedef TTypeTreeData ZCTypeTreeData;
public:
class ZCNode1; class ZCNode2; class ZCNodeInfo ;
public:
typedef typename TTypeTreeData::TypeSize TypeSize;
public:
typedef typename TTypeTreeData::
template ZtCTypeClass<TypeData>::TypeList ZCDataList ;
typedef typename TTypeTreeData::
template ZtCTypeClass<ZCNode1 >::TypeList ZCNode1List;
typedef typename TTypeTreeData::
template ZtCTypeClass<ZCNode2 >::TypeList ZCNode2List;
public:
typedef ZCNode1 ZCNode ;
typedef ZCNode1List ZCNodeList;
typedef typename ZCNodeList::ZCLink ZCNodeLink;
typedef typename ZCDataList::ZCLink ZCDataLink;
public:
typedef typename ZCDataList::iterator IterOfData;
typedef typename ZCNodeList::iterator IterOfNode;
public:
class ZCNode1
{
public :
friend class ZCNodeInfo;
private:
ZCNode* mp_HighNode ;
ZCDataList mo_CDataList;
ZCNode2List mo_CNodeList;
public :
ZCNode1()
{
mp_HighNode=0;
}/*
ZCNode1()*/
ZCNode* GetHighNodePtr() {return (ZCNode*)mp_HighNode;}
const ZCNode* GetHighNodePtr()const{return (ZCNode*)mp_HighNode;}
ZCDataList& GetZCDataList() {return mo_CDataList;}
const ZCDataList& GetZCDataList()const{return mo_CDataList;}
const ZCNodeList& GetCNodeList()const{return (ZCNodeList&)mo_CNodeList;}
TypeSize GetDataCnt(){return mo_CDataList.size();}
TypeSize GetNodeCnt(){return mo_CNodeList.size();}
void DeleteCDataList(){mo_CDataList.DeleteAll();}
void DeleteCNodeList(){mo_CNodeList.DeleteAll();}
void DeleteAll (){mo_CDataList.DeleteAll(); mo_CNodeList.DeleteAll();}
void clear (){DeleteAll();}
ZCNode& AddSubNode()
{
ZCNode* VP_CNode=(ZCNode*)&(**mo_CNodeList.AddTailDef());
VP_CNode->mp_HighNode=(ZCNode*)this; return *VP_CNode ;
}/*
ZCNode& AddSubNode()*/
ZCNodeInfo GetHeadNodeIter()
{
return ZCNodeInfo((ZCNode*)this, ((ZCNodeList&)mo_CNodeList).GetHeadLinkPtr());
}/*
ZCNodeInfo GetHeadNodeIter()*/
/*//////////////////////////////////////////////////////////////////////////////
■ TViewClass 의 interface
ZNsMain::ZNsEnum::ZERun OnDataStart(int AI_Depth)
ZNsMain::ZNsEnum::ZERun OnDataBody(TypeData, TypeSize AI_Depth, TypeSize AI_Index)
ZNsMain::ZNsEnum::ZERun OnDataClose(int AI_Depth)
ZNsMain::ZNsEnum::ZERun OnSubNodeStart(int AI_Depth, int AI_NodeCnt)
ZNsMain::ZNsEnum::ZERun OnSubNodeClose(int AI_Depth, int AI_NodeCnt)
-- 2011-10-31 21:53:00
//////////////////////////////////////////////////////////////////////////////*/
template<typename TViewClass> ZNsMain::ZNsEnum::ZERun IterPreOrder
(
TViewClass& AR_CViewClass ,
TypeSize AI_StartDepth=0,
TypeSize AI_NodeIndex =0
)
/*##############################################################*/
{
TypeSize VL_DataCnt= mo_CDataList .size();
TypeSize VL_NodeCnt=((ZCNodeList&)mo_CNodeList).size();
IterOfData VO_iter_Data( mo_CDataList.begin());
IterOfNode VO_iter_Node(((ZCNodeList&)mo_CNodeList).begin());
if(AR_CViewClass.OnDataStart(AI_StartDepth)==ZNsMain::ZNsEnum::ZERun_NO)
{ return ZNsMain::ZNsEnum::ZERun_NO; }
/*>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>*/
{
__for1(TypeSize, i, VL_DataCnt)
{
const bool CB_DoStop =
(
AR_CViewClass.OnDataBody
(
mo_CDataList.ItD(VO_iter_Data), AI_StartDepth, AI_NodeIndex
)
== ZNsMain::ZNsEnum::ZERun_NO
);
//////////////////////
if(CB_DoStop) return ZNsMain::ZNsEnum::ZERun_NO;
mo_CDataList.MoveNextIter(VO_iter_Data); ///////
}/*
__for1(TypeSize, i, VL_DataCnt)*/
}
if(AR_CViewClass.OnDataClose(AI_StartDepth)==ZNsMain::ZNsEnum::ZERun_NO)
{ return ZNsMain::ZNsEnum::ZERun_NO; }
/*<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<*/
if(AR_CViewClass.OnSubNodeStart
(AI_StartDepth, VL_NodeCnt)==ZNsMain::ZNsEnum::ZERun_NO)
{ return ZNsMain::ZNsEnum::ZERun_NO; }
++AI_StartDepth; /*>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>*/
{
__for1(TypeSize, i, VL_NodeCnt)
{
const bool CB_DoStop = ///////////////////////////////
(
((ZCNodeList&)mo_CNodeList).ItD(VO_iter_Node).
IterPreOrder<TViewClass>
(AR_CViewClass, AI_StartDepth. i)
== ZNsMain::ZNsEnum::ZERun_NO
);
//////////////////////////////////////////////////////
if(CB_DoStop) return ZNsMain::ZNsEnum::ZERun_NO;
((ZCNodeList&)mo_CNodeList).MoveNextIter(VO_iter_Node);
}/*
__for1(TypeSize, i, VL_NodeCnt)*/
}
--AI_StartDepth; /*<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<*/
if(AR_CViewClass.OnSubNodeClose
(AI_StartDepth, VL_NodeCnt)==ZNsMain::ZNsEnum::ZERun_NO)
{ return ZNsMain::ZNsEnum::ZERun_NO; }
return ZNsMain::ZNsEnum::ZERun_OK; /////////////////////////
}/*
template<typename TViewClass> ZNsMain::ZNsEnum::ZERun IterPreOrder
(
TViewClass& AR_CViewClass, TypeSize AI_StartDepth=0
TypeSize AI_NodeIndex =0
) */
/*###############################################################*/
template<typename TViewClass> ZNsMain::ZNsEnum::ZERun IterPostOrder
(
TViewClass& AR_CViewClass ,
TypeSize AI_StartDepth=0,
TypeSize AI_NodeIndex =0
)
/*###############################################################*/
{
TypeSize VL_DataCnt= mo_CDataList. size();
TypeSize VL_NodeCnt=((ZCNodeList&)mo_CNodeList).size();
IterOfData VO_iter_Data( mo_CDataList. begin());
IterOfNode VO_iter_Node(((ZCNodeList&)mo_CNodeList).begin());
if(AR_CViewClass.OnSubNodeStart
(AI_StartDepth, VL_NodeCnt)==ZNsMain::ZNsEnum::ZERun_NO)
{ return ZNsMain::ZNsEnum::ZERun_NO; }
++AI_StartDepth; /*>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>*/
{
__for1(TypeSize, i, VL_NodeCnt)
{
const bool CB_DoStop = ////////////////////////////////
(
((ZCNodeList&)mo_CNodeList).
ItD(VO_iter_Node).IterPostOrder<TViewClass>
(AR_CViewClass, AI_StartDepth, i)
== ZNsMain::ZNsEnum::ZERun_NO
);
///////////////////////////////////////////////////////
if(CB_DoStop) return ZNsMain::ZNsEnum::ZERun_NO;
((ZCNodeList&)mo_CNodeList).MoveNextIter(VO_iter_Node);
}/*
__for1(TypeSize, i, VL_NodeCnt)*/
}
--AI_StartDepth; /*<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<*/
if(AR_CViewClass.OnSubNodeClose
(AI_StartDepth, VL_NodeCnt)==ZNsMain::ZNsEnum::ZERun_NO)
{ return ZNsMain::ZNsEnum::ZERun_NO; }
if(AR_CViewClass.OnDataStart(AI_StartDepth)==ZNsMain::ZNsEnum::ZERun_NO)
{ return ZNsMain::ZNsEnum::ZERun_NO; }
/*>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>*/
{
__for1(TypeSize, i, VL_DataCnt)
{
const bool CB_DoStop = ////////////////////
(
AR_CViewClass.OnDataBody
(
mo_CDataList.ItD(VO_iter_Data), AI_StartDepth, AI_NodeIndex
)
== ZNsMain::ZNsEnum::ZERun_NO
);
///////////////////////////////////////////
if(CB_DoStop) return ZNsMain::ZNsEnum::ZERun_NO;
mo_CDataList.MoveNextIter(VO_iter_Data); ///////////////
}/*
__for1(TypeSize, i, VL_DataCnt)*/
}
if(AR_CViewClass.OnDataClose(AI_StartDepth)==ZNsMain::ZNsEnum::ZERun_NO)
{ return ZNsMain::ZNsEnum::ZERun_NO; }
/*<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<*/
return ZNsMain::ZNsEnum::ZERun_OK;
}/*
template<typename TViewClass> ZNsMain::ZNsEnum::ZERun IterPostOrder
(
TViewClass& AR_CViewClass ,
TypeSize AI_StartDepth=0 ,
TypeSize AI_NodeIndex =0
)
#################################################################*/
public:
};/*
class ZCNode1*/
class ZCNode2
{
public :
friend class ZCNodeInfo;
private:
ZCNode* mp_HighNode ;
ZCDataList mo_CDataList;
ZCNode1List mo_CNodeList;
public :
ZCNode2()
{
mp_HighNode=0;
}/*
ZCNode2()*/
ZCNode* GetHighNodePtr() {return (ZCNode*)mp_HighNode;}
const ZCNode* GetHighNodePtr()const{return (ZCNode*)mp_HighNode;}
ZCDataList& GetZCDataList() {return mo_CDataList;}
const ZCDataList& GetZCDataList()const{return mo_CDataList;}
const ZCNodeList& GetCNodeList ()const{return (ZCNodeList&)mo_CNodeList;}
TypeSize GetDataCnt(){return mo_CDataList.size();}
TypeSize GetNodeCnt(){return mo_CNodeList.size();}
void DeleteCDataList(){mo_CDataList.DeleteAll();}
void DeleteCNodeList(){mo_CNodeList.DeleteAll();}
void DeleteAll (){mo_CDataList.DeleteAll(); mo_CNodeList.DeleteAll();}
void clear (){DeleteAll();}
ZCNode& AddSubNode()
{
ZCNode* VP_CNode=(ZCNode*)&
( **mo_CNodeList.AddTailDef() );
VP_CNode->mp_HighNode=(ZCNode*)this; return *VP_CNode;
}/*
ZCNode& AddSubNode()*/
ZCNodeInfo GetHeadNodeIter()
{
return ZCNodeInfo((ZCNode*)this, ((ZCNodeList&)mo_CNodeList).GetHeadLinkPtr());
}/*
ZCNodeInfo GetHeadNodeIter()*/
/*//////////////////////////////////////////////////////////////////////////////////////////////
■ ZCNode1 과 ZCNode2 가 동일한 구조이므로, ZCNode2 에서는 IterPreOrder() 와 IterPostOrder() 를
정의할 필요없다. ZCNode2 이 ZCNode1 로 형변환되어서 ZCNode1 의 IterPreOrder() 와 IterPostOrder()
을 사용할 것이기 때문이다.
-- 2011-11-01 10:40:00
//////////////////////////////////////////////////////////////////////////////////////////////*/
public:
};/*
class ZCNode2*/
class ZCNodeInfo
{
private:
ZCNode* mp_NowNodeWrap;
ZCNodeLink* mp_NowNodeLink;
public :
ZCNodeInfo(ZCNode* AP_CNode=0,ZCNodeLink* AP_CNodeLink=0)
{
mp_NowNodeWrap=AP_CNode; mp_NowNodeLink=AP_CNodeLink;
}/*
ZCNodeInfo(ZCNode* AP_CNode=0,ZCNodeLink* AP_CNodeLink=0)*/
ZCNode* GetNowNodeWrap(){return mp_NowNodeWrap;}
ZCNodeLink* GetNowNodeLink(){return mp_NowNodeLink;}
bool DeleteNode()
{
if(mp_NowNodeWrap==0 || mp_NowNodeLink==0) return false;
((ZCNodeList&)(mp_NowNodeWrap->mo_CNodeList)).
DeleteLink(mp_NowNodeLink);
mp_NowNodeLink=0; return true; //////////////
}/*
bool DeleteNode()*/
ZCNodeInfo& operator++(int)
{
mp_NowNodeWrap->mo_CNodeList.MoveNextIter(mp_NowNodeLink); return *this;
}/*
ZCNodeInfo& operator++(int)*/
ZCNode& operator*() {return mp_NowNodeWrap->mo_CNodeList.ItD(mp_NowNodeLink);}
const ZCNode& operator*()const{return mp_NowNodeWrap->mo_CNodeList.ItD(mp_NowNodeLink);}
public:
};/*
class ZCNodeInfo
public :*/
private:
ZCNode mo_RootNode;
public:
ZCNode& GetRootNode() {return mo_RootNode;}
const ZCNode& GetRootNode()const{return mo_RootNode;}
void DeleteAll(){mo_RootNode.clear();}
void clear (){mo_RootNode.clear();}
template<typename TViewClass> void IterPreOrder (TViewClass AO_CViewClass)
{ mo_RootNode.IterPreOrder<TViewClass>(AO_CViewClass, 0); }
template<typename TViewClass> void IterPostOrder(TViewClass AO_CViewClass)
{ mo_RootNode.IterPostOrder<TViewClass>(AO_CViewClass, 0); }
public:
};/*
template< typename TType,
typename TTypeTreeData=ZNsType::ZtCTypeTreeData<long>
>
ZtCTreeDataEx #################################################*/
}/*
namespace ZNsMain*/
/*//////////////////////////////////////////////////////////////////////////////////////////
■ 이 파일은 CTreeClass.H 파일을 대체할 것이다. CTreeClass.H 에서는 트리 구조를 표현하는데,
아래 형식의
class CMyNode;
{
public:
TypeData mo_TypeData;
ZNsMain::ZtCObjList<CMyNode> mo_NodeList; // 하위 노드 리스트.
};
재귀 용법을 구현할 수가 없어서, void* 를 사용하였다. 그러나 이 파일에서는, 똑같은 구조의
두 클래스 ZCNode1, ZCNode2 를 사용함으로써, 멋지게(!!) 재귀를 구현하고 있다.
클래스 ZCNode1 에서는 ZCNode2 의 컨테이너(리스트)를 가지고 있고,
클래스 ZCNode2 에서는 ZCNode1 의 컨테이너(리스트)를 가지고 있다.
아주 깜찍하고, 기발한 방법이라고 아니할 수 없다.
2011-10-29 일 토요일, 저녁 7 시 군포시예술문화회관 공연을 보고 오면서, 먼저 선언된 object
에서, 나중에 선언된 object 의 instance 를 참조하는 경우, 매끄럽게 해결할 수 있을 지도 모
르는 방법이 머릿 속에 그려지면서, 운명은 내편이라는 강한 확신이 들었었다. 그러나 집에 도
착 후, 조사 결과, 기대했던 매끄러운 방법은 아니었음이 드러났다. 실망할 수도 있었던 그 순
간, 트리를 구현할 때, 똑깥은 구조의, 이름만 다른 2 개의 클래스로 트리의 재귀 구조를 구현
할 수 있다는 생각이 번개처럼 떠 오른 것이다. 그 결과물이 이 파일 CTreeData.H 이다.
그래, 운명은 내편이었어.
어느덧 해는 저무는데, 이제는 모든 것을 뒤에 두고 떠날 수 있는 날이, 바로 앞에 성큼 다가왔
다.
-- 2011-10-31 23:47:00
-- 현재 CTreeClass.H 는 제거되었다. -- 2013-05-01 17:22:00
//////////////////////////////////////////////////////////////////////////////////////////*/
#endif // __ZCPPMAIN__ZCTREEDATA_H__