Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Server Side Programming Articles - Page 1873 of 2646
256 Views
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
183 Views
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
384 Views
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
321 Views
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
260 Views
In this article we will be discussing the working, syntax and examples of forward_list::merge() 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::merge()?forward_list::merge() is an inbuilt function in C++ STL which is declared in header file. merge() is used to merge two sorted forward_list into one. Before merging two lists we must ensure the lists are ... Read More
196 Views
Given is the task to show the working of forward_list max_size() function in C++ STL.What is a Forward List?Forward list can be understood as a singly linked list where the tracking can be done only in forward direction but not in a backward direction whereas in the list we can track the elements in both the direction i.e. the element holds the two links one is for forward element and another one is for backward element. Forward lists are therefore fast because they have to hold only one link which will be of a forward element. Forward elements can be ... Read More
4K+ Views
In this article we will be discussing the working, syntax and examples of list::empty() 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::empty()?list::empty() ... Read More
96 Views
Given is the task to show the working of ratio_less_equal () function in c++.The given function Ratio_less_equal checks if the value of ratio1 is less or equal than ratio2. It returns a Boolean constant “value” which returns true if ratio1 is less or equal than ratio2 else returns false.Syntaxtemplate ratio_less_equalParametersThis function accepts two template parameters one is ratio1 and another one is ratio2 which are to be compared.Explanation of this functionIn this function, if the value of ratio1 is less than or equal to the value of ratio2 then this function will return the Boolean value which is true i.e. ... Read More
110 Views
Given is the task to show the working of ratio_greater_equal () function in C++.The given function Ratio_greater_equal checks if the value of ratio1 is greater or equal than ratio2. It returns a Boolean constant “value” which returns true if ratio1 is greater or equal than ratio2 else returns false.SyntaxTemplate ratio_greater_equalParametersThis function accepts two template parameters one is ratio1 and another one is ratio2 which are to be compared.Explanation of this functionIn this function, if the value of ratio1 is greater than or equal to the value of ratio2 then this function will return the Boolean value which is true ... Read More
62 Views
Given is the task to show the working of ratio_greater () function in c++.The given function Ratio_greater checks if the value of ratio1 is greater than ratio2. It returns a Boolean constant “value” which returns true if ratio1 is greater than ratio2 else returns false.SyntaxTemplate ratio_greaterParametersThis function accepts two template parameters one is ratio1 and another one is ratio2 which are to be compared.Explanation of this functionIn this function, if the value of ratio1 is greater than the value of ratio2 then this function will return the Boolean value which is true i.e. integer digit 1 otherwise it will ... Read More