23%
Designing Components with the C++ STL: A new approach to programming

Designing Components with the C++ STL: A new approach to programming

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

'This book is the most accurate and up-to-date source of information on the STL currently available. ! It has an approach and appeal of its own: it explains techniques for building data structures and algorithms on top of the STL, and in this way appreciates the STL for what it is -- a framework.' - Angelika Langer, Independent Consultant and C++ Report Columnist "A superbly authored treatment of the STL...an excellent book which belongs in any serious C++ developer's library." - Jim Armstrong, President 2112 F/X, Texas. The C++ Standard Template Library (STL) represents a breakthrough in C++ programming techniques. With it, software developers can achieve vast improvements in the reliability of their software, and increase their own productivity. Designing Components with the C++ STL has three aims: / to introduce the reader to the STL / to show how this powerful resource can be exploited / to extend its use to the construction of new components. This revised edition is fully compliant with the new ISO/IEC C++ Standard with an associated web site containing numerous, fully up-to-date examples for downloading.The author shows how to make practical use of the STL through a wealth of examples and by drawing on his extensive experience and knowledge gained working with the C++ Standardization Committee. Unique insight into the internals of the STL takes the reader beyond simply using it, to show how the components supplied in the STL can be used to design more complex data structures and algorithms, and powerful abstract data types. Throughout, the author maintains an elegant and sophisticated coding style, adhering faithfully to the current ISO/ANSI standards, helping to ensure that your software will be even more portable, maintainable and reusable than ever.

Table of Contents:
Foreword vii. Preface ix. I. INTRODUCTION. 1. The concept of the C++ Standard Template Library (STL). Genericity of components. Abstract and implicit data types. The fundamental concept. Containers. Iterators. Algorithms. Interplay. Internal functioning. Complexity. O notation. Omega notation. = Auxiliary classes and functions. Pairs. Comparison operators. Function objects. Function adapters. Some conventions. = Namespaces. = Header files. Allocators. 2. Iterators. Iterator properties. States. Standard iterator and traits classes. Distances. Categories. Reverse iterators. Tag classes. Stream iterators. Istream iterator. Ostream iterator. 3. Containers. Data type interface. Container methods. Reversible containers. Sequences. Vector. List. Deque. showSequence. Iterator categories and containers. Derivation of value and distance types. Inheriting iterator properties. Iterators for insertion into containers. 4. Abstract data types. Stack. Queue. Priority queue. Sorted associative containers. Set. Multiset. Map. Multimap. II ALGORITHMS. 5. Standard algorithms. Copying algorithms. Algorithms with predicates. Algorithms with binary predicates. Nonmutating sequence operations. for_each. find und find_if. find_end. find_first_of. adjacent_find. count and count_if. mismatch. equal. search. search_n. Mutating sequence operations. iota. copy and copy_backward. copy_if. swap, iter_swap and swap_ranges. transform. replace and variants. fill and fill_n. generate and generate_n. remove and variants. unique. reverse. rotate. random_shuffle. partition. Sorting, merging, and related operations. sort. nth_element. Binary search. Merging. Set operations on sorted structures. includes. set_union. set_intersection. set_difference. set_symmetric_difference. Conditions and limitations. Heap algorithms. pop_heap. push_heap. make_heap. sort_heap. Minimum and maximum. Lexikographical comparison. Permutations. Numeric algorithms. accumulate. inner_product. partial_sum. adjacent_difference. III BEYOND THE STL: COMPONENTS AND APPLICATIONS. 6. Set operations on associative containers. Subset relation. Union. Intersection. Difference. Symmetric difference. Example. 7. Fast associative containers. Fundamentals. Collision handling. Map. Example. Set. Overloaded operators for sets. Union. Intersection. Difference. Symmetric difference. Example. 8. Various applications. Cross-reference. Permuted index. Thesaurus. 9. Vectors and matrices. Checked vectors. Matrices as nested containers. Two-dimensional matrices. Three-dimensional matrices. Generalization. Matrices for different memory models. C memory layout. FORTRAN memory layout. Memory layout for symmetric matrices. Sparse matrices. Index operator and assignment. Hash function for index pairs. Class MatrixElement. Class sparseMatrix. Run time measurements. 10. External sorting. 1@AHEADS = External sorting by merging. 1@AHEADS = External sorting with accelerator. 11. Graphs. Class Graph. Insertion of vertices and edges. Analysis of a graph. Input and output tools. Dynamic priority queue. Data structure. Class dynamic_priority_queue. Graph algorithms. Shortest paths. Topological sorting of a gra


Best Sellers


Product Details
  • ISBN-13: 9780201674880
  • Publisher: Pearson Education Limited
  • Publisher Imprint: Addison Wesley
  • Edition: 2 Rev ed
  • Language: English
  • Returnable: N
  • Sub Title: A new approach to programming
  • Width: 176 mm
  • ISBN-10: 0201674882
  • Publisher Date: 17 Nov 1999
  • Binding: Paperback
  • Height: 242 mm
  • No of Pages: 320
  • Spine Width: 19 mm
  • Weight: 580 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Designing Components with the C++ STL: A new approach to programming
Pearson Education Limited -
Designing Components with the C++ STL: A new approach to programming
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Designing Components with the C++ STL: A new approach to programming

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA