find function returns set::iterator : set « 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 » set 
find function returns set::iterator
 
#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->Name0);
    }
    bool operator==(const MyClass^ rhs){
        return (Name->Equals(rhs->Name));
    }
};

int main(array<System::String ^> ^args)
{
    set<MyClass^> pets; 
    MyClass^ King = gcnew MyClass("K");

    pets.insert(pets.end(), gcnew MyClass("A"));
    pets.insert(King)
    pets.insert(gcnew MyClass("B"));
    

    set<MyClass^>::iterator Lady = pets.find(gcnew MyClass("L"));
    Console::WriteLine(Lady == pets.end());
    return (0);
}

   
  
Related examples in the same category
1.Adding element to a set
2.Inserting duplicate elements to set
3.Display set with for loop using reverse_iterator
4.Insert and erase element from a set
5.Find element in a set
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.