в 15:31, 26 мая 2010

2010-05-26T15:31:02Z

Admin: 1 версия

2010-05-26T12:05:19Z

1 версия

Новая страница

==Add value to a Queue with Enqueue==

<source lang="csharp">
#include "stdafx.h"
using namespace System;
using namespace System::Collections;
void main()
{
Queue ^que = gcnew Queue();
Stack ^stk = gcnew Stack();
array<String^>^ entry = gcnew array<String^> { "First", "Second", "Third", "Fourth" };
for (int i = 0; i < entry->Length; i++)
{
que->Enqueue(entry[i]);
stk->Push(entry[i]);
Console::WriteLine("{0}\t\t{1}", entry[i], entry[i]);
}
while ((que->Count > 0) && (stk->Count > 0))
{
Console::WriteLine("{0}\t\t{1}", que->Dequeue(), stk->Pop());
}
que->Clear();
stk->Clear();
}

</source>

==Call dequeue to remove element from a Queue==

<source lang="csharp">
#include "stdafx.h"
using namespace System;
using namespace System::Collections;
void main()
{
Queue ^que = gcnew Queue();
Stack ^stk = gcnew Stack();
array<String^>^ entry = gcnew array<String^> { "First", "Second", "Third", "Fourth" };
for (int i = 0; i < entry->Length; i++)
{
que->Enqueue(entry[i]);
stk->Push(entry[i]);
Console::WriteLine("{0}\t\t{1}", entry[i], entry[i]);
}
while ((que->Count > 0) && (stk->Count > 0))
{
Console::WriteLine("{0}\t\t{1}", que->Dequeue(), stk->Pop());
}
que->Clear();
stk->Clear();
}

</source>

==Display Queue by IEnumerator<> interface==

<source lang="csharp">
#include "stdafx.h"
#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->Equals(rhs->Name));
}
};
int main(array<System::String ^> ^args)
{
queue<MyClass^> petq;
petq.push(gcnew MyClass("A"));
petq.push(gcnew MyClass("B"));
petq.push(gcnew MyClass("C"));
petq.push(gcnew MyClass("D"));
for each (MyClass^ pet in petq.get_container())
Console::Write("{0} ", pet->Name);
return 0;
}

</source>

==Get element count for a Queue==

<source lang="csharp">
#include "stdafx.h"
using namespace System;
using namespace System::Collections;
void main()
{
Queue ^que = gcnew Queue();
Stack ^stk = gcnew Stack();
array<String^>^ entry = gcnew array<String^> { "First", "Second", "Third", "Fourth" };
for (int i = 0; i < entry->Length; i++)
{
que->Enqueue(entry[i]);
stk->Push(entry[i]);
Console::WriteLine("{0}\t\t{1}", entry[i], entry[i]);
}
while ((que->Count > 0) && (stk->Count > 0))
{
Console::WriteLine("{0}\t\t{1}", que->Dequeue(), stk->Pop());
}
que->Clear();
stk->Clear();
}

</source>

==Get the front of a queue==

<source lang="csharp">
#include "stdafx.h"
#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->Equals(rhs->Name));
}
};
int main(array<System::String ^> ^args)
{
queue<MyClass^> petq;
petq.push(gcnew MyClass("A"));
petq.push(gcnew MyClass("B"));
petq.push(gcnew MyClass("C"));
petq.push(gcnew MyClass("D"));
while (!petq.empty())
{
Console::Write("{0} ", petq.front()->Name);
petq.pop();
}

return 0;
}

</source>

==Get the last element in a queue==

<source lang="csharp">
#include "stdafx.h"
#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->Equals(rhs->Name));
}
};
int main(array<System::String ^> ^args)
{
queue<MyClass^> petq;
petq.push(gcnew MyClass("A"));
petq.push(gcnew MyClass("B"));
petq.push(gcnew MyClass("C"));
petq.push(gcnew MyClass("D"));
queue<MyClass^>::value_type lastpet = petq.back();
System::Console::WriteLine("The last pet in queue is:\n{0}", lastpet->Name);
return 0;
}

</source>

==Is queue empty==

<source lang="csharp">
#include "stdafx.h"
#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->Equals(rhs->Name));
}
};
int main(array<System::String ^> ^args)
{
queue<MyClass^> petq;
petq.push(gcnew MyClass("A"));
petq.push(gcnew MyClass("B"));
petq.push(gcnew MyClass("C"));
petq.push(gcnew MyClass("D"));
while (!petq.empty())
{
Console::Write("{0} ", petq.front()->Name);
petq.pop();
}

return 0;
}

</source>

==Push element to a queue==

<source lang="csharp">
#include "stdafx.h"
#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->Equals(rhs->Name));
}
};
int main(array<System::String ^> ^args)
{
queue<MyClass^> petq;
petq.push(gcnew MyClass("A"));
petq.push(gcnew MyClass("B"));
petq.push(gcnew MyClass("C"));
petq.push(gcnew MyClass("D"));

return 0;
}

</source>

← Предыдущая	Версия 15:31, 26 мая 2010
(нет различий)

Visual C++ .NET/Collections/queue - История изменений

в 15:31, 26 мая 2010

Admin: 1 версия