ATL / WTL / STL

Removes duplicate elements that are adjacent to each other in a specified range.

#include <set>
#include <vector>
#include <iostream>
#include <iterator>

struct Finder : std::unary_function<bool, int>
{
  Finder(std::set<int>& s) : s_(s) {}
  bool operator()(int i) const
  { 
    if (s_.count(i)==0)
    {
      s_.insert(i);
      return false;
    }
    else
    {
      return true;
    }
  }
  std::set<int>& s_;
};

int main(int, char**)
{
  std::vector<int> data;
  data.push_back(1);
  data.push_back(3);
  data.push_back(2);
  data.push_back(1);
  data.push_back(5);
  data.push_back(1);

  // Show the vector
  std::copy(data.begin(), data.end(), std::ostream_iterator<int>(std::cout, ", ")); std::cout << std::endl;
  
  // Use Finder and a set to remove items if we've seen them before in the vector
  std::set<int> uniqueItems;
  data.erase(std::remove_if(data.begin(), data.end(), Finder(uniqueItems)), data.end());

  // Show the vector with duplicates removed
  std::copy(data.begin(), data.end(), std::ostream_iterator<int>(std::cout, ", ")); std::cout << std::endl;
  return 0;
}

Stuart Dootson wrote:

struct Finder : std::unary_function<bool, int>

struct Finder : std::unary_function<int, bool>

// TEMPLATE STRUCT unary_function
template<class _A, class _R>
	struct unary_function {
	typedef _A argument_type;
	typedef _R result_type;
	};

// VanillaConsole.cpp : Defines the entry point for the console application.
//
 
#include "stdafx.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
 
void main()
{
	using namespace std;
 
	// Create a vector and fill it with data.
	typedef vector<int> data_t;
	data_t data;
	data.push_back(1);
	data.push_back(3);
	data.push_back(2);
	data.push_back(1);
	data.push_back(5);
	data.push_back(1);
 
	// Show the user the contents before messing with it.
	cout << "Contents before:" << endl;
	copy(data.begin(), data.end(), ostream_iterator<int>(cout, " "));
	cout << endl << endl;
 
	// Remove the duplicates.
	sort(data.begin(), data.end());
	data_t::iterator new_end = unique(data.begin(), data.end());
 
	// Show the user the contents with duplicates removed (and sorted).
	cout < "Contents after:" < endl;
	copy(data.begin(), new_end, ostream_iterator<int>(cout, " "));
	cout << endl << endl;
}

If the order of elements is unimportant, sort the vector (with std::sort) before using unique.

#include <map>
class MyObject
{
...
   int UniqueID() const;
...
};
std::map<int, MyObject> myMap;

To insert an item:
   MyObject o;
   myMap.insert(std::make_pair(o.UniqueID(), o));
To retrieve an item:
  MyObject anotherO = myMap[someID];

1. Use GetPrivateProfileIntA, which is the the ASCII version of GetPrivateProfileInt.
2. If the string is a literal, pass it as L"string-literal" rather than "string-literal"
3. Convert the char buffer(s) to wchar_t before passing into GetPrivateProfileInt:

<div style="margin-left: 80px;"><code>char charBuffer[260];
wchar_t wcharBuffer[260];
mbtowc(wcharBuffer, charBuffer, 260);</code></div>