Re: Sorting a list Structure

From:

Salt_Peter <pj_hern@yahoo.com>

Newsgroups:

comp.lang.c++

Date:

Tue, 28 Oct 2008 07:50:30 -0700 (PDT)

Message-ID:

<4427547c-9a79-4e1f-8ef2-ab6985bf8f8c@z6g2000pre.googlegroups.com>

On Oct 27, 5:19 pm, mrc2...@cox.net (Mike Copeland) wrote:

I'm confused about how to sort a list on an element of the list's
structure. Here is my data definition:

struct Finishes // computed Finish informatio=

{
        long netTime;
        int bibNumber;} fWork;

typedef list<Finishes> FINISHES;
        FINISHES finishInfo;
        list<Finishes>::iterator fIter;

   I have populated the list successfully, and now I want to sort the
list on the netTime element. All examples of the list.sort I've found
work only with scalars or single-element structures. How do I do this
with my data? TIA

Why not use an appropriate container like std::map where netTime is
the key and the integer its values? Elements are then sorted on
insertion using the default comparator less<>.

#include <iostream>
#include <map>

int main()
{
  std::map< long, int > finishes;
  finishes[10L] = 10;
  finishes[3L] = 3;
  finishes[2L] = 2;
  finishes[4L] = 4;
  finishes[1L] = 1;
  finishes.insert( std::pair< long, int >(9L, 9) );

  typedef std::map< long, int >::iterator MIter;
  for( MIter miter = finishes.begin();
       miter != finishes.end();
       ++miter )
  {
    std::cout << (*miter).first;
    std::cout << "\t";
    std::cout << (*miter).second << std::endl;
  }

  std::cout << "press Enter to EXIT\n";
  std::cin.get();
}

/*
1 1
2 2
3 3
4 4
9 9
10 10
*/