{"product_id":"generic-algorithms-and-data-structures-using-c-11-origin-future-of-boost-c-libraries-9781484111543","title":"Generic Algorithms and Data Structures using C++11: Origin: Future of Boost C++ Libraries","description":"\u003cp\u003e • Author(s): Sergei Nakariakov\u003cbr\u003e • Publisher: Createspace Independent Publishing Platform\u003cbr\u003e • Publisher Imprint: Createspace Independent Publishing Platform\u003cbr\u003e • BISAC: Programming Languages - C++\u003c\/p\u003e\u003cp\u003eThis book contains implementation of generic algorithms and data structures using C++11. \u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e I Type Traits \u003cp\u003e\u003c\/p\u003e 1 Type Functions \u003cbr\u003e 2 Extended Function Traits \u003cbr\u003e 3 Integer Traits \u003cbr\u003e 4 Associated Member Types \u003cbr\u003e 5 Member pointers \u003cbr\u003e 6 Overloadable operators \u003cbr\u003e 7 Reference Traits \u003cbr\u003e 8 Type Traits \u003cbr\u003e 8.1 All \u003cbr\u003e 8.2 Assignable \u003cbr\u003e 8.3 Common \u003cbr\u003e 8.4 Convertible \u003cbr\u003e 8.5 Derived \u003cbr\u003e 8.6 Float \u003cbr\u003e 8.7 Function \u003cbr\u003e 8.8 Identity \u003cbr\u003e 8.9 Integer \u003cbr\u003e 8.10 Meta \u003cbr\u003e 8.11 Relational \u003cbr\u003e 8.12 Same \u003cbr\u003e 8.13 Select \u003cbr\u003e 8.14 Void \u003cp\u003e\u003c\/p\u003e \u003cp\u003e\u003c\/p\u003e II Type Concepts \u003cp\u003e\u003c\/p\u003e 9 Type deduction systems \u003cbr\u003e 10 Overloaded Concept Implementations \u003cbr\u003e 11 Type Concepts \u003cbr\u003e 11.1 Copyable \u003cbr\u003e 11.2 Difference Type \u003cbr\u003e 11.3 Equality Comparable \u003cbr\u003e 11.4 Pointer Of \u003cbr\u003e 11.5 Reference Of \u003cbr\u003e 11.6 Size Type \u003cbr\u003e 11.7 Streamable \u003cbr\u003e 11.8 Totally Ordered \u003cbr\u003e 11.9 Value Type \u003cp\u003e\u003c\/p\u003e \u003cp\u003e\u003c\/p\u003e III Functional Library \u003cp\u003e\u003c\/p\u003e 12 Functional Library \u003cp\u003e\u003c\/p\u003e \u003cp\u003e\u003c\/p\u003e IV Sequence Concepts \u003cp\u003e\u003c\/p\u003e 13 Sequence Concepts Traits \u003cbr\u003e 14 Sequence Concepts \u003cbr\u003e 14.1 Iterators \u003cbr\u003e 14.2 Ranges \u003cbr\u003e 14.3 Readable and Writable \u003cbr\u003e 14.4 Traits \u003cbr\u003e 15 Range \u003cbr\u003e 15.1 Reference Of \u003cbr\u003e 15.2 Ranges \u003cbr\u003e 16 Range Generator \u003cbr\u003e 17 Sequence Algorithms \u003cbr\u003e 17.1 Binary Search \u003cbr\u003e 17.2 Copy \u003cbr\u003e 17.3 Count \u003cbr\u003e 17.4 Equal \u003cbr\u003e 17.5 Fill \u003cbr\u003e 17.6 Find \u003cbr\u003e 17.7 For Each \u003cbr\u003e 17.8 Generate \u003cbr\u003e 17.9 Heap \u003cbr\u003e 17.10Lexicographical \u003cbr\u003e 17.11Merge \u003cbr\u003e 17.12Min Max \u003cbr\u003e 17.13Mismatch \u003cbr\u003e 17.14Move \u003cbr\u003e 17.15Partition \u003cbr\u003e 17.16Permutation \u003cbr\u003e 17.17Quantifier \u003cbr\u003e 17.18Remove \u003cbr\u003e 17.19Replace \u003cbr\u003e 17.20Reverse \u003cbr\u003e 17.21Search \u003cbr\u003e 17.22Set \u003cbr\u003e 17.23Shuffle \u003cbr\u003e 17.24Sort \u003cbr\u003e 17.25Transform \u003cbr\u003e 17.26Unique \u003cbr\u003e 18 Iterators \u003cbr\u003e 18.1 Filter \u003cbr\u003e 19 Sequence Testing \u003cp\u003e\u003c\/p\u003e \u003cp\u003e\u003c\/p\u003e V Memory Concepts \u003cp\u003e\u003c\/p\u003e 20 Concepts \u003cbr\u003e 21 Allocators \u003cp\u003e\u003c\/p\u003e \u003cp\u003e\u003c\/p\u003e VI Matrix \u003cp\u003e\u003c\/p\u003e 22 Matrix Base \u003cbr\u003e 23 Slice Iterator \u003cbr\u003e 24 Matrix \u003cbr\u003e 25 Matrix Reference \u003cbr\u003e 26 Matrix Operations \u003cbr\u003e 27 Slice \u003cbr\u003e 28 Support Operations \u003cbr\u003e 29 Matrix Traits \u003cbr\u003e 30 Matrix \u003cbr\u003e 30.1 1D Matrix \u003cbr\u003e 30.2 2D Matrix \u003cbr\u003e 30.3 3D Matrix \u003cbr\u003e 30.4 Matrix \u003cbr\u003e 30.5 Matrix Operations \u003cbr\u003e 30.6 Slice Operations \u003cbr\u003e 30.7 Solver \u003cp\u003e\u003c\/p\u003e \u003cp\u003e\u003c\/p\u003e VII Graph \u003cp\u003e\u003c\/p\u003e 31 Graph Concepts \u003cbr\u003e 32 Interface And Predicates \u003cbr\u003e 33 Graph I\/O \u003cbr\u003e 34 Graph Handle \u003cbr\u003e 35 Utilities \u003cbr\u003e 36 Graph Edge \u003cbr\u003e 37 Adjacency List \u003cbr\u003e 37.1 Node Pool \u003cbr\u003e 37.2 Directed and Undirected Adjacency List \u003cbr\u003e 37.3 Directed and Undirected Adjacency Vector \u003cp\u003e\u003c\/p\u003e \u003cp\u003e\u003c\/p\u003e VIII Data \u003cp\u003e\u003c\/p\u003e 38 Container Concepts \u003cbr\u003e 39 Optional Qualifier","brand":"Createspace Independent Publishing Platform","offers":[{"title":"Paperback","offer_id":45504602669207,"sku":"9781484111543","price":3581.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0666\/3471\/1191\/files\/9781484111543.webp?v=1767455572","url":"https:\/\/atlanticbooks.com\/products\/generic-algorithms-and-data-structures-using-c-11-origin-future-of-boost-c-libraries-9781484111543","provider":"Atlantic Books","version":"1.0","type":"link"}