Visual C++ .NET/Collections/deque

Материал из .Net Framework эксперт
Версия от 12:05, 26 мая 2010; Admin (обсуждение | вклад) (1 версия)
(разн.) ← Предыдущая | Текущая версия (разн.) | Следующая → (разн.)
Перейти к: навигация, поиск

Cast deque to IList

 
#include "stdafx.h"
#include <cliext/deque>
#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); 
}


Convert deque to ICollection by make_collection

 
#include "stdafx.h"
#include <cliext/deque>
#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); 
}


for loop -- Using subscript with deque

 
#include "stdafx.h"
#include <cliext/deque>
#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); 
}


Push into a deque

 
#include "stdafx.h"
#include <cliext/deque>
#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); 
}


Reference the first and last element of a deque

 
#include "stdafx.h"
#include <cliext/deque>
#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); 
}


Use for each to loop through a deque

 
#include "stdafx.h"
#include <cliext/deque>
#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); 
}


Using built in IEnumerator<> interface from deque

 
#include "stdafx.h"
#include <cliext/deque>
#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); 
}


Using const_iterator with deque.insert

 
#include "stdafx.h"
#include <cliext/deque>
#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); 
}