Template Library Management
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 298 Accepted Submission (s): 87Problem DescriptionAs an experienced ACMer, you must have known the importance of "code template library ". with the help of pre-printed code library, you can implement the complicated algorithms correctl
1. What is Standard Template Library STLBefore you have learned the declaration and use of function templates and class templates, the previous template is designed by the programmer himself according to their own needs, from their own to declare the template to the last to useTemplates are done by themselves, and these standard template libraries are not written by ourselves, but by some of the great gods, because they often use common templates duri
Memory configurator (allocator) and stlallocator of the STL Library
I am learning. If there are any mistakes, please give me more advice. According to our constant understanding, we will make changes. The changes will be retained. recording errors is the greatest improvement. Sorry!
SGI space configurator with sub-configuration force (SGI is a version of STL, and
Using a fast one-year STL library, decided to write about the use of this year's experience and summary. 1. Overview
Personal feel STL = = {algorithm, container, iterator};
type
header File
Algorithm
Include
Iterators
Include
Container
include
There's a very classical word on the C+
Standard Template Library (STL) learn to explore the vector containerC + + VectorsVector is part of the C + + Standard Template Library, which is a multifunctional template class and function library that can manipulate a variety of data structures and algorithms. Vector is considered to be a container because it can s
1. Standard Template Library (STL): is to provide a common template, this part of the code is high-quality code, improve the programmer's development efficiency2.vector vectors: Essentially, the encapsulation of an array, characterized by the completion of reading in constant time, more complex inserts, and traversal through iteratorsSeveral ways to initialize vector vectors:
Vector
Vector
Vecto
Paste the code First:#include "stdafx.h" #include The principle of the delay program is very simple, is simple to get the program to invoke the clock () function CPU time, and then use a while loop, always call this function until the initial call and the current time of the last call to set the delay number jump out of the loop.List,stack,vector the use of these containers I now feel more similar, I have just started to look at the STL standard
memory must be traversed and stored in a third block of memory.
Considering the reusability of the program, we use the generic programming technology to design the solution to adapt to the change of storage medium.
When files are large (thousands of lines per file), it may not be realistic to store each file in memory. In addition, it also brings difficulties to the implementation process.
Implementation Details:
You can use containers to design, such as arrays or queues, to store character
merged with the original third heap, and a new heap is obtained, with a number of 12, which consumes 12 of the energy. So the total cost of energy =3+12=15. It can be shown that 15 is the minimum physical cost.Enter a description input Description The input consists of two lines, the first line being an integer n (1outputs description output Description The output includes one row, which contains only an integer, which is the minimum physical cost. The input data guarantees that this valueis le
1, Stl::bind and Std::mem_fun_ref series with the use of problems, multi-Parameter form does not know how to organize. The operation of the adapter is really uncomfortable!!! Can only be used in a daze. Only lambda or transfer operations are considered when using non-qualitative algorithms when used in containers. CondFunctor-adapter_p431.cpp: Defines the entry point of the console application. #include "stdafx.h" #include
Sort is sorted in the STL library, and sometimes the O (n^2) algorithm that bubbles, chooses, and so on times out, we can use the Quick sort O (n log n) in the STL to do the sortingSort in the
1234
templateclassRandomAccessIterator>voidsort ( RandomAccessIterator first, RandomAccessIterator last );templateclass RandomAccessIterator,classCompa
The STL contains three parts of the container Class (Container), the iteration sub (iterator), and the algorithm (algorithm).
(1), Container
(2), AlgorithmIn a template the algorithm does not depend on the specific data type, and the generic algorithm goes further than the concrete container. For example, because the STL sort () function is completely generic, you can use it to manipulate almost any data
C + + Standard Template Library STL queue use method and application introductionQueueThe queue template class is defined in the Similar to the Stack template class, the queue template class requires two template parameters, one element type, one container type, the element type is necessary, the container type is optional, and the default is the Deque type.The sample code that defines the queue object is a
0. Content for personal study notes, for reference only, if there are errors and omissions, please correct me!1. All components in the STL are made up of templates, so their elements can be of any type. The components are:-Container: Manages a collection of objects of a class. Different containers have their own pros and cons.-iterators: Used to traverse on an element of an object cluster (Collection of Objects). This cob can be part of a container/co
the iterator returned by the first and end operations will be invalidated. 3. After the delete operation (Erase,pop_back), the iterator to the delete point is all invalidated, and the iterator to the element that follows the delete point will all be invalidated.Deque iterator failure condition: In the C++primer book is this limit: 1. Inserting elements in the Deque container header or tail does not invalidate any iterators. 2. Deleting an element at its first or trailing end only invalidates th
What is STL is not introduced, here mainly introduce the common use of vectors in the library for easy reference later.Vector member functions
Function
Expression
C.assign (Beg,end)C.assign (N,elem)
assigns the data in the [beg; end] interval to c. assigns a copy of n elem to c.
c.at (IDX)
Returns the index IDX refers to the data, if the IDX is out
() {VectorWords[0] = "zero";WORDS[1] = "one";coutint x;cin>>x;Switch (x) {Case 0:coutBreakCase 1:coutBreakCase 2:coutBreakDefaultBreak}}Map of STL1map Additions and Queries#include #include #include using namespace Std;int main () {Mapm1["Beijing"] = 100;m1["Shenzhen"] = 200;m1["Shanghai"] = 300;coutMapwhile (It! = M1.end ()) {// this comparescoutit++;}return 0;}2 whenever you use the subscript to access the map element, if the element does not exist, then the first time in the map is reborn i
#include The algorithm header file contains a large stack of template functions, the algorithm provided by the STL library, which can be considered to be largely independent of each function. The types of algorithms available are:1) Adjacent_find//The first pair of equal adjacent elements in the detection interval TemplateFwit Adjacent_find (Fwdit first,fwdit last); If successful, return first+n,n satisfie
sorted in ascending order of the dictionary, equivalent to the loopint list[3]={3,2,1};Next_permutation (list,list+3);coutOutput: 1 2 3(2) Char type next_permutationint main (){Char ch[205];CIN >> ch;Sort (CH, ch + strlen (ch));The statement sorts the input array in ascending order. If the input 9874563102coutchar *first = ch;Char *last = ch + strlen (CH);do {cout}while (Next_permutation (First, last));return 0;}So that you do not have to know the size of CH, is the entire CH string all sortedI
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.