C / C++ / MFC

#include <set>
#include <iostream>

using namespace std;

int main()
{
	set<int> set1;

	// insert 10 integers.
	for(int i = 0; i < 10; ++i)
		set1.insert(i);

	cout << "Set contains: ";
	for(set<int>::iterator set_iter = set1.begin(); set_iter != set1.end(); ++set_iter)
		cout << *set_iter << " ";
	cout << endl << endl;

	int value_to_be_searched = 5;
	
	set<int>::iterator si = set1.find(value_to_be_searched);
	if(si != set1.end())
		cout << "Value " << value_to_be_searched << ": found!!" << endl;
	else
		cout << "Value " << value_to_be_searched << ": not found!!" << endl;

	value_to_be_searched = 14;

	si = set1.find(value_to_be_searched);
	if(si != set1.end())
		cout << "Value " << value_to_be_searched << ": found!!" << endl;
	else
		cout << "Value " << value_to_be_searched << ": not found!!" << endl;

	return 0;
}

#include "stdio.h"
#include "windows.h"
#include <vector>
#include <set>
#include <map>
#include <hash_set>
#include <algorithm>

#define ITEM_COUNT 1500000
#define LOOP_COUNT 10

int main (int argc, char* argv[])
{
    int i, j, k;
    DWORD dw;


    std::vector <int> v;
    std::set <int> s;
    std::map <int, int> m;
    std::hash_set <int> h;

    for (i = 0; i < ITEM_COUNT; i++)
    {
        v .push_back (i * 2);
        s .insert (i * 2);
        m [i * 2] = i * 2;
        h .insert (i * 2);
    }
    std::sort (v .begin (), v .end (), std::less<int> ());

    //
    // Vector
    //

    dw = GetTickCount ();
    k = 0;
    for (i = 0; i < LOOP_COUNT; i++)
    {
        for (j = 0; j < ITEM_COUNT * 2; j++)
        {
            //if (std::binary_search (v .begin (), v .end (), j))
            //  k++;
            std::vector <int>::iterator ix = std::lower_bound (v .begin (), v .end (), j);
            if (ix != v .end () && (*ix) == j)
                k++;
        }
    }
    printf ("Vector: %d (%d)\n", GetTickCount () - dw, k);

    //
    // Set
    //

    dw = GetTickCount ();
    k = 0;
    for (i = 0; i < LOOP_COUNT; i++)
    {
        for (j = 0; j < ITEM_COUNT * 2; j++)
        {
            std::set <int>::iterator ix = s .find (j);
            if (ix != s .end ())
                k++;
        }
    }
    printf ("Set: %d (%d)\n", GetTickCount () - dw, k);

    //
    // Map
    //

    dw = GetTickCount ();
    k = 0;
    for (i = 0; i < LOOP_COUNT; i++)
    {
        for (j = 0; j < ITEM_COUNT * 2; j++)
        {
            std::map <int, int>::iterator ix = m .find (j);
            if (ix != m .end ())
                k++;
        }
    }
    printf ("Map: %d (%d)\n", GetTickCount () - dw, k);

    //
    // Hash set
    //

    dw = GetTickCount ();
    k = 0;
    for (i = 0; i < LOOP_COUNT; i++)
    {
        for (j = 0; j < ITEM_COUNT * 2; j++)
        {
            std::hash_set <int>::iterator ix = h .find (j);
            if (ix != h .end ())
                k++;
        }
    }
    printf ("Hash Set: %d (%d)\n", GetTickCount () - dw, k);

    return 0;
}