2. Boost Beast Translation (zh_Hans)
3. English
4. Zen

5 string ID 16
	Source string description type: variablelist cell
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — "Beast does not offer an HTTP client?" 38/10000 · 38
5 string ID 22
	Source string description type: list
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — * Mimic __Asio__; familiarity breeds confidence. 48/10000 · 48
5 string ID 40
	Source string description type: list
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — * `x` is a series of octets describing a valid HTTP message in 62/10000 · 62
5 string ID 28
	Source string description type: paragraph
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The assessment team conducted a hybrid application assessment of the Beast library. Bishop Fox’s hybrid application assessment methodology leverages the real-world attack techniques of application penetration testing in combination with targeted source code review to thoroughly identify application security vulnerabilities. These fullknowledge assessments begin with automated scans of the deployed application and source code. Next, analyses of the scan results are combined with manual review to thoroughly identify potential application security vulnerabilities. In addition, the team performs a review of the application architecture and business logic to locate any design-level issues. Finally, the team performs manual exploitation and review of these issues to validate the findings. 793/10000 · 793
5 string ID 23
	Source string description type: paragraph
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — File: [path_link example/http/client/sync/http_client_sync.cpp http_sync_client.cpp] 84/10000 · 84
5 string ID 22
	Source string description type: list
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — * [*Ease of Use:] __Asio__ users will immediately understand Beast. 67/10000 · 67
21 string ID 21
	Source string description type: table cell
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Description 11/10000 · 11
5 string ID 46
	Source string description type: paragraph
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — For portability reasons, networking does not provide timeouts 61/10000 · 61
5 string ID 17
	Source string description type: table cell
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Description 11/10000 · 11
5 string ID 26
	Source string description type: list
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — * [@boost:/doc/html/boost_asio/reference/ssl__context/add_certificate_authority.html `net::ssl::context::add_certificate_authority`] * [@boost:/doc/html/boost_asio/reference/ssl__context/add_verify_path.html `net::ssl::context::add_verify_path`] * [@boost:/doc/html/boost_asio/reference/ssl__context/load_verify_file.html `net::ssl::context::load_verify_file`] * [@boost:/doc/html/boost_asio/reference/ssl__context/set_default_verify_paths.html `net::ssl::context::set_default_verify_paths`] 491/10000 · 491
5 string ID 44
	Source string description type: table title
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Asynchronous Helpers 20/10000 · 20
5 string ID 33
	Source string description type: paragraph
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The implementation strategy is to make the composed object meet the requirements of a completion handler by being movable, and by making it invocable so it can be used as a continuation for the asynchronous operations it launches. Rather than using `std::bind` or `boost::bind`, which destroys the type information and therefore breaks the associators, we will simply pass `std::move(*this)` as the completion handler parameter for any operations that we initiate. For the move to work correctly, care must be taken to ensure that no access to data members are made after the move takes place. Here is the complete implementation of our composed operation: 656/10000 · 656
5 string ID 21
	Source string description type: table cell
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Namespace and Header Example 28/10000 · 28
5 string ID 37
	Source string description type: paragraph
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Higher level abstractions can be developed in this fashion by nesting stream layers to arbitrary degree. The stack of stream layers effectively forms a compile-time singly linked list. The object at the end of this list is called the ['lowest layer], and is special from the others because it typically represents the underlying socket. 336/10000 · 336
5 string ID 19
	Source string description type: table cell
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Description 11/10000 · 11
5 string ID 48
	Source string description type: paragraph
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A vendor supplies a program called a [@https://en.wikipedia.org/wiki/Device_driver ['device driver]], enabling networking hardware such as an [@https://en.wikipedia.org/wiki/Network_interface_controller ['ethernet adaptor]] to talk to the operating system. This in turn permits running programs to interact with networking using various flavors of interfaces such as [@https://en.wikipedia.org/wiki/Berkeley_sockets ['Berkeley sockets]] or [@https://en.wikipedia.org/wiki/Winsock ['Windows Sockets 2]] ("Winsock"). 514/10000 · 514
5 string ID 33
	Source string description type: list
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — * The HTTP message has a `Content-Length` header, and the body is fully 71/10000 · 71
21 string ID 21
	Source string description type: table cell
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Description 11/10000 · 11
5 string ID 35
	Source string description type: paragraph
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The detection function above is suitably generic and targeted in focus that it may be used as a building block to create higher level abstractions. Our goal is to create a ['stream algorithm]: a function which is invoked with a stream, that reads or writes (or both) to achieve a purpose. In this case, to detect the TLS client handshake. Stream algorithms may be synchronous or asynchronous. Because synchronous algorithms are easier to write, we start there. Then we build the asynchronous version, trying to model it similarly to make reasoning about it easier. 564/10000 · 564
25 string ID 25
	Source string description type: table cell
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — HTTP, synchronous 17/10000 · 17