в 14:21, 25 мая 2010

2010-05-25T14:21:17Z

Admin: 1 версия: Импорт контента...

2010-05-25T10:29:32Z

1 версия: Импорт контента...

Новая страница

==Add some data by push_front==

<source lang="cpp">#include <list>
#include <iostream>
using namespace std;
typedef list<int> LISTINT;
int main(void)
{
LISTINT listOne;
LISTINT listAnother;
LISTINT::iterator i;
listOne.push_front (2);
listOne.push_front (1);
listOne.push_back (3);
listAnother.push_front(4);
listAnother.assign(listOne.begin(), listOne.end());
for (i = listAnother.begin(); i != listAnother.end(); ++i)
cout << *i << endl;
listAnother.assign(4, 1);
}</source>

==Demonstrating the difference between push_back() and push_front()==

<source lang="cpp">#include <iostream>
#include <list>
using namespace std;
int main()
{
list<int> lst1, lst2;
int i;
for(i=0; i<10; i++) lst1.push_back(i);
for(i=0; i<10; i++) lst2.push_front(i);

list<int>::iterator p;

cout << "Contents of lst1:\n";
p = lst1.begin();
while(p != lst1.end()) {
cout << *p << " ";
p++;
}
cout << "\n\n";
cout << "Contents of lst2:\n";
p = lst2.begin();
while(p != lst2.end()) {
cout << *p << " ";
p++;
}

return 0;
}</source>
<pre class=codeResult>Contents of lst1:
0 1 2 3 4 5 6 7 8 9
Contents of lst2:
9 8 7 6 5 4 3 2 1 0</pre>

==difference between push_back() and push_front()==

<source lang="cpp">#include <iostream>
#include <list>
using namespace std;

int main()
{
list<int> lst1, lst2;
int i;

for(i=0; i<10; i++) lst1.push_back(i);
for(i=0; i<10; i++) lst2.push_front(i);

list<int>::iterator p;

p = lst1.begin();
while(p != lst1.end()) {
cout << *p << " ";
p++;
}

p = lst2.begin();
while(p != lst2.end()) {
cout << *p << " ";
p++;
}

return 0;
}</source>

==list.pop_back(): remove element from back==

<source lang="cpp">#include <iostream>
using std::cout;
using std::endl;
#include <list> // list class-template definition
#include <algorithm> // copy algorithm
#include <iterator> // ostream_iterator
int main()
{
int array[ 4 ] = { 2, 6, 4, 8 };
std::list< int > values; // create list of ints
std::list< int > otherValues; // create list of ints
std::ostream_iterator< int > output( cout, " " );
// insert items in values
values.push_front( 1 );
values.push_front( 3 );
values.push_back( 4 );
values.push_back( 2 );
cout << "values contains: ";
std::copy( values.begin(), values.end(), output );
values.pop_back();// remove element from back
cout << "\n\nvalues contains: ";
std::copy( values.begin(), values.end(), output );
cout << endl;
return 0;
}</source>
<pre class=codeResult>values contains: 3 1 4 2
values contains: 3 1 4</pre>

==list.pop_front(): remove element from front==

<source lang="cpp">#include <iostream>
using std::cout;
using std::endl;
#include <list> // list class-template definition
#include <algorithm> // copy algorithm
#include <iterator> // ostream_iterator
int main()
{
int array[ 4 ] = { 2, 6, 4, 8 };
std::list< int > values; // create list of ints
std::list< int > otherValues; // create list of ints
std::ostream_iterator< int > output( cout, " " );
// insert items in values
values.push_front( 1 );
values.push_front( 3 );
values.push_back( 4 );
values.push_back( 2 );
cout << "values contains: ";
std::copy( values.begin(), values.end(), output );
values.pop_front(); // remove element from front
cout << "\n\nvalues contains: ";
std::copy( values.begin(), values.end(), output );
cout << endl;
return 0;
}</source>
<pre class=codeResult>values contains: 3 1 4 2
values contains: 1 4 2</pre>

==list: push_back and push_front==

<source lang="cpp">/* The following code example is taken from the book
* "The C++ Standard Library - A Tutorial and Reference"
* by Nicolai M. Josuttis, Addison-Wesley, 1999
*
* (C) Copyright Nicolai M. Josuttis 1999.
* Permission to copy, use, modify, sell and distribute this software
* is granted provided this copyright notice appears in all copies.
* This software is provided "as is" without express or implied
* warranty, and with no claim as to its suitability for any purpose.
*/
#include <iostream>
#include <list>
#include <algorithm>
#include <iterator>
using namespace std;
void printLists (const list<int>& l1, const list<int>& l2)
{
cout << "list1: ";
copy (l1.begin(), l1.end(), ostream_iterator<int>(cout," "));
cout << endl << "list2: ";
copy (l2.begin(), l2.end(), ostream_iterator<int>(cout," "));
cout << endl << endl;
}
int main()
{
// create two empty lists
list<int> list1, list2;
// fill both lists with elements
for (int i=0; i<6; ++i) {
list1.push_back(i);
list2.push_front(i);
}
printLists(list1, list2);
}</source>
<pre class=codeResult>list1: 0 1 2 3 4 5
list2: 5 4 3 2 1 0</pre>

==list: push_back, front, empty and pop_front==

<source lang="cpp">/* The following code example is taken from the book
* "The C++ Standard Library - A Tutorial and Reference"
* by Nicolai M. Josuttis, Addison-Wesley, 1999
*
* (C) Copyright Nicolai M. Josuttis 1999.
* Permission to copy, use, modify, sell and distribute this software
* is granted provided this copyright notice appears in all copies.
* This software is provided "as is" without express or implied
* warranty, and with no claim as to its suitability for any purpose.
*/
#include <iostream>
#include <list>
using namespace std;
int main()
{
list<char> coll; // list container for character elements
// append elements from "a" to "z"
for (char c="a"; c<="z"; ++c) {
coll.push_back(c);
}
/* print all elements
* - while there are elements
* - print and remove the first element
*/
while (! coll.empty()) {
cout << coll.front() << " ";
coll.pop_front();
}
cout << endl;
}</source>
<pre class=codeResult>a b c d e f g h i j k l m n o p q r s t u v w x y z</pre>

← Предыдущая	Версия 14:21, 25 мая 2010
(нет различий)

C++ Tutorial/list/list push pop - История изменений

в 14:21, 25 мая 2010

Admin: 1 версия: Импорт контента...