一个方便好用的数组类

yzhlinux

to Whanxy

; n5 u$ y/ s; v" Z

int N; * o( S7 x, `7 |& I. z' U" cN=StrToInt(Edit1->Text); , p0 e3 W0 f6 c6 W; Wint RESULT[N]; # i- o0 F& v+ {* _哈哈,这样的代码很有意思哦. % m" N$ S8 z" c: X' K k6 H/ w4 \在c++里没有现成的类似vb的redim那样可以自由定义数组边界的办法,很多人提供了一些数组类以实现你这样的需求,同样微软也提供了这样的模板类 CArray ,你可以去参考这个摸板,不过 CArray 写的不够好只能给单线程的地方使用(后来个跟踪进去才发现是它的问题,没把偶气死)并且不能很好的支持使用 & 引用内部的成员(底层机制的问题),我从新改写了它的底层实现,写了一个摸板类,给你用正好满足你的需求.: #if !defined(CYCArray_INCLUDED) #define CYCArray_INCLUDED #include "afxtempl.h" # ~# Y, C, d* Q+ g: O( x7 v/** 3 n: g; o+ C5 p* b7 m; }. ~* 动态数组的模板类 (Write By yzhlinux ,you could use it any time any way if you could email me about it yzhlinux@hotmail.com) 4 c; H# M9 j5 y* 1.支持字符索引 : C0 f7 q. x' f& d3 a* 2.方便的添加删除修改任意一项 8 i" Y/ T: t, m3 s" t$ X* 最后更新 2004-8-9 2 X! _7 o' t# m**1.优化了字符索引的运作方式，使用数组存储 **2.重写了底层数据的存储，将连续性的存储方式改为了非连续, *** 从而很好有效地支持了“引用”,并且让数据的删除增加变的更为快速 % Z( X. m* i; \///// * 用法句举例1： * YCArray<int,int> test1 ; ' w: G1 v* a5 v% w* test1.Add("Number2",4); # E) Y `! N0 P8 @: { z* test1.Add("Number1",2); * printf("%d %d",test1["Number1"],test1["Number2"]); * 显示： ( a0 ]7 l' G9 B4 Y$ M; C( j* 2 4 ///// * 用法句举例2： 4 M! X' p! `/ U4 n* YCArray<CString,CString> test2 ; * test2.Add("string2","hahahaha"); * test2.Add("string1","yes yes yes yes"); 1 x( |% C6 q) u+ e4 a' S3 J7 ~* printf("%s %s %s",test2["string1"],test2["string2],test2[0]); ) O. }4 C4 g% y7 Y8 h4 j' c+ W* 显示： ) e" ~: b* P; X; z" C- A- q* yes yes yes yes hahahaha yes yes yes yes 2 J/ k( T4 ?5 h+ O///// * 用法句举例3: ! Y' i7 B+ E, @9 \* YCArray<CString,CString> test3 ; * test3.Add("string2","hahahaha"); * test3.Add("string1","yes yes yes yes"); * test3.Add("","no no no"); * test3.AddR("string2","yes yes yes yes"); //AddR方法会去搜索字符索引，如果存在则替换 0 u" d, Q8 p' p& \* printf("%s %s %s",test3["string1"],test3["string2],test3[2]); * 显示： * G2 O5 }- G3 l7 E* yes yes yes yes yes yes yes yes no no no 7 [( Y& y, E1 v3 [**/ ///////////////////////////////////////////////////////////////////////////// 4 o6 y$ ~4 p0 o y. P! i0 s* O// YCArray<TYPE, ARG_TYPE> #include <afxmt.h> template<class TYPE, class ARG_TYPE> class YCArray : public CObject { 9 J! f; n8 k& g9 i# m5 C' e3 z% f//friend YCArray<TYPE, ARG_TYPE>; ! [0 k6 Q; e0 LCCriticalSection YCArray_Add; 5 g+ L# `+ O% n* Bpublic: // Attributes 9 s- v- b* _) x' ] Rint GetSize() const; int GetUpperBound() const; 6 b' f5 V% [( F* H, qvoid SetSize(int nNewSize, int nGrowBy = -1);

// Operations // Clean up $ O9 B% S$ c& F( ^void FreeExtra(); 4 n. G" C7 ]6 q9 S. w7 n; [) Q% \void RemoveAll();

// Accessing elements . ^7 n7 B7 N8 H7 \) f5 \TYPE GetAt(int nIndex) const; void SetAt(int nIndex, ARG_TYPE newElement); TYPE& ElementAt(int nIndex);

( ]4 {7 O% u, X1 q) i0 F( g

TYPE GetAt(CString cIndex) const; void SetAt(CString cIndex, ARG_TYPE newElement); 0 k& |! S$ p) s! FTYPE& ElementAt(CString cIndex);

// Direct Access to the element data (may return NULL) const TYPE** GetData() const; 1 F! {) H1 i: B& ?! Q f" ATYPE** GetData();

8 k& T, L7 i3 o4 i, J J3 l- \

// Potentially growing the array void SetAtGrow(int nIndex, ARG_TYPE newElement); ! a0 W, o& G+ M+ N" Zvoid SetAtGrow(CString cIndex, ARG_TYPE newElement); / m5 b3 r; A9 `6 Vint Add(ARG_TYPE newElement,CString cIndex = ""); int AddR(ARG_TYPE newElement,CString cIndex = "")//如果存在就替换 ! x# w1 f1 ?3 S# B{ ' A6 I) t- k+ E* e/ ^ int nIndex = GetIndex(cIndex); 5 c1 D% {: G- e* {2 _ if(cIndex!=""&&nIndex >-1){ operator[](nIndex)=newElement; }else{ nIndex = m_nSize; SetAtGrow(nIndex, newElement); # Y; @) U" k& G SETIndex(cIndex,nIndex); # _8 E. @/ r1 F f* A. }" f7 c* o return nIndex; + e( t6 s5 ?' N8 ]9 C+ ]0 _, N } } int AddM(ARG_TYPE newElement,CString cIndex = "") { 1 _- j5 a' U( y5 d static int nIndex ; 7 y/ |7 ]. O' {0 g2 X YCArray_Add.Lock(); nIndex = m_nSize; SetAtGrow(nIndex, newElement); YCArray_Add.Unlock(); & q4 d5 l! y. Q2 \, M- B SETIndex(cIndex,nIndex); return nIndex; 2 P( m7 N0 ]/ V7 y w8 r" K C}; int Append(const YCArray& src); 8 B* H* V* _7 C2 q$ P$ _/ bvoid Copy(const YCArray& src);

. e* \5 Y _1 x

// overloaded operator helpers ; ]4 V# C& [8 E, RTYPE operator[](int nIndex) const; ! u( T) h: I2 ~# j; f7 JTYPE& operator[](int nIndex); TYPE operator[](CString cIndex) const; 1 N$ x+ m1 g1 D5 N* l$ J, ^9 \TYPE& operator[](CString cIndex); //YCArray<TYPE,ARG_TYPE> operator=(YCArray<TYPE,ARG_TYPE>& tparr)const; 7 c5 u! Y" v# l7 {- z) ?) d6 x0 FYCArray<TYPE,ARG_TYPE>& operator=(YCArray<TYPE,ARG_TYPE>& tparr); - C; s5 t" v- b- W/ N// Operations that move elements around void InsertAt(int nIndex, ARG_TYPE newElement, int nCount = 1); void RemoveAt(int nIndex, int nCount = 1); void RemoveAt(CString cIndex,int nCount = 1); void InsertAt(int nStartIndex, YCArray* pNewArray); void InsertAt(ARG_TYPE newElement,int nIndex,CString cIndex);

* C( T/ W, ?: N* M- s( i6 `

int GetIndex(CString cIndex); CString GetIndex(int nIndex);

" q8 x; n4 l& \7 v/ S

CString GetSign(); " l4 @0 z% t6 r+ L1 T y" vint SetSign(CString& sign);

// Implementation protected: 7 T7 u2 S9 A3 \5 jTYPE** Ym_pData; // the actual array of data int m_nSize; // # of elements (upperBound - 1) 2 S9 u- `2 {1 p. ?8 u, K' R8 f. w. s# kint m_nMaxSize; // max allocated % ~% n" X3 c1 H. d5 Pint m_nGrowBy; // grow amount ' @3 O6 K! u# i- s' N: I, Fprivate: int lock_sign; + k+ Q+ {' b) h7 Y, B) JCString Sign; int MAXSIGNTIME;

CString* strIndex; : w* j) b d" [0 }int strIndexNum; : D& O" l) Z! R1 \7 k2 b D6 v9 oBOOL SetIndexSize(int nIndex); * P- T" n( `1 Q( x7 FBOOL SETIndex(CString cIndex,int nIndex); BOOL INSERTIndex(int nIndex,int nCount =1); + ?; z* u! u* |; [/ N; xBOOL DELIndex(int nIndex,int nCount = 1); BOOL DELIndex(CString cIndex,int nCount = 1); 7 j2 c* `1 {/ G( X: a( y% S* g4 Dvoid DestructAllElement(int nIndex,int nCount) {//销毁对象，包括每个指针指向的对象 ) j9 U& j' W/ T! r DELIndex(nIndex,nCount); ASSERT(nIndex >= 0); ASSERT(nCount >= 0); ( }2 A: i" }- i- @; Z. K ASSERT(nIndex + nCount <= m_nSize); . X) {8 Q+ D# h if(nCount>0&&m_nSize>0){ for(int i =nIndex;i<nIndex+nCount;i++){ 1 E* a p2 ^5 ~ //Ym_pData->~TYPE(); // 由于ConstructAllElements 中是 Ym_pData[nIndex] = new TYPE;所以不需要Ym_pData->~TYPE() ! X& Q. O+ N- s( J1 C# O4 v! ? delete Ym_pData; " k9 t, [* D: O* a } } & b7 C: p, V9 p8 O, J7 ]}; void ConstructAllElements(int nIndex,int nCount) ) O4 M" i2 s. M( I{//创建对象，包括 new 出每个指针指向的对象 //nIndex = 0; ' l9 N y/ D v memset((void*)(Ym_pData+nIndex), 0, nCount * sizeof(TYPE*)); 2 e& x' R& a! j/ E2 d B* J+ S( U5 K for (; nCount--; nIndex++) * X# q) p$ N3 u3 i, N Ym_pData[nIndex] = new TYPE; 0 P: l! s6 O. v! @$ M}; ( k6 W1 T" `- ~ h( \public: ' V2 |( H Z0 I4 V" [// Construction YCArray(); # M3 Q- a( f+ h+ n% [4 A' U3 QYCArray(YCArray<TYPE, ARG_TYPE>& tp); ~YCArray(); void Serialize(CArchive&); ; j r% t8 \* V. P1 o- c e5 m#ifdef _DEBUG void Dump(CDumpContext&) const; . ?1 n0 m R/ d9 v/ ~8 j: D, E+ mvoid AssertValid() const; : x- a4 O8 S3 Z- h: v- j1 b) _#endif

$ D: Q0 a0 X" V" m; o8 r( F. G# S

};

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

) T0 J$ u4 z+ ?7 L$ e, W

yzhlinux

//接上面

template<class TYPE, class ARG_TYPE> 7 B U& `' q2 Q, [0 JYCArray<TYPE, ARG_TYPE>::~YCArray() { ASSERT_VALID(this);

if (Ym_pData != NULL) { DestructAllElement(0,m_nSize); 5 ]3 ^; b/ V. F( E P //DestructElements<TYPE>(Ym_pData, m_nSize); * Z( F* X+ w, g delete[] (BYTE*)Ym_pData; * w7 v4 C/ X" H) [% N2 x: r+ ]0 f } : c0 Z% d; V* }# j* }} template<class TYPE, class ARG_TYPE> CString YCArray<TYPE, ARG_TYPE>::GetSign() ( e `9 k/ q( ^0 j! g, j6 G2 l{ 0 G; Z- w* S7 z) N a lock_sign=0; return Sign; } : S, B+ x6 w/ ]* f& p3 X; Qtemplate<class TYPE, class ARG_TYPE> # g% l8 f/ R% H. n. { U4 X9 E* z, }int YCArray<TYPE, ARG_TYPE>::SetSign(CString& sign) . ~3 T+ A% d; o6 x{ * g+ {! o- r( W4 I int i=0; while(lock_sign&&i<MAXSIGNTIME){ . O% \2 H t. n9 p3 S Sleep(1); 7 r! \: J f! ~0 U( v2 r i++; } lock_sign=1; * s F0 T: a- h! r. B Sign=sign; 2 s5 e- G7 h# H' B4 E' k; g return TRUE; } //用与把 nindex 后的索引往后推 nCount ,自动调整好buffer template<class TYPE, class ARG_TYPE> BOOL YCArray<TYPE, ARG_TYPE>::SetIndexSize(int nNewSize) * a3 [6 x/ `5 k& G% i% @! x6 `! U8 M{ 6 x2 b& E& X! i6 Y if(strIndexNum < nNewSize){ + g2 X" k8 }4 |. i. L, h* f% m CString* tp = new CString[nNewSize];//新的buffer for(int i=0;i<strIndexNum;i++){//把老索引复制过来 5 [! y. B. `' J tp = strIndex; - V0 U. Z! q( X3 M } * j( Q$ @6 n; h% @2 c9 j/ P0 C for(i=strIndexNum;i<nNewSize;i++){ tp = "" ; % c& h: [& D1 ?# i$ R' W/ p } : n, ^& T( X! ~$ t/ d delete[] strIndex ; 6 m" f0 j9 t, U- a7 Y7 {5 w strIndex = tp ; strIndexNum = nNewSize ; }else if(strIndexNum < nNewSize){ for(int i=nNewSize;i<strIndexNum;i++){ * \) _0 I$ b" ~+ I/ ]9 C/ L strIndex = "" ; # M, \9 q% H) R. m/ r; U } " n9 d: f' Z' r% h) K; } } return TRUE; } template<class TYPE, class ARG_TYPE> ( r B# k0 [$ j7 `, G* H! dBOOL YCArray<TYPE, ARG_TYPE>::INSERTIndex(int nIndex,int nCount /*=1*/) { CString* tp = new CString[m_nSize+nCount];//新的buffer ' g0 a6 L( d$ C* D for(int i=0;i<nIndex;i++){//把老索引复制过来 tp = strIndex; & Y& V* _3 C0 f. y8 _" _ b8 L }int j =0 ; 8 K* r# ^. F9 e4 j. i' l for(i=nIndex+nCount;i<m_nSize;i++){//把老索引复制过来 tp = strIndex[nIndex+j]; . C Q# n/ S+ D8 Q j++; 8 F& I3 N- b( S7 y _+ y } delete[] strIndex ; , t6 k i. A1 g strIndex = tp ; ( ^, d0 X3 V0 a' [ return TRUE; 9 k9 f2 A& t0 ^+ ^7 I8 z/ n7 b/ q} * q7 J, l: I# H9 [template<class TYPE, class ARG_TYPE> $ u: Y# K' d& jBOOL YCArray<TYPE, ARG_TYPE>::SETIndex(CString cIndex,int nIndex) {//在 nIndex 后面添加一个 字符串索引 strIndex[nIndex] = cIndex ; return TRUE; } , B/ V7 |7 E9 n, l& Ltemplate<class TYPE, class ARG_TYPE> BOOL YCArray<TYPE, ARG_TYPE>:ELIndex(int nIndex,int nCount /*=1*/) {//需要在 m_nSize 变化之前调用!! ASSERT(nIndex >= 0); ASSERT(nCount >= 0); * Q7 K1 {" C* ~" {" Y( v ASSERT(nIndex + nCount <= m_nSize); int j =0 ; for(int i=nIndex+nCount;i<m_nSize;i++){//把老索引复制过来 strIndex[nIndex+j] = strIndex; 8 h5 N. Y) ]7 R5 P5 z3 a j++; } return TRUE; 0 Y" p& h7 J3 L! G% g* f' @} template<class TYPE, class ARG_TYPE> 0 c& U+ Z- B9 k+ _4 \% a; XBOOL YCArray<TYPE, ARG_TYPE>:ELIndex(CString cIndex,int nCount /*=1*/) { + P* [9 l3 P- b! k; F) f# ` int nIndex=this->GetIndex(cIndex); ' Z" M4 i* M; }( V3 u7 s) {9 n return this->DELIndex(nIndex,nCount); 6 X: W( C, X4 D6 ^} template<class TYPE, class ARG_TYPE> , l& H8 q- T+ b# jint YCArray<TYPE, ARG_TYPE>::GetIndex(CString cIndex) 3 n8 i3 l* R# g0 ?3 e2 _% s{//得到 cIndex 的数字索引 int nPos = -1; , ~1 k( H3 o; E; O$ t2 u$ T for(int i=0;i<m_nSize;i++){ # k6 F+ a+ ^5 U if(strIndex == cIndex){ nPos = i ;break; 1 _2 z6 L# W9 ^ } # ~! r* C" i" B8 v1 N1 h6 @# M } $ J7 t. y# @" D0 j# V return nPos; } ) Q2 h1 ^! i8 e: atemplate<class TYPE, class ARG_TYPE> CString YCArray<TYPE, ARG_TYPE>::GetIndex(int nIndex) ) g7 ], i9 A$ C& K) b{//返回 nIndex 的字符串索引 return strIndex[nIndex]; T" l& ?( ~8 f} ///////////////////////////////////////////////////////////////////////////// // YCArray<TYPE, ARG_TYPE> inline functions

template<class TYPE, class ARG_TYPE> : Z! D, E0 j. Q: u9 @AFX_INLINE int YCArray<TYPE, ARG_TYPE>::GetSize() const { return m_nSize; } / B8 Z; R. I) {8 Etemplate<class TYPE, class ARG_TYPE> ! ?3 U" Y* S4 f& T4 `7 G" EAFX_INLINE int YCArray<TYPE, ARG_TYPE>::GetUpperBound() const { return m_nSize-1; } 8 I) U0 \: [! V2 [$ z/ ]+ q% A1 Etemplate<class TYPE, class ARG_TYPE> - V1 R) _$ o0 X7 C7 Q/ k1 D: T$ C& yAFX_INLINE void YCArray<TYPE, ARG_TYPE>::RemoveAll() 7 g# S, I5 x* h$ M3 R) r/ \ { SetSize(0, -1); } 7 w" J% I3 K8 P% K) ktemplate<class TYPE, class ARG_TYPE> AFX_INLINE TYPE YCArray<TYPE, ARG_TYPE>::GetAt(int nIndex) const . t$ R! J7 s; K { ASSERT(nIndex >= 0 && nIndex < m_nSize); return *Ym_pData[nIndex]; } template<class TYPE, class ARG_TYPE> AFX_INLINE void YCArray<TYPE, ARG_TYPE>::SetAt(int nIndex, ARG_TYPE newElement) K; C4 @/ v& X { ASSERT(nIndex >= 0 && nIndex < m_nSize); *(Ym_pData[nIndex]) = newElement; }

template<class TYPE, class ARG_TYPE> AFX_INLINE TYPE& YCArray<TYPE, ARG_TYPE>::ElementAt(int nIndex) - h* k/ E: r* _1 S { ASSERT(nIndex >= 0 && nIndex < m_nSize); return *Ym_pData[nIndex]; }

template<class TYPE, class ARG_TYPE> 8 z7 U: v5 |' e; Z: Z5 kTYPE YCArray<TYPE, ARG_TYPE>::GetAt(CString cIndex) const { & q5 C9 X) W: I3 a7 f7 x+ l$ ` int nIndex=GetIndex(cIndex); return GetAt(nIndex); } template<class TYPE, class ARG_TYPE> , ^, @; q/ Z6 wvoid YCArray<TYPE, ARG_TYPE>::SetAt(CString cIndex, ARG_TYPE newElement) 7 i1 n! u3 u1 j: @{ 0 \5 [1 U9 r8 g, s int nIndex=GetIndex(cIndex); 0 t: b: h' Z' D" V7 k* V6 ^ return SetAt(nIndex, newElement); } ( [5 w& x q: [template<class TYPE, class ARG_TYPE> TYPE& YCArray<TYPE, ARG_TYPE>::ElementAt(CString cIndex) # n$ \* m. U+ b: T0 t: a# ]* _{ . `2 D' J" W7 I: U) d" K2 b& R int nIndex=GetIndex(cIndex); return ElementAt(nIndex); ' V4 ~5 B. N/ h2 h4 e5 L2 Y} template<class TYPE, class ARG_TYPE> ; O( i. i9 @1 \' t: `& ?AFX_INLINE const TYPE** YCArray<TYPE, ARG_TYPE>::GetData() const 6 K2 \ R# d0 X* P( m { return (const TYPE**)Ym_pData; } 9 t, _8 G+ h6 @& N; U& f, Qtemplate<class TYPE, class ARG_TYPE> AFX_INLINE TYPE** YCArray<TYPE, ARG_TYPE>::GetData() 7 Y2 q% n) A0 T( x5 P8 j { return (TYPE**)Ym_pData; } template<class TYPE, class ARG_TYPE> 0 q" e7 @, u8 }" x( b; ~7 z5 \AFX_INLINE int YCArray<TYPE, ARG_TYPE>::Add(ARG_TYPE newElement,CString cIndex /* ="" */) . v; c: ^8 I+ e, C' P2 ` { int nIndex = m_nSize; SetAtGrow(nIndex, newElement); SETIndex(cIndex,nIndex); ( F2 \8 m/ q: ]; z2 o; T5 J4 ^ return nIndex; } template<class TYPE, class ARG_TYPE> AFX_INLINE TYPE YCArray<TYPE, ARG_TYPE>:perator[](int nIndex) const { return GetAt(nIndex); } template<class TYPE, class ARG_TYPE> AFX_INLINE TYPE& YCArray<TYPE, ARG_TYPE>:perator[](int nIndex) ( p3 T+ W1 Y5 |1 j* x2 s) q { return ElementAt(nIndex); } 7 Q* ^2 z1 a; O! htemplate<class TYPE, class ARG_TYPE> AFX_INLINE TYPE YCArray<TYPE, ARG_TYPE>:perator[](CString cIndex) const { int nIndex=GetIndex(cIndex);

return operator[](nIndex); } % P; N z) c9 A& m* Wtemplate<class TYPE, class ARG_TYPE> # r4 S& [3 Y7 gAFX_INLINE TYPE& YCArray<TYPE, ARG_TYPE>:perator[](CString cIndex) 1 D+ P9 p' W( x3 s{ int nIndex=GetIndex(cIndex); ' C2 w& t" s0 w return operator[](nIndex); } /* template<class TYPE, class ARG_TYPE> AFX_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)); 4 g6 e* r* H( x+ O) E if(j>-1){ operator[](tparr.GetIndex(i)) = tparr; 8 O% [% P9 V3 v" s, W }else{ 2 b% n% p! |9 ^$ |8 f, s Add(tparr,tparr.GetIndex(i)); } } return this; } */ ' q- p9 a+ l7 ^, A% K; R: n; @template<class TYPE, class ARG_TYPE> b* B/ z. }1 d1 E6 d2 ~AFX_INLINE YCArray<TYPE,ARG_TYPE>& YCArray<TYPE, ARG_TYPE>:perator=(YCArray<TYPE,ARG_TYPE>& src) # y" o2 H& V3 [% V1 z{ + _! F8 \8 r9 I9 ?0 M$ j. n2 b1 p, ? ASSERT_VALID(this); ASSERT(this != &src); // cannot append to itself

SetSize(src.m_nSize); ( G5 @6 q7 |. O e, v for(int i=0;i<m_nSize;i++){ " K. h7 a& w" E /*将此句修改为内存拷贝*/// 0 C$ o& l- ]) [2 _; E% ~ *Ym_pData = *src.Ym_pData ; //memcpy(Ym_pData,src.Ym_pData,sizeof(TYPE)); 3 N" Z1 a% V7 V2 d5 I; r SETIndex(src.GetIndex(i),i); } 3 e3 s7 @( q! U; s9 u return *this; % J; Z& u0 w7 N% ^} ///////////////////////////////////////////////////////////////////////////// 6 R9 T- ?- v- \0 J T8 M1 q: q// YCArray<TYPE, ARG_TYPE> out-of-line functions

template<class TYPE, class ARG_TYPE> r3 x' u$ f% @5 iYCArray<TYPE, ARG_TYPE>::YCArray() ) }+ V {/ O% Q{ , ?" Y$ e8 C9 ] Ym_pData = NULL; ( \0 A+ M. N5 M) ?+ d! `) j( {- N( F strIndexNum = m_nSize = m_nMaxSize = m_nGrowBy = 0; strIndex=NULL;MAXSIGNTIME=10; # D6 s3 R D4 Y$ J} template<class TYPE, class ARG_TYPE> / [5 x& _5 T7 X4 R( d9 @- k- WYCArray<TYPE, ARG_TYPE>::YCArray(YCArray<TYPE, ARG_TYPE>& tp) { Ym_pData = NULL; 1 |: K. R5 @. ?/ M0 S strIndexNum = m_nSize = m_nMaxSize = m_nGrowBy = 0; 2 m G9 H% L5 b8 f; l% ~6 C5 M& t. @ strIndex=NULL;MAXSIGNTIME=10; , E4 G: }$ P$ i/ t" u+ g- M operator=(tp); }

template<class TYPE, class ARG_TYPE> 0 B3 u" b0 e8 C/ t1 mvoid YCArray<TYPE, ARG_TYPE>::SetSize(int nNewSize, int nGrowBy) { ; o% `/ D) k" {3 N+ y" S. k$ s% G1 ?" E ASSERT_VALID(this); ASSERT(nNewSize >= 0);

if (nGrowBy != -1) . H( D4 _1 H' _1 y z# g$ e3 F m_nGrowBy = nGrowBy; // set new size

if (nNewSize == 0){ 5 `8 y7 P: g+ _' u. q) A // shrink to nothing 8 T& q/ }2 F- y' }' f$ N) P! { if (Ym_pData != NULL){ ! m, f2 \7 D5 e DestructAllElement(0,m_nSize); 7 D8 t) }) n; i& { //DestructElements<TYPE>(Ym_pData, m_nSize); delete[] (BYTE*)Ym_pData; - ?8 q7 [/ u8 p# W Ym_pData = NULL; } m_nSize = m_nMaxSize = 0; } else if (Ym_pData == NULL){ // create one with exact size , u& K+ [" H% o/ U; `#ifdef SIZE_T_MAX % f& g5 m9 q% f9 W6 l" c2 n2 o ASSERT(nNewSize <= SIZE_T_MAX/sizeof(TYPE*)); // no overflow 8 P$ w- k% U7 E/ z0 A; H+ R5 r#endif 1 w, x8 i. f8 |0 f Ym_pData = (TYPE**) new BYTE[nNewSize * sizeof(TYPE*)]; ConstructAllElements(0,nNewSize);//ConstructElements<TYPE>(Ym_pData, nNewSize); m_nSize = m_nMaxSize = nNewSize; } else if (nNewSize <= m_nMaxSize){ // it fits & h3 o; S+ Z; ^$ o if (nNewSize > m_nSize) t0 w3 e4 b6 | { & b6 ?; ~3 \4 W* q // initialize the new elements K$ x2 p, c9 w1 W* E% M* _7 U2 t ConstructAllElements(m_nSize,nNewSize-m_nSize);//ConstructElements<TYPE>(&Ym_pData[m_nSize], nNewSize-m_nSize); } N/ |" |, o( P6 h else if (m_nSize > nNewSize) { + \' C2 P* I0 w5 i9 j7 T // destroy the old elements 3 Q9 K' b# g* p2 \5 `* ] DestructAllElement(nNewSize,m_nSize-nNewSize); //DestructElements<TYPE>(&Ym_pData[nNewSize], m_nSize-nNewSize); } - X# c1 L& t, {2 W m_nSize = nNewSize; 5 p5 {" W$ `8 G; ]+ R } else + X) u. U2 \7 u6 R* c* D V1 } { / ?2 I' G& ~7 U6 d3 G // otherwise, grow array int nGrowBy = m_nGrowBy; ( E/ I7 ^! ~* S: I; | if (nGrowBy == 0) { // heuristically determine growth when nGrowBy == 0 4 o5 w' j( ]3 B' x) s4 Y" L // (this avoids heap fragmentation in many situations) nGrowBy = m_nSize / 8; nGrowBy = (nGrowBy < 4) ? 4 : ((nGrowBy > 1024) ? 1024 : nGrowBy); } & f6 a0 ?$ a, t, P int nNewMax; if (nNewSize < m_nMaxSize + nGrowBy) 5 _7 S# u# N0 `! [8 ^/ s' y nNewMax = m_nMaxSize + nGrowBy; // granularity 9 K0 a- w+ `- t4 N( D& e) F% u5 Z else nNewMax = nNewSize; // no slush

ASSERT(nNewMax >= m_nMaxSize); // no wrap around ) T8 R; J% M7 ]6 H7 X#ifdef SIZE_T_MAX ( C0 m- r9 {; L$ N6 d ASSERT(nNewMax <= SIZE_T_MAX/sizeof(TYPE)); // no overflow #endif ; ~; R. N+ v% c9 H& \ TYPE** pNewData = (TYPE**) new BYTE[nNewMax * sizeof(TYPE*)];//TYPE* pNewData = (TYPE*) new BYTE[nNewMax * sizeof(TYPE)];

// copy new data from old memcpy(pNewData, Ym_pData, m_nSize * sizeof(TYPE*));

// construct remaining elements ASSERT(nNewSize > m_nSize); //throw("/*wait for me --- yzhlinux*/"); / x. d: ^5 J8 ^% e c3 F delete[] (BYTE*)Ym_pData; 6 d6 y, n+ r/ G) w Ym_pData = pNewData; $ ]* U& K t$ n 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; ; p2 m" V A M, q8 r- F& w m_nMaxSize = nNewMax; 0 P+ N/ G* L( M l } SetIndexSize(nNewSize); } % o; j% W& c6 I) v! U1 \

yzhlinux

//接上面

template<class TYPE, class ARG_TYPE> + M* q8 z2 {1 o& j2 g/ iint YCArray<TYPE, ARG_TYPE>::Append(const YCArray& src) { ASSERT_VALID(this); ASSERT(this != &src); // cannot append to itself

int nOldSize = m_nSize; SetSize(m_nSize + src.m_nSize);

ConstructAllElements(nOldSize,src.m_nSize); 9 X0 O! i# e, @7 j# g, U for(int i=nOldSize;i<m_nSize;i++){ 0 X) K. h4 W: @( _6 o /*将此句修改为内存拷贝*/// : _8 q: u7 ?) O" u' Z' P *Ym_pData = *src.Ym_pData[i-nOldSize] ; 2 i2 r9 e( W$ N9 n //memcpy(Ym_pData,src.Ym_pData[i-nOldSize],sizeof(TYPE)); ' P/ F# y, _1 }* a" l SETIndex(src.GetIndex(i-nOldSize),i); } /*wait for me*///CopyElements<TYPE>(Ym_pData + nOldSize, src.Ym_pData, src.m_nSize); 6 n$ W2 K [, e! L: j: z$ v return nOldSize; 0 ~( a. b6 @. a0 P+ |6 x* v! I$ F7 e}

template<class TYPE, class ARG_TYPE> 4 k- p; M# Z% O& xvoid YCArray<TYPE, ARG_TYPE>::Copy(const YCArray& src) # [ ]3 d* v: C4 c [% v9 ?6 L{ ASSERT_VALID(this); 1 @+ y+ i" p |, h: }) x% ^* E8 [ ASSERT(this != &src); // cannot append to itself

SetSize(src.m_nSize); 5 L3 ~- O2 F! `+ h/ | for(int i=0;i<m_nSize;i++){ /*将此句修改为内存拷贝*///*Ym_pData = *src.Ym_pData ; 5 b7 P: h, Z, E( f$ ^5 i* s# _ memcpy(Ym_pData,src.Ym_pData,sizeof(TYPE)); SETIndex(src.GetIndex(i),i); ; v5 W) e, ~& E1 m- L } / \% R! Z6 Y9 n2 u2 y /*wait for me*///CopyElements<TYPE>(Ym_pData, src.Ym_pData, src.m_nSize); - D& y# M5 `1 x1 \0 e}

template<class TYPE, class ARG_TYPE> ( u8 F) Q) Q2 P: k' i' ]void YCArray<TYPE, ARG_TYPE>::FreeExtra() { ASSERT_VALID(this);

if (m_nSize != m_nMaxSize) $ z: V: s' g$ Z( d0 Y. y. K { $ I4 f5 [5 B! M // shrink to desired size ' p; ]4 ~, z/ Q1 ^#ifdef SIZE_T_MAX . D% m( k1 X2 [! O3 T$ \$ w ASSERT(m_nSize <= SIZE_T_MAX/sizeof(TYPE)); // no overflow #endif TYPE* pNewData = NULL; if (m_nSize != 0) 9 o V! n& q5 b( ` { pNewData = (TYPE**) new BYTE[m_nSize * sizeof(TYPE*)]; // copy new data from old ! W- b8 ?4 f- E s memcpy(pNewData, Ym_pData, m_nSize * sizeof(TYPE*)); 3 Q3 i' c6 C7 O/ d2 }" ? }

// get rid of old stuff (note: no destructors called) : W9 ]# r8 F/ {& s& m delete[] (BYTE*)Ym_pData; 2 [5 @: d4 _& `: t1 A9 M) t( S Ym_pData = pNewData; " u6 e: I' x7 ]% k3 d8 ^ m_nMaxSize = m_nSize; ! B' w5 |6 _+ B4 s: w! q3 r) t } } template<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::SetAtGrow(CString cIndex, ARG_TYPE newElement) . `# Q- H% x2 `- Y/ b) D+ z{ int nIndex=GetIndex(cIndex); ) Z! R# e6 ?, e3 G- ^/ l. s return SetAtGrow(nIndex,newElement); } ' S. Y# E+ w J% J- ?5 Y% jtemplate<class TYPE, class ARG_TYPE> . E( J) e' U" w+ u, Y& k6 q, e Q$ Uvoid YCArray<TYPE, ARG_TYPE>::SetAtGrow(int nIndex, ARG_TYPE newElement) $ w3 v% _3 L0 V) P5 N4 Z{ " w, B l2 P2 H( W2 {# y ASSERT_VALID(this); 3 Y8 @- C0 S3 P6 C# a ASSERT(nIndex >= 0);

if (nIndex >= m_nSize) 4 ^/ L' D+ Q/ y* X: t# g SetSize(nIndex+1, -1); *Ym_pData[nIndex] = newElement; }

template<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::InsertAt(int nIndex, ARG_TYPE newElement, int nCount /*=1*/) 3 t7 A: N% o6 h% a1 J$ @4 H{ 0 \6 X6 c0 g* I# d5 T+ n ASSERT_VALID(this); ASSERT(nIndex >= 0); // will expand to meet need 0 n# H0 Z# e$ e2 `2 @) q1 j ASSERT(nCount > 0); // zero or negative size not allowed

if (nIndex >= m_nSize) { 4 ?9 Z9 H/ Q4 K+ |# {& m# _ // adding after the end of the array 2 f' e" M2 e1 k* o9 z8 v, W SetSize(nIndex + nCount, -1); // grow so nIndex is valid : j7 i9 x1 \9 ?( h6 _$ G( O } 1 [( c/ D% Y+ H& ?6 y else { // inserting in the middle of the array / ?6 t/ x4 o4 h! p int nOldSize = m_nSize; SetSize(m_nSize + nCount, -1); // grow it to new size 0 v) j: E7 s- g: I$ T$ N // destroy intial data before copying over it 0 m' X; v! N3 Q! V& V /*不需要销毁了,因为 SetSize 的是指针*///DestructAllElement(nOldSize,nCount); $ O5 @7 |+ z5 D //DestructElements<TYPE>(&Ym_pData[nOldSize], nCount); // shift old data up to fill gap memmove(&Ym_pData[nIndex+nCount], &Ym_pData[nIndex], (nOldSize-nIndex) * sizeof(TYPE*));

// re-init slots we copied from 0 U) |: a/ @$ K: W( B /*不需要销毁了,因为 SetSize 的是指针*///ConstructAllElements(nIndex,nCount);//ConstructElements<TYPE>(&Ym_pData[nIndex], nCount); 0 ?; M" o, q: q. c }

// insert new value in the gap - @4 p" A' s) f8 p. G ASSERT(nIndex + nCount <= m_nSize); k9 s3 P, r% Z! Z while (nCount--){ *Ym_pData[nIndex++] = newElement; 4 ?' Q. D/ N: f4 O9 d- ?) ~ } # r1 N2 \* \; M! Z2 x* w- b6 {} template<class TYPE, class ARG_TYPE> * j" H& z t; P3 U Lvoid YCArray<TYPE, ARG_TYPE>::RemoveAt(CString cIndex,int nCount /*=1*/) * T, v; E5 V+ B( u" R2 ?& Z{ int nIndex = GetIndex(cIndex); 9 Z& o0 j* W* Y. k* i RemoveAt(nIndex,nCount); # x, n- Q$ W! p9 ?0 B} template<class TYPE, class ARG_TYPE> ' _" K' C* x& ?void YCArray<TYPE, ARG_TYPE>::RemoveAt(int nIndex, int nCount /*=1*//*=1*/) { , |7 b8 K$ w: z/ r5 X ASSERT_VALID(this); ASSERT(nIndex >= 0); ) r# F, Q8 ?5 T# V1 R, Z4 T ASSERT(nCount >= 0); # ?3 n7 G) A+ A* v ASSERT(nIndex + nCount <= m_nSize); % @0 l3 I" q9 b4 w! M; t //yzh DELIndex(nIndex); 2 C' V* Y" m; P6 S# P/ h. n+ a6 r# ] //yzh // just remove a range int nMoveCount = m_nSize - (nIndex + nCount); //需要移动的数目 " ^" C- H& x1 g, D5 G DestructAllElement(nIndex,nCount); //DestructElements<TYPE>(&Ym_pData[nIndex], nCount); if (nMoveCount) ( W+ w4 g% Z: H4 u$ y. Z- M9 x memmove(&Ym_pData[nIndex], &Ym_pData[nIndex + nCount], nMoveCount * sizeof(TYPE*)); m_nSize -= nCount; }

template<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::InsertAt(int nStartIndex, YCArray* pNewArray) 7 F2 \7 C$ i. V* F4 t& H{ 5 P6 q5 v/ P+ n" X& L- L ASSERT_VALID(this); ASSERT(pNewArray != NULL); / ^( P# l/ q/ B ASSERT_VALID(pNewArray); 5 t5 p; m& l! | ASSERT(nStartIndex >= 0);

if (pNewArray->GetSize() > 0) { InsertAt(nStartIndex, pNewArray->GetAt(0), pNewArray->GetSize()); for (int i = 0; i < pNewArray->GetSize(); i++) SetAt(nStartIndex + i, pNewArray->GetAt(i)); : l8 a6 c& ~* Q& S1 d# @( m } } . \7 }! d8 m( W0 {4 w% A+ e7 @template<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::InsertAt(ARG_TYPE newElement, int nIndex,CString cIndex) $ C# R @6 c$ U{ ; b& h) `4 x4 s6 q6 t! A. ?8 y ADDIndex(cIndex,nIndex+1); InsertAt(newElement,nIndex); . s- e% H# ]3 {+ [' E, E} 0 I" G, q. |- S. p4 z2 Stemplate<class TYPE, class ARG_TYPE> / p: V( A" d5 j! r6 B7 Z$ g* Ivoid YCArray<TYPE, ARG_TYPE>::Serialize(CArchive& ar) { ASSERT_VALID(this); throw("/*wait for me --- yzhlinux*/"); 2 @4 p( W9 k8 ^3 l- H. T* @% ~ CObject::Serialize(ar); if (ar.IsStoring()) 3 l; d) L3 s* f; l) @ { ar.WriteCount(m_nSize); } else * {9 a q! r! z6 {% m j. K% A* G { + Q0 q4 c' f0 k2 _/ R DWORD nOldSize = ar.ReadCount(); SetSize(nOldSize, -1); ! K- a# u( o0 F9 R4 W X } //SerializeElements<TYPE>(ar, Ym_pData, m_nSize); , b2 T1 c$ J, w; c5 p2 o}

#ifdef _DEBUG 8 ?7 g3 s/ M1 I1 R5 ktemplate<class TYPE, class ARG_TYPE> $ B0 M9 D& F- \0 [, u- mvoid YCArray<TYPE, ARG_TYPE>::AssertValid() const & y0 A$ L( D( m+ S{ ; k* M. i. F6 H CObject::AssertValid();

if (Ym_pData == NULL) { + G4 [" J+ A! d% A6 h `$ F ASSERT(m_nSize == 0); , W3 F* x, m6 L7 d/ v0 I$ ] ASSERT(m_nMaxSize == 0); 7 x1 _/ ` \) L5 ?' Q1 g } ; t5 O3 r2 u5 R else ; \) X) ]4 D2 s5 n8 X( q( A { ASSERT(m_nSize >= 0); ASSERT(m_nMaxSize >= 0); ASSERT(m_nSize <= m_nMaxSize); * h2 x1 p4 w, }. t7 i% g ASSERT(AfxIsValidAddress(Ym_pData, m_nMaxSize * sizeof(TYPE*))); 6 J* n8 {8 }4 L: \! n3 D4 f } : o/ `& r- L y, ~! o, \ _} template<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>:ump(CDumpContext& dc) const { CObject:ump(dc); throw("/*wait for me --- yzhlinux*/"); 3 @- g, ^' J e& ?# l* ~/ u8 j7 C dc << "with " << m_nSize << " elements"; if (dc.GetDepth() > 0) { 8 e Z: Z! L3 R. d( O dc << "\n"; 8 C% F1 a2 R( w- L/*wait for me --- yzhlinux*/// DumpElements<TYPE>(dc, Ym_pData, m_nSize); - N+ e6 A/ r& ` y- p9 ` }

dc << "\n"; # g3 f, v2 D0 O8 N} & i0 {" i e I# v#endif

#endif

//完

Eagle

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

yzhlinux

以下是引用Eagle在2005-1-10 14:44:00的发言： 太长了点，叶师兄应该打包上传的。

; T& j4 V8 t' o, F C $ F+ W/ U, _$ R* _ 就是因为发不了文件啊，奇怪，现在不能上传文件了，不然不用那么辛苦 8 E3 h: u9 K( T0 O3 A

Eagle

先传到帖图区……

管理员

赚帖子不好吗

yzhlinux

现在可以传文件了，附上，好用的摸板数组类，支持 ATL 可以在任何地方使用。
0 _, Y5 `, f! G9 m6 l, I
9 K/ j/ T5 s1 r" `* v$ E' U E2mkAVvk.rar (4.61 KB, 下载次数: 19)

2005-6-3 14:56 上传

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

游侠无极限

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