From -5895291981734294256
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: f78e5,ba96c237e128ed5a,start
X-Google-Attributes: gidf78e5,public
From: Don Montgomery <montgo@utdallas.edu>
Subject: STL priority queue search
Date: 1998/07/03
Message-ID: <6nirma$dng$2@news.utdallas.edu>#1/1
X-Deja-AN: 368427287
Approved: stephen.clamage@sun.com (comp.std.c++)
Originator: clamage@taumet
X-NNTP-Posting-Host: apache.utdallas.edu
Organization: The University of Texas at Dallas
User-Agent: tin/pre-1.4-980514 (UNIX) (SunOS/5.6 (sun4u))
Newsgroups: comp.std.c++


Hi, does anyone know the (a) good way to do a linear 
(or, for that matter, a random access) search on PQs
in STL?

Thanks,

-- 
Don

Don Montgomery
Advanced Communications Technology (ACT) Laboratory
University of Texas at Dallas
montgo@utdallas.edu


[ comp.std.c++ is moderated.  To submit articles, try just posting with ]
[ your news-reader.  If that fails, use mailto:std-c++@ncar.ucar.edu    ]
[              --- Please see the FAQ before posting. ---               ]
[ FAQ: http://reality.sgi.com/austern_mti/std-c++/faq.html              ]