summaryrefslogtreecommitdiffstats
path: root/src/usr/testcore/lib/stltest.H
Commit message (Collapse)AuthorAgeFilesLines
* Enhanced STL capabilities.Patrick Williams2012-05-211-0/+124
| | | | | | | | | | | | | | | | | | | - max_element - for_each - remove / remove_if - unique - sort - mem_fun / mem_fun_ref - bind1st / bind2nd RTC: 41636 Change-Id: Icf15ef90562ed20097306a15f4a314e05511b199 Reviewed-on: http://gfw160.austin.ibm.com:8080/gerrit/1068 Tested-by: Jenkins Server Reviewed-by: Douglas R. Gilbert <dgilbert@us.ibm.com> Reviewed-by: Bradley W. Bishop <bradleyb@us.ibm.com> Reviewed-by: Terry J. Opie <opiet@us.ibm.com> Reviewed-by: A. Patrick Williams III <iawillia@us.ibm.com>
* Segfault in map when removing root-node.Patrick Williams2012-05-101-0/+12
| | | | | | | | | Change-Id: I0ed81f62d00c771ffb7d3fc98745ea47bd51f90f Reviewed-on: http://gfw160.austin.ibm.com:8080/gerrit/1043 Tested-by: Jenkins Server Reviewed-by: Van H. Lee <vanlee@us.ibm.com> Reviewed-by: Douglas R. Gilbert <dgilbert@us.ibm.com> Reviewed-by: A. Patrick Williams III <iawillia@us.ibm.com>
* Fix broken map::operator[].Patrick Williams2012-04-051-0/+6
| | | | | | | | | | | | | | | | According to the STL documentation, 'insert' should do nothing if attempting to insert an item that already exists. This allows [] to be implemented as a form of insert(pair(key, data_T())). Our insert was actually updating the data portion of the map, which was causing operator[] to always erase the data portion of any lookup. Change-Id: I5b2ae1934dbd81d71df4b56d83e2f04f53f0e525 Reviewed-on: http://gfw160.austin.ibm.com:8080/gerrit/825 Tested-by: Jenkins Server Reviewed-by: Douglas R. Gilbert <dgilbert@us.ibm.com> Reviewed-by: Bradley W. Bishop <bradleyb@us.ibm.com> Reviewed-by: A. Patrick Williams III <iawillia@us.ibm.com>
* Improve std::map by using a SplayTree container.Patrick Williams2012-03-291-0/+37
| | | | | | | | | | | | | | | | | Originally std::map was implemented as a linked list. Some of the maps in PORE and PRD code will be big enough that this is very inefficient. Converted std::map to a binary search tree implementation based on the Splay-Tree algorithm. RTC: 34071 Change-Id: If77c017f5d95920f8010991e7f087cbe571ca2e9 Reviewed-on: http://gfw160.austin.ibm.com:8080/gerrit/790 Tested-by: Jenkins Server Reviewed-by: MIKE J. JONES <mjjones@us.ibm.com> Reviewed-by: Douglas R. Gilbert <dgilbert@us.ibm.com> Reviewed-by: Bradley W. Bishop <bradleyb@us.ibm.com> Reviewed-by: A. Patrick Williams III <iawillia@us.ibm.com>
* Add return of an iterator to the vector erase function to match the stl ↵Doug Gilbert2012-03-061-0/+33
| | | | | | | | | | | standard. Change-Id: I383a147976bb6203f6426c22279f9ad6dc80b46e RTC: 37922 Reviewed-on: http://gfw160.austin.ibm.com:8080/gerrit/722 Tested-by: Jenkins Server Reviewed-by: A. Patrick Williams III <iawillia@us.ibm.com> Reviewed-by: Bradley W. Bishop <bradleyb@us.ibm.com>
* STL advance / distance.Patrick Williams2012-02-221-0/+94
| | | | | | | | | | Change-Id: I9cdf9459f2970def812b1681897fe7d0cdda37ac Reviewed-on: http://gfw160.austin.ibm.com:8080/gerrit/669 Tested-by: Jenkins Server Reviewed-by: Douglas R. Gilbert <dgilbert@us.ibm.com> Reviewed-by: Terry J. Opie <opiet@us.ibm.com> Reviewed-by: MIKE J. JONES <mjjones@us.ibm.com> Reviewed-by: A. Patrick Williams III <iawillia@us.ibm.com>
* STL map support based on STL listDoug Gilbert2011-10-261-0/+171
Change-Id: Ifd693b0911b0f76114564920dbb86f1cefa6f838 Reviewed-on: http://gfw160.austin.ibm.com:8080/gerrit/450 Reviewed-by: A. Patrick Williams III <iawillia@us.ibm.com> Tested-by: Jenkins Server
OpenPOWER on IntegriCloud