menu
{ "item_title" : "Generic Algorithms and Data Structures using C++11", "item_author" : [" Sergei Nakariakov "], "item_description" : "This book contains implementation of generic algorithms and data structures using C++11. I Type Traits 1 Type Functions2 Extended Function Traits3 Integer Traits4 Associated Member Types5 Member pointers6 Overloadable operators7 Reference Traits8 Type Traits8.1 All8.2 Assignable8.3 Common8.4 Convertible8.5 Derived8.6 Float8.7 Function8.8 Identity8.9 Integer8.10 Meta8.11 Relational8.12 Same8.13 Select8.14 Void II Type Concepts 9 Type deduction systems10 Overloaded Concept Implementations11 Type Concepts11.1 Copyable11.2 Difference Type11.3 Equality Comparable11.4 Pointer Of11.5 Reference Of11.6 Size Type11.7 Streamable11.8 Totally Ordered11.9 Value Type III Functional Library 12 Functional Library IV Sequence Concepts 13 Sequence Concepts Traits14 Sequence Concepts14.1 Iterators14.2 Ranges14.3 Readable and Writable14.4 Traits15 Range15.1 Reference Of15.2 Ranges16 Range Generator17 Sequence Algorithms17.1 Binary Search17.2 Copy17.3 Count17.4 Equal17.5 Fill17.6 Find17.7 For Each17.8 Generate17.9 Heap17.10Lexicographical17.11Merge17.12Min Max17.13Mismatch17.14Move17.15Partition17.16Permutation17.17Quantifier17.18Remove17.19Replace17.20Reverse17.21Search17.22Set17.23Shuffle17.24Sort17.25Transform17.26Unique18 Iterators18.1 Filter19 Sequence Testing V Memory Concepts 20 Concepts21 Allocators VI Matrix 22 Matrix Base23 Slice Iterator24 Matrix25 Matrix Reference26 Matrix Operations27 Slice28 Support Operations29 Matrix Traits30 Matrix30.1 1D Matrix30.2 2D Matrix30.3 3D Matrix30.4 Matrix30.5 Matrix Operations30.6 Slice Operations30.7 Solver VII Graph 31 Graph Concepts32 Interface And Predicates33 Graph I/O34 Graph Handle35 Utilities36 Graph Edge37 Adjacency List37.1 Node Pool37.2 Directed and Undirected Adjacency List37.3 Directed and Undirected Adjacency Vector VIII Data 38 Container Concepts39 Optional Qualifier", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/1/48/411/154/1484111540_b.jpg", "price_data" : { "retail_price" : "39.99", "online_price" : "39.99", "our_price" : "39.99", "club_price" : "39.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Generic Algorithms and Data Structures using C++11|Sergei Nakariakov

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

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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

This item is Non-Returnable

Details

  • ISBN-13: 9781484111543
  • ISBN-10: 1484111540
  • Publisher: Createspace Independent Publishing Platform
  • Publish Date: April 2013
  • Dimensions: 9 x 6 x 1.14 inches
  • Shipping Weight: 1.64 pounds
  • Page Count: 564

Related Categories

You May Also Like...

    1

BAM Customer Reviews