Home PC Games Linux Windows Database Network Programming Server Mobile  
           
  Home \ Programming \ STL source code analysis - iterator each container classification     - The wrong in Linux: too many open files (Linux)

- E: Sub-process / usr / bin / dpkg returned an error code (1) error solution (Linux)

- Linux SSH login without a password (Linux)

- Oracle first Automated Installation Packages (Database)

- C ++ Learning Notes: references (Programming)

- After installation of Debian 6.0 do a few things first (Linux)

- Java interface (Programming)

- Linux Shell Scripting Interview Question (Linux)

- CentOS7 compile and install Tengine + PHP + MariaDB notes (Server)

- Mac OS X 10.9 compiler OCI8 module (Programming)

- Linux System Getting Started Learning: The Linux command line burn ISO or NRG image to DVD (Linux)

- C # mobile side and PC-side data exchange (Database)

- Use read command to read user input (Programming)

- Customize the 404 error page Nginx (Server)

- To install Python-Pip and Fabric under CentOS / Ubuntu (Linux)

- CoreOS Linux introduces Kubernetes kubelet (Server)

- Hunk / Hadoop: Performance Best Practices (Server)

- Ubuntu Server security risk checks (Linux)

- Linux mount command Detailed (Linux)

- PostgreSQL query lock and kill the process (Database)

 
         
  STL source code analysis - iterator each container classification
     
  Add Date : 2018-11-21      
         
         
         
  Five iterator as follows:

1, input iterator: read-only, one pass

As input iterator predefined implementations only istream_iterator and istreambuf_iterator, for reading from an input stream istream in. An input iterator for each element only once it has chosen to resolve, they can only move forward. A special constructor is defined beyond the end of the value. Always, input iterator can read the results of parsing (parse only once for each value), and then move forward.

2, the output iterator: write only, one pass

This is in addition to the input iterators, but instead of reading the write operation. Output iterator predefined implementations only ostream_iterator and ostreambuf_iterator, used to write data to an output stream ostream, there is generally a less used raw_storage_iterator. They parsed only once for each value written, and can only move forward. For output iterator, it is not used beyond the end of the value to the end of the concept. In short, the value of output iterator can write to parse (only parsed once for each value), and then move forward.

3, forward iterators: multiple read / write

Forward iterators contain both input and output iterator functions, plus you can also resolve many an iterator specified location, it can be a value for multiple read / write. As the name suggests, forward iterators can only move forward. Not the forward iterator predefined iterators.

4, bidirectional iterators: operator--

Bidirectional iterator has all the features the forward iteration. In addition it can be used and decrement operator-- backward move one position. Container from the list returned iterators are bidirectional.

5, random access iterators: similar to a pointer

Random access iterator bidirectional iterator has all the features, plus a pointer to all the functions (a pointer is a random access iterator), except that no kind of "empty (null)" iterators and null pointer corresponds. Basically it can be said, a random access iterator as a pointer that can carry out any operation, including the use of operator operator [] index, add a value to a pointer can move forward or backward a number of positions, or use a comparison between the iterator compare.

vector and deque offer is RandomAccessIterator, list is provided by iterators BidirectionalIterator, set and map is provided Bidirectional Iterator, hash_set and hash_map iterator is Forward Iterator. About the STL iterator iterator as follows:

Iterator category

Explanation

Input iterator

Read elements from the container. Input iterator can only be read into one element is moved forward again only supports input iterator algorithm, the same input iterator can traverse a sequence twice

Output iterator

Write element to the container. Output iterator can only move forward one at a time element. Output iterator algorithm supports only once, not twice unified output iterator to traverse a sequence

Forward iterators

Combination of input and output iterator iterator function, and retain the position in the container

Bidirectional iterators

Combination of forward and reverse iterator iterator function, support multi-pass algorithm

Random access iterators

Combination of bidirectional iterators functions and features direct access to any element of the container, you can skip forward any elements backwards

Iterator operations:

Each iterator can be carried out, including the operating table before an iterative can be carried out. By overloaded operators to achieve, and what action to support iterators can perform what operation is determined by the iterator overloaded operator nature of the operation of the iterator.

Iterator type of operation Type Description
All iterators

p ++

++ P

Post-increment iterator

Pre-increment iterator s's

Input iterator

* P

p = p1

p == p1

p! = p1

Dereferenced iterator, as a right value

An iterator assigned to another iterator

Compare iterators for equality

Compare iterator inequality

Output iterator

* P

p = p1

Dereferenced iterator, as lvalue

An iterator assigned to another iterator

Forward iterators

Provide all input and output iterator function

 

Bidirectional iterators

--p

p--

Pre-decrement iterator

Post-decrement iterator

Random access iterators

p + = i

p- = i

p + i

p-i

p [i]

p < p1

p < = p1

p> p1

p> = p1

Increment the iterator i bits

Decrement the iterator i bits

In the p bits plus i bit iterator

In the p bit down i bit iterator

Returns the p-bit elements departing from the i-th element reference

If the iterator p position before p1, returns true, false otherwise

p position returns true if the front or in the same position p1, and false otherwise

If the iterator p position after p1, returns true, false otherwise

p returns true if the position or behind the same position p1, and false otherwise

 Only order containers and associative containers support iterators traversal iterator each container supports the following categories:
Container supports iterator category container supports iterator category container supports iterator category
vector random access random access list bidirectional deque
bi-directional bi multiset set bidirectional map
multimap does not support two-way stack does not support queue
priority_queue not supported before hash_set forward to hash_map
     
         
         
         
  More:      
 
- Using 30 seconds to write a detailed analysis of garbage removal system (Linux)
- Difference between TCP and UDP protocols (Linux)
- Understanding and Memcached MongoDB arbitration node, Zookeeper, Redis Recovery Programme Thoughts (Database)
- Install Open vSwitch under CentOS 6.5 (Linux)
- Linux Platform Oracle 11g Single Instance Installation Deployment Configuration Quick Reference (Database)
- How to use the beta / unstable version of the software in Debian library (Linux)
- CoreOS use register mirror to build private warehouse (Linux)
- Linux, modify / retrieve the root password (Linux)
- Shell command line operation (Linux)
- Linux network security strategy (Linux)
- Linux SU command security Suggestions (Linux)
- CentOS 7 Configure logging (VirtualBox) (Linux)
- OpenStack / Dev stack with neutron on Ubuntu 14.04 (Server)
- After installing minimize RHEL / CentOS 7 we need to do (Linux)
- PyCharm new Python file name and the name of the module will import the same problem might arise (Programming)
- The Java ThreadLocal (Programming)
- Cygwin install Python MySQLdb (Linux)
- CentOS / Linux install VNC Server (Linux)
- How to install Hadoop on CentOS7 (Server)
- Java Generics Introduction --HashMap summary (Programming)
     
           
     
  CopyRight 2002-2022 newfreesoft.com, All Rights Reserved.