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

  • Mastering the C++17 STL
  • Arthur O'Dwyer
  • 404字
  • 2021-07-08 10:20:25

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.

主站蜘蛛池模板: 临澧县| 绍兴县| 育儿| 南靖县| 松桃| 平塘县| 榆树市| 岗巴县| 定安县| 吉首市| 湛江市| 镇沅| 阿尔山市| 洪湖市| 昭通市| 黄大仙区| 日喀则市| 营山县| 房山区| 平和县| 海安县| 海林市| 同江市| 英吉沙县| 德钦县| 沁水县| 韩城市| 天等县| 荆门市| 乌拉特前旗| 延吉市| 高青县| 泰宁县| 通州市| 时尚| 芜湖市| 兰坪| 遂平县| 米林县| 清河县| 北京市|