一个方便好用的数组类

yzhlinux

to Whanxy

int N; N=StrToInt(Edit1->Text); , J% S% Y1 P, J" p* J0 K2 |int RESULT[N]; 哈哈,这样的代码很有意思哦. 在c++里没有现成的类似vb的redim那样可以自由定义数组边界的办法,很多人提供了一些数组类以实现你这样的需求,同样微软也提供了这样的模板类 CArray ,你可以去参考这个摸板,不过 CArray 写的不够好只能给单线程的地方使用(后来个跟踪进去才发现是它的问题,没把偶气死)并且不能很好的支持使用 & 引用内部的成员(底层机制的问题),我从新改写了它的底层实现,写了一个摸板类,给你用正好满足你的需求.: #if !defined(CYCArray_INCLUDED) ) Z- R" ]5 A% h$ B5 t" U#define CYCArray_INCLUDED #include "afxtempl.h" 5 f- [) n3 ~7 |- U/** * 动态数组的模板类 (Write By yzhlinux ,you could use it any time any way if you could email me about it yzhlinux@hotmail.com) ! x3 Z/ G$ F' M. o$ E2 f! m* 1.支持字符索引 O$ X. g9 U6 l4 [* N& P* 2.方便的添加删除修改任意一项 * 最后更新 2004-8-9 + F" G* s8 @- D7 e' y**1.优化了字符索引的运作方式，使用数组存储 **2.重写了底层数据的存储，将连续性的存储方式改为了非连续, 2 O- m; t6 U0 f9 s4 [) B- e*** 从而很好有效地支持了“引用”,并且让数据的删除增加变的更为快速 ///// $ ~3 o6 l, f6 h* 用法句举例1： * YCArray<int,int> test1 ; 2 A6 O' p# d3 q% x* test1.Add("Number2",4); - S/ D4 z, Z) c3 j7 Z: t) ]* test1.Add("Number1",2); 7 R$ w9 K8 r* H; |" p* printf("%d %d",test1["Number1"],test1["Number2"]); * 显示： * 2 4 ! }8 S! V* F, e! I( H4 a! n E" N///// * 用法句举例2： * YCArray<CString,CString> test2 ; ! K$ w% G/ ?% \7 p/ f2 _0 \* test2.Add("string2","hahahaha"); a2 r; [) y: Y9 b9 e- d4 a/ n4 T6 C3 Y* test2.Add("string1","yes yes yes yes"); * printf("%s %s %s",test2["string1"],test2["string2],test2[0]); 4 W) R+ f( O* f' H' k: s* 显示： * yes yes yes yes hahahaha yes yes yes yes ///// * 用法句举例3: : B+ _2 B3 {1 T. e w1 u K* YCArray<CString,CString> test3 ; # [3 f! w8 b1 v0 ]* test3.Add("string2","hahahaha"); ! p1 W7 e: h0 J0 h& g* test3.Add("string1","yes yes yes yes"); " \) V a0 V* f2 v. G* test3.Add("","no no no"); * j+ Y: y( _9 V1 Y- H3 b$ P* test3.AddR("string2","yes yes yes yes"); //AddR方法会去搜索字符索引，如果存在则替换 # A% P* _* ?/ f1 j, ^* printf("%s %s %s",test3["string1"],test3["string2],test3[2]); 0 R* A* I) y7 f( \* 显示： * yes yes yes yes yes yes yes yes no no no & Q9 l d6 k7 i5 R3 P; N1 t**/ ///////////////////////////////////////////////////////////////////////////// // YCArray<TYPE, ARG_TYPE> #include <afxmt.h> # M: o H9 a _8 Ktemplate<class TYPE, class ARG_TYPE> ! w+ n! m c( k; Z' S, @ S) g$ ^class YCArray : public CObject 8 l& H3 c4 b% \& v/ I6 d# s0 G+ `{ ' n6 y6 M0 z: I/ v3 @& r//friend YCArray<TYPE, ARG_TYPE>; CCriticalSection YCArray_Add; ; M3 q) ~- d7 R: }9 W5 Epublic: // Attributes # v/ }$ o& q! f" n. x" x$ Z9 {int GetSize() const; int GetUpperBound() const; 3 Y8 D; F! }& z! i$ o* k$ \void SetSize(int nNewSize, int nGrowBy = -1);

// Operations // Clean up void FreeExtra(); - H% S; o' J" `+ {. d5 }* Hvoid RemoveAll();

// Accessing elements TYPE GetAt(int nIndex) const; void SetAt(int nIndex, ARG_TYPE newElement); TYPE& ElementAt(int nIndex);

TYPE GetAt(CString cIndex) const; void SetAt(CString cIndex, ARG_TYPE newElement); TYPE& ElementAt(CString cIndex);

// Direct Access to the element data (may return NULL) const TYPE** GetData() const; ' m) ^! m L3 a B0 h2 iTYPE** GetData();

// Potentially growing the array % M! p! V& l- K2 r7 X% Qvoid SetAtGrow(int nIndex, ARG_TYPE newElement); ) ^ W# F+ {: ^/ O: S [void SetAtGrow(CString cIndex, ARG_TYPE newElement); int Add(ARG_TYPE newElement,CString cIndex = ""); 7 @3 ?1 A. \# ~9 s& jint AddR(ARG_TYPE newElement,CString cIndex = "")//如果存在就替换 4 l5 d) O. u. o5 c9 s3 m{ int nIndex = GetIndex(cIndex); ; U9 z; L2 P! Y4 n- u: G+ M if(cIndex!=""&&nIndex >-1){ 7 x- I" v& q% G ^, R) S operator[](nIndex)=newElement; }else{ nIndex = m_nSize; 0 @4 Q5 p* N# z SetAtGrow(nIndex, newElement); SETIndex(cIndex,nIndex); return nIndex; } + \ j* ~9 C1 v- f; X} 2 y! |* i, h/ K- g( A4 Dint AddM(ARG_TYPE newElement,CString cIndex = "") { 3 L: G* D! Z0 G static int nIndex ; 7 m/ [, n M( i: j6 E; i YCArray_Add.Lock(); " N o0 X+ p2 F- w0 M# H nIndex = m_nSize; SetAtGrow(nIndex, newElement); 7 c+ Y2 A5 V9 a+ j; q: v6 l YCArray_Add.Unlock(); SETIndex(cIndex,nIndex); ' M% s. v5 J6 }/ e3 D# B) g6 q return nIndex; - Q' G8 G4 L H0 p! Q}; # ]; b: n' v# e; x3 O L2 tint Append(const YCArray& src); ; z2 b+ H' \, S( Dvoid Copy(const YCArray& src);

; Y: K/ y+ B/ t9 {0 n& L F

// overloaded operator helpers TYPE operator[](int nIndex) const; * T- V/ A7 h# I+ R; ~TYPE& operator[](int nIndex); TYPE operator[](CString cIndex) const; TYPE& operator[](CString cIndex); //YCArray<TYPE,ARG_TYPE> operator=(YCArray<TYPE,ARG_TYPE>& tparr)const; 9 j. f- x* E( ], A0 MYCArray<TYPE,ARG_TYPE>& operator=(YCArray<TYPE,ARG_TYPE>& tparr); 3 ]6 ?' H( r$ ^3 }( S9 O// 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); . f$ [' l$ V8 d, x! b, K" a/ svoid InsertAt(ARG_TYPE newElement,int nIndex,CString cIndex);

int GetIndex(CString cIndex); 8 u* g, Z6 t |1 }* K' I& ACString GetIndex(int nIndex);

CString GetSign(); $ L/ K1 k6 x. p0 p0 pint SetSign(CString& sign);

// Implementation protected: " V. t. I1 A: q. h" h6 L+ |* rTYPE** Ym_pData; // the actual array of data , }# a9 F/ [% l" j! ^0 k2 @int m_nSize; // # of elements (upperBound - 1) / K _+ b" [/ _) w! v' @' S2 Mint m_nMaxSize; // max allocated 9 W+ ?; m0 B- I7 w6 s: r5 Hint m_nGrowBy; // grow amount ; t; B, c1 c2 B! ^1 Gprivate: int lock_sign; CString Sign; int MAXSIGNTIME;

CString* strIndex; ; x+ l5 w1 l8 ^9 e' Eint strIndexNum; BOOL SetIndexSize(int nIndex); BOOL SETIndex(CString cIndex,int nIndex); & }2 P2 r. t) w5 @$ uBOOL INSERTIndex(int nIndex,int nCount =1); BOOL DELIndex(int nIndex,int nCount = 1); / J+ J# z9 T) w1 qBOOL DELIndex(CString cIndex,int nCount = 1); ; N5 T/ ^7 I4 |. G* O9 {void DestructAllElement(int nIndex,int nCount) ( E; D8 T1 X- U. J{//销毁对象，包括每个指针指向的对象 0 l" W# O+ B& d DELIndex(nIndex,nCount); ASSERT(nIndex >= 0); % d: f8 T/ u* o ASSERT(nCount >= 0); + j4 e* t6 H0 ^5 F o5 a) a ASSERT(nIndex + nCount <= m_nSize); 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() ' r: z% L, y2 a delete Ym_pData; } 9 P* l7 V9 n) @' ^% y! b. e. f4 f } : k& q. W# G1 _: A! f% j* K7 w}; void ConstructAllElements(int nIndex,int nCount) 5 d. u" p @' k* C3 Q/ C{//创建对象，包括 new 出每个指针指向的对象 //nIndex = 0; ; y r5 b* s0 u# F# {2 i5 T% {& y memset((void*)(Ym_pData+nIndex), 0, nCount * sizeof(TYPE*)); 0 G9 m$ a) }9 w% J9 S+ a/ _& q for (; nCount--; nIndex++) Ym_pData[nIndex] = new TYPE; }; public: : ~, W7 W& J" a4 K( e# o4 A// Construction ! s4 J% M, Q4 {( g* b3 i9 TYCArray(); # D) |' r7 m# q4 h" B) CYCArray(YCArray<TYPE, ARG_TYPE>& tp); 8 q& b4 O/ G# |- Q4 }- k5 k~YCArray(); / _# r8 }" L# \/ m( y. [2 Y. f6 Jvoid Serialize(CArchive&); " y( H& K* c1 Q: P4 t; M#ifdef _DEBUG void Dump(CDumpContext&) const; void AssertValid() const; #endif

};

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

yzhlinux

//接上面

& B% ^' i J0 R5 itemplate<class TYPE, class ARG_TYPE> ) x: q+ R1 A6 L8 v7 k- f1 MYCArray<TYPE, ARG_TYPE>::~YCArray() { 6 I6 y' k, `0 v+ q6 j7 J ASSERT_VALID(this);

if (Ym_pData != NULL) { ! y7 w9 z& D4 H5 ? DestructAllElement(0,m_nSize); //DestructElements<TYPE>(Ym_pData, m_nSize); 8 g+ j$ ~% L0 v% n delete[] (BYTE*)Ym_pData; } : H& J( e/ k, v$ |5 D" a5 x, |5 R} * D$ p1 k) r4 a- R$ M( @6 k: D ~4 ~* Htemplate<class TYPE, class ARG_TYPE> CString YCArray<TYPE, ARG_TYPE>::GetSign() " \( O3 s( {/ Z b, |$ |{ lock_sign=0; ! U2 Q, F/ c9 U( E# D; T( H return Sign; * X9 H* z' F* y/ b} template<class TYPE, class ARG_TYPE> ' ]$ ^) G" }, |8 a$ o, O4 Z* |- mint YCArray<TYPE, ARG_TYPE>::SetSign(CString& sign) L& z3 W3 ]. e- M{ int i=0; + Z4 S. }6 M- z8 c" f/ A! i8 T& i while(lock_sign&&i<MAXSIGNTIME){ Sleep(1); ' @# O M- ]5 }$ o5 N# Y0 F1 j! y% Y i++; } 3 X! w7 Z8 H8 O2 Q! {6 @: Q lock_sign=1; ! s5 n8 a4 ?/ \/ A9 H h Sign=sign; return TRUE; } //用与把 nindex 后的索引往后推 nCount ,自动调整好buffer 7 h& U8 G Z* s$ Vtemplate<class TYPE, class ARG_TYPE> BOOL YCArray<TYPE, ARG_TYPE>::SetIndexSize(int nNewSize) / ]" e( {" t0 N/ `{ ! g6 u( F$ K _# t2 i% v% s- r1 G if(strIndexNum < nNewSize){ CString* tp = new CString[nNewSize];//新的buffer I* H! e; X4 t6 t j/ k" _ for(int i=0;i<strIndexNum;i++){//把老索引复制过来 % p3 Y: \& ?! R7 V% O tp = strIndex; } for(i=strIndexNum;i<nNewSize;i++){ : P0 ?4 @) Z) {, X+ D) W" d$ D% ] c& B tp = "" ; W7 i7 q! Z% G; K) S } 5 G; P6 _$ A3 q0 k' Y" [ delete[] strIndex ; % A9 f' U9 j' m/ j$ [ d% ~) c strIndex = tp ; 5 V6 N+ z) s% F! w0 ~) d! Q strIndexNum = nNewSize ; 7 v, L) G3 M: k$ @, c1 R, m: D }else if(strIndexNum < nNewSize){ for(int i=nNewSize;i<strIndexNum;i++){ / \/ q7 X# T% n6 y strIndex = "" ; & a5 Q/ \: \1 Z3 J; W2 ^ } 2 [; x4 D' R9 ? } return TRUE; } C8 z$ |0 S0 stemplate<class TYPE, class ARG_TYPE> BOOL YCArray<TYPE, ARG_TYPE>::INSERTIndex(int nIndex,int nCount /*=1*/) $ M8 M" A! N8 U1 A- \* S7 Q{ + s2 q2 x! b' P CString* tp = new CString[m_nSize+nCount];//新的buffer # g( z% ?1 X) ]/ H9 C for(int i=0;i<nIndex;i++){//把老索引复制过来 $ ]' G* v3 H3 K* `6 F, Q. U tp = strIndex; }int j =0 ; for(i=nIndex+nCount;i<m_nSize;i++){//把老索引复制过来 ( j, n7 ^8 f0 ^6 f. D- Z) o tp = strIndex[nIndex+j]; j++; 9 a; i6 m9 G$ N% o } & g( k8 e; s: w3 g3 ` delete[] strIndex ; 9 T2 m- Q* I0 {) _ strIndex = tp ; return TRUE; 5 q; D4 `1 |1 o# C0 j" {5 G} template<class TYPE, class ARG_TYPE> BOOL YCArray<TYPE, ARG_TYPE>::SETIndex(CString cIndex,int nIndex) {//在 nIndex 后面添加一个 字符串索引 # D+ |6 u) w Y) z* i/ Z strIndex[nIndex] = cIndex ; return TRUE; } template<class TYPE, class ARG_TYPE> BOOL YCArray<TYPE, ARG_TYPE>:ELIndex(int nIndex,int nCount /*=1*/) 4 A% W; b6 Q7 A* A" ?, [0 s7 T6 g{//需要在 m_nSize 变化之前调用!! 3 j/ j1 \% \2 w% v* w/ r ASSERT(nIndex >= 0); ( ~5 O6 ~. B8 R0 b! o ASSERT(nCount >= 0); ASSERT(nIndex + nCount <= m_nSize); int j =0 ; / H6 ?$ E% r' m, y# k+ _/ Y; l for(int i=nIndex+nCount;i<m_nSize;i++){//把老索引复制过来 9 p0 `" f- J9 K/ j0 U0 m3 K strIndex[nIndex+j] = strIndex; ) L2 S( L" b' G9 f& O" } j++; } return TRUE; } 5 b7 h$ p/ Q+ U3 Y& Ltemplate<class TYPE, class ARG_TYPE> ! D7 `# a$ D4 U" ?& i; NBOOL YCArray<TYPE, ARG_TYPE>:ELIndex(CString cIndex,int nCount /*=1*/) { int nIndex=this->GetIndex(cIndex); return this->DELIndex(nIndex,nCount); } ( Q2 ]* Z* U3 c$ }1 p; M( ztemplate<class TYPE, class ARG_TYPE> ; n; ~' E8 W0 I" Z5 \int YCArray<TYPE, ARG_TYPE>::GetIndex(CString cIndex) {//得到 cIndex 的数字索引 8 w- i. z; c r7 c" P' X" I4 m6 K int nPos = -1; for(int i=0;i<m_nSize;i++){ if(strIndex == cIndex){ nPos = i ;break; } } 0 K6 O6 M4 D' t% A& w return nPos; 3 p" B. e' l) v! C, [9 Q$ ^# \9 w0 N} template<class TYPE, class ARG_TYPE> ; i8 W+ L7 ]& V+ B* F- U) i' B VCString YCArray<TYPE, ARG_TYPE>::GetIndex(int nIndex) ) _ [! _8 P& B* X/ t9 }8 U{//返回 nIndex 的字符串索引 - O& ^0 ? s- p4 P( @* [ return strIndex[nIndex]; 4 w. P1 D0 n4 o; U/ f} ///////////////////////////////////////////////////////////////////////////// - }& ^' Q9 T: }7 J; u+ Y6 B// YCArray<TYPE, ARG_TYPE> inline functions

template<class TYPE, class ARG_TYPE> ! A6 [6 f1 Z7 b2 f) v' \! mAFX_INLINE int YCArray<TYPE, ARG_TYPE>::GetSize() const { return m_nSize; } template<class TYPE, class ARG_TYPE> AFX_INLINE int YCArray<TYPE, ARG_TYPE>::GetUpperBound() const % W5 a6 \( U7 F3 k0 x: b4 D0 O { return m_nSize-1; } 2 _4 o( U* S) I+ ltemplate<class TYPE, class ARG_TYPE> ' l" F7 T$ a. ?3 L wAFX_INLINE void YCArray<TYPE, ARG_TYPE>::RemoveAll() ) m! |2 c, _ l( W3 J$ y { SetSize(0, -1); } 5 s6 k. \2 B0 G- \4 T+ u0 Xtemplate<class TYPE, class ARG_TYPE> AFX_INLINE TYPE YCArray<TYPE, ARG_TYPE>::GetAt(int nIndex) const % v# A* u- T8 j; w f4 d { ASSERT(nIndex >= 0 && nIndex < m_nSize); $ b' \0 ]; `# E! p; c W* G1 v" t return *Ym_pData[nIndex]; } $ s, D8 F: f( Atemplate<class TYPE, class ARG_TYPE> AFX_INLINE void YCArray<TYPE, ARG_TYPE>::SetAt(int nIndex, ARG_TYPE newElement) { 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) { ASSERT(nIndex >= 0 && nIndex < m_nSize); return *Ym_pData[nIndex]; }

template<class TYPE, class ARG_TYPE> 1 d; n9 i7 ` B3 h" ?6 H; cTYPE YCArray<TYPE, ARG_TYPE>::GetAt(CString cIndex) const : D3 @1 z( ^$ X( H, }6 W- c{ int nIndex=GetIndex(cIndex); return GetAt(nIndex); } 2 t+ C9 k! _4 K7 a- }template<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::SetAt(CString cIndex, ARG_TYPE newElement) " B$ K- Y4 m/ ]: L: g{ / H8 ]/ C$ E/ E% U int nIndex=GetIndex(cIndex); & ]& `& l6 X E* p) P9 J return SetAt(nIndex, newElement); } ) z. U# m& Q3 N, K* P) O/ O1 Jtemplate<class TYPE, class ARG_TYPE> " a, m7 y. N0 a+ R1 F% S" wTYPE& YCArray<TYPE, ARG_TYPE>::ElementAt(CString cIndex) { % _( c* d) l! f. f; D int nIndex=GetIndex(cIndex); return ElementAt(nIndex); } 8 h6 O! p" H& x; `1 M* @6 ptemplate<class TYPE, class ARG_TYPE> 0 }7 H* l4 _* ^* M- M( {0 xAFX_INLINE const TYPE** YCArray<TYPE, ARG_TYPE>::GetData() const { return (const TYPE**)Ym_pData; } ) i7 ]2 _" \* w% b9 t1 S+ d, Btemplate<class TYPE, class ARG_TYPE> AFX_INLINE TYPE** YCArray<TYPE, ARG_TYPE>::GetData() ( Y' O2 l9 d7 z3 y, d4 {$ s { return (TYPE**)Ym_pData; } template<class TYPE, class ARG_TYPE> AFX_INLINE int YCArray<TYPE, ARG_TYPE>::Add(ARG_TYPE newElement,CString cIndex /* ="" */) ; L* T/ M5 f' w' L { int nIndex = m_nSize; SetAtGrow(nIndex, newElement); SETIndex(cIndex,nIndex); " M5 d/ J7 ]) Y0 q/ o* q4 H! I 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> 9 z3 J7 f0 `; C4 q, b* gAFX_INLINE TYPE& YCArray<TYPE, ARG_TYPE>:perator[](int nIndex) 9 N4 o7 M0 n. m( M O+ b" h { return ElementAt(nIndex); } + ]1 W) L( N" a1 wtemplate<class TYPE, class ARG_TYPE> AFX_INLINE TYPE YCArray<TYPE, ARG_TYPE>:perator[](CString cIndex) const * P S, i& |" m+ V9 w" p{ int nIndex=GetIndex(cIndex);

return operator[](nIndex); $ c4 {& z* C* @} % e! X! Z1 O; q# x; g" T i; stemplate<class TYPE, class ARG_TYPE> AFX_INLINE TYPE& YCArray<TYPE, ARG_TYPE>:perator[](CString cIndex) { ' u3 f3 O) G3 U; Z. E& r int nIndex=GetIndex(cIndex); return operator[](nIndex); 4 W2 ~1 |) B! C8 N} ! @. k/ E( A& f' s' V/* template<class TYPE, class ARG_TYPE> AFX_INLINE YCArray<TYPE,ARG_TYPE> YCArray<TYPE, ARG_TYPE>:perator=(YCArray<TYPE,ARG_TYPE>& tparr) const . O" Q/ Y U& E1 m; P6 }{ : |, ^5 T7 Q. j k D U* k int i,j; for(i=0;i<tparr.GetSize();i++){ j = GetIndex(tparr.GetIndex(i)); if(j>-1){ operator[](tparr.GetIndex(i)) = tparr; }else{ 9 G* G& }+ |5 B* x Add(tparr,tparr.GetIndex(i)); , J. x5 X& g0 x% _# y } } return this; 3 D8 \0 q9 t& [* S} / L2 S+ r' G+ |. O2 H! t( |+ o*/ % s5 K$ f. M" t+ b; Ptemplate<class TYPE, class ARG_TYPE> AFX_INLINE YCArray<TYPE,ARG_TYPE>& YCArray<TYPE, ARG_TYPE>:perator=(YCArray<TYPE,ARG_TYPE>& src) { : j4 \4 k" h @0 J3 I9 e; x ASSERT_VALID(this); " H$ A/ ]/ x$ `+ B ASSERT(this != &src); // cannot append to itself

SetSize(src.m_nSize); # J2 q! I# H" t; O for(int i=0;i<m_nSize;i++){ + V8 S0 M/ |, [ /*将此句修改为内存拷贝*/// 6 V/ a1 p7 d, ^# Y w8 w7 Y) H *Ym_pData = *src.Ym_pData ; //memcpy(Ym_pData,src.Ym_pData,sizeof(TYPE)); SETIndex(src.GetIndex(i),i); } 3 ]# O j) o1 K" m e! s return *this; } 2 X8 A* R) j0 Z///////////////////////////////////////////////////////////////////////////// # _- j6 e' s4 m( q// YCArray<TYPE, ARG_TYPE> out-of-line functions

template<class TYPE, class ARG_TYPE> YCArray<TYPE, ARG_TYPE>::YCArray() { 0 I. W( k) m( }; w- a. p$ `' m Ym_pData = NULL; strIndexNum = m_nSize = m_nMaxSize = m_nGrowBy = 0; 1 I- A/ j. t: D* V' Z' d) B' R strIndex=NULL;MAXSIGNTIME=10; } 0 a/ o) p0 R; P) G2 }' M2 itemplate<class TYPE, class ARG_TYPE> YCArray<TYPE, ARG_TYPE>::YCArray(YCArray<TYPE, ARG_TYPE>& tp) % |5 Q" q1 G& k7 p) `' j* q" z{ 5 T$ y( z. N7 o" L, J6 z Ym_pData = NULL; ( T! T0 z3 I4 B/ }- _2 W0 | strIndexNum = m_nSize = m_nMaxSize = m_nGrowBy = 0; 1 w$ L, N2 q8 @: J" \- } strIndex=NULL;MAXSIGNTIME=10; % Z: } g. e! T+ } operator=(tp); }

template<class TYPE, class ARG_TYPE> / @, R! a: c/ L* }3 u" n1 {void YCArray<TYPE, ARG_TYPE>::SetSize(int nNewSize, int nGrowBy) { ASSERT_VALID(this); ASSERT(nNewSize >= 0);

if (nGrowBy != -1) m_nGrowBy = nGrowBy; // set new size

if (nNewSize == 0){ 2 K) A5 o% R8 z1 k! Z p // shrink to nothing if (Ym_pData != NULL){ ; |) r7 ~( y% S- o* b! [6 z7 K DestructAllElement(0,m_nSize); //DestructElements<TYPE>(Ym_pData, m_nSize); delete[] (BYTE*)Ym_pData; 3 `. o4 b1 C" }7 G, p: S Ym_pData = NULL; 5 f7 U# o; E9 w1 b! C N } m_nSize = m_nMaxSize = 0; % c1 @4 k* {5 d } else if (Ym_pData == NULL){ 4 \% `. b, D9 L; h1 r // create one with exact size $ p0 n6 I5 [" i7 T#ifdef SIZE_T_MAX # o3 f) w5 x. n- x0 q ASSERT(nNewSize <= SIZE_T_MAX/sizeof(TYPE*)); // no overflow % Z' E5 h- {$ z% U/ A# C: ~#endif Ym_pData = (TYPE**) new BYTE[nNewSize * sizeof(TYPE*)]; ConstructAllElements(0,nNewSize);//ConstructElements<TYPE>(Ym_pData, nNewSize); 3 C6 f2 g0 M7 I% o$ A7 C0 ]" l m_nSize = m_nMaxSize = nNewSize; } else if (nNewSize <= m_nMaxSize){ // it fits if (nNewSize > m_nSize) % v. `& h5 V0 s i, m1 e* r5 N0 h; P { : z' u2 U* Q5 k( k% E: Z // initialize the new elements ConstructAllElements(m_nSize,nNewSize-m_nSize);//ConstructElements<TYPE>(&Ym_pData[m_nSize], nNewSize-m_nSize); } else if (m_nSize > nNewSize) - I, G2 o: a! D& e { // destroy the old elements " ?) d4 n( @0 { DestructAllElement(nNewSize,m_nSize-nNewSize); 0 J [% U1 k0 _0 k, U$ F //DestructElements<TYPE>(&Ym_pData[nNewSize], m_nSize-nNewSize); } m_nSize = nNewSize; # Z z; C% T4 y/ f, ? } " c) T0 Q3 c* C; V( m5 [0 a4 D' T$ S else { // otherwise, grow array * a7 d( Q* R, u) q Y# \ int nGrowBy = m_nGrowBy; % Y: p. _! Y7 I7 g" S/ u if (nGrowBy == 0) " H* ?0 u" s, Q7 p { // heuristically determine growth when nGrowBy == 0 // (this avoids heap fragmentation in many situations) nGrowBy = m_nSize / 8; nGrowBy = (nGrowBy < 4) ? 4 : ((nGrowBy > 1024) ? 1024 : nGrowBy); 4 Q" X& a) \, z9 b; e+ y [9 B } , N8 W. r$ d( |$ o( t int nNewMax; if (nNewSize < m_nMaxSize + nGrowBy) 4 ]+ B+ w. I* K1 F( U nNewMax = m_nMaxSize + nGrowBy; // granularity / m& C8 m% S; N' P else # x% c0 }$ c* g# T6 W nNewMax = nNewSize; // no slush

ASSERT(nNewMax >= m_nMaxSize); // no wrap around #ifdef SIZE_T_MAX ASSERT(nNewMax <= SIZE_T_MAX/sizeof(TYPE)); // no overflow - T, o, }4 R, D, c% E0 x#endif 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*/"); delete[] (BYTE*)Ym_pData; / }, o. ?- g* l Ym_pData = pNewData; * n( x) g9 h- y: }9 c: f: z5 z6 F0 z ConstructAllElements(m_nSize,nNewSize-m_nSize);//ConstructElements<TYPE>(&pNewData[m_nSize], nNewSize-m_nSize);

// get rid of old stuff (note: no destructors called) * b; I# y. ~, `% _* A9 ~7 [/ n m_nSize = nNewSize; m_nMaxSize = nNewMax; } SetIndexSize(nNewSize); }

yzhlinux

//接上面

template<class TYPE, class ARG_TYPE> ! x( e7 J' s! Iint YCArray<TYPE, ARG_TYPE>::Append(const YCArray& src) { ASSERT_VALID(this); ASSERT(this != &src); // cannot append to itself

int nOldSize = m_nSize; _# W! N$ x$ `7 E2 X8 E. x7 ] SetSize(m_nSize + src.m_nSize);

ConstructAllElements(nOldSize,src.m_nSize); for(int i=nOldSize;i<m_nSize;i++){ ! e. _# L) H$ J7 ~ /*将此句修改为内存拷贝*/// *Ym_pData = *src.Ym_pData[i-nOldSize] ; $ _: |$ E4 C4 G$ g8 S( | //memcpy(Ym_pData,src.Ym_pData[i-nOldSize],sizeof(TYPE)); 1 C i( f3 C! _9 w- y8 @. {2 D SETIndex(src.GetIndex(i-nOldSize),i); _# C3 e" o- [9 g Q, b, K } /*wait for me*///CopyElements<TYPE>(Ym_pData + nOldSize, src.Ym_pData, src.m_nSize); return nOldSize; 9 R9 x' o% [* a: n6 G5 x}

template<class TYPE, class ARG_TYPE> $ l) M! h/ t- j4 o) n0 hvoid YCArray<TYPE, ARG_TYPE>::Copy(const YCArray& src) { , h G+ V$ d7 g+ U ASSERT_VALID(this); 7 p0 b" V" k: R( |% h6 g ASSERT(this != &src); // cannot append to itself

SetSize(src.m_nSize); for(int i=0;i<m_nSize;i++){ . f, @- ]' H6 L: ]* C; ~ /*将此句修改为内存拷贝*///*Ym_pData = *src.Ym_pData ; 7 x; {4 H5 p: Z9 P: g2 p e memcpy(Ym_pData,src.Ym_pData,sizeof(TYPE)); SETIndex(src.GetIndex(i),i); Y9 q1 M% M8 N } /*wait for me*///CopyElements<TYPE>(Ym_pData, src.Ym_pData, src.m_nSize); }

template<class TYPE, class ARG_TYPE> 5 C0 x4 u$ k" Uvoid YCArray<TYPE, ARG_TYPE>::FreeExtra() { ASSERT_VALID(this);

if (m_nSize != m_nMaxSize) 7 S3 J2 o2 M! r$ D4 g7 w( _. l( j8 Q* g% i { # K% i( H) z/ X. }% |1 o5 L // shrink to desired size 6 G. Y8 G Q4 ~2 [, y#ifdef SIZE_T_MAX ASSERT(m_nSize <= SIZE_T_MAX/sizeof(TYPE)); // no overflow 7 u$ i4 T, f8 u6 ?* H% Y% N#endif TYPE* pNewData = NULL; if (m_nSize != 0) { pNewData = (TYPE**) new BYTE[m_nSize * sizeof(TYPE*)]; // copy new data from old memcpy(pNewData, Ym_pData, m_nSize * sizeof(TYPE*)); }

// get rid of old stuff (note: no destructors called) 8 l) X7 q: |1 P6 Q9 I/ P" ^/ P delete[] (BYTE*)Ym_pData; * ~4 u( T' R' ~. r. ?, \ ]# z9 k Ym_pData = pNewData; " k( y5 S8 G. P- A& j6 ~6 x m_nMaxSize = m_nSize; 3 R3 _/ G+ T/ n } } 8 H6 m& u9 d Gtemplate<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::SetAtGrow(CString cIndex, ARG_TYPE newElement) { u8 c1 L" Y- ]( |2 y3 \ int nIndex=GetIndex(cIndex); return SetAtGrow(nIndex,newElement); 5 n& W4 [/ c, t& }6 ^9 n} template<class TYPE, class ARG_TYPE> 4 e: F6 Z5 a$ e% b) H# Yvoid YCArray<TYPE, ARG_TYPE>::SetAtGrow(int nIndex, ARG_TYPE newElement) { ASSERT_VALID(this); ASSERT(nIndex >= 0);

if (nIndex >= m_nSize) SetSize(nIndex+1, -1); 1 H9 |; I* M; f0 M( N *Ym_pData[nIndex] = newElement; }

template<class TYPE, class ARG_TYPE> % d! p# y3 ]) o$ A8 L& p* `void YCArray<TYPE, ARG_TYPE>::InsertAt(int nIndex, ARG_TYPE newElement, int nCount /*=1*/) 2 n" l; d- J; E9 B( W5 F: O{ ASSERT_VALID(this); ASSERT(nIndex >= 0); // will expand to meet need ASSERT(nCount > 0); // zero or negative size not allowed

if (nIndex >= m_nSize) { // adding after the end of the array ) c0 ^( I' z. O; I' m: }/ k SetSize(nIndex + nCount, -1); // grow so nIndex is valid # @' {+ V8 E7 A7 Z+ U" f! } } 4 b! h, D! \2 x E; q% s2 f$ z else ( C* k. O8 | V1 I5 Z0 n { // inserting in the middle of the array 9 z$ [3 V( n, h; O int nOldSize = m_nSize; $ j# h" s: l. V/ D SetSize(m_nSize + nCount, -1); // grow it to new size " o2 T' J; r, J // destroy intial data before copying over it 8 ?6 f6 g3 W% W2 Y /*不需要销毁了,因为 SetSize 的是指针*///DestructAllElement(nOldSize,nCount); //DestructElements<TYPE>(&Ym_pData[nOldSize], nCount); ; M ?- s1 x( \6 J // 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 % l7 |2 T2 `: V0 A- b7 v /*不需要销毁了,因为 SetSize 的是指针*///ConstructAllElements(nIndex,nCount);//ConstructElements<TYPE>(&Ym_pData[nIndex], nCount); ! |. K. n v3 t N( I% o# l }

// insert new value in the gap $ f% H3 I+ v6 H$ Y: e/ f ASSERT(nIndex + nCount <= m_nSize); 8 h4 d7 Y1 J- l0 s: i while (nCount--){ # F) T' S5 o1 L7 K *Ym_pData[nIndex++] = newElement; } $ `0 @# x( q6 P2 R} template<class TYPE, class ARG_TYPE> / S0 t2 W2 q2 `) Zvoid YCArray<TYPE, ARG_TYPE>::RemoveAt(CString cIndex,int nCount /*=1*/) 4 u' [( _5 K, a{ int nIndex = GetIndex(cIndex); : G! ^4 J4 o0 l, O RemoveAt(nIndex,nCount); } * d( l( I2 ?2 N+ V; X; Ptemplate<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::RemoveAt(int nIndex, int nCount /*=1*//*=1*/) { # [9 C8 s4 L6 z! d9 f ASSERT_VALID(this); ASSERT(nIndex >= 0); ASSERT(nCount >= 0); 9 N* g* T$ w* P" u; H ASSERT(nIndex + nCount <= m_nSize); 9 n+ W: z- H* e6 r8 A //yzh % \" ~) m4 R8 `4 q; R; D DELIndex(nIndex); //yzh // just remove a range 0 U: Z) b/ x: v, ? int nMoveCount = m_nSize - (nIndex + nCount); //需要移动的数目 DestructAllElement(nIndex,nCount); 3 U# f v- X, D W# b //DestructElements<TYPE>(&Ym_pData[nIndex], nCount); if (nMoveCount) memmove(&Ym_pData[nIndex], &Ym_pData[nIndex + nCount], $ y$ { n3 ?1 C! _5 d( ? nMoveCount * sizeof(TYPE*)); 5 r$ n* y; j* j/ O0 @/ H- @ m_nSize -= nCount; . ^9 p2 r" K; `}

template<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::InsertAt(int nStartIndex, YCArray* pNewArray) ; M6 w5 Z) C$ l E7 g9 Y{ 5 G2 i) x- x9 g3 z ASSERT_VALID(this); ASSERT(pNewArray != NULL); ASSERT_VALID(pNewArray); . I7 I& y2 r3 e! T ASSERT(nStartIndex >= 0);

if (pNewArray->GetSize() > 0) ) y5 n* v. f1 Q# `. B, P- A { 1 F6 x, o7 {: X5 ]7 U1 m0 ?" u InsertAt(nStartIndex, pNewArray->GetAt(0), pNewArray->GetSize()); % f& q4 G2 _6 A( Q for (int i = 0; i < pNewArray->GetSize(); i++) SetAt(nStartIndex + i, pNewArray->GetAt(i)); $ Z/ O/ y1 K3 L } ! O0 X; I0 Q& o0 |} template<class TYPE, class ARG_TYPE> void YCArray<TYPE, ARG_TYPE>::InsertAt(ARG_TYPE newElement, int nIndex,CString cIndex) 6 t2 p0 F% ~$ D& x5 {" H{ 1 Q% [4 r5 {3 \8 L- {# p$ U! B ADDIndex(cIndex,nIndex+1); ! U; j( X1 L4 I InsertAt(newElement,nIndex); } 6 Z. O! X. l) e' H& wtemplate<class TYPE, class ARG_TYPE> " }( y% O$ l! o/ ~void YCArray<TYPE, ARG_TYPE>::Serialize(CArchive& ar) " d" G6 B# C3 P- x{ % \2 S; G$ C0 X4 x9 l$ o ASSERT_VALID(this); throw("/*wait for me --- yzhlinux*/"); 3 Y4 _# q6 m5 w CObject::Serialize(ar); ; @# h2 E8 g" o9 V1 u6 C if (ar.IsStoring()) ; z5 u! B3 Q" p { { ar.WriteCount(m_nSize); ! j0 \( W% k3 r( j4 r } else { ) ^5 E; R9 n& L( T# U, d$ P DWORD nOldSize = ar.ReadCount(); % j" s$ S( G' w% e& D) S0 r3 J SetSize(nOldSize, -1); } 4 v* Z4 m3 c1 R2 u //SerializeElements<TYPE>(ar, Ym_pData, m_nSize); / I7 n H/ z. ]. \" p}

#ifdef _DEBUG ' A& C% l. G. A6 M0 @% z$ Y: a' {. [template<class TYPE, class ARG_TYPE> ( f h% a0 h0 [0 f0 Cvoid YCArray<TYPE, ARG_TYPE>::AssertValid() const / J" H4 T/ G7 j. q8 g6 e' y{ CObject::AssertValid();

if (Ym_pData == NULL) { 6 p) |4 v2 }* z4 _8 G ASSERT(m_nSize == 0); ; b# w* e% G; N+ G ASSERT(m_nMaxSize == 0); } c- c& U. h* a else { ASSERT(m_nSize >= 0); ASSERT(m_nMaxSize >= 0); ' F0 ^+ b! z) \2 {% C: p6 F$ u ASSERT(m_nSize <= m_nMaxSize); ASSERT(AfxIsValidAddress(Ym_pData, m_nMaxSize * sizeof(TYPE*))); } 2 I8 R! z8 I+ ?9 D+ a" L2 h/ t} template<class TYPE, class ARG_TYPE> ) d0 o( R, U0 i8 }/ W. `5 p$ r0 v) @8 q% Tvoid YCArray<TYPE, ARG_TYPE>:ump(CDumpContext& dc) const { CObject:ump(dc); throw("/*wait for me --- yzhlinux*/"); dc << "with " << m_nSize << " elements"; if (dc.GetDepth() > 0) ' e$ l: B+ q2 J) P& a { 1 ~6 b' Q+ h7 x4 s% L4 v dc << "\n"; /*wait for me --- yzhlinux*/// DumpElements<TYPE>(dc, Ym_pData, m_nSize); $ l9 E( s' K& r4 D1 K. S/ u }

dc << "\n"; } # [* Z$ X' d( ^( y! k+ Z#endif

#endif

//完

Eagle

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

yzhlinux

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

8 E/ T- ?; g M" N. C 就是因为发不了文件啊，奇怪，现在不能上传文件了，不然不用那么辛苦

Eagle

先传到帖图区……

管理员

赚帖子不好吗

yzhlinux

现在可以传文件了，附上，好用的摸板数组类，支持 ATL 可以在任何地方使用。
5 Z5 L2 X1 }' w
E2mkAVvk.rar (4.61 KB, 下载次数: 19)

2005-6-3 14:56 上传

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

游侠无极限

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