Get the front of a queue : queue « Collections « Visual C++ .NET

Home
Visual C++ .NET
1.2D
2.Class
3.Collections
4.Data Type
5.Database ADO.net
6.Delegate
7.Development
8.File Directory
9.Function
10.Generics
11.GUI Form
12.Language Basics
13.Network
14.Reflection
15.Security
16.Statement
17.Structure
18.Thread
19.XML
C / ANSI-C
C Tutorial
C++
C++ Tutorial
Visual C++ .NET » Collections » queue 
Get the front of a queue
 
#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->Name0);
    }

    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;
}

   
  
Related examples in the same category
1.Push element to a queue
2.Get the last element in a queue
3.Display Queue by IEnumerator<> interface
4.Is queue empty
5.Add value to a Queue with Enqueue
6.Get element count for a Queue
7.Call dequeue to remove element from a Queue
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.