数学建模社区-数学中国

标题: TTypedList一个类型安全的TList模板类 [打印本页]

---

作者: 韩冰    时间: 2005-1-26 01:11
标题: TTypedList一个类型安全的TList模板类

& @2 N+ i6 ^4 r2 ^0 Y

偶在一个老外的文章的基础上写的，应该很有用的说，

以前总是用STL的vector做替代，但是STL的用法实在不是很习惯

, y! x$ q+ l: o) c8 y

//-------------------------------------------------------------------------

- ^0 N, Z4 V7 u7 O

#ifndef TypedListH_0CBFE2E8-E7C5-4D88-9844-1F177F4B00E4

#define TypedListH_0CBFE2E8-E7C5-4D88-9844-1F177F4B00E4

//-------------------------------------------------------------------------

#include <classes.hpp>

( i! U/ u1 n4 r+ |

//-------------------------------------------------------------------------

9 P* F3 s0 o9 @1 N4 e* L

template <class T>

class TTypedList : public TList

: {# h8 a2 o3 q

{

1 U0 ^5 ^7 b) Y% L

typedef TList inherited;

private:

bool FAutoClear;

TClass FItemClassType;

5 r3 Z% y0 ^0 m% |# V* D. g8 t

protected:

T* __fastcall Get(int Index) const

{

return (T*)inherited::Get(Index);

}

U( `* N) y( c3 z3 u

void __fastcall Put(int Index, T* Item)

{

4 ?, ?( m5 v2 C7 a

inherited:ut(Index, Item);

+ T- h+ \) z1 Z5 x' y

}

public:

& w) V* N# W7 W) J) \; n

__property T* Items[int Index] = {read=Get, write=Put};

0 J% J# l9 Z& \) S) `

public:

__fastcall TTypedList(bool bAutoClear = true)

6 H. M3 v1 c8 X3 L& i

: TList(), FAutoClear(bAutoClear), FItemClassType(__classid(T))

{ }

// no destructor needed

: a0 h- _8 z4 X9 T

int __fastcall Add(T* Item)

" W+ q; K. P- t+ H6 ]% R

{

3 n; u9 i" p$ ]; K7 e) `

return inherited::Add(Item);

}

int __fastcall AddList(const TTypedList& List)

{

& b; H: a# X1 L' Z2 W

if(this == &List)

; J% D6 T. d: v, W+ H* @5 L

{

6 o; z" N* x* P" P

throw EInvalidPointer("Can't add a TTypedList to himself!");

}

8 `2 T0 ^: p* S2 l1 b

if(FItemClassType != List.FItemClassType)

( j* Q$ g/ p% `/ L0 b, I4 P# E5 W; V

{

2 @3 U0 _. Q Q. W4 `9 L6 q# [

throw EConvertError("Can't add a TTypedList with a different ItemClass

Type!");

2 V0 s! p+ l, D( j% F

}

for(int i=0; i<List.Count; i++)

{

0 A C: F7 k3 ~6 L, x

Add(List.Get(i));

}

# Y2 |) ^( Y$ p- X' h+ ^9 ~: v' a

return List.Count;

, n: M5 p1 B, y

}

virtual void __fastcall Clear(void)

{

if(FAutoClear)

{

for(int i=0; i<Count; i++)

# h+ ^6 e& S" ]( V' B

{

delete Get(i);

}

# o" N1 g, v- k

}

. j/ I; V' I- Q! A* O6 @

inherited::Clear();

}

void __fastcall Delete(int Index, bool bAutoDelete = true)

{

* z2 d: H# h/ ]/ v5 o

if(bAutoDelete)

{

9 S9 V5 R9 b; k8 b

delete Get(Index);

}

3 F z. ~; |, w& d

inherited:elete(Index);

( }! S, {$ [% a

}

T* __fastcall First(void) const

" C5 u8 y$ ?% \; e

{

return (T*)inherited::First();

% I) |8 \1 y# v C* M

}

) X0 J2 g9 h# L- J2 ]* f! s

int __fastcall IndexOf(T* Item) const

{

* F# Q4 D! I: V/ H4 Y& N5 F* S

return inherited::IndexOf(Item);

}

void __fastcall Insert(int Index, T* Item)

{

4 o3 J3 R5 m# r q$ m

inherited::Insert(Index, Item);

) ?6 t3 Y; w7 [8 Q

}

bool __fastcall IsEmpty(void) const

{

return Count == 0;

}

' L5 E1 M5 h. S' W9 B% u# M

T* __fastcall Last(void) const

{

return (T*)inherited:ast();

. `% I+ y) ~# t* a$ M) H

}

1 Z3 o7 ]" Z+ t

int __fastcall Remove(T* Item, bool bAutoDelete = true)

2 G; `: Q; v+ [4 ^( v, |

{

% L8 C p. N) ~# @- l, D

int nIndex = inherited::Remove(Item);

. B. w5 ^! v1 U6 [( H0 O

if(bAutoDelete && (nIndex != -1))

7 I% | `; j+ X6 m9 ]3 P

{

delete Item;

}

return nIndex;

}

4 @( H) G ^8 ?3 Y' |

void operator<<(T* Item)

{

' Q; I) y4 Z) M$ e1 Q

Add((T *)Item);

}

4 @" i, d2 X, |+ v4 J

void operator<<(const TTypedList& List)

5 F4 Q- q2 V" C5 N# m1 s

{

" \" V: C" o6 H6 I. Q

AddList(List);

}

}; // end of TTypedList

//-------------------------------------------------------------------------

#endif

---

欢迎光临 数学建模社区-数学中国 (http://www.madio.net/)

Powered by Discuz! X2.5