Store class objects in a list.


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

class myclass {
  int a, b;
  int sum;
public:
  myclass() { 
     a = b = 0; 
  }
  myclass(int i, int j) {
    a = i;
    b = j;
    sum = a + b;
  }
  int getsum() { 
     return sum; 
  }

  friend bool operator<(const myclass &object1, const myclass &object2);
  friend bool operator>(const myclass &object1, const myclass &object2);
  friend bool operator==(const myclass &object1, const myclass &object2);
  friend bool operator!=(const myclass &object1, const myclass &object2);
};

bool operator<(const myclass &object1, const myclass &object2)
{
  return object1.sum < object2.sum;
}

bool operator>(const myclass &object1, const myclass &object2)
{
  return object1.sum > object2.sum;
}

bool operator==(const myclass &object1, const myclass &object2)
{
  return object1.sum == object2.sum;
}

bool operator!=(const myclass &object1, const myclass &object2)
{
  return object1.sum != object2.sum;
}

int main()
{
  int i;

  list<myclass> listObject1;
  for(i = 0; i < 10; i++) 
     listObject1.push_back(myclass(i, i));

  cout << "First list: ";
  list<myclass>::iterator p = listObject1.begin();
  while(p != listObject1.end()) {
    cout << p->getsum() << " ";
    p++;
  }
  cout << endl;

  list<myclass> listObject2;
  for(i = 0; i < 10; i++) 
     listObject2.push_back(myclass(i*2, i*3));

  cout << "Second list: ";
  p = listObject2.begin();
  while(p != listObject2.end()) {
    cout << p->getsum() << " ";
    p++;
  }
  cout << endl;

  
  listObject1.merge(listObject2);

  
  cout << "Merged list: ";
  p = listObject1.begin();
  while(p != listObject1.end()) {
    cout << p->getsum() << " ";
    p++;
  }

  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.	Using a list to store mailing addresses.
13.	Use ostream_iterator for string
14.	Demonstrate advance() and distance() in list
15.	Using an arrays as a container
16.	Using a list: push_back, begin, end, size
17.	Merge and splice lists.
18.	Copy a list to a vector.
19.	Push value in the list
20.	Use a binary function object in list 'transform'
21.	end() in list.
22.	The difference between push_back() and push_front().
23.	Sort a list.
24.	Merge two lists.
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

Store class objects in a list. : List « Data Structure « C++

Related examples in the same category