官术网_书友最值得收藏!

The notion of ownership

When we say that object A owns object B, what we mean is that object A manages the lifetime of object B--that A controls the construction, copying, moving, and destruction of object B. The user of object A can (and should) "forget about" managing B (for example, via explicit calls to delete B, fclose(B), and so on).

The simplest way for an object A to "own" an object B is for B to be a member variable of A. For example:

    struct owning_A {
B b_;
};

struct non_owning_A {
B& b_;
};

void test()
{
B b;

// a1 takes ownership of [a copy of] b.
owning_A a1 { b };

// a2 merely holds a reference to b;
// a2 doesn't own b.
non_owning_A a2 { b };
}

Another way is for A to hold a pointer to B, with the appropriate code in ~A() (and, if necessary, in the copy and move operations of A) to clean up the resources associated with that pointer:

    struct owning_A {
B *b_;

explicit owning_A(B *b) : b_(b) {}

owning_A(owning_A&& other) : b_(other.b_) {
other.b_ = nullptr;
}

owning_A& operator= (owning_A&& other) {
delete b_;
b_ = other.b_;
other.b_ = nullptr;
return *this;
}

~owning_A() {
delete b_;
}
};

struct non_owning_A {
B *b_;
};

void test()
{
B *b = new B;

// a1 takes ownership of *b.
owning_A a1 { b };

// a2 merely holds a pointer to *b;
// a2 doesn't own *b.
non_owning_A a2 { b };
}

The notion of ownership is tightly bound up with the C++-specific catchphrase Resource Allocation Is Initialization, which you will often see abbreviated as RAII. (That cumbersome abbreviation should properly have been more like "Resource Freeing Is Destruction", but that acronym was taken.)

The goal of the standard container classes is to provide access to a particular bunch of data objects B, while making sure that the ownership of those objects is always clear--namely, a container always has ownership of its data elements. (Contrariwise, an iterator, or a pair of iterators defining a range, never owns its data elements; we saw in Chapter 3, The Iterator-Pair Algorithms, that the standard iterator-based algorithms such as std::remove_if never actually deallocate any elements, but instead simply permute the values of the elements in various ways.)

In the remainder of this chapter, we'll explore the various standard container classes.

主站蜘蛛池模板: 建昌县| 古蔺县| 罗平县| 施甸县| 阜新| 南安市| 德庆县| 梁河县| 措美县| 新邵县| 通江县| 穆棱市| 霍山县| 太和县| 穆棱市| 榆树市| 榆树市| 廊坊市| 赤峰市| 布尔津县| 锡林浩特市| 沂南县| 淄博市| 林口县| 广宁县| 隆安县| 神农架林区| 定边县| 兴业县| 黑山县| 霍州市| 夏津县| 恭城| 岐山县| 上高县| 崇信县| 娄底市| 浦东新区| 察隅县| 梧州市| 唐山市|