Storing class objects in a priority_queue. : Priority Queue « Data Structure « C++

Home
C++
1.Bitset
2.Class
3.Console
4.Data Structure
5.Data Type
6.Deque
7.Development
8.File
9.Function
10.Generic
11.Language
12.List
13.Map Multimap
14.Overload
15.Pointer
16.Qt
17.Queue Stack
18.Set Multiset
19.STL Algorithms Binary search
20.STL Algorithms Heap
21.STL Algorithms Helper
22.STL Algorithms Iterator
23.STL Algorithms Merge
24.STL Algorithms Min Max
25.STL Algorithms Modifying sequence operations
26.STL Algorithms Non modifying sequence operations
27.STL Algorithms Sorting
28.STL Basics
29.String
30.Valarray
31.Vector
C / ANSI-C
C Tutorial
C++ Tutorial
Visual C++ .NET
C++ » Data Structure » Priority QueueScreenshots 
Storing class objects in a priority_queue.
Storing class objects in a priority_queue.

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

class Thread {
  int priority;
  string name;
public:
  Thread() { 
     name = ""
     priority = 0
  }
  Thread(string n, int p) { 
     name = n; 
     priority = p; 
  }

  string getname() const 
     return name; 
  }
  int getpriority() const 
     return priority; 
  }
};

// Determine priority.
bool operator<(const Thread &a, const Thread &b)
{
  return a.getpriority() < b.getpriority();
}

int main()
{
  priority_queue<Thread> q;
  
  q.push(Thread("F"10));
  q.push(Thread("M"2));

  // show priority
  cout << "Priorities: "
  while(!q.empty()) {
    cout << q.top().getname() << endl;
    cout << "            ";
    q.pop();
  }

  return 0;
}


           
       
Related examples in the same category
1.Demonstrate a priority_queue.Demonstrate a priority_queue.
2.Using a different comparison function: greaterUsing a different comparison function: greater
3.PriorityQueue: push, pop and topPriorityQueue: push, pop and top
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.