![]() |
C++ World |
C++ Resources, Tips, Documentation, Examples, HOWTO's, FAQ's, Tools Libraries, Frameworks, IDE's © 2005,2009 C++ World - All rights reserved - webdesign.arttina |
|---|
| C++, Sockets, SysProg, Libraries, Examples, Tools, Compilers, IDE, STL, XML |
|
| FAQ | Sockets | Socket Library | Software Engineering | Sysprog | Examples | Books |
|---|
| Home |
|---|
| C++ |
| The C Language |
| STL |
| BOOST |
| GNU |
| GNU C Compiler |
| GNU Debugger |
| GNU Profiler |
| HP C++ Compiler |
| DDD |
| Eclipse |
| Curses |
| XML |
| X11 |
| KDevelop |
| MS Visual Studio |
| Tutorials |
// *************************************************
// File: list1.cpp
// Author: franzbrandel@cplusplusworld.com
// (c) 2009 C++ World
// http://www.cplusplusworld.com/
// simple example
// *************************************************
#include <iostream>
#include <list>
#include <vector>
#include <string>
// This example shows how easy lists can be filled
// and emptied again.
int main(int argc, char *argv[]) {
std::list<std::string> l;
std::vector<std::string> v;
v.push_back("first");
v.push_back("second");
v.push_back("third");
// List elements are added to the end
for ( int i = 0; i < 10 ; ++i ) {
l.push_back( v[ i % 3 ] );
}
// first list element ist printed
// and the delete from the list
while (! l.empty()) {
std::cout << l.front() << '\n';
l.pop_front();
}
return 0;
}
| Franz Brandel | Contact | Legal Statement | Sitemap | C++ World |