We hope that this view will lead to parallelizable data-store operations. Since iterating through the structure sequentially is STL's most basic operation, it is not easy to develop a distributed structure. But we can make use of the ideas behind STL to develop a special purpose generic library for distributable object stores. We do not distinguish between the abstraction of iterators and containers. By not specifying how containers are processed, we make parallelization much simpler.
Containers are data structures which store elements of a certain kind.
You can insert and remove elements. You can apply a function to all elements stored. You can also test whether an element is in the container or not. Some implementations may rely on hints about the maximum or average number of elements the container can hold. You can pass this number when initializing the container.