Visual C++ .NET/Collections/deque

Материал из .Net Framework эксперт
Перейти к: навигация, поиск

Cast deque to IList

<source lang="csharp">

  1. include "stdafx.h"
  2. include <cliext/deque>
  3. include <cliext/adapter>

using namespace System; using namespace cliext; using namespace System::Collections::Generic; ref class MyClass { public:

   String^ Name;
   MyClass() : Name(String::Empty) { }
   MyClass(String^ name) : Name(name) { }
   MyClass(const MyClass% orig)
   {
       Name = orig.Name; 
   }
   MyClass% operator=(const MyClass% orig)
   {
       if (this != %orig)
           Name = orig.Name;
       return *this;
   }
   ~MyClass() { }
   bool operator<(const MyClass^ rhs)
   {
       return (Name->CompareTo(rhs->Name) < 0);
   }
   bool operator==(const MyClass^ rhs)
   {
       return (Name->Equals(rhs->Name));
   }

};

int main(array<System::String ^> ^args) {

   deque<MyClass^> pets; 
   pets.push_front(gcnew MyClass("A")); 
   pets.push_front(gcnew MyClass("B"));
   pets.push_front(gcnew MyClass("C"));
   pets.push_front(gcnew MyClass("D"));
   System::Console::WriteLine("\n\nfor each loop -- From typecast to IList<> with Add():"); 
   IList<MyClass^>^ genericIList = %pets;
   genericIList->Add(gcnew MyClass("Q"));
   for each (MyClass^ pet in genericIList) 
       System::Console::Write("{0} ", pet->Name); 
       
   return (0); 

}

 </source>


Convert deque to ICollection by make_collection

<source lang="csharp">

  1. include "stdafx.h"
  2. include <cliext/deque>
  3. include <cliext/adapter>

using namespace System; using namespace cliext; using namespace System::Collections::Generic; ref class MyClass { public:

   String^ Name;
   MyClass() : Name(String::Empty) { }
   MyClass(String^ name) : Name(name) { }
   MyClass(const MyClass% orig)
   {
       Name = orig.Name; 
   }
   MyClass% operator=(const MyClass% orig)
   {
       if (this != %orig)
           Name = orig.Name;
       return *this;
   }
   ~MyClass() { }
   bool operator<(const MyClass^ rhs)
   {
       return (Name->CompareTo(rhs->Name) < 0);
   }
   bool operator==(const MyClass^ rhs)
   {
       return (Name->Equals(rhs->Name));
   }

};

int main(array<System::String ^> ^args) {

   deque<MyClass^> pets; 
   pets.push_front(gcnew MyClass("A")); 
   pets.push_front(gcnew MyClass("B"));
   pets.push_front(gcnew MyClass("C"));
   pets.push_front(gcnew MyClass("D"));
   System::Console::WriteLine("\n\nfor each loop -- subset ICollection<> created by make_collection<>():"); 
   ICollection<MyClass^>^ icMyClasss = make_collection(pets.begin() + 1,pets.end() - 1);
   for each (MyClass^ pet in icMyClasss) 
       System::Console::Write("{0} ", pet->Name); 
       
   return (0); 

}

 </source>


for loop -- Using subscript with deque

<source lang="csharp">

  1. include "stdafx.h"
  2. include <cliext/deque>
  3. include <cliext/adapter>

using namespace System; using namespace cliext; using namespace System::Collections::Generic; ref class MyClass { public:

   String^ Name;
   MyClass() : Name(String::Empty) { }
   MyClass(String^ name) : Name(name) { }
   MyClass(const MyClass% orig)
   {
       Name = orig.Name; 
   }
   MyClass% operator=(const MyClass% orig)
   {
       if (this != %orig)
           Name = orig.Name;
       return *this;
   }
   ~MyClass() { }
   bool operator<(const MyClass^ rhs)
   {
       return (Name->CompareTo(rhs->Name) < 0);
   }
   bool operator==(const MyClass^ rhs)
   {
       return (Name->Equals(rhs->Name));
   }

};

int main(array<System::String ^> ^args) {

   deque<MyClass^> pets; 
   pets.push_front(gcnew MyClass("A")); 
   pets.push_front(gcnew MyClass("B"));
   pets.push_front(gcnew MyClass("C"));
   pets.push_front(gcnew MyClass("D"));
   System::Console::WriteLine("for loop -- Using subscript:"); 
   for(int i=0; i < pets.size(); i++)   
       System::Console::Write("{0} ", pets[i]->Name); 
       
   return (0); 

}

 </source>


Push into a deque

<source lang="csharp">

  1. include "stdafx.h"
  2. include <cliext/deque>
  3. include <cliext/adapter>

using namespace System; using namespace cliext; using namespace System::Collections::Generic; ref class MyClass { public:

   String^ Name;
   MyClass() : Name(String::Empty) { }
   MyClass(String^ name) : Name(name) { }
   MyClass(const MyClass% orig)
   {
       Name = orig.Name; 
   }
   MyClass% operator=(const MyClass% orig)
   {
       if (this != %orig)
           Name = orig.Name;
       return *this;
   }
   ~MyClass() { }
   bool operator<(const MyClass^ rhs)
   {
       return (Name->CompareTo(rhs->Name) < 0);
   }
   bool operator==(const MyClass^ rhs)
   {
       return (Name->Equals(rhs->Name));
   }

};

int main(array<System::String ^> ^args) {

   deque<MyClass^> myCollection; 
   myCollection.push_front(gcnew MyClass("A")); 
   myCollection.push_front(gcnew MyClass("B"));
   myCollection.push_front(gcnew MyClass("C"));
   myCollection.push_front(gcnew MyClass("D"));
   return (0); 

}

 </source>


Reference the first and last element of a deque

<source lang="csharp">

  1. include "stdafx.h"
  2. include <cliext/deque>
  3. include <cliext/adapter>

using namespace System; using namespace cliext; using namespace System::Collections::Generic; ref class MyClass { public:

   String^ Name;
   MyClass() : Name(String::Empty) { }
   MyClass(String^ name) : Name(name) { }
   MyClass(const MyClass% orig)
   {
       Name = orig.Name; 
   }
   MyClass% operator=(const MyClass% orig)
   {
       if (this != %orig)
           Name = orig.Name;
       return *this;
   }
   ~MyClass() { }
   bool operator<(const MyClass^ rhs)
   {
       return (Name->CompareTo(rhs->Name) < 0);
   }
   bool operator==(const MyClass^ rhs)
   {
       return (Name->Equals(rhs->Name));
   }

};

int main(array<System::String ^> ^args) {

   deque<MyClass^> pets; 
   pets.push_front(gcnew MyClass("A")); 
   pets.push_front(gcnew MyClass("B"));
   pets.push_front(gcnew MyClass("C"));
   pets.push_front(gcnew MyClass("D"));
   System::Console::WriteLine("\n\nfor each loop -- subset ICollection<> created by make_collection<>():"); 
   ICollection<MyClass^>^ icMyClasss = make_collection(pets.begin() + 1,pets.end() - 1);
   for each (MyClass^ pet in icMyClasss) 
       System::Console::Write("{0} ", pet->Name); 
       
   return (0); 

}

 </source>


Use for each to loop through a deque

<source lang="csharp">

  1. include "stdafx.h"
  2. include <cliext/deque>
  3. include <cliext/adapter>

using namespace System; using namespace cliext; using namespace System::Collections::Generic; ref class MyClass { public:

   String^ Name;
   MyClass() : Name(String::Empty) { }
   MyClass(String^ name) : Name(name) { }
   MyClass(const MyClass% orig)
   {
       Name = orig.Name; 
   }
   MyClass% operator=(const MyClass% orig)
   {
       if (this != %orig)
           Name = orig.Name;
       return *this;
   }
   ~MyClass() { }
   bool operator<(const MyClass^ rhs)
   {
       return (Name->CompareTo(rhs->Name) < 0);
   }
   bool operator==(const MyClass^ rhs)
   {
       return (Name->Equals(rhs->Name));
   }

};

int main(array<System::String ^> ^args) {

   deque<MyClass^> pets; 
   pets.push_front(gcnew MyClass("A")); 
   pets.push_front(gcnew MyClass("B"));
   pets.push_front(gcnew MyClass("C"));
   pets.push_front(gcnew MyClass("D"));
   System::Console::WriteLine("\n\nfor each loop -- From typecast to IList<> with Add():"); 
   IList<MyClass^>^ genericIList = %pets;
   genericIList->Add(gcnew MyClass("Q"));
   for each (MyClass^ pet in genericIList) 
       System::Console::Write("{0} ", pet->Name); 
       
   return (0); 

}

 </source>


Using built in IEnumerator<> interface from deque

<source lang="csharp">

  1. include "stdafx.h"
  2. include <cliext/deque>
  3. include <cliext/adapter>

using namespace System; using namespace cliext; using namespace System::Collections::Generic; ref class MyClass { public:

   String^ Name;
   MyClass() : Name(String::Empty) { }
   MyClass(String^ name) : Name(name) { }
   MyClass(const MyClass% orig)
   {
       Name = orig.Name; 
   }
   MyClass% operator=(const MyClass% orig)
   {
       if (this != %orig)
           Name = orig.Name;
       return *this;
   }
   ~MyClass() { }
   bool operator<(const MyClass^ rhs)
   {
       return (Name->CompareTo(rhs->Name) < 0);
   }
   bool operator==(const MyClass^ rhs)
   {
       return (Name->Equals(rhs->Name));
   }

};

int main(array<System::String ^> ^args) {

   deque<MyClass^> pets; 
   pets.push_front(gcnew MyClass("A")); 
   pets.push_front(gcnew MyClass("B"));
   pets.push_front(gcnew MyClass("C"));
   pets.push_front(gcnew MyClass("D"));
   System::Console::WriteLine("\n\nfor each loop -- using built in IEnumerator<> interface:"); 
   for each (MyClass^ pet in pets) 
       System::Console::Write("{0} ", pet->Name); 
       
   return (0); 

}

 </source>


Using const_iterator with deque.insert

<source lang="csharp">

  1. include "stdafx.h"
  2. include <cliext/deque>
  3. include <cliext/adapter>

using namespace System; using namespace cliext; using namespace System::Collections::Generic; ref class MyClass { public:

   String^ Name;
   MyClass() : Name(String::Empty) { }
   MyClass(String^ name) : Name(name) { }
   MyClass(const MyClass% orig)
   {
       Name = orig.Name; 
   }
   MyClass% operator=(const MyClass% orig)
   {
       if (this != %orig)
           Name = orig.Name;
       return *this;
   }
   ~MyClass() { }
   bool operator<(const MyClass^ rhs)
   {
       return (Name->CompareTo(rhs->Name) < 0);
   }
   bool operator==(const MyClass^ rhs)
   {
       return (Name->Equals(rhs->Name));
   }

};

int main(array<System::String ^> ^args) {

   deque<MyClass^> pets; 
   pets.push_front(gcnew MyClass("A")); 
   pets.push_front(gcnew MyClass("B"));
   pets.push_front(gcnew MyClass("C"));
   pets.push_front(gcnew MyClass("D"));
   System::Console::WriteLine("\n\nfor loop -- Using const_iterator with insert: "); 
   pets.insert(pets.begin() + 1, gcnew MyClass("Jack"));
   deque<MyClass^>::const_iterator pet_i;   
   for(pet_i = pets.begin(); pet_i != pets.end(); pet_i++)
       System::Console::Write("{0} ", pet_i->Name); 
       
   return (0); 

}

 </source>