一个方便好用的数组类

yzhlinux

to Whanxy

- U& ?" A. S+ ~$ C& F" N$ ^2 U# p

int N; N=StrToInt(Edit1->Text); & F+ m" a$ Q$ a: N. O# I, Q5 Cint RESULT[N]; 哈哈,这样的代码很有意思哦. 在c++里没有现成的类似vb的redim那样可以自由定义数组边界的办法,很多人提供了一些数组类以实现你这样的需求,同样微软也提供了这样的模板类 CArray ,你可以去参考这个摸板,不过 CArray 写的不够好只能给单线程的地方使用(后来个跟踪进去才发现是它的问题,没把偶气死)并且不能很好的支持使用 & 引用内部的成员(底层机制的问题),我从新改写了它的底层实现,写了一个摸板类,给你用正好满足你的需求.: #if !defined(CYCArray_INCLUDED) & g5 I4 V D" d c4 b* k#define CYCArray_INCLUDED #include "afxtempl.h" 3 @2 M3 s S& N$ l8 [9 c/** z3 p6 `& C3 \' A$ h* 动态数组的模板类 (Write By yzhlinux ,you could use it any time any way if you could email me about it yzhlinux@hotmail.com) * 1.支持字符索引 ( Q9 ~; F$ B' f3 ?: D7 K" B$ `* 2.方便的添加删除修改任意一项 * 最后更新 2004-8-9 2 @$ ^, J* g& e6 l; Y' m! k**1.优化了字符索引的运作方式，使用数组存储 9 W0 B7 ^5 d% k4 \7 [# A4 l**2.重写了底层数据的存储，将连续性的存储方式改为了非连续, *** 从而很好有效地支持了“引用”,并且让数据的删除增加变的更为快速 ///// : S0 q9 _/ f+ c* 用法句举例1： * YCArray<int,int> test1 ; * test1.Add("Number2",4); ) ?$ V8 e. t: K4 w, |) _8 G9 ~# _' [* test1.Add("Number1",2); * printf("%d %d",test1["Number1"],test1["Number2"]); - ~3 \, A9 L+ k* 显示： ( P4 b, ` t" I7 K% l+ g/ H* 2 4 - q. ]6 ~# O' E$ o///// * 用法句举例2： 2 i& n, `6 S9 S0 R* YCArray<CString,CString> test2 ; ( D9 ~, p n9 t l. h5 I* test2.Add("string2","hahahaha"); * test2.Add("string1","yes yes yes yes"); * printf("%s %s %s",test2["string1"],test2["string2],test2[0]); * 显示： * yes yes yes yes hahahaha yes yes yes yes ' [( Q: K% H0 H* i5 W///// 9 M- p' F& U: Q8 w0 ^$ ~* 用法句举例3: * YCArray<CString,CString> test3 ; # p k* [ f# m/ {: H7 Q* test3.Add("string2","hahahaha"); * test3.Add("string1","yes yes yes yes"); ) V+ W: Z/ i; e% {3 W* test3.Add("","no no no"); / {5 u* s2 P0 Z( b* test3.AddR("string2","yes yes yes yes"); //AddR方法会去搜索字符索引，如果存在则替换 * printf("%s %s %s",test3["string1"],test3["string2],test3[2]); . F& b* W5 `3 }4 b& ?* 显示： ; {7 s; f" u' K* yes yes yes yes yes yes yes yes no no no **/ ///////////////////////////////////////////////////////////////////////////// // YCArray<TYPE, ARG_TYPE> #include <afxmt.h> template<class TYPE, class ARG_TYPE> class YCArray : public CObject { . @$ e( \$ E2 J; U//friend YCArray<TYPE, ARG_TYPE>; % A5 M7 J, K: \! G+ A: _CCriticalSection YCArray_Add; 0 S# J4 d! ~/ G0 N8 vpublic: // Attributes 7 Z6 T# {+ C" K- J( ^ h4 U8 ?int GetSize() const; 2 n) K9 N) `1 d* o2 ~4 {int GetUpperBound() const; 2 n" \( T2 P7 e9 {# avoid SetSize(int nNewSize, int nGrowBy = -1);

: J4 c8 G) m8 S- W1 W" {

// Operations 6 D! |7 i- Q2 F) h! W// Clean up 4 o/ O* A8 c: f/ x! z1 J* T& ~7 Hvoid FreeExtra(); void RemoveAll();

// Accessing elements , f' G/ e! A; p. G5 }1 L: @TYPE GetAt(int nIndex) const; $ H Z% P/ Z5 z! r2 \* G$ \void SetAt(int nIndex, ARG_TYPE newElement); $ B6 n" H8 v C/ v9 Y- O A& u' @TYPE& ElementAt(int nIndex);

TYPE GetAt(CString cIndex) const; void SetAt(CString cIndex, ARG_TYPE newElement); ! k' O4 Q+ }4 _/ ?9 M0 j) lTYPE& ElementAt(CString cIndex);

// Direct Access to the element data (may return NULL) const TYPE** GetData() const; 8 G+ D. w6 U8 y4 E8 A1 o! hTYPE** GetData();

+ [. M) [7 W- H; `

// Potentially growing the array void SetAtGrow(int nIndex, ARG_TYPE newElement); void SetAtGrow(CString cIndex, ARG_TYPE newElement); 4 K0 T# @* Z- h- a( Kint Add(ARG_TYPE newElement,CString cIndex = ""); ) j; f3 W* u$ X( fint AddR(ARG_TYPE newElement,CString cIndex = "")//如果存在就替换 { int nIndex = GetIndex(cIndex); [5 {4 ]$ V8 D0 {9 m if(cIndex!=""&&nIndex >-1){ , a8 n1 ]/ ?6 { J operator[](nIndex)=newElement; * U# f5 n+ |5 O* q/ b9 O1 s- A }else{ 6 x2 ] C7 F3 A" m" S' d. s; V nIndex = m_nSize; ( F. L! r) X" c8 ^' p5 D SetAtGrow(nIndex, newElement); " O" R2 V& o: i SETIndex(cIndex,nIndex); " I3 ~, A3 S# T7 i. R. b. O return nIndex; - p; _- {; {: y4 t } } int AddM(ARG_TYPE newElement,CString cIndex = "") { + |3 ]4 P) _6 i1 S; R static int nIndex ; , ?) M0 N3 f4 z6 R, {8 ?5 x9 C YCArray_Add.Lock(); , s! S, P: N* t nIndex = m_nSize; SetAtGrow(nIndex, newElement); # h! E% K* x- l# t8 U0 r% B8 ~ YCArray_Add.Unlock(); SETIndex(cIndex,nIndex); return nIndex; 6 O2 ? j. E; ^# a}; int Append(const YCArray& src); void Copy(const YCArray& src);

// overloaded operator helpers TYPE operator[](int nIndex) const; ; n2 |5 q' C0 S1 E: D% JTYPE& operator[](int nIndex); TYPE operator[](CString cIndex) const; 2 g1 O6 t- g; Q2 k' oTYPE& operator[](CString cIndex); //YCArray<TYPE,ARG_TYPE> operator=(YCArray<TYPE,ARG_TYPE>& tparr)const; ! \' ^% @- d" e! }YCArray<TYPE,ARG_TYPE>& operator=(YCArray<TYPE,ARG_TYPE>& tparr); // Operations that move elements around , R9 ^& f% ]6 e# q$ s2 w" nvoid InsertAt(int nIndex, ARG_TYPE newElement, int nCount = 1); 6 _8 r7 g! f3 S6 Q C1 x# s9 Uvoid RemoveAt(int nIndex, int nCount = 1); void RemoveAt(CString cIndex,int nCount = 1); void InsertAt(int nStartIndex, YCArray* pNewArray); ' I. Q' |& G. c) f g7 ^void InsertAt(ARG_TYPE newElement,int nIndex,CString cIndex);

0 Q# h, D t& W' X9 S2 e

int GetIndex(CString cIndex); 7 n( O; \0 }$ d8 H8 b1 ^* ]CString GetIndex(int nIndex);

CString GetSign(); # q, N* J8 [1 N! Eint SetSign(CString& sign);

// Implementation protected: TYPE** Ym_pData; // the actual array of data int m_nSize; // # of elements (upperBound - 1) . p y8 h9 _- d6 Tint m_nMaxSize; // max allocated int m_nGrowBy; // grow amount private: * r! h, W- T5 I+ M# `int lock_sign; . d8 O; Y: F8 l% c3 \CString Sign; . S+ A2 ` l, r! N U5 dint MAXSIGNTIME;

9 H0 P( {" U9 o+ N* q

CString* strIndex; int strIndexNum; 9 e6 r$ m; c: k) Y; M/ jBOOL SetIndexSize(int nIndex); " S6 {1 d1 V. r# k# \BOOL SETIndex(CString cIndex,int nIndex); - Z. Y; ~/ t- f4 q$ k+ Y* MBOOL INSERTIndex(int nIndex,int nCount =1); BOOL DELIndex(int nIndex,int nCount = 1); BOOL DELIndex(CString cIndex,int nCount = 1); " v' s4 Z2 \6 l: U3 T3 ~void DestructAllElement(int nIndex,int nCount) {//销毁对象，包括每个指针指向的对象 9 K1 g, F, I F- H& U8 k6 `7 \ DELIndex(nIndex,nCount); 8 a( n0 W3 Z+ k1 I3 A ASSERT(nIndex >= 0); ' V1 z% a( H7 K3 D( W _ ASSERT(nCount >= 0); " k# l3 M4 [9 m K$ v ASSERT(nIndex + nCount <= m_nSize); & s8 M# ^- r9 [& P, X" H* T if(nCount>0&&m_nSize>0){ for(int i =nIndex;i<nIndex+nCount;i++){ //Ym_pData->~TYPE(); // 由于ConstructAllElements 中是 Ym_pData[nIndex] = new TYPE;所以不需要Ym_pData->~TYPE() . p- r% k U- N4 L1 ]; G R delete Ym_pData; } ' J& ?- M; m7 r8 J( O/ C } 1 @2 Q" |: F2 ]' W}; & Y6 Y2 u6 J& r. s$ ` Xvoid ConstructAllElements(int nIndex,int nCount) {//创建对象，包括 new 出每个指针指向的对象 //nIndex = 0; memset((void*)(Ym_pData+nIndex), 0, nCount * sizeof(TYPE*)); 9 r3 R+ B1 [' ^. u% t for (; nCount--; nIndex++) + m9 [. ^# E/ ^/ M0 w& m Ym_pData[nIndex] = new TYPE; }; public: // Construction YCArray(); YCArray(YCArray<TYPE, ARG_TYPE>& tp); # ~, e W0 ] x2 F6 {: H~YCArray(); void Serialize(CArchive&); ' c4 G$ A. T; H4 D#ifdef _DEBUG $ Y8 H& q R7 ]: w$ w6 Hvoid Dump(CDumpContext&) const; void AssertValid() const; 9 a% u ]7 [# M8 V( c% e; R#endif

};

% D0 k9 |' V# @) j" k* o4 X

[此贴子已经被作者于2005-1-10 14:04:39编辑过]

; Y: v B% u7 ?: w7 K" N

yzhlinux

//接上面

template<class TYPE, class ARG_TYPE> , H" ^. B+ A- _ A3 C6 O' D$ _! N* rYCArray<TYPE, ARG_TYPE>::~YCArray() { ASSERT_VALID(this);

if (Ym_pData != NULL) % p2 l; W4 }. r { DestructAllElement(0,m_nSize); //DestructElements<TYPE>(Ym_pData, m_nSize); delete[] (BYTE*)Ym_pData; } ) C$ O; T9 \4 H% l} template<class TYPE, class ARG_TYPE> 3 ?* u% b8 R/ l; L8 { tCString YCArray<TYPE, ARG_TYPE>::GetSign() { lock_sign=0; return Sign; ' X$ N1 i9 J/ d} T0 D, Q* Y) g0 z% Dtemplate<class TYPE, class ARG_TYPE> int YCArray<TYPE, ARG_TYPE>::SetSign(CString& sign) { , D6 E- {2 P5 S, i- P8 @! x int i=0; while(lock_sign&&i<MAXSIGNTIME){ Sleep(1); i++; } lock_sign=1; 9 Y0 T" c- B5 p. G6 f Sign=sign; return TRUE; } 5 Y8 D7 k Y1 l0 `+ O- |//用与把 nindex 后的索引往后推 nCount ,自动调整好buffer ; t- r) l7 h# t& r* }( g. ]3 U2 C# otemplate<class TYPE, class ARG_TYPE> BOOL YCArray<TYPE, ARG_TYPE>::SetIndexSize(int nNewSize) { ; L5 H( d% z D if(strIndexNum < nNewSize){ 8 z* b0 T, `$ e, T2 U CString* tp = new CString[nNewSize];//新的buffer . K' l: e* A5 g1 {( i3 g for(int i=0;i<strIndexNum;i++){//把老索引复制过来 ; X3 E7 J# k4 S$ n2 t, J tp = strIndex; - ^' {; s, |; o4 c6 i } for(i=strIndexNum;i<nNewSize;i++){ tp = "" ; } ?* \6 W/ r6 @ delete[] strIndex ; & J3 x& t' G& a; h' T strIndex = tp ; strIndexNum = nNewSize ; }else if(strIndexNum < nNewSize){ for(int i=nNewSize;i<strIndexNum;i++){ 9 G5 y8 _, |8 J. l- t+ G. `2 _ strIndex = "" ; " ?' a8 Y& I: a* Y } } return TRUE; } 6 J: p! h: r& u! O G& qtemplate<class TYPE, class ARG_TYPE> 8 c ? v% I8 PBOOL YCArray<TYPE, ARG_TYPE>::INSERTIndex(int nIndex,int nCount /*=1*/) { CString* tp = new CString[m_nSize+nCount];//新的buffer # g& M2 \0 q9 x. B+ f6 n' E* @ for(int i=0;i<nIndex;i++){//把老索引复制过来 * R& N& d* U6 u6 J$ o tp = strIndex; }int j =0 ; for(i=nIndex+nCount;i<m_nSize;i++){//把老索引复制过来 tp = strIndex[nIndex+j]; 6 W" U; ^: a. H$ `" B5 a6 w# C j++; # ~' \! d; ]9 \3 N' F% e2 ` } delete[] strIndex ; * i9 M8 v* ~9 Y/ y/ ?# d" c! z/ W& A9 } strIndex = tp ; 7 b0 P s; f1 M* S return TRUE; . a( m/ K1 q1 F; U6 M} 3 ]& ^# G+ |1 }. btemplate<class TYPE, class ARG_TYPE> 5 D; U% g6 S2 w1 o* H" _. B9 _BOOL YCArray<TYPE, ARG_TYPE>::SETIndex(CString cIndex,int nIndex) {//在 nIndex 后面添加一个 字符串索引 strIndex[nIndex] = cIndex ; 4 c& j4 A5 O' s! Y2 W. X) H return TRUE; 0 V2 n8 f: A3 b5 x} $ a4 U* u7 l$ ltemplate<class TYPE, class ARG_TYPE> BOOL YCArray<TYPE, ARG_TYPE>:ELIndex(int nIndex,int nCount /*=1*/) {//需要在 m_nSize 变化之前调用!! ASSERT(nIndex >= 0); 8 t& @; q/ @. {: y8 F" d ASSERT(nCount >= 0); , h# v6 p4 @" v ASSERT(nIndex + nCount <= m_nSize); int j =0 ; * B" Z3 L: M! Q) G/ W7 C" @ for(int i=nIndex+nCount;i<m_nSize;i++){//把老索引复制过来 0 F( I% X2 R0 B$ Y( y9 M" ]: V/ X' E strIndex[nIndex+j] = strIndex; " ?% ~2 _0 Z8 ^/ ~ j++; } 5 E1 G, G! Z! a return TRUE; } - s+ |. D; F: E* H9 Vtemplate<class TYPE, class ARG_TYPE> . J$ O4 W: g( w6 A; O- @3 [BOOL YCArray<TYPE, ARG_TYPE>:ELIndex(CString cIndex,int nCount /*=1*/) { * w6 f4 |( u* ?; L% d int nIndex=this->GetIndex(cIndex); ( N- F- u, Y& X+ C$ A8 d+ l return this->DELIndex(nIndex,nCount); } ! F% f. I# i4 `# e8 R8 n' \template<class TYPE, class ARG_TYPE> # K# K9 N( ?4 ]4 Z& ]int YCArray<TYPE, ARG_TYPE>::GetIndex(CString cIndex) {//得到 cIndex 的数字索引 ! `) ^, i4 K& F int nPos = -1; " e. I2 h' m+ y/ r6 D( X for(int i=0;i<m_nSize;i++){ ) Q) A4 K. G2 B" P1 @' a: M4 H! C9 p% L if(strIndex == cIndex){ nPos = i ;break; } / Q0 y) O2 [$ T- O7 n } 7 S( V# |+ B& I. V% T6 f" U4 ~ return nPos; } template<class TYPE, class ARG_TYPE> ; O# i% D" Q: v; n" v8 dCString YCArray<TYPE, ARG_TYPE>::GetIndex(int nIndex) 0 c7 b+ B( G3 |1 s* t2 a) |5 s" y{//返回 nIndex 的字符串索引 return strIndex[nIndex]; } J+ G7 s x$ p# l+ V6 \3 p: W///////////////////////////////////////////////////////////////////////////// / s; d! E7 W" K( W9 _7 U4 H4 Z// YCArray<TYPE, ARG_TYPE> inline functions

template<class TYPE, class ARG_TYPE> AFX_INLINE int YCArray<TYPE, ARG_TYPE>::GetSize() const { return m_nSize; } 3 L. k6 Z) B7 Rtemplate<class TYPE, class ARG_TYPE> 6 m5 q H) m R# S% A3 l6 JAFX_INLINE int YCArray<TYPE, ARG_TYPE>::GetUpperBound() const { return m_nSize-1; } template<class TYPE, class ARG_TYPE> " ? d+ t0 A4 U, U6 C* C% G7 aAFX_INLINE void YCArray<TYPE, ARG_TYPE>::RemoveAll() k/ u+ M: y: W; E { SetSize(0, -1); } template<class TYPE, class ARG_TYPE> , t& M7 G; O, z, Y) ~9 vAFX_INLINE TYPE YCArray<TYPE, ARG_TYPE>::GetAt(int nIndex) const ( m0 t m0 `" `" | { ASSERT(nIndex >= 0 && nIndex < m_nSize); return *Ym_pData[nIndex]; } " b7 ?5 \5 a* Q) ` \template<class TYPE, class ARG_TYPE> ! K) s# H: c# I. w d( m) EAFX_INLINE void YCArray<TYPE, ARG_TYPE>::SetAt(int nIndex, ARG_TYPE newElement) { ASSERT(nIndex >= 0 && nIndex < m_nSize); 7 {' _1 s" P" c/ l, {) J *(Ym_pData[nIndex]) = newElement; }

template<class TYPE, class ARG_TYPE> AFX_INLINE TYPE& YCArray<TYPE, ARG_TYPE>::ElementAt(int nIndex) ) J/ F5 ]) U7 P2 Q1 ?, g* T% ?2 A { ASSERT(nIndex >= 0 && nIndex < m_nSize); return *Ym_pData[nIndex]; }

template<class TYPE, class ARG_TYPE> TYPE YCArray<TYPE, ARG_TYPE>::GetAt(CString cIndex) const { 5 q; a, f/ P+ ~; \& p int nIndex=GetIndex(cIndex); ( a0 x& L/ D" P+ l' v return GetAt(nIndex); * u6 J1 u8 v/ N. L) i4 U} : R) i1 |9 d. Z4 Ctemplate<class TYPE, class ARG_TYPE> ) U5 \- X" b7 [* r" I: kvoid YCArray<TYPE, ARG_TYPE>::SetAt(CString cIndex, ARG_TYPE newElement) { + H4 h! [1 L* a! f' Z# O int nIndex=GetIndex(cIndex); ' D. V" Z' I% t! T5 E: l5 }( S return SetAt(nIndex, newElement); } template<class TYPE, class ARG_TYPE> ; Z4 @: O7 N6 g+ N# ^TYPE& YCArray<TYPE, ARG_TYPE>::ElementAt(CString cIndex) { @4 D8 e! M* r- D' I int nIndex=GetIndex(cIndex); return ElementAt(nIndex); " ~; a+ I% R6 E} template<class TYPE, class ARG_TYPE> 8 l% Y( R4 _0 t2 P, S; |AFX_INLINE const TYPE** YCArray<TYPE, ARG_TYPE>::GetData() const { return (const TYPE**)Ym_pData; } ) L' g2 c: O7 b# ?2 R$ F* {# {. u) a0 vtemplate<class TYPE, class ARG_TYPE> AFX_INLINE TYPE** YCArray<TYPE, ARG_TYPE>::GetData() { return (TYPE**)Ym_pData; } template<class TYPE, class ARG_TYPE> 9 ~: F' r! J7 y1 \5 p. A7 OAFX_INLINE int YCArray<TYPE, ARG_TYPE>::Add(ARG_TYPE newElement,CString cIndex /* ="" */) { int nIndex = m_nSize; SetAtGrow(nIndex, newElement); SETIndex(cIndex,nIndex); return nIndex; } t8 w \( ~( _) g* s8 c" c3 Qtemplate<class TYPE, class ARG_TYPE> ! _, E. s. P! Z3 ^" [AFX_INLINE TYPE YCArray<TYPE, ARG_TYPE>:perator[](int nIndex) const 5 q! G8 ?+ _) L% S1 D$ |) F) G { return GetAt(nIndex); } template<class TYPE, class ARG_TYPE> ( v2 F; H4 E% Z1 \/ W" E4 KAFX_INLINE TYPE& YCArray<TYPE, ARG_TYPE>:perator[](int nIndex) & Y0 k# z( X- _4 @$ W { return ElementAt(nIndex); } 4 }) j/ l, v3 c9 Ytemplate<class TYPE, class ARG_TYPE> 7 j6 l `. \: q) _- W, wAFX_INLINE TYPE YCArray<TYPE, ARG_TYPE>:perator[](CString cIndex) const 0 L$ b y9 s! V/ ?, F- R{ int nIndex=GetIndex(cIndex);

return operator[](nIndex); 6 u% k5 k/ x1 B} template<class TYPE, class ARG_TYPE> AFX_INLINE TYPE& YCArray<TYPE, ARG_TYPE>:perator[](CString cIndex) { $ y8 L: d* ?! h. R. @ int nIndex=GetIndex(cIndex); 6 ^- q! C6 P2 k" Z. Z }/ S/ |6 e. Z return operator[](nIndex); S. w: n' E, Q% F. Q# M} /* % s+ S; {$ L5 b' B9 p7 r( etemplate<class TYPE, class ARG_TYPE> 6 \! k* @. P j b8 `8 BAFX_INLINE YCArray<TYPE,ARG_TYPE> YCArray<TYPE, ARG_TYPE>:perator=(YCArray<TYPE,ARG_TYPE>& tparr) const { int i,j; for(i=0;i<tparr.GetSize();i++){ j = GetIndex(tparr.GetIndex(i)); if(j>-1){ $ q: B3 t2 `5 D! O operator[](tparr.GetIndex(i)) = tparr; ( v0 \6 }$ y# r2 }; ^ }else{ Add(tparr,tparr.GetIndex(i)); } 7 |+ {4 ~6 T( i, E+ T1 E } return this; } */ template<class TYPE, class ARG_TYPE> AFX_INLINE YCArray<TYPE,ARG_TYPE>& YCArray<TYPE, ARG_TYPE>:perator=(YCArray<TYPE,ARG_TYPE>& src) { ASSERT_VALID(this); ASSERT(this != &src); // cannot append to itself

SetSize(src.m_nSize); ; A+ J9 @ c+ J2 F for(int i=0;i<m_nSize;i++){ 6 r# v7 B/ b( `. O /*将此句修改为内存拷贝*/// *Ym_pData = *src.Ym_pData ; //memcpy(Ym_pData,src.Ym_pData,sizeof(TYPE)); SETIndex(src.GetIndex(i),i); # C+ l1 `: g v J: W: v } , ^1 H5 u$ P3 k- d) K4 z9 K, n, ~ return *this; } ///////////////////////////////////////////////////////////////////////////// // YCArray<TYPE, ARG_TYPE> out-of-line functions

template<class TYPE, class ARG_TYPE> YCArray<TYPE, ARG_TYPE>::YCArray() { Ym_pData = NULL; . Y( L/ }$ K& t( \( ~ strIndexNum = m_nSize = m_nMaxSize = m_nGrowBy = 0; # J8 }8 d3 a# y( t8 T1 W& W( K# r0 e5 p strIndex=NULL;MAXSIGNTIME=10; % m, U b* X9 b' Q# [$ [. H} template<class TYPE, class ARG_TYPE> YCArray<TYPE, ARG_TYPE>::YCArray(YCArray<TYPE, ARG_TYPE>& tp) { 8 g- g& w2 j \) S Ym_pData = NULL; $ N/ X; E v5 I" ~ strIndexNum = m_nSize = m_nMaxSize = m_nGrowBy = 0; strIndex=NULL;MAXSIGNTIME=10; operator=(tp); }

template<class TYPE, class ARG_TYPE> 8 G2 B4 t& k' v( J6 u( F$ `" `9 S! `void YCArray<TYPE, ARG_TYPE>::SetSize(int nNewSize, int nGrowBy) { * ~5 E& E) E) t! d ASSERT_VALID(this); ASSERT(nNewSize >= 0);

if (nGrowBy != -1) ! G4 m' M4 G9 d8 X1 H+ R m_nGrowBy = nGrowBy; // set new size

if (nNewSize == 0){ 0 N0 l/ ^+ P! Y1 [' _ // shrink to nothing 5 D9 V: [# w$ i8 d+ ]4 o! ] if (Ym_pData != NULL){ 0 r3 ]& e0 [9 o s6 _& G DestructAllElement(0,m_nSize); * S4 [5 D8 T# @ //DestructElements<TYPE>(Ym_pData, m_nSize); 5 u1 H3 Y6 H) d: Z, H delete[] (BYTE*)Ym_pData; Ym_pData = NULL; } m_nSize = m_nMaxSize = 0; } else if (Ym_pData == NULL){ // create one with exact size #ifdef SIZE_T_MAX + s$ h8 o! s7 G& u; U$ L4 ]) B ASSERT(nNewSize <= SIZE_T_MAX/sizeof(TYPE*)); // no overflow #endif R. K- D: f0 f7 ~ B @ Ym_pData = (TYPE**) new BYTE[nNewSize * sizeof(TYPE*)]; ConstructAllElements(0,nNewSize);//ConstructElements<TYPE>(Ym_pData, nNewSize); " C8 [' _6 Z' R9 U/ `/ Z* b- s m_nSize = m_nMaxSize = nNewSize; } else if (nNewSize <= m_nMaxSize){ * l: Z) u7 x1 E3 M, C6 S! n // it fits 5 V2 ]2 t' Y5 D; e' K+ v- f: c2 ] if (nNewSize > m_nSize) 5 Y/ @8 i! j' }% r& ]. n M1 n2 ~ { // initialize the new elements 5 T& p: z% q# \, w j% L, ~8 b ConstructAllElements(m_nSize,nNewSize-m_nSize);//ConstructElements<TYPE>(&Ym_pData[m_nSize], nNewSize-m_nSize); } else if (m_nSize > nNewSize) { // destroy the old elements DestructAllElement(nNewSize,m_nSize-nNewSize); //DestructElements<TYPE>(&Ym_pData[nNewSize], m_nSize-nNewSize); 3 M, c& r% W6 `1 u0 _- t } 5 H: g* {7 ]' k: k0 h7 d m_nSize = nNewSize; } 6 I: G' j7 @" x4 j, l8 X else { // otherwise, grow array int nGrowBy = m_nGrowBy; if (nGrowBy == 0) 4 ]. x- U6 u0 ~/ q { // heuristically determine growth when nGrowBy == 0 // (this avoids heap fragmentation in many situations) 2 K& Y( b1 ]3 T& e( {5 [ nGrowBy = m_nSize / 8; 7 w0 b0 u! T4 _ nGrowBy = (nGrowBy < 4) ? 4 : ((nGrowBy > 1024) ? 1024 : nGrowBy); } , [$ w% w, G( w/ B" } int nNewMax; / D8 \/ s, a, i& W8 z" M/ G$ O if (nNewSize < m_nMaxSize + nGrowBy) nNewMax = m_nMaxSize + nGrowBy; // granularity else % c- s+ Q1 S7 [6 M' z3 s* O nNewMax = nNewSize; // no slush

ASSERT(nNewMax >= m_nMaxSize); // no wrap around / ^ k' C; L! c) x% F4 t# z#ifdef SIZE_T_MAX , T G3 m9 Z% | ASSERT(nNewMax <= SIZE_T_MAX/sizeof(TYPE)); // no overflow # Q" [4 D- w1 W8 n#endif TYPE** pNewData = (TYPE**) new BYTE[nNewMax * sizeof(TYPE*)];//TYPE* pNewData = (TYPE*) new BYTE[nNewMax * sizeof(TYPE)];

// copy new data from old : C7 h# g1 f" C' w/ }6 D) T; E memcpy(pNewData, Ym_pData, m_nSize * sizeof(TYPE*));

// construct remaining elements ASSERT(nNewSize > m_nSize); //throw("/*wait for me --- yzhlinux*/"); delete[] (BYTE*)Ym_pData; Ym_pData = pNewData; ; A1 ]8 ~, n! M1 ?: H ConstructAllElements(m_nSize,nNewSize-m_nSize);//ConstructElements<TYPE>(&pNewData[m_nSize], nNewSize-m_nSize);

// get rid of old stuff (note: no destructors called) m_nSize = nNewSize; m_nMaxSize = nNewMax; } SetIndexSize(nNewSize); . R9 s9 ^0 q _7 w2 B; E}

yzhlinux

//接上面

& x4 P8 `$ N+ w6 Z) O8 Ltemplate<class TYPE, class ARG_TYPE> 8 F$ N L9 n) V- r. G% ?' ~int YCArray<TYPE, ARG_TYPE>::Append(const YCArray& src) 3 S4 m1 l( U- o( y, \{ ASSERT_VALID(this); ASSERT(this != &src); // cannot append to itself

int nOldSize = m_nSize; 6 M- S' R, d C. F4 }4 D; l0 @9 w' U SetSize(m_nSize + src.m_nSize);

ConstructAllElements(nOldSize,src.m_nSize); ) ^2 i- j& I1 Z3 v( t for(int i=nOldSize;i<m_nSize;i++){ /*将此句修改为内存拷贝*/// ( g# G) {( f1 x3 V' d *Ym_pData = *src.Ym_pData[i-nOldSize] ; # p' q0 Y+ R" y) @+ w //memcpy(Ym_pData,src.Ym_pData[i-nOldSize],sizeof(TYPE)); SETIndex(src.GetIndex(i-nOldSize),i); # U( Q/ q# E6 m N$ N/ N6 u } 3 R4 i- S; F; j+ |; l5 ~ /*wait for me*///CopyElements<TYPE>(Ym_pData + nOldSize, src.Ym_pData, src.m_nSize); 1 U* p- W6 B3 j; M/ d- Z6 Y" {3 c return nOldSize; : K2 r8 l* z/ V: D4 a2 v}

template<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::Copy(const YCArray& src) 5 j! P- r! P/ A9 [- ]' S3 [2 W5 V: [{ 1 h0 S8 Q5 @3 N3 ]$ s: P ASSERT_VALID(this); ASSERT(this != &src); // cannot append to itself

SetSize(src.m_nSize); ) N4 [+ Q1 z9 B for(int i=0;i<m_nSize;i++){ " r) ^; P" Y) w* t) V- a' x /*将此句修改为内存拷贝*///*Ym_pData = *src.Ym_pData ; memcpy(Ym_pData,src.Ym_pData,sizeof(TYPE)); 5 c2 [3 l% W F Z1 ^ F SETIndex(src.GetIndex(i),i); ! Y! d, n% c C } /*wait for me*///CopyElements<TYPE>(Ym_pData, src.Ym_pData, src.m_nSize); }

template<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::FreeExtra() { + ~. ], `4 A) b" s( t2 f( o ASSERT_VALID(this);

if (m_nSize != m_nMaxSize) 5 Y. N) x7 g4 R2 j { ; u0 {, z. f5 p% G/ m& x* T% S& ]2 d // shrink to desired size #ifdef SIZE_T_MAX ASSERT(m_nSize <= SIZE_T_MAX/sizeof(TYPE)); // no overflow 6 Q4 |( g+ h+ j9 k: a6 }# \#endif 6 U0 m9 T5 M& { r# T. M TYPE* pNewData = NULL; 8 W) Z) W/ b+ u" A9 j: r if (m_nSize != 0) * I$ F" j9 K/ j* L' J { pNewData = (TYPE**) new BYTE[m_nSize * sizeof(TYPE*)]; / ^% W0 @/ M$ L- o) g8 R8 g, O5 y+ ? // copy new data from old . u" u* @2 F" K, h8 C; j# a/ w7 j& E memcpy(pNewData, Ym_pData, m_nSize * sizeof(TYPE*)); }

// get rid of old stuff (note: no destructors called) 6 w# g* X6 {0 o D' a( q1 P delete[] (BYTE*)Ym_pData; Ym_pData = pNewData; * J8 R. n {$ H1 Y+ A2 T* S m_nMaxSize = m_nSize; } } template<class TYPE, class ARG_TYPE> 2 C* q9 G' |* K4 C6 v1 `: Z; A3 Avoid YCArray<TYPE, ARG_TYPE>::SetAtGrow(CString cIndex, ARG_TYPE newElement) $ v$ B2 k3 }! i2 U+ |{ int nIndex=GetIndex(cIndex); return SetAtGrow(nIndex,newElement); . j( N% z8 R9 r1 W" ?8 K" x+ e} ' q( C3 D, I5 r) A( c9 d$ S* b: j3 ~template<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::SetAtGrow(int nIndex, ARG_TYPE newElement) { 6 ?: P3 E! s1 F. T8 a" E. Q$ q ASSERT_VALID(this); ASSERT(nIndex >= 0);

if (nIndex >= m_nSize) " b- N1 d- g$ p+ J0 D# t5 W SetSize(nIndex+1, -1); ( I1 d$ Z5 l2 o) |5 z4 z% e3 F' s4 f *Ym_pData[nIndex] = newElement; }

template<class TYPE, class ARG_TYPE> ! ?. _' ~8 l1 bvoid YCArray<TYPE, ARG_TYPE>::InsertAt(int nIndex, ARG_TYPE newElement, int nCount /*=1*/) { ! }9 W5 I0 X. a ASSERT_VALID(this); 7 {9 }9 R1 P7 X6 R ASSERT(nIndex >= 0); // will expand to meet need ASSERT(nCount > 0); // zero or negative size not allowed

if (nIndex >= m_nSize) { ) I* e/ j3 h- R& a" u) q2 O4 p+ M% t // adding after the end of the array . h6 R$ b5 D3 j2 I SetSize(nIndex + nCount, -1); // grow so nIndex is valid 4 T+ F( M; R+ @$ z. F } z( [- C R X7 | else * ~5 G/ \3 k- m a c6 d { // inserting in the middle of the array int nOldSize = m_nSize; SetSize(m_nSize + nCount, -1); // grow it to new size // destroy intial data before copying over it /*不需要销毁了,因为 SetSize 的是指针*///DestructAllElement(nOldSize,nCount); : N) h5 f" T) V2 ^/ I2 v* ^ //DestructElements<TYPE>(&Ym_pData[nOldSize], nCount); // shift old data up to fill gap ) l& J2 d/ \3 f: c: S# w3 Q memmove(&Ym_pData[nIndex+nCount], &Ym_pData[nIndex], (nOldSize-nIndex) * sizeof(TYPE*));

// re-init slots we copied from /*不需要销毁了,因为 SetSize 的是指针*///ConstructAllElements(nIndex,nCount);//ConstructElements<TYPE>(&Ym_pData[nIndex], nCount); }

// insert new value in the gap ASSERT(nIndex + nCount <= m_nSize); while (nCount--){ *Ym_pData[nIndex++] = newElement; ) X2 R I' z" P! E } ' K, r J0 S/ O5 h" g9 N! M} # z9 ^3 _! l0 n* ftemplate<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::RemoveAt(CString cIndex,int nCount /*=1*/) 4 j# L1 H) n5 Z+ T{ . J" n& n0 f0 T1 _! I/ i9 G int nIndex = GetIndex(cIndex); RemoveAt(nIndex,nCount); : |: e& A4 o% S$ I# _} . ~" d- Y- t8 c' xtemplate<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::RemoveAt(int nIndex, int nCount /*=1*//*=1*/) 1 D8 h( ^2 o, o; y# ^, j; k{ ASSERT_VALID(this); " o* D; S+ H# j% S% ~0 [ ASSERT(nIndex >= 0); ASSERT(nCount >= 0); ASSERT(nIndex + nCount <= m_nSize); //yzh DELIndex(nIndex); //yzh // just remove a range int nMoveCount = m_nSize - (nIndex + nCount); //需要移动的数目 0 {# Z' l: E; u0 Y& m DestructAllElement(nIndex,nCount); //DestructElements<TYPE>(&Ym_pData[nIndex], nCount); ' h1 K2 x; V/ L( y+ f5 Y if (nMoveCount) memmove(&Ym_pData[nIndex], &Ym_pData[nIndex + nCount], 6 @& @9 q+ C" {- X% I nMoveCount * sizeof(TYPE*)); " M/ y" [* P( p5 p, u+ f4 t m_nSize -= nCount; }

template<class TYPE, class ARG_TYPE> / _4 _3 k: S8 A( w& P, ?void YCArray<TYPE, ARG_TYPE>::InsertAt(int nStartIndex, YCArray* pNewArray) 1 G6 D% N$ U/ V/ Z{ 4 n# D+ G6 ~$ k& @' q" H+ s ASSERT_VALID(this); ASSERT(pNewArray != NULL); ! @/ D4 p; j4 c, e7 U* b/ k- W ASSERT_VALID(pNewArray); : g% q0 k. i+ R8 f4 ~% r e ASSERT(nStartIndex >= 0);

if (pNewArray->GetSize() > 0) { 2 Q+ |2 g5 t+ J5 d) R4 y InsertAt(nStartIndex, pNewArray->GetAt(0), pNewArray->GetSize()); 2 A5 o6 i/ f4 O2 g for (int i = 0; i < pNewArray->GetSize(); i++) SetAt(nStartIndex + i, pNewArray->GetAt(i)); } } template<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::InsertAt(ARG_TYPE newElement, int nIndex,CString cIndex) { ADDIndex(cIndex,nIndex+1); InsertAt(newElement,nIndex); 7 m& |+ ]) C4 T# I1 ^4 A6 q0 o/ }7 i9 t} ' r! z9 H& y. Atemplate<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::Serialize(CArchive& ar) { ) s* W( M9 n' A" Q5 s ASSERT_VALID(this); throw("/*wait for me --- yzhlinux*/"); ; d* i" j. J9 `* O4 e8 s CObject::Serialize(ar); 4 P; f( S9 M- j2 h+ n0 Y if (ar.IsStoring()) { + o) A9 G! C# L! m ar.WriteCount(m_nSize); / F/ W( H1 ^4 o7 R% k3 Q7 v } 9 J+ X; x3 s0 ` else " P7 o8 K# P2 c4 ]% _$ V# p { % {% V) G2 R2 s2 D2 N( b8 t' | DWORD nOldSize = ar.ReadCount(); ( H# }5 r- g) G F. ?; R* E9 P SetSize(nOldSize, -1); } * ^ W% L" G- N0 c //SerializeElements<TYPE>(ar, Ym_pData, m_nSize); }

#ifdef _DEBUG template<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::AssertValid() const . H2 M+ e" m1 _) Z8 k{ CObject::AssertValid();

if (Ym_pData == NULL) 1 u J) q. u. {+ R ?& t$ h { ASSERT(m_nSize == 0); ASSERT(m_nMaxSize == 0); } else 3 o- \ P$ z$ i$ F8 \ { 3 X; p8 x1 h& q. k0 J/ H# _ ASSERT(m_nSize >= 0); ASSERT(m_nMaxSize >= 0); 7 s8 V( f& g$ m' S0 G& X9 ~7 j ASSERT(m_nSize <= m_nMaxSize); 9 r; k: k7 Z! `/ [1 s! | ASSERT(AfxIsValidAddress(Ym_pData, m_nMaxSize * sizeof(TYPE*))); } } template<class TYPE, class ARG_TYPE> 0 Q3 R0 }; F+ k+ evoid YCArray<TYPE, ARG_TYPE>:ump(CDumpContext& dc) const , g6 B& I0 l5 Q7 W$ B( v% z{ ( {! I+ Y+ ]. K& a \ CObject:ump(dc); throw("/*wait for me --- yzhlinux*/"); 8 b- t- S% {9 u4 r9 H& r dc << "with " << m_nSize << " elements"; * d2 S* K. x% ^. h; ]5 d if (dc.GetDepth() > 0) { dc << "\n"; , @- A9 F% j. x7 z: y/*wait for me --- yzhlinux*/// DumpElements<TYPE>(dc, Ym_pData, m_nSize); 1 w1 ~" R* p8 M/ K; M }

dc << "\n"; # R, O( C& B( @$ ^} #endif

#endif

//完

Eagle

太长了点，叶师兄应该打包上传的。

yzhlinux

以下是引用Eagle在2005-1-10 14:44:00的发言： 7 e: ?7 j7 `3 k! A太长了点，叶师兄应该打包上传的。

+ P* z. E6 F" Z, [ ) ~/ m `% W1 [8 O 就是因为发不了文件啊，奇怪，现在不能上传文件了，不然不用那么辛苦 0 V& h) G# d. \! Q1 i# P' l

Eagle

先传到帖图区……

管理员

赚帖子不好吗

yzhlinux

现在可以传文件了，附上，好用的摸板数组类，支持 ATL 可以在任何地方使用。
0 s( C) o7 `0 f, }
E2mkAVvk.rar (4.61 KB, 下载次数: 19)

2005-6-3 14:56 上传

点击文件名下载附件
一个方便好用的数组类
下载积分: 下沙币 -1 元

游侠无极限

std::map 模板的作用好像就是这样的……