Visual C++ .NET/Collections/multiset — различия между версиями

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

Текущая версия на 12:05, 26 мая 2010

equal_range of duplicate multiset

 
#include "stdafx.h"
#include <cliext/set>
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)
{
    multiset<MyClass^> mpets; 
    mpets.insert(gcnew MyClass("King")); 
    mpets.insert(gcnew MyClass("Buster"));
    mpets.insert(mpets.end(), gcnew MyClass("Zipper"));
    mpets.insert(gcnew MyClass("N"));
    multiset<MyClass^>::iterator New_Puppy = mpets.insert(gcnew MyClass("N"));

    multiset<MyClass^>::pair_iter_iter FindSE = mpets.equal_range(*New_Puppy); 
    for (; FindSE.first != FindSE.second; ++FindSE.first) 
        System::Console::Write("{0} ", FindSE.first->Name); 

    return (0);
}


Erase element from multiset

 
#include "stdafx.h"
#include <cliext/set>
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)
{
    multiset<MyClass^> mpets; 
    mpets.insert(gcnew MyClass("King")); 
    mpets.insert(gcnew MyClass("Buster"));
    mpets.insert(mpets.end(), gcnew MyClass("Zipper"));
    mpets.insert(gcnew MyClass("N"));
    multiset<MyClass^>::iterator New_Puppy = mpets.insert(gcnew MyClass("N"));

  int count = mpets.erase(*New_Puppy);
    System::Console::WriteLine("\n\nErasing {0} New Puppies from container", count);

    return (0);
}


Insert elements (with duplicate) to multiset

 
#include "stdafx.h"
#include <cliext/set>
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)
{
    multiset<MyClass^> mpets; 
    mpets.insert(gcnew MyClass("King")); 
    mpets.insert(gcnew MyClass("Buster"));
    mpets.insert(mpets.end(), gcnew MyClass("Zipper"));
    mpets.insert(gcnew MyClass("N"));
    multiset<MyClass^>::iterator New_Puppy = mpets.insert(gcnew MyClass("N"));

    for each (MyClass^ pet in mpets) 
        System::Console::Write("{0} ", pet->Name); 
    return (0);
}


Insert to multiset

 
#include "stdafx.h"
#include <cliext/set>
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)
{
    multiset<MyClass^> mpets; 
    mpets.insert(gcnew MyClass("A")); 
    mpets.insert(gcnew MyClass("B"));
    mpets.insert(mpets.end(), gcnew MyClass("Z"));
    return (0);
}


Upper/Lower bound of duplicate multiset

 
#include "stdafx.h"
#include <cliext/set>
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)
{
    multiset<MyClass^> mpets; 
    mpets.insert(gcnew MyClass("King")); 
    mpets.insert(gcnew MyClass("Buster"));
    mpets.insert(mpets.end(), gcnew MyClass("Zipper"));
    mpets.insert(gcnew MyClass("N"));
    multiset<MyClass^>::iterator New_Puppy = mpets.insert(gcnew MyClass("N"));
    multiset<MyClass^>::iterator puppiesL = mpets.lower_bound(*New_Puppy);
    multiset<MyClass^>::iterator puppiesU = mpets.upper_bound(*New_Puppy);
    for(; puppiesL != puppiesU; puppiesL++)
        System::Console::Write("{0} ", puppiesL->Name); 

    return (0);
}