List « Data Structure « C++

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.  Queue Stack 17.  Set Multiset 18.  STL Algorithms Binary search 19.  STL Algorithms Heap 20.  STL Algorithms Helper 21.  STL Algorithms Iterator 22.  STL Algorithms Merge 23.  STL Algorithms Min Max 24.  STL Algorithms Modifying sequence operations 25.  STL Algorithms Non modifying sequence operations 26.  STL Algorithms Sorting 27.  STL Basics 28.  String 29.  Valarray 30.  Vector Java Java Tutorial Java Source Code / Java Documentation Java Open Source Jar File Download Java Articles Java Products Java by API Photoshop Tutorials Maya Tutorials Flash Tutorials 3ds-Max Tutorials Illustrator Tutorials GIMP Tutorials C# / C Sharp C# / CSharp Tutorial C# / CSharp Open Source ASP.Net ASP.NET Tutorial JavaScript DHTML JavaScript Tutorial JavaScript Reference HTML / CSS HTML CSS Reference C / ANSI-C C Tutorial C++ Tutorial Ruby PHP Python Python Tutorial Python Open Source SQL Server / T-SQL SQL Server / T-SQL Tutorial Oracle PL / SQL Oracle PL/SQL Tutorial PostgreSQL SQL / MySQL MySQL Tutorial VB.Net VB.Net Tutorial Flash / Flex / ActionScript VBA / Excel / Access / Word XML XML Tutorial Microsoft Office PowerPoint 2007 Tutorial Microsoft Office Excel 2007 Tutorial Microsoft Office Word 2007 Tutorial

C++ » Data Structure » List Screenshots  1.  List basics: push, begin, end pop 2.  Elements can be put on the front or end of a list. 3.  Define class and store in a list 4.  An example of the transform algorithm. 5.  Demonstrate merge() in list 6.  Merging won't work if the lists aren't ordered. 7.  Merge into descending order. 8.  A list splicing example. 9.  Demonstrate remove() in list 10.  Demonstrate unique() in list 11.  Using reverse() to create a palindrome tester. 12.  Using a list to store mailing addresses. 13.  Use ostream_iterator for string 14.  Demonstrate advance() and distance() in list 15.  Using an arrays as a container 16.  Using a list: push_back, begin, end, size 17.  Merge and splice lists. 18.  Copy a list to a vector. 19.  Push value in the list 20.  Use a binary function object in list 'transform' 21.  end() in list. 22.  The difference between push_back() and push_front(). 23.  Sort a list. 24.  Merge two lists. 25.  Store class objects in a list. 26.  Transform algorithm based on list. 27.  Demonstrate bind2nd(). 28.  Create a reciprocal function object. 29.  Understanding end() in List 30.  Difference between push_back() and push_front() 31.  Merging One List with Another 32.  Storing Class Objects in a List 33.  Traverse a List Using an Iterator 34.  Demonstrate virtual functons: list interface