Buy Foundation of Algorithms in C++11, Volume 1(third Edition)
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer programming / software engineering > Programming and scripting languages: general > Foundation of Algorithms in C++11, Volume 1(third Edition): Using and Extending C++11, Boost and Beyond(Algocoders)
Foundation of Algorithms in C++11, Volume 1(third Edition): Using and Extending C++11, Boost and Beyond(Algocoders)

Foundation of Algorithms in C++11, Volume 1(third Edition): Using and Extending C++11, Boost and Beyond(Algocoders)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

This book is vital to understand and extend the C++11 Algorithms by carefully worked out synthesis of language and library features with an eye at future evolution with special emphasis to: Template Alias constexpr copy_backward requires std:: enable_if: SFINAE Private Cast Type Functions Type Traits Explicit Template Instantiations and Specializations Trailing Return Type auto type specifier Intermediate Traits Idiom Value Type Deduction Framework Target Audience This book can be read by anyone having some experience in any higher level programming. Beginners in C++ will be able to learn basic concepts of C++11 with practical examples. Intermediate programmers in C++ will learn foundational aspect of C++11 advanced concepts in a pragmatic way. Expert programmers(aka C++ hackers) can enjoy evolutionary ideas leading to future of C++11(aka C++1y), Boost and beyond. This book or booklet is an attempt to voice our understanding of foundation of algorithms newly introduced in C++11 from programmers' perspective who wish to keep themselves abreast with latest advent in C++ and beyond, but quite often than less, find themselves amidst a myriad of disconnecting information, simply due to sheer size of tremendous information available at hands reach, leading to a vast array of tips n techniques. Nonetheless, when it comes to applying same to their day-to-day problems, they end up struggling a lot to find the apt one. This is the very first of this series which is out as promised above! We have adopted a top-down approach to instil our notes in a cohesive manner. The style is pedagogical: we took an algorithm, newly introduced in C++11, looked at its usage, patterns, limitations, corner-cases, preconditions, post-conditions, constraints etc. while keeping a close eye on the interface, its possible evolution in ongoing works like the Origin C++ Libraries by Andrew Sutton, Contract++, A Concept Design of the STL by Bjarne Stroustrup et al. and other efforts to port boost libraries to C++11 as well as works at libcxx and libstdc++ with focus on C++11. We tried to present a coherent approach to address the needs of programmers like us, who are keenly interested to apply these at work, with little or less risk, without indulging deep into the internals of intermediate evolution.

About the Author :
Chandrashekhar Kumar holds a degree in Integrated M.Sc.(5 yrs) in Physics from IIT Kanpur. He has been programming in C++ since last 13 years. He loves to hack gcc, gdb, valgrind, clang, boost, TeX and pours inside the works of Knuth. Aditya Kant Sharma holds a B.Tech. degree from MITS-G. He has been programming in C++ since last 9 years. He loves to dive inside the internals of C++, Templates hijacking, STL, Boost, Loki, Design Patterns, LaTeX. He is at the forefront of spearheading ruminations on C++11 and beyond.


Best Sellers


Product Details
  • ISBN-13: 9781482353488
  • Publisher: Createspace
  • Publisher Imprint: Createspace
  • Height: 229 mm
  • No of Pages: 215
  • Series Title: Algocoders
  • Sub Title: Using and Extending C++11, Boost and Beyond
  • Width: 152 mm
  • ISBN-10: 1482353482
  • Publisher Date: 03 Feb 2013
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Spine Width: 13 mm
  • Weight: 327 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Foundation of Algorithms in C++11, Volume 1(third Edition): Using and Extending C++11, Boost and Beyond(Algocoders)
Createspace -
Foundation of Algorithms in C++11, Volume 1(third Edition): Using and Extending C++11, Boost and Beyond(Algocoders)
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.

Foundation of Algorithms in C++11, Volume 1(third Edition): Using and Extending C++11, Boost and Beyond(Algocoders)

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


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!