Index: [thread] [date] [subject] [author]
  From: Luke Palmer <lop@duke.edu>
  To  : 
  Date: Sat, 13 Feb 1999 15:26:10 -0500

using sort....

part of my program uses a vector of slists of pointers to appointments to
hold the schedule for an entire week (each slist represents a day, and can
hold a variable number of appointments).  i want to use the sort member
function built into slist to get all the appointments in order, but i am
guessing that it will just sort the pointer values.  assuming i have written
comparison operators for my appointment class, how can i get sort to look at
what the pointers represent, rather than the pointer values themselves?
using appointments instead of pointers to appointments would solve the
problem, but waste a lot of memory because of all the copies that have to be
made at different points in the program.  any ideas?  thanks.
-luke




Index: [thread] [date] [subject] [author]