166988

1596840

Размер шрифта:
14 | 16 | 18 | 20 | 22 | 24

Ширина текста:
50% | 60% | 70% | 80% | 90% | 100%

Шрифт:

Цвет текста:
Установить
Цвет фона:
Установить

Сбросить настройки

Introduction to the Standard Template Library

Containers and algorithms

Iterators

Concepts and Modeling

Refinement

Other parts of the STL

How to use the STL documentation

Classification of STL components

Using the STL documentation

Containers

Concepts

General concepts

Container

Forward Container

Reversible Container

Random Access Container

Sequences

Sequence

Front Insertion Sequence

Back Insertion Sequence

Associative Containers

Associative Container

Simple Associative Container

Pair Associative Container

Sorted Associative Container

Hashed Associative Container

Hash Function

Unique Associative Container

Multiple Associative Container

Unique Sorted Associative Container

Multiple Sorted Associative Container

Unique Hashed Associative Container

Multiple Hashed Associative Container

Container classes

Sequences

vector<T, Alloc>

deque<T, Alloc>

list<T, Alloc>

slist<T, Alloc>

bit_vector

Associative Containers

set<Key, Compare, Alloc>

map<Key, Data, Compare, Alloc>

multiset<Key, Compare, Alloc>

multimap<Key, Data, Compare, Alloc>

hash_set<Key, HashFcn, EqualKey, Alloc>

hash_map<Key, Data, HashFcn, EqualKey, Alloc>

hash_multiset<Key, HashFcn, EqualKey, Alloc>

hash_multimap<Key, Data, HashFcn, EqualKey, Alloc>

hash<T>

String package

Character Traits

char_traits

basic_string<charT, traits, Alloc>

rope<T, Alloc>

Container adaptors

stack<T, Sequence>

queue<T, Sequence>

priority_queue<T, Sequence, Compare>

bitset<N>

Iterators

Introduction

Concepts

Trivial Iterator

Input Iterator

Output Iterator

Forward Iterator

Bidirectional Iterator

Random Access Iterator

Iterator Tags

Introduction

iterator_traits<Iterator>

iterator_category

distance_type

value_type

Iterator tag classes

input_iterator_tag

output_iterator_tag

forward_iterator_tag

bidirectional_iterator_tag

random_access_iterator_tag

Iterator base classes

input_iterator<T, Distance>

output_iterator

forward_iterator<T, Distance>

bidirectional_iterator<T, Distance>

random_access_iterator<T, Distance>

Iterator functions

distance

advance

Iterator classes

istream_iterator<T, Distance>

ostream_iterator<T>

front_insert_iterator<FrontInsertionSequence>

back_insert_iterator<BackInsertionSequence>

insert_iterator<Container>

reverse_iterator<RandomAccessIterator, T, Reference, Distance>

reverse_bidirectional_iterator<BidirectionalIterator, T, Reference, Distance>

raw_storage_iterator<ForwardIterator, T>

sequence_buffer<Container, buf_sz>

Algorithms

Non-mutating algorithms

for_each

find

find_if

adjacent_find

find_first_of

count

count_if

mismatch

equal

search

search_n

find_end

Mutating algorithms

copy

copy_n

copy_backward

Swap

swap

iter_swap

swap_ranges

transform

Replace

replace

replace_if

replace_copy

replace_copy_if

fill

fill_n

generate

generate_n

Remove

remove

remove_if

remove_copy

remove_copy_if

unique

unique_copy

reverse

reverse_copy

rotate

rotate_copy

random_shuffle

random_sample

random_sample_n

partition

stable_partition

Sorting

Sort

sort

stable_sort

partial_sort

partial_sort_copy

is_sorted

nth_element

Binary search

lower_bound

upper_bound

equal_range

binary_search

merge

inplace_merge

Set operations on sorted ranges

includes

set_union

set_intersection

set_difference

set_symmetric_difference

Heap operations

push_heap

pop_heap

make_heap

sort_heap

is_heap

Minimum and maximum

min

max

min_element

max_element

lexicographical_compare

lexicographical_compare_3way

next_permutation

prev_permutation

Generalized numeric algorithms

iota

accumulate

inner_product

partial_sum

adjacent_difference

power

Function Objects

Introduction

Concepts

Generator

Unary Function

Binary Function

Adaptable Generator

Adaptable Unary Function

Adaptable Binary Function

Predicates

Predicate

Binary Predicate

Adaptable Predicate

Adaptable Binary Predicate

Strict Weak Ordering

MonoidOperation

Random Number Generator

Predefined function objects

Arithmetic operations

plus<T>

minus<T>

multiplies<T>

divides<T>

modulus<T>

negate<T>

Comparisons

equal_to<T>

not_equal_to<T>

less<T>

greater<T>

less_equal<T>

greater_equal<T>

Logical operations

logical_and<T>

logical_or<T>

logical_not<T>

Generalized identity operations

identity<T>

project1st<Arg1, Arg2>

project2nd<Arg1, Arg2>

select1st<Pair>

select2nd<Pair>

subtractive_rng

Function object adaptors

binder1st<AdaptableBinaryFunction>

binder2nd<AdaptableBinaryFunction>

ptr_fun

pointer_to_unary_function<Arg, Result>

pointer_to_binary_function<Arg1, Arg2, Result>

unary_negate<AdaptablePredicate>

binary_negate<AdaptableBinaryPredicate>

unary_compose<AdaptableUnaryFunction1,AdaptableUnaryFunction2>

binary_compose<AdaptableBinaryFunction,AdaptableUnaryFunction1,AdaptableUnaryFunction2>

Member function adaptors

mem_fun_t<Result, X>

mem_fun_ref_t<Result, X>

mem_fun1_t<Result, X, Arg>

mem_fun1_ref_t<Result, X, Arg>

Utilities

Concepts

Assignable

Default Constructible

Equality Comparable

LessThan Comparable

Functions

Relational Operators

Classes

pair<T1, T2>

Memory Allocation

Classes

Allocators

Functions

construct

destroy

uninitialized_copy

uninitialized_copy_n

uninitialized_fill

uninitialized_fill_n

temporary_buffer<ForwardIterator, T>

get_temporary_buffer

return_temporary_buffer

Design documents

Thread-safety for SGI STL

STL Complexity Specifications

Strings in SGI STL

Rope Implementation Overview

SGI STL Allocator Design

What's New

Other STL Web sites

Al Stevens Interviews Alex Stepanov

Frequently Asked Questionsabout the SGI Standard Template Library