Using a list to store mailing addresses.

#include <iostream>
#include <list>
#include <string>
using namespace std;

class Address {
  string name;
  string street;
  string city;
  string state;
  string zip;
public:
  Address() {
    name = street = city = state = zip = "";
  }
  Address(string n, string s, string c, string st, string z) {
    name = n;
    street = s;
    city = c;
    state = st;
    zip = z;
  }

  string getname() { 
     return name; 
  }
  string getcity() { 
     return city; 
  }
  string getstreet() { 
     return street; 
  }
  string getstate() { 
     return state; 
  }
  string getzip() { 
     return zip; 
  }
};

// List sorted by name.
bool operator<(Address &a, Address &b)
{
  return a.getname() < b.getname();
}

// List searched by name.
bool operator==(Address &a, Address &b)
{
  return a.getname() == b.getname();
}


void display(list<Address> &listObject) {
  list<Address>::iterator p;

  for(p = listObject.begin(); p != listObject.end(); p++) {
    cout << p->getname() << ": ";
    cout << p->getstreet() << ", ";
    cout << p->getcity() << ", ";
    cout << p->getstate() << " ";
    cout << p->getzip() << endl;
  }
}

int main()
{
  list<Address> mlistObjectA, mlistObjectB;

  mlistObjectA.push_back(Address("J", "1102 St", "Mission", "TX", "78572")); 

  mlistObjectA.sort();
  mlistObjectB.sort();

  // merge mailings lists
  mlistObjectA.merge(mlistObjectB);
  cout << "List A after sorting and merging.\n";
  display(mlistObjectA);
  cout << "List A now has " << mlistObjectA.size();
  cout << " entries.\n";

  // remove duplicates
  mlistObjectA.unique();
  cout << "List A after removing duplicates.\n";
  display(mlistObjectA);
  cout << "List A now has " << mlistObjectA.size();
  cout << " entries.\n";

  return 0;
}

Related examples in the same category

1.	List basics: push, begin, end pop
2.	Elements can be put on the front or end of a list.
3.	Define class and store in a list
4.	An example of the transform algorithm.
5.	Demonstrate merge() in list
6.	Merging won't work if the lists aren't ordered.
7.	Merge into descending order.
8.	A list splicing example.
9.	Demonstrate remove() in list
10.	Demonstrate unique() in list
11.	Using reverse() to create a palindrome tester.
12.	Use ostream_iterator for string
13.	Demonstrate advance() and distance() in list
14.	Using an arrays as a container
15.	Using a list: push_back, begin, end, size
16.	Merge and splice lists.
17.	Copy a list to a vector.
18.	Push value in the list
19.	Use a binary function object in list 'transform'
20.	end() in list.
21.	The difference between push_back() and push_front().
22.	Sort a list.
23.	Merge two lists.
24.	Store class objects in a list.
25.	Transform algorithm based on list.
26.	Demonstrate bind2nd().
27.	Create a reciprocal function object.
28.	Understanding end() in List
29.	Difference between push_back() and push_front()
30.	Merging One List with Another
31.	Storing Class Objects in a List
32.	Traverse a List Using an Iterator
33.	Demonstrate virtual functons: list interface

Using a list to store mailing addresses. : List « Data Structure « C++

Related examples in the same category