扫一扫
分享文章到微信
扫一扫
关注官方公众号
至顶头条
作者:LITHR 来源:天极BLOG 2007年11月16日
关键字: Visual C++ STL
void objectCollection() { using namespace System::Collections; ArrayList ^as = gcnew ArrayList; as->Add( "Pooh" ); as->Add( "Piglet" ); as->Add( "Eeyore" ); as->Add( "Rabbit" ); as->Sort(); Console::WriteLine( "ArrayList holds {0} elements: ",as->Count ); for ( int i = 0; i < as->Count; i++ ) Console::WriteLine( as[ i ] ); int index = as->IndexOf( "Pooh" ); if ( index != -1 ) { //需要一个清晰地downcast String^ item = safe_cast( as[ index ]); as->RemoveAt( index ); } as->Remove( "Rabbit" ); Console::WriteLine( "\nArrayList holds {0} elements: ",as->Count ); IEnumerator^ is = as->GetEnumerator(); while ( is->MoveNext() ) Console::WriteLine( is->Current ); } |
#include #include void stlCollection() { vector ^svec = gcnew vector; svec->push_back("Pooh"); svec->push_back("Piglet"); svec->push_back("Eeyore"); svec->push_back("Rabbit"); //泛型算法:sort sort( svec->begin(), svec->end() ); Console::WriteLine( "Collection holds {0} elements: ",svec->size() ); for ( int i = 0; i < svec->size(); i++ ) Console::WriteLine( svec[ i ] ); //泛型算法:find vector::iterator iter = find( svec->begin(), svec->end(), "Pooh" ); if ( iter != svec->end() ) { //不需要downcast…… String ^item = *iter; svec->erase( iter ); } //泛型算法: remove…… remove( svec->begin(), svec->end(), "Rabbit" ); Console::WriteLine( "\nCollection holds {0} elements:",svec->size() ); IEnumerator ^is = svec->GetEnumerator(); while ( is->MoveNext() ) Console::WriteLine( is->Current ); } |
如果您非常迫切的想了解IT领域最新产品与技术信息,那么订阅至顶网技术邮件将是您的最佳途径之一。