Generic Algorithms and Data Structures using C++11: Origin: Future of Boost C++ Libraries

Sergei Nakariakov

ISBN 10: 1484111540 / ISBN 13: 9781484111543

Verlag: Createspace Independent Publishing Platform, 2013

Beschreibung

This item is printed on demand. New copy - Usually dispatched within 5-9 working days 892.

Bestandsnummer des Verkäufers C9781484111543

Bibliografische Details

• Titel: Generic Algorithms and Data Structures using C++11: Origin: Future of Boost C++ Libraries
• Verlag: Createspace Independent Publishing Platform
• Veröffentlichungsdatum: 2013
• Sprache: Englisch
• ISBN-10: 1484111540
• ISBN-13: 9781484111543
• Bindung: Paperback / softback
• Zustand: New

Über diesen Titel

Inhaltsangabe

This book contains implementation of generic algorithms and data structures using C++11.

I Type Traits

1 Type Functions
2 Extended Function Traits
3 Integer Traits
4 Associated Member Types
5 Member pointers
6 Overloadable operators
7 Reference Traits
8 Type Traits
8.1 All
8.2 Assignable
8.3 Common
8.4 Convertible
8.5 Derived
8.6 Float
8.7 Function
8.8 Identity
8.9 Integer
8.10 Meta
8.11 Relational
8.12 Same
8.13 Select
8.14 Void



II Type Concepts

9 Type deduction systems
10 Overloaded Concept Implementations
11 Type Concepts
11.1 Copyable
11.2 Difference Type
11.3 Equality Comparable
11.4 Pointer Of
11.5 Reference Of
11.6 Size Type
11.7 Streamable
11.8 Totally Ordered
11.9 Value Type



III Functional Library

12 Functional Library



IV Sequence Concepts

13 Sequence Concepts Traits
14 Sequence Concepts
14.1 Iterators
14.2 Ranges
14.3 Readable and Writable
14.4 Traits
15 Range
15.1 Reference Of
15.2 Ranges
16 Range Generator
17 Sequence Algorithms
17.1 Binary Search
17.2 Copy
17.3 Count
17.4 Equal
17.5 Fill
17.6 Find
17.7 For Each
17.8 Generate
17.9 Heap
17.10Lexicographical
17.11Merge
17.12Min Max
17.13Mismatch
17.14Move
17.15Partition
17.16Permutation
17.17Quantifier
17.18Remove
17.19Replace
17.20Reverse
17.21Search
17.22Set
17.23Shuffle
17.24Sort
17.25Transform
17.26Unique
18 Iterators
18.1 Filter
19 Sequence Testing



V Memory Concepts

20 Concepts
21 Allocators



VI Matrix

22 Matrix Base
23 Slice Iterator
24 Matrix
25 Matrix Reference
26 Matrix Operations
27 Slice
28 Support Operations
29 Matrix Traits
30 Matrix
30.1 1D Matrix
30.2 2D Matrix
30.3 3D Matrix
30.4 Matrix
30.5 Matrix Operations
30.6 Slice Operations
30.7 Solver



VII Graph

31 Graph Concepts
32 Interface And Predicates
33 Graph I/O
34 Graph Handle
35 Utilities
36 Graph Edge
37 Adjacency List
37.1 Node Pool
37.2 Directed and Undirected Adjacency List
37.3 Directed and Undirected Adjacency Vector



VIII Data

38 Container Concepts
39 Optional Qualifier