Visual C++ .NET/Collections/priority queue

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

Add to priority_queue

<source lang="csharp">

  1. include "stdafx.h"
  2. include <cliext/queue>

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->CompareTo(rhs->Name) > 0);
   }
   bool operator==(const MyClass^ rhs)
   {
       return (Name->Equals(rhs->Name));
   }

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

   priority_queue<MyClass^> petpq;
   petpq.push(gcnew MyClass("A"));
   petpq.push(gcnew MyClass("B"));
   petpq.push(gcnew MyClass("C"));
   petpq.push(gcnew MyClass("D"));
   return 0;

}

 </source>


Display priority_queue by IEnumerator<> interface

<source lang="csharp">

  1. include "stdafx.h"
  2. include <cliext/queue>

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->CompareTo(rhs->Name) > 0);
   }
   bool operator==(const MyClass^ rhs)
   {
       return (Name->Equals(rhs->Name));
   }

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

   priority_queue<MyClass^> petpq;
   petpq.push(gcnew MyClass("A"));
   petpq.push(gcnew MyClass("B"));
   petpq.push(gcnew MyClass("C"));
   petpq.push(gcnew MyClass("D"));
   for each (MyClass^ pet in petpq.get_container())
       Console::Write("{0} ", pet->Name);
   return 0;

}

 </source>


Pop myMap from priority queue till empty

<source lang="csharp">

  1. include "stdafx.h"
  2. include <cliext/queue>

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->CompareTo(rhs->Name) > 0);
   }
   bool operator==(const MyClass^ rhs)
   {
       return (Name->Equals(rhs->Name));
   }

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

   priority_queue<MyClass^> petpq;
   petpq.push(gcnew MyClass("A"));
   petpq.push(gcnew MyClass("B"));
   petpq.push(gcnew MyClass("C"));
   petpq.push(gcnew MyClass("D"));
   while (!petpq.empty())
   {
       Console::Write("{0} ", petpq.top()->Name);
       petpq.pop();
   }
   return 0;

}

 </source>