c projects for engineering students

With the running success in the C project development, we have developed a range of new projects in C/UNIX or C/Windows. For the B.tech perusing students we have special projects which are especially designed based on their curriculum. 

With the recent few years due to project concept leak we are not presenting a list of the project topic and details. This can only be provided based on your request. Please drop us an email with your requirement we will provide the list of the projects which will best suit according to you need. 

In case you need a live demo and chat with the executive please get the details from the below link.

Project Home Page : click me

Contact Details : click me

Note:

All the projects that we are developing and providing are new and are developed in ccplusplus development labs only.

c projects for btech students

With the running success in the C project development, we have developed a range of new projects in C/UNIX or C/Windows. For the B.tech perusing students we have special projects which are especially designed based on their curriculum. 

With the recent few years due to project concept leak we are not presenting a list of the project topic and details. This can only be provided based on your request. Please drop us an email with your requirement we will provide the list of the projects which will best suit according to you need. 

In case you need a live demo and chat with the executive please get the details from the below link.

Project Home Page : click me

Contact Details : click me

Note:

All the projects that we are developing and providing are new and are developed in ccplusplus development labs only.

new projects in c

With the running success in the C project development, we have developed a range of new projects in C/UNIX or C/Windows.

With the recent few years due to project concept leak we are not presenting a list of the project topic and details. This can only be provided based on your request. Please drop us an email with your requirement we will provide the list of the projects which will best suit according to you need. 

In case you need a live demo and chat with the executive please get the details from the below link.

Project Home Page : click me

Contact Details : click me

Note:

All the projects that we are developing and providing are new and are developed in ccplusplus development labs only.

c language training center in gurgaon

We provide the C training in Gurgaon and NCR region. Our Gurgaon based development center is providing the e Learning courses for C with preferred windows/Linux support platform. This is complete online based course best suited for the students/professional who wants to save their time and are willing to learn C++ parallel to their current profession, You can see the course details and the contact details at the below link,

Course Details : click me

Contact Details : click me

The listed course details are totally flexible and can be made according to you. Please contact at the above details to get a brief information.

c++ training in gurgaon

We provide the C++ training in Gurgaon and NCR region. Our Gurgaon based development center is providing the e Learning courses for C/C++ with preferred windows/Linux support platform. This is complete online based course best suited for the students/professional who wants to save their time and are willing to learn C++ parallel to their current profession, You can see the course details and the contact details at the below link,

Course Details : click me

Contact Details : click me

The listed course details are totally flexible and can be made according to you. Please contact at the above details to get a brief information.

c++ training in ghaziabad

We provide the C++ training in Ghaziabad and NCR region. Our Gurgaon based development center is providing the e Learning courses for C/C++ with preferred windows/Linux support platform. This is complete online based course best suited for the students/professional who wants to save their time and are willing to learn C++ parallel to their current profession, You can see the course details and the contact details at the below link,

Course Details : click me

Contact Details : click me

The listed course details are totally flexible and can be made according to you. Please contact at the above details to get a brief information.

c++ training in delhi

We provide the C++ training in New Delhi and NCR region. Our Gurgaon based development center is providing the e Learning courses for C/C++ with preferred windows/Linux support platform. This is complete online based course best suited for the students/professional who wants to save their time and are willing to learn C++ parallel to their current profession, You can see the course details and the contact details at the below link,

Course Details : click me

Contact Details : click me

The listed course details are totally flexible and can be made according to you. Please contact at the above details to get a brief information.

advantage of stl list

The internal structure of a list is totally different from a vector or a deque. Thus, a list differs in several major ways compared with vectors and deques:

• A list does not provide random access. For example, to access the fifth element, you must navigate the first four elements following the chain of links. Thus, accessing an arbitrary element using a list is slow. 
• Inserting and removing elements is fast at each position, and not only at one or both ends. You can always insert and delete an element in constant time because no other elements have to be moved. Internally, only some pointer values are manipulated. 
• Inserting and deleting elements does not invalidate pointers, references, and iterators to other elements. 
• A list supports exception handling in such a way that almost every operation succeeds or is a no-op. Thus, you can't get into an intermediate state in which only half of the operation is complete.

The member functions provided for lists reflect these differences compared with vectors and deques as follows:

• Lists provide neither a subscript operator nor at() because no random access is provided. 
• Lists don't provide operations for capacity or reallocation because neither is needed. Each element has its own memory that stays valid until the element is deleted. 
• Lists provide many special member functions for moving elements. These member functions are faster versions of general algorithms that have the same names. They are faster because they only redirect pointers rather than copy and move the values.

See Also:

Standard Template Library Tutorial and Sample Codes

  

difference between stl list and deque

The internal structure of a list is totally different from a vector or a deque. Thus, a list differs in several major ways compared with vectors and deques:

• A list does not provide random access. For example, to access the fifth element, you must navigate the first four elements following the chain of links. Thus, accessing an arbitrary element using a list is slow. 
• Inserting and removing elements is fast at each position, and not only at one or both ends. You can always insert and delete an element in constant time because no other elements have to be moved. Internally, only some pointer values are manipulated. 
• Inserting and deleting elements does not invalidate pointers, references, and iterators to other elements. 
• A list supports exception handling in such a way that almost every operation succeeds or is a no-op. Thus, you can't get into an intermediate state in which only half of the operation is complete.

The member functions provided for lists reflect these differences compared with vectors and deques as follows:

• Lists provide neither a subscript operator nor at() because no random access is provided. 
• Lists don't provide operations for capacity or reallocation because neither is needed. Each element has its own memory that stays valid until the element is deleted. 
• Lists provide many special member functions for moving elements. These member functions are faster versions of general algorithms that have the same names. They are faster because they only redirect pointers rather than copy and move the values.

See Also:

Standard Template Library Tutorial and Sample Codes

  

difference between stl list and vector

The internal structure of a list is totally different from a vector or a deque. Thus, a list differs in several major ways compared with vectors and deques:

• A list does not provide random access. For example, to access the fifth element, you must navigate the first four elements following the chain of links. Thus, accessing an arbitrary element using a list is slow. 
• Inserting and removing elements is fast at each position, and not only at one or both ends. You can always insert and delete an element in constant time because no other elements have to be moved. Internally, only some pointer values are manipulated. 
• Inserting and deleting elements does not invalidate pointers, references, and iterators to other elements. 
• A list supports exception handling in such a way that almost every operation succeeds or is a no-op. Thus, you can't get into an intermediate state in which only half of the operation is complete.

The member functions provided for lists reflect these differences compared with vectors and deques as follows:

• Lists provide neither a subscript operator nor at() because no random access is provided. 
• Lists don't provide operations for capacity or reallocation because neither is needed. Each element has its own memory that stays valid until the element is deleted. 
• Lists provide many special member functions for moving elements. These member functions are faster versions of general algorithms that have the same names. They are faster because they only redirect pointers rather than copy and move the values.

See Also:

Standard Template Library Tutorial and Sample Codes

  

online course for c programming

We have a well designed course for C programming. This is much better for the students and professionals who are planning to work in C language. 

Please contact the below address for getting more information.

elearning@ccplusplus.com

c++ course for c programmers

C programmers can learn the C++ very easily with our special designed courses with a comparison based study in C and C++. This is much good for professional and students who are good in C. For more details,

Please click this link

c++ course for class 11

We have special courses for class 11th students which is designed with well suited and clear examples. For getting more details

Please click this link

deque stl

A deque (pronounced "deck") is very similar to a vector. It manages its elements with a dynamic array, provides random access, and has almost the same interface as a vector. The difference is that with a deque the dynamic array is open at both ends. Thus, a deque is fast for insertions and deletions at both the end and the beginning (Figure below).

Figure a: Logical Structure of a Deque

To provide this ability, the deque is implemented typically as a bunch of individual blocks, with the first block growing in one direction and the last block growing in the opposite direction (Figure b).

Figure b: Internal Structure of a Deque

To use a deque, you must include the header file <deque>:

Note: In the original STL, the header file for deques was <deque.h>.

#include <deque>

There, the type is defined as a template class inside namespace std:

namespace std {

   template <class T,

   class Allocator = allocator<T> >

   class deque;

}

As with vectors, the type of the elements is passed as a first template parameter and may be of any type that is assignable and copyable. The optional second template argument is the memory model, with allocator as the default.

Note: In systems without support for default template parameters, the second argument is typically missing.

We will be covering the following under the deque:

1. Abilities of Deque
2. Deque Operations
3. Examples of Using Deques

See Also:

Standard Template Library Tutorial and Sample Codes

deque pop_front example

/******************************************************************* * File : deque-example.cpp * Author : Team ccplusplus * Description : deque pop_front example * Date : PM 09:28 10 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <deque> #include <string> #include <algorithm> using namespace std; int main() { //create empty deque of strings deque<string> coll; //insert several elements coll.assign (3, string("string")); coll.push_back ("last string"); coll.push_front ("first string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); cout << endl; //remove first and last element coll.pop_front(); coll.pop_back(); //insert ''another'' into every element but the first for (int i=1; i<coll.size(); ++i) { coll[i] = "another " + coll [i]; } //change size to four elements coll.resize (4, "resized string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); return 0; } /* * OUTPUT * [blog@ccplusplus deque]$ c++ deque-example.cpp -o deque-example [blog@ccplusplus deque]$ ./deque-example first string string string string last string string another string another string resized string [blog@ccplusplus deque]$ */

deque pop_front example

/******************************************************************* * File : deque-example.cpp * Author : Team ccplusplus * Description : deque pop_front example * Date : PM 09:28 10 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <deque> #include <string> #include <algorithm> using namespace std; int main() { //create empty deque of strings deque<string> coll; //insert several elements coll.assign (3, string("string")); coll.push_back ("last string"); coll.push_front ("first string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); cout << endl; //remove first and last element coll.pop_front(); coll.pop_back(); //insert ''another'' into every element but the first for (int i=1; i<coll.size(); ++i) { coll[i] = "another " + coll [i]; } //change size to four elements coll.resize (4, "resized string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); return 0; } /* * OUTPUT * [blog@ccplusplus deque]$ c++ deque-example.cpp -o deque-example [blog@ccplusplus deque]$ ./deque-example first string string string string last string string another string another string resized string [blog@ccplusplus deque]$ */

stl deque push_front example

/******************************************************************* * File : deque-example.cpp * Author : Team ccplusplus * Description : stl deque push_front example * Date : PM 09:28 10 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <deque> #include <string> #include <algorithm> using namespace std; int main() { //create empty deque of strings deque<string> coll; //insert several elements coll.assign (3, string("string")); coll.push_back ("last string"); coll.push_front ("first string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); cout << endl; //remove first and last element coll.pop_front(); coll.pop_back(); //insert ''another'' into every element but the first for (int i=1; i<coll.size(); ++i) { coll[i] = "another " + coll [i]; } //change size to four elements coll.resize (4, "resized string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); return 0; } /* * OUTPUT * [blog@ccplusplus deque]$ c++ deque-example.cpp -o deque-example [blog@ccplusplus deque]$ ./deque-example first string string string string last string string another string another string resized string [blog@ccplusplus deque]$ */

push_front vector c++ example

/******************************************************************* * File : deque-example.cpp * Author : Team ccplusplus * Description : push_front vector c++ example * Date : PM 09:28 10 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <deque> #include <string> #include <algorithm> using namespace std; int main() { //create empty deque of strings deque<string> coll; //insert several elements coll.assign (3, string("string")); coll.push_back ("last string"); coll.push_front ("first string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); cout << endl; //remove first and last element coll.pop_front(); coll.pop_back(); //insert ''another'' into every element but the first for (int i=1; i<coll.size(); ++i) { coll[i] = "another " + coll [i]; } //change size to four elements coll.resize (4, "resized string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); return 0; } /* * OUTPUT * [blog@ccplusplus deque]$ c++ deque-example.cpp -o deque-example [blog@ccplusplus deque]$ ./deque-example first string string string string last string string another string another string resized string [blog@ccplusplus deque]$ */

std deque push_front example

/******************************************************************* * File : deque-example.cpp * Author : Team ccplusplus * Description : std deque push_front example * Date : PM 09:28 10 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <deque> #include <string> #include <algorithm> using namespace std; int main() { //create empty deque of strings deque<string> coll; //insert several elements coll.assign (3, string("string")); coll.push_back ("last string"); coll.push_front ("first string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); cout << endl; //remove first and last element coll.pop_front(); coll.pop_back(); //insert ''another'' into every element but the first for (int i=1; i<coll.size(); ++i) { coll[i] = "another " + coll [i]; } //change size to four elements coll.resize (4, "resized string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); return 0; } /* * OUTPUT * [blog@ccplusplus deque]$ c++ deque-example.cpp -o deque-example [blog@ccplusplus deque]$ ./deque-example first string string string string last string string another string another string resized string [blog@ccplusplus deque]$ */

using push_back c++

/******************************************************************* * File : deque-example.cpp * Author : Team ccplusplus * Description : deque push_back example * Date : PM 09:28 10 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <deque> #include <string> #include <algorithm> using namespace std; int main() { //create empty deque of strings deque<string> coll; //insert several elements coll.assign (3, string("string")); coll.push_back ("last string"); coll.push_front ("first string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); cout << endl; //remove first and last element coll.pop_front(); coll.pop_back(); //insert ''another'' into every element but the first for (int i=1; i<coll.size(); ++i) { coll[i] = "another " + coll [i]; } //change size to four elements coll.resize (4, "resized string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); return 0; } /* * OUTPUT * [blog@ccplusplus deque]$ c++ deque-example.cpp -o deque-example [blog@ccplusplus deque]$ ./deque-example first string string string string last string string another string another string resized string [blog@ccplusplus deque]$ */

deque push_back example

/******************************************************************* * File : deque-example.cpp * Author : Team ccplusplus * Description : deque push_back example * Date : PM 09:28 10 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <deque> #include <string> #include <algorithm> using namespace std; int main() { //create empty deque of strings deque<string> coll; //insert several elements coll.assign (3, string("string")); coll.push_back ("last string"); coll.push_front ("first string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); cout << endl; //remove first and last element coll.pop_front(); coll.pop_back(); //insert ''another'' into every element but the first for (int i=1; i<coll.size(); ++i) { coll[i] = "another " + coll [i]; } //change size to four elements coll.resize (4, "resized string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); return 0; } /* * OUTPUT * [blog@ccplusplus deque]$ c++ deque-example.cpp -o deque-example [blog@ccplusplus deque]$ ./deque-example first string string string string last string string another string another string resized string [blog@ccplusplus deque]$ */

deque push_back c++

/******************************************************************* * File : deque-example.cpp * Author : Team ccplusplus * Description : deque push_back c++ * Date : PM 09:28 10 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <deque> #include <string> #include <algorithm> using namespace std; int main() { //create empty deque of strings deque<string> coll; //insert several elements coll.assign (3, string("string")); coll.push_back ("last string"); coll.push_front ("first string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); cout << endl; //remove first and last element coll.pop_front(); coll.pop_back(); //insert ''another'' into every element but the first for (int i=1; i<coll.size(); ++i) { coll[i] = "another " + coll [i]; } //change size to four elements coll.resize (4, "resized string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); return 0; } /* * OUTPUT * [blog@ccplusplus deque]$ c++ deque-example.cpp -o deque-example [blog@ccplusplus deque]$ ./deque-example first string string string string last string string another string another string resized string [blog@ccplusplus deque]$ */

stl deque implementation

/******************************************************************* * File : deque-example.cpp * Author : Team ccplusplus * Description : stl deque implementation * Date : PM 09:28 10 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <deque> #include <string> #include <algorithm> using namespace std; int main() { //create empty deque of strings deque<string> coll; //insert several elements coll.assign (3, string("string")); coll.push_back ("last string"); coll.push_front ("first string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); cout << endl; //remove first and last element coll.pop_front(); coll.pop_back(); //insert ''another'' into every element but the first for (int i=1; i<coll.size(); ++i) { coll[i] = "another " + coll [i]; } //change size to four elements coll.resize (4, "resized string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); return 0; } /* * OUTPUT * [blog@ccplusplus deque]$ c++ deque-example.cpp -o deque-example [blog@ccplusplus deque]$ ./deque-example first string string string string last string string another string another string resized string [blog@ccplusplus deque]$ */

stl deque example c++

/******************************************************************* * File : deque-example.cpp * Author : Team ccplusplus * Description : stl deque example c++ * Date : PM 09:28 10 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <deque> #include <string> #include <algorithm> using namespace std; int main() { //create empty deque of strings deque<string> coll; //insert several elements coll.assign (3, string("string")); coll.push_back ("last string"); coll.push_front ("first string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); cout << endl; //remove first and last element coll.pop_front(); coll.pop_back(); //insert ''another'' into every element but the first for (int i=1; i<coll.size(); ++i) { coll[i] = "another " + coll [i]; } //change size to four elements coll.resize (4, "resized string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); return 0; } /* * OUTPUT * [blog@ccplusplus deque]$ c++ deque-example.cpp -o deque-example [blog@ccplusplus deque]$ ./deque-example first string string string string last string string another string another string resized string [blog@ccplusplus deque]$ */

deque example c++

/******************************************************************* * File : deque-example.cpp * Author : Team ccplusplus * Description : using deque in c++ example * Date : PM 09:28 10 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <deque> #include <string> #include <algorithm> using namespace std; int main() { //create empty deque of strings deque<string> coll; //insert several elements coll.assign (3, string("string")); coll.push_back ("last string"); coll.push_front ("first string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); cout << endl; //remove first and last element coll.pop_front(); coll.pop_back(); //insert ''another'' into every element but the first for (int i=1; i<coll.size(); ++i) { coll[i] = "another " + coll [i]; } //change size to four elements coll.resize (4, "resized string"); //print elements separated by newlines copy (coll.begin(), coll.end(), ostream_iterator<string>(cout,"\n")); return 0; } /* * OUTPUT * [blog@ccplusplus deque]$ c++ deque-example.cpp -o deque-example [blog@ccplusplus deque]$ ./deque-example first string string string string last string string another string another string resized string [blog@ccplusplus deque]$ */

vector ostream_iterator example

/******************************************************************* * File : using-vector.cpp * Author : Team ccplusplus * Description : vector ostream_iterator example * Date : PM 10:23 09 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <vector> #include <string> #include <algorithm> using namespace std; int main() { //create empty vector for strings vector<string> sentence; //reserve memory for five elements to avoid reallocation sentence.reserve(5); //append some elements sentence.push_back("Hello,"); sentence.push_back("how"); sentence.push_back("are"); sentence.push_back("you"); sentence.push_back("?"); //print elements separated with spaces copy (sentence.begin(), sentence.end(), ostream_iterator<string>(cout," ")); cout << endl; //print ''technical data'' cout << " max_size(): " << sentence.max_size() << endl; cout << " size(): " << sentence.size() << endl; cout << " capacity(): " << sentence.capacity() << endl; //swap second and fourth element swap (sentence[1], sentence [3]); //insert element "always" before element "?" sentence.insert (find(sentence.begin(),sentence.end(),"?"), "always"); //assign "!" to the last element sentence.back() = "!"; //print elements separated with spaces copy (sentence.begin(), sentence.end(), ostream_iterator<string>(cout," ")); cout << endl; //print "technical data" again cout << " max_size(): " << sentence.max_size() << endl; cout << " size(): " << sentence.size() << endl; cout << " capacity(): " << sentence.capacity() << endl; return 0; } /* * OUTPUT * [blog@ccplusplus vector]$ c++ using-vector.cpp -o using-vector [blog@ccplusplus vector]$ ./using-vector Hello, how are you ? max_size(): 2305843009213693951 size(): 5 capacity(): 5 Hello, you are how always ! max_size(): 2305843009213693951 size(): 6 capacity(): 10 [blog@ccplusplus vector]$ */

ostream_iterator example c++

/******************************************************************* * File : using-vector.cpp * Author : Team ccplusplus * Description : ostream_iterator example c++ * Date : PM 10:23 09 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <vector> #include <string> #include <algorithm> using namespace std; int main() { //create empty vector for strings vector<string> sentence; //reserve memory for five elements to avoid reallocation sentence.reserve(5); //append some elements sentence.push_back("Hello,"); sentence.push_back("how"); sentence.push_back("are"); sentence.push_back("you"); sentence.push_back("?"); //print elements separated with spaces copy (sentence.begin(), sentence.end(), ostream_iterator<string>(cout," ")); cout << endl; //print ''technical data'' cout << " max_size(): " << sentence.max_size() << endl; cout << " size(): " << sentence.size() << endl; cout << " capacity(): " << sentence.capacity() << endl; //swap second and fourth element swap (sentence[1], sentence [3]); //insert element "always" before element "?" sentence.insert (find(sentence.begin(),sentence.end(),"?"), "always"); //assign "!" to the last element sentence.back() = "!"; //print elements separated with spaces copy (sentence.begin(), sentence.end(), ostream_iterator<string>(cout," ")); cout << endl; //print "technical data" again cout << " max_size(): " << sentence.max_size() << endl; cout << " size(): " << sentence.size() << endl; cout << " capacity(): " << sentence.capacity() << endl; return 0; } /* * OUTPUT * [blog@ccplusplus vector]$ c++ using-vector.cpp -o using-vector [blog@ccplusplus vector]$ ./using-vector Hello, how are you ? max_size(): 2305843009213693951 size(): 5 capacity(): 5 Hello, you are how always ! max_size(): 2305843009213693951 size(): 6 capacity(): 10 [blog@ccplusplus vector]$ */

c++ vector push_back example

/******************************************************************* * File : using-vector.cpp * Author : Team ccplusplus * Description : c++ vector push_back example * Date : PM 10:23 09 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <vector> #include <string> #include <algorithm> using namespace std; int main() { //create empty vector for strings vector<string> sentence; //reserve memory for five elements to avoid reallocation sentence.reserve(5); //append some elements sentence.push_back("Hello,"); sentence.push_back("how"); sentence.push_back("are"); sentence.push_back("you"); sentence.push_back("?"); //print elements separated with spaces copy (sentence.begin(), sentence.end(), ostream_iterator<string>(cout," ")); cout << endl; //print ''technical data'' cout << " max_size(): " << sentence.max_size() << endl; cout << " size(): " << sentence.size() << endl; cout << " capacity(): " << sentence.capacity() << endl; //swap second and fourth element swap (sentence[1], sentence [3]); //insert element "always" before element "?" sentence.insert (find(sentence.begin(),sentence.end(),"?"), "always"); //assign "!" to the last element sentence.back() = "!"; //print elements separated with spaces copy (sentence.begin(), sentence.end(), ostream_iterator<string>(cout," ")); cout << endl; //print "technical data" again cout << " max_size(): " << sentence.max_size() << endl; cout << " size(): " << sentence.size() << endl; cout << " capacity(): " << sentence.capacity() << endl; return 0; } /* * OUTPUT * [blog@ccplusplus vector]$ c++ using-vector.cpp -o using-vector [blog@ccplusplus vector]$ ./using-vector Hello, how are you ? max_size(): 2305843009213693951 size(): 5 capacity(): 5 Hello, you are how always ! max_size(): 2305843009213693951 size(): 6 capacity(): 10 [blog@ccplusplus vector]$ */

c++ vector push_back example

/******************************************************************* * File : using-vector.cpp * Author : Team ccplusplus * Description : c++ vector push_back example * Date : PM 10:23 09 May 2012 * Source : http://www.ccplusplus.com/p/c_15.html * Note : *******************************************************************/ #include <iostream> #include <iterator> #include <vector> #include <string> #include <algorithm> using namespace std; int main() { //create empty vector for strings vector<string> sentence; //reserve memory for five elements to avoid reallocation sentence.reserve(5); //append some elements sentence.push_back("Hello,"); sentence.push_back("how"); sentence.push_back("are"); sentence.push_back("you"); sentence.push_back("?"); //print elements separated with spaces copy (sentence.begin(), sentence.end(), ostream_iterator<string>(cout," ")); cout << endl; //print ''technical data'' cout << " max_size(): " << sentence.max_size() << endl; cout << " size(): " << sentence.size() << endl; cout << " capacity(): " << sentence.capacity() << endl; //swap second and fourth element swap (sentence[1], sentence [3]); //insert element "always" before element "?" sentence.insert (find(sentence.begin(),sentence.end(),"?"), "always"); //assign "!" to the last element sentence.back() = "!"; //print elements separated with spaces copy (sentence.begin(), sentence.end(), ostream_iterator<string>(cout," ")); cout << endl; //print "technical data" again cout << " max_size(): " << sentence.max_size() << endl; cout << " size(): " << sentence.size() << endl; cout << " capacity(): " << sentence.capacity() << endl; return 0; } /* * OUTPUT * [blog@ccplusplus vector]$ c++ using-vector.cpp -o using-vector [blog@ccplusplus vector]$ ./using-vector Hello, how are you ? max_size(): 2305843009213693951 size(): 5 capacity(): 5 Hello, you are how always ! max_size(): 2305843009213693951 size(): 6 capacity(): 10 [blog@ccplusplus vector]$ */