Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
new is used for dynamic memory allocation. The memory allocated in this case goes on the heap. There are several costs associated with this type of memory allocation along with the programmer having to do manual memory cleaning and management. This type of allocation must be used when − You don't know how much memory you need at compile time.You want to allocate memory which will persist after leaving the current block.Other than these, there are very few cases where dynamic memory allocation is required. This is because, in C++, there is the concept of a destructor. This function gets called ... Read More
In this article we will be discussing the working, syntax and examples of list::front() function in C++.What is a List in STL?List is a data structure that allows constant time insertion and deletion anywhere in sequence. Lists are implemented as doubly linked lists. Lists allow non-contiguous memory allocation. List perform better insertion extraction and moving of element in any position in container than array, vector and deque. In List the direct access to the element is slow and list is similar to forward_list, but forward list objects are single linked lists and they can only be iterated forwards.What is list::front() ... Read More
In this article we will be discussing the working, syntax and examples of list::end() function in C++.What is a List in STL?List is a data structure that allows constant time insertion and deletion anywhere in sequence. Lists are implemented as doubly linked lists. Lists allow non-contiguous memory allocation. List perform better insertion extraction and moving of element in any position in container than array, vector and deque. In List the direct access to the element is slow and list is similar to forward_list, but forward list objects are single linked lists and they can only be iterated forwards.What is list::end()?list::end() ... Read More
In this article we will be discussing the working, syntax and examples of forward_list::operator = in C++.What is a Forward_list in STL?Forward list are sequence containers that allow constant time insert and erase operations anywhere within the sequence. Forward list are implement as a singly-linked lists. The ordering is kept by the association to each element of a link to the next element in the sequence.What is forward_list::operator =?Forward_list::operator = is used to assign the new values to the forward_list container by replacing the already existing ones. This operator also modifies the size of the forward_list container according to the ... Read More
POD is an acronym in C++ that means plain old data. It is a class/struct that ONLY has member variables and no methods, constructors, destructors, virtual functions, etc. For example,Example#include using namespace std; // POD struct MyStruct { int key; string data; }; int main() { struct MyStruct s; s.key = 1; s.data = "hello"; return 0; }The struct MyStruct has no user-defined ctor, dtor, etc and hence is a POD.
In this article we will be discussing the working, syntax and examples of forward_list::front() and forward_list::empty() functions in C++.What is a Forward_list in STL?Forward list are sequence containers that allow constant time insert and erase operations anywhere within the sequence. Forward list are implement as a singly-linked lists. The ordering is kept by the association to each element of a link to the next element in the sequence.What is forward_list::front()?forward_list::front() is an inbuilt function in C++ STL which is declared in header file. front() returns the iterator which is referred to the first element in the forward_list container.Syntaxforwardlist_container.front();This function ... Read More
The linker searches from left to right. While doing so it encounters unresolved symbols which it keeps track of. If a library resolves the unresolved symbol, it takes the object files of that library to resolve the symbol.Dependencies of static libraries from each other work in the same way. Libraries requiring symbols from other library come before libraries resolving the symbol. If you have cyclic dependencies, you must enclose the libraries having a cyclic dependency in parenthesis. For example, if you have libraries a and b that are cyclically dependent −$ g++ hello.cpp -L. -( -la -lb -)Newer linkers are ... Read More
In this article we will be discussing the working, syntax and examples of forward_list::begin() and forward_list::end() functions in C++.What is a Forward_list in STL?Forward list are sequence containers that allow constant time insert and erase operations anywhere within the sequence. Forward list are implement as a singly-linked lists. The ordering is kept by the association to each element of a link to the next element in the sequence.What is forward_list::begin()?forward_list::begin() is an inbuilt function in C++ STL which is declared in header file. begin() returns the iterator which is referred to the first element in the forward_list container. Mostly we ... Read More
By using a temporary variable −>>> x=10 >>> y=20 >>> z=x >>> x=y >>> y=z >>> x,y (20, 10)Without using temporary variable>>> a,b=5,7 >>> a,b (5, 7) >>> a,b=b,a >>> a,b (7, 5)
In this article we will be discussing the working, syntax and examples of forward_list::before_begin() function in C++.What is a Forward_list in STL?Forward list are sequence containers that allow constant time insert and erase operations anywhere within the sequence. Forward list are implement as a singly-linked lists. The ordering is kept by the association to each element of a link to the next element in the sequence.What is forward_list::before_begin()?forward_list::before_begin() is an inbuilt function in C++ STL which is declared in header file. before_begin() returns the iterator which is pointing to the element before the first element in the forward_list container.Syntaxforwardlist_container.before_begin();This ... Read More