5. Effective Data Structures beyond STL | Learning Boost C++

Sign In Start Free Trial

Book Overview & Buying
Table Of Contents
Feedback & Rating

Learning Boost C++

By : Mukherjee

4.5 (2)

Learning Boost C++

4.5 (2)

By: Mukherjee

Overview of this book

If you are a C++ programmer who has never used Boost libraries before, this book will get you up-to-speed with using them. Whether you are developing new C++ software or maintaining existing code written using Boost libraries, this hands-on introduction will help you decide on the right library and techniques to solve your practical programming problems.

Preface

Preface

What this book covers

What you need for this book

Who this book is for

Conventions

Reader feedback

Customer support

Free Chapter

1. Introducing Boost

1. Introducing Boost

How it all started

What is Boost?

Getting started with Boost libraries

Self-test questions

Summary

2. The First Brush with Boost's Utilities

2. The First Brush with Boost's Utilities

Simple data structures

Working with heterogeneous values

Handling command-line arguments

Other utilities and compile-time checks

Self-test questions

Summary

References

3. Memory Management and Exception Safety

3. Memory Management and Exception Safety

Dynamic memory allocation and exception safety

Smart pointers

Self-test questions

Summary

References

4. Working with Strings

4. Working with Strings

Text processing with Boost String Algorithms library

Splitting text using the Boost Tokenizer library

Regular expressions using Boost.Regex

Self-test questions

Summary

5. Effective Data Structures beyond STL

5. Effective Data Structures beyond STL

Boost Container library

Fast lookups using Boost Unordered containers

Containers for dynamically-allocated objects

Expressive initialization and assignment using Boost.Assign

Iteration patterns using Boost.Iterator

Self-test questions

Summary

References

6. Bimap and Multi-index Containers

6. Bimap and Multi-index Containers

Containers for multi-criteria lookups

Boost Multi-index containers

Boost Bimap

Self-test questions

Summary

References

7. Higher Order and Compile-time Programming

7. Higher Order and Compile-time Programming

Higher order programming with Boost

Compile-time programming with Boost

Domain Specific Embedded Languages

Self-test questions

Summary

References

8. Date and Time Libraries

8. Date and Time Libraries

Date and time calculations with Boost Date Time

Using Chrono to measure time

Measuring program performance using Boost Timer

Self-test questions

Summary

References

9. Files, Directories, and IOStreams

9. Files, Directories, and IOStreams

Managing files and directories with Boost Filesystem

Extensible I/O with Boost IOStreams

Self-test questions

Summary

10. Concurrency with Boost

10. Concurrency with Boost

Creating concurrent tasks with Boost Thread

Managing shared data

Boost Coroutine

Self-test questions

Summary

References

11. Network Programming Using Boost Asio

11. Network Programming Using Boost Asio

Task execution with Asio

Network I/O using Asio

Self-test questions

Summary

References

A. C++11 Language Features Emulation

A. C++11 Language Features Emulation

RAII

Copy semantics

Move semantics and rvalue references

C++11 auto and Boost.Auto

Range-based for-loops

C++11 exception-handling improvements

Self-test questions

References

Index

Index

Customer Reviews

4.5 (2)

5 star

50%

4 star

50%

3 star

0%

2 star

0%

1 star

0%

Fast lookups using Boost Unordered containers

The four standard associative containers in C++03: std::set, std::map, std::multiset, and std::multimap are ordered containers and store their keys in some sorted order using balanced binary search trees. They require an ordering relationship to be defined for their keys and provide logarithmic complexity insertions and lookups. Given the ordering relationship and two keys, A and B, we can determine whether A precedes B or B precedes A in the relationship. If neither precedes the other, the keys A and B are said to be equivalent; this does not mean A and B are equal. In fact, the ordered containers are agnostic to equality and there need not be a notion of equality defined at all. This is the reason, such a relation is called a strict weak ordering.

Consider the following example:

 1 #include <string>
 2 #include <tuple>
 3 
 4 struct Person  {
 5   std::string name;
 6   int age;
 7   std::string profession;
 8   std::string nationality...

Visually different images

CONTINUE READING

83

Tech Concepts

36

Programming languages

73

Tech Tools

Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.

Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.

50+ new titles added per month and exclusive early access to books as they are being written.

Learning Boost C++

Search

Your notes and bookmarks