1. Revision History
1.1. Revision 7 - December 12th, 2024
-
Evaluate several different implementations and talk to several experts about the (now-closed) [p1130] with respect to
.#depend -
Settle on
being exclusively based in translation units as this is both simple and easy to implement. Module export can be added on as a later paper, as described in § 5.3.5 Modules.#depend -
Keep
’s glob syntax and reaffirm the speed of implementation is fine, and that "it’s slow on Windows" is more or less poor programming practices on behalf of folks not willing to use modern Windows/NTFS APIs.#depend -
Choose a specific option for how module behavior works (it is entirely private and local to the module).
-
Provide
andlimit
overloads, withoffset
exact-limit version as well.N
1.2. Revision 6 - March 2nd, 2020
-
Add new section § 2 Relevant Polls.
-
Add new section § 5.3.4 Dependency-Scanning Friendly with #depend.
-
Add new section § 5.3.5 Modules.
-
Improve section § 5.3.6 Statically Polymorphic.
-
Add new section § 5.3.7 Optional Limit.
-
Add new section § 5.3.8 UTF-8 Only.
-
Add new section § 6 Previous Implementations.
-
Improve wording and add static version (thanks, @lichray).
1.3. Revision 5 - January 13th, 2020
-
Split
into a new paper.#embed -
Add memory and time benchmarks from various implementation strategies in the new Current Practice section.
-
Address concerns for a generic API and similar in the new Results Analysis section.
-
Retarget to EWG and SG 7.
1.4. Revision 4 - November 26th, 2018
-
Wording is now relative to [n4778].
-
Minor typo and tweak fixes.
1.5. Revision 3 - November 26th, 2018
-
Change to using
.consteval -
Discuss potential issues with accessing resources after full semantic analysis is performed. Prepare to poll Evolution Working Group. Reference new paper, [p1130], about resource management.
1.6. Revision 2 - October 10th, 2018
-
Destroy
andembed_options
options: if the function is materialized only at compile-time throughalignment
or the upcoming "immediate functions" (constexpr
), there is no reason to make this part of the function. Instead, the user can choose their own alignment when they pin this down into a std::array or some form of C array / C++ storage.constexpr !
1.7. Revision 1 - June 10th, 2018
-
Create future directions section, follow up on Library Evolution Working Group comments.
-
Change
tostd :: embed_options :: null_terminated
.std :: embed_options :: null_terminate -
Add more code demonstrating the old way and motivating examples.
-
Incorporate LEWG feedback, particularly alignment requirements illuminated by Odin Holmes and Niall Douglass. Add a feature macro on top of having
.__has_include ( < embed > )
1.8. Revision 0 - May 11th, 2018
Initial release.
2. Relevant Polls
The following polls are shaping the current design. Votes are in the form of SF (Strongly in Favor), F (in Favor), N (Neutral), A (Against), SA (Strongly Against).
- We would like to have this feature in C++(Something) and spend time figuring out the details.
-
SF F N A SA -
14 13 2 0 0 -
Consensus: Do more work.
- We want recursive globs (recursively searching through directories) for #depend.
-
SF F N A SA -
2 3 9 12 4 -
Consensus: Do not want.
-
Vote Commentary:
-
A: Complexity?
-
SA: Windows is slow with recursive globs.
-
It should be mandatory that EVERY file for
is specified by a
.
-
SF F N A SA -
4 12 5 6 3 -
Consensus: Split, no consensus. Add why/why not.
-
Vote Commentary:
-
SF: This MUST exist. Both compiler and build system authors. (Implementers.)
-
SA: Can make user experience sad face for common case. Build system should scream at you for making the mistake instead.
-
should form a Virtual File System / String Table State that constrains the search and should be passed to std::embed.
-
SF F N A SA -
3 11 7 2 2 -
Consensus: Do it.
-
Vote Commentary:
-
SA: Hell to implement. (This was the author.)
-
Make std::embed ill-formed inside of a module interface (with a plan to revisit later).
-
SF F N A SA
-
4 2 7 1 1
-
Consensus: Yes, but Meh.
-
Vote Commentary:
-
SA: Modules are important we should make sure it interacts well with modules (figure it out now).
-
SF: How does this work with #depend ?
-
SF: std::embed is basically a #include -- why would we want it in interface? Just focus on getting feature working and doing it well.
-
A: Jumping the gun. Space needs more exploration.
-
N: We are highly undecided - need to answer more questions (especially about Modules).
-
3. Motivation
I’m very keen on std::embed. I’ve been hand-embedding data in executables for NEARLY FORTY YEARS now. — Guy "Hatcat" Davidson, June 15, 2018
Currently | With Proposal |
---|---|
|
|
|
|
A very large amount of C and C++ programmer -- at some point -- attempts to
large chunks of non-C++ data into their code. Of course,
expects the format of the data to be source code, and thusly the program fails with spectacular lexer errors. Thusly, many different tools and practices were adapted to handle this, as far back as 1995 with the
tool. Many industries need such functionality, including (but hardly limited to):
-
Financial Development
-
representing coefficients and numeric constants for performance-critical algorithms;
-
-
Game Development
-
assets that do not change at runtime, such as icons, fixed textures and other data;
-
Shader and scripting code;
-
-
Embedded Development
-
storing large chunks of binary, such as firmware, in a well-compressed format;
-
placing data in memory on chips and systems that do not have an operating system or file system;
-
-
Application Development
-
compressed binary blobs representing data
-
non-C++ script code that is not changed at runtime;
-
-
Server Development
-
configuration parameters which are known at build-time and are baked in to set limits and give compile-time information to tweak performance under certain loads;
-
SSL/TLS Certificates hard-coded into your executable (requiring a rebuild and potential authorization before deploying new certificates), and;
-
-
Static Analyzers
-
Static analyzers suffer -- much like their binary code generating friends -- from having to parse extremely large array literals;
-
Reduces memory pressure and enables better information tracking and potential sanitization (file source is not lost in build system).
-
In the pursuit of this goal, these tools have proven to have inadequacies and contribute poorly to the C++ development cycle as it continues to scale up for larger and better low-end devices and high-performance machines, bogging developers down with menial build tasks and trying to cover-up disappointing differences between platforms. It also absolutely destroys state-of-the-art compilers due to the extremely high memory overhead of producing an Abstract Syntax Tree for a braced initializer list of several tens of thousands of integral constants with numeric values at 255 or less.
The request for some form of
or similar dates back quite a long time, with one of the oldest stack overflow questions asked-and-answered about it dating back nearly 10 years. Predating even that is a plethora of mailing list posts and forum posts asking how to get script code and other things that are not likely to change into the binary.
This paper proposes
to make this process much more efficient, portable, and streamlined.
4. Scope and Impact
is an extension to the language proposed entirely as a library construct. The goal is to have it implemented with compiler intrinsics, builtins, or other suitable mechanisms. It does not affect the language. The proposed header to expose this functionality is
, making the feature entirely-opt-in by checking if either the proposed feature test macro or header exists.
5. Design Decisions
avoids using the preprocessor or defining new string literal syntax like its predecessors, preferring the use of a free function in the
namespace. This gives
a greater degree of power and advantage over
’s design is derived heavily from community feedback plus the rejection of the prior art up to this point, as well as the community needs demonstrated by existing practice and their pit falls.
5.1. Implementation Experience & Current Practice
Here, we examine current practice, their benefits, and their pitfalls. There are a few cross-platform (and not-so-cross-platform) paths for getting data into an executable. We also scrutinize the performance, with numbers for both memory overhead and speed overhead available at the repository that houses the current implementation. For ease of access, the numbers as of January 2020 with the latest versions of the indicated compilers and tools are replicated below.
All three major implementations were explored, plus an early implementation of this functionality in GCC. A competing implementation in a separate C++-like meta language called Circle was also looked at by the behest of Study Group 7.
5.1.1. Speed Results
Below are timing results for a file of random bytes using a specific strategy. The file is of the size specified at the top of the column. Files are kept the same between strategies and tests.
-
Intel Core i7-6700HQ @ 2.60 GHz
-
24.0 GB RAM 2952 MHz
-
Debian Sid or Windows 10
-
Method: Gather timings from
*nix program ortime
PowerShell, compute meanMeasure - Command { ... }
Strategy | 4 bytes | 40 bytes | 400 bytes | 4 kilobytes |
---|---|---|---|---|
GCC
| 0.201 s | 0.208 s | 0.207 s | 0.218 s |
GCC
| 0.709 s | 0.724 s | 0.711 s | 0.715 s |
-generated GCC
| 0.225 s | 0.215 s | 0.237 s | 0.247 s |
-generated Clang
| 0.272 s | 0.275 s | 0.272 s | 0.272 s |
-generated MSVC
| 0.204 s | 0.229 s | 0.209 s | 0.232 s |
Circle @
| 0.353 s | 0.359 s | 0.361 s | 0.361 s |
Circle @
| 0.199 s | 0.208 s | 0.204 s | 0.368 s |
(linker)
| 0.501 s | 0.482 s | 0.519 s | 0.527 s |
Strategy | 40 kilobytes | 400 kilobytes | 4 megabytes | 40 megabytes |
---|---|---|---|---|
GCC
| 0.236 s | 0.231 s | 0.300 s | 1.069 s |
GCC
| 0.705 s | 0.713 s | 0.772 s | 1.135 s |
-generated GCC
| 0.406 s | 2.135 s | 23.567 s | 225.290 s |
-generated Clang
| 0.366 s | 1.063 s | 8.309 s | 83.250 s |
-generated MSVC
| 0.552 s | 3.806 s | 52.397 s | Out of Memory |
Circle @
| 0.353 s | 0.363 s | 0.421 s | 0.585 s |
Circle @
| 0.238 s | 0.199 s | 0.219 s | 0.368 s |
(linker)
| 0.500 s | 0.497 s | 0.555 s | 2.183 s |
Strategy | 400 megabytes | 1 gigabyte |
---|---|---|
GCC
| 9.803 s | 26.383 s |
GCC
| 4.170 s | 11.887 s |
-generated GCC
| Out of Memory | Out of Memory |
-generated Clang
| Out of Memory | Out of Memory |
-generated MSVC
| Out of Memory | Out of Memory |
Circle @
| 2.655 s | 6.023 s |
Circle @
| 1.886 s | 4.762 s |
(linker)
| 22.654 s | 58.204 s |
5.1.2. Memory Size Results
Below is the peak memory usage (heap usage) for a file of random bytes using a specific strategy. The file is of the size specified at the top of the column. Files are kept the same between strategies and tests.
-
Intel Core i7-6700HQ @ 2.60 GHz
-
24.0 GB RAM 2952 MHz
-
Debian Sid or Windows 10
-
Method:
or Execute command hundreds of times, stare at Task Manager/ usr / bin / time - v
Strategy | 4 bytes | 40 bytes | 400 bytes | 4 kilobytes |
---|---|---|---|---|
GCC
| 17.26 MB | 17.26 MB | 17.26 MB | 17.27 MB |
GCC
| 38.82 MB | 38.77 MB | 38.80 MB | 38.80 MB |
-generated GCC
| 17.26 MB | 17.26 MB | 17.26 MB | 17.27 MB |
-generated Clang
| 35.12 MB | 35.22 MB | 35.31 MB | 35.88 MB |
-generated MSVC
| < 30.00 MB | < 30.00 MB | < 33.00 MB | < 38.00 MB |
Circle @
| 53.56 MB | 53.60 MB | 53.53 MB | 53.88 MB |
Circle @
| 33.35 MB | 33.34 MB | 33.34 MB | 33.35 MB |
(linker)
| 17.32 MB | 17.31 MB | 17.31 MB | 17.31 MB |
Strategy | 40 kilobytes | 400 kilobytes | 4 megabytes | 40 megabytes |
---|---|---|---|---|
GCC
| 17.26 MB | 17.96 MB | 53.42 MB | 341.72 MB |
GCC
| 38.80 MB | 40.10 MB | 59.06 MB | 208.52 MB |
-generated GCC
| 24.85 MB | 134.34 MB | 1,347.00 MB | 12,622.00 MB |
-generated Clang
| 41.83 MB | 103.76 MB | 718.00 MB | 7,116.00 MB |
-generated MSVC
| ~48.60 MB | ~477.30 MB | ~5,280.00 MB | Out of Memory |
Circle @
| 53.69 MB | 54.73 MB | 65.88 MB | 176.44 MB |
Circle @
| 33.34 MB | 33.34 MB | 39.41 MB | 113.12 MB |
(linker)
| 17.31 MB | 17.31 MB | 17.31 MB | 57.13 MB |
Strategy | 400 megabytes | 1 gigabyte |
---|---|---|
GCC
| 3,995.34 MB | 9,795.31 MB |
GCC
| 1,494.66 MB | 5,279.37 MB |
-generated GCC
| Out of Memory | Out of Memory |
-generated Clang
| Out of Memory | Out of Memory |
-generated MSVC
| Out of Memory | Out of Memory |
Circle @
| 1,282.34 MB | 3,199.28 MB |
Circle @
| 850.40 MB | 2,128.36 MB |
(linker)
| 425.77 MB | 1,064.74 MB |
5.1.3. Results Analysis
The above clearly demonstrates the superiority of
over latest optimized trunk builds of various compilers. It is also notable that originally the Circle language did not have an @
keyword, but it was added in December 2019. When the compiler author was spoken to about Study Group 7’s aspirations for a more generic way of representing data from a file, the ultimate response was this:
I’ll add a new @embed keyword that takes a type and a file path and loads the file and embeds it into an array prvalue of that type. This will cut out the interpreter and it’ll run at max speed. Feed back like this is good. This is super low-hanging fruit.
It was Circle’s conclusion that a generic API was unsuitable and suffered from the same performance pitfalls that currently plagued current-generation compilers today. And it was SG7’s insistence that a more generic API would be suitable, modeled on Circle’s principles. Given that thorough exploration of the design space in Circle led to the same conclusion this proposal is making, and given the wide variety of languages providing a similar interface (D, Nim, Rust, etc.), it is clear that a more generic API is not desirable for functionality as fundamental and simple as this. This does not preclude a more generic solution being created, but it does prioritize the "Bird in the Hand" approach that the Direction Group and Bjarne Stroustrup have advocated for many times.
Furthermore, inspecting compiler bug reports around this subject area reveal that this is not the first time GCC has suffered monumental memory blowup over unoptimized representation of data. In fact, this is a 16+ year old problem that GCC has been struggling with for a long time now (C++ version here). That the above numbers is nearing the best that can be afforded by some of the most passionate volunteers and experts curating an extremely large codebase should be testament to how hard the language is this area for compiler developers, and how painful it is for regular developers using their tools.
Clang, while having a better data representation and more optimized structures at its disposal, is similarly constrained. With significant implementation work, they are deeply constrained in what they can do:
It might be possible to introduce some sort of optimized representation specifically for initializer lists. But it would be a big departure from existing AST handling. And it wouldn’t really open up new use cases, given that string literal handling is already reasonably efficient.
Is this really the best use of compiler developer energy?
To provide a backdrop against which a big departure from current AST handling in can be compared, an implementation of the built-in necessary for this proposal is -- for an experienced developer -- at most a few day’s work in either GCC or Clang. Other compiler engineers have reported similar ease of implementation and integration. Should this really be delegated to Quality of Implementation that will be need to be solved N times over by every implementation in their own particularly special way? Chipping away at what is essentially a fundamental inefficiency required by C++'s inescapable tokenization model from the preprocessor plus the sheer cost of an ever-growing language that makes simple constructs like a brace initializer list of integer constants expensive is, in this paper’s demonstrated opinion, incredibly unwise.
5.1.4. Manual Work
Many developers also hand-wrap their files in (raw) string literals, or similar to massage their data -- binary or not -- into a conforming representation that can be parsed at source code:
-
Have a file
with some data, for example:data . json
{ "Hello" : "World!" }
-
Mangle that file with raw string literals, and save it as
:raw_include_data . h
R" json({ "Hello": "World!" } )json"
-
Include it into a variable, optionally made
, and use it in the program:constexpr
#include <iostream>#include <string_view>int main () { constexpr std :: string_view json_view = #include "raw_include_data.h"; // { "Hello": "World!" } std :: cout << json_view << std :: endl ; return 0 ; }
This happens often in the case of people who have not yet taken the "add a build step" mantra to heart. The biggest problem is that the above C++-ready source file is no longer valid in as its original representation, meaning the file as-is cannot be passed to any validation tools, schema checkers, or otherwise. This hurts the portability and interop story of C++ with other tools and languages.
Furthermore, if the string literal is too big vendors such as VC++ will hard error the build (example from Nonius, benchmarking framework).
5.1.5. Processing Tools
Other developers use pre-processors for data that can’t be easily hacked into a C++ source-code appropriate state (e.g., binary). The most popular one is
, which outputs an array in a file which developers then include. This is problematic because it turns binary data in C++ source. In many cases, this results in a larger file due to having to restructure the data to fit grammar requirements. It also results in needing an extra build step, which throws any programmer immediately at the mercy of build tools and project management. An example and further analysis can be found in the § 8.1.1 Pre-Processing Tools Alternative and the § 8.1.2 python Alternative section.
5.1.6. ld
, resource files, and other vendor-specific link-time tools
Resource files and other "link time" or post-processing measures have one benefit over the previous method: they are fast to perform in terms of compilation time. A example can be seen in the § 8.1.3 ld Alternative section.
5.1.7. The incbin
tool
There is a tool called [incbin] which is a 3rd party attempt at pulling files in at "assembly time". Its approach is incredibly similar to
, with the caveat that files must be shipped with their binary. It unfortunately falls prey to the same problems of cross-platform woes when dealing with VC++, requiring additional pre-processing to work out in full.
5.2. Prior Art
There has been a lot of discussion over the years in many arenas, from Stack Overflow to mailing lists to meetings with the Committee itself. The latest advancements that had been brought to WG21’s attention was p0373r0 - File String Literals. It proposed the syntax
and
, with a few other amenities, to load files at compilation time. The following is an analysis of the previous proposal.
5.2.1. Literal-Based, constexpr
A user could reasonably assign (or want to assign) the resulting array to a
variable as its expected to be handled like most other string literals. This allowed some degree of compile-time reflection. It is entirely helpful that such file contents be assigned to constexpr: e.g., string literals of JSON being loaded at compile time to be parsed by Ben Deane and Jason Turner in their CppCon 2017 talk, constexpr All The Things.
5.2.2. Literal-Based, Null Terminated (?)
It is unclear whether the resulting array of characters or bytes was to be null terminated. The usage and expression imply that it will be, due to its string-like appearance. However, is adding an additional null terminator fitting for desired usage? From the existing tools and practice (e.g.,
or linking a data-dumped object file), the answer is no: but the syntax
makes the answer seem like a "yes". This is confusing: either the user should be given an explicit choice or the feature should be entirely opt-in.
5.2.3. Encoding
Because the proposal used a string literal, several questions came up as to the actual encoding of the returned information. The author gave both
and
to separate binary versus string-based arrays of returns. Not only did this conflate issues with expectations in the previous section, it also became a heavily contested discussion on both the mailing list group discussion of the original proposal and in the paper itself. This is likely one of the biggest pitfalls between separating "binary" data from "string" data: imbuing an object with string-like properties at translation time provide for all the same hairy questions around source/execution character set and the contents of a literal.
5.3. Design Goals
Because of the aforementioned reasons, it seems more prudent to take a "compiler intrinsic"/"magic function" approach. The function overload takes the form:
template < typename T = byte > consteval span < const T > embed ( string_view resource_identifier ); template < typename T = byte > consteval span < const T > embed ( string_view resource_identifier , size_t limit ); template < typename T = byte > consteval span < const T > embed ( string_view resource_identifier , size_t offset , size_t limit ); template < size_t N , typename T = byte > consteval span < const T , N > embed ( string_view resource_identifier ); template < size_t N , typename T = byte > consteval span < const T > embed ( string_view resource_identifier , size_t offset );
is a
processed in an implementation-defined manner to find and pull resources into C++ at constexpr time.
is the maximum number of elements the function call can produce (but it may produce less). The most obvious source will be the file system, with the intention of having this evaluated as a core constant expression. We do not attempt to restrict the
to a specific subset: whatever the implementation accepts (typically expected to be a relative or absolute file path, but can be other identification scheme), the implementation should use. The
template parameter is for specifying that the returned span has _at least_
elements (to fit in the statically-sized
).
5.3.1. Implementation Defined
Calls such as
,
, and
are meant to be evaluated in a
context (with "core constant expressions" only), where the behavior is implementation-defined. The function has unspecified behavior when evaluated in a non-constexpr context (with the expectation that the implementation will provide a failing diagnostic in these cases). This is similar to how include paths work, albeit
interacts with the programmer through the preprocessor.
There is precedent for specifying library features that are implemented only through compile-time compiler intrinsics (
,
, and similar utilities). Core -- for other proposals such as p0466r1 - Layout-compatibility and Pointer-interconvertibility Traits -- indicated their preference in using a
magic function implemented by intrinsic in the standard library over some form of
construct. However, it is important to note that [p0466r1] proposes type traits, where as this has entirely different functionality, and so its reception and opinions may be different.
Finally, we use "implementation defined" so that compilers can produce implementation-defined search path for their translation units and modules during compilation with flags. The current implementation uses
to indicate this, but when it is standardized there will probably be an
or
flag instead. It is up to the implementation to pick what works for their platform.
5.3.2. Binary Only
Creating two separate forms or options for loading data that is meant to be a "string" always fuels controversy and debate about what the resulting contents should be. The problem is sidestepped entirely by demanding that the resource loaded by
represents the bytes exactly as they come from the resource. This prevents encoding confusion, conversion issues, and other pitfalls related to trying to match the user’s idea of "string" data or non-binary formats. Data is received exactly as it is from the resource as defined by the implementation, whether it is a supposed text file or otherwise.
and
behave exactly the same concerning their treatment of the resource.
5.3.3. Constexpr Compatibility
The entire implementation must be usable in a
context. It is not just for the purposes of processing the data at compile time, but because it matches existing implementations that store strings and huge array literals into a variable via
. These variables can be
: to not have a constexpr implementation is to leave many of the programmers who utilize this behavior without a proper standardized tool.
5.3.4. Dependency-Scanning Friendly with #depend
One of the biggest hurdles to generating consensus was the deep-seated issues with dependency scanning. The model with only dealing with
as a way of adding extra code or data-as-code means that all dependencies -- at the time of compiler invocation -- can be completely and statically known by the end of Phase 4 of compilation. This greatly aided in speedy dependency pulling.
throws a wrench in that model as it can affect the generation of code at Phase 7 time, which is when
is evaluated. By taking a
, it makes it impossible to know all files which may be used by a translation or module unit.
For this purpose, a new
preprocessor directive was introduced. It is intended to inform the compiler which translation units it depends on in order to make it simpler to retrieve all necessary dependencies. An advanced implementation can also replace all
directives with magical compiler builtins which instruct the compiler to cache the file’s data as part of the translation unit.
This makes it possible to send minimal compiler reproductions and test cases for bug vetting, as well as allow distributed systems to continue to use the
or
flags (or similar preprocessor flags). For example, the GCC and Clang implementations linked above have
and
methods that allow single translation units to be self-sufficient, while the compiler built-ins
will search the internally populated data cache from these entries in order to furnish data. This allows a complete system that keeps current tools working exactly as expected without any issues at all.
The
directive works by allowing a user to specify a single-dependency or a family-dependency. They are analogous to a single resource name or a "glob" resource name. These would, in file system terms, name a single file or all the files in a directory (subject to pattern matching). There is also be a "recursive-family-dependency" for specifying searching for files in a directory, recursively. They looked like this:
// single-dependency directives #depend <config/graph.bin> #depend <foo.txt> // family-dependencies // do not "recurse" into directories #depend "art /*" #depend "art/mocks/*.json" // recursive-family-dependency // recurse through directories and similar #depend "assets/**" // mixed: all resources starting with // "translation/", with all files that end in ".po", // that have at least one "/" (one directory) // after the "translation/", found recursively #depend "translation/**/ *.po"
Due to Windows being a pile of garbage for
-style directory iteration, it was voted to remove
as the recursive-family-dependency (see § 2 Relevant Polls). However, the manifest existence of CMake’s new
in conjunction with
very strongly nullifies the arguments brought up during the taking of that poll, which was that build systems could not do this fast enough on certain platforms (such as Windows).
with
was only allowed into CMake after benchmarks proved against conventional wisdom that this could be done swiftly. This was also backed up by the author of Boost’s Low-Level File I/O library. Therefore, we feel compelled to ask the Committee to reconsider this now that there is sufficient data in the positive for such behavior.
uses both the chevron-delimited
and the quote-delimited
formats. This is because one is for resources that are found only on the system / implementation paths similar to
and
, and then one that uses local look up plus the aforementioned resource paths. This can be useful for e.g. files that get embedded from system SDKs, like icons from Windows or Android build-time graphical resources or similar.
5.3.5. Modules
Modules front-load and bring front-and-center one of the largest problems not with
, but with
.
is a Compilation Phase 4 entity: that is, it does not exist beyond the preprocessor. In the world of
, preprocessor commands were resolved that would not exist in the traditional
world, or at least would not have to need immediate answers. In particular, the fact that modules can "save" Phase 4 information before proceeding with the rest of compilation opens interesting questions for Module Interface Units (AKA, the public-facing portion of modules). Module implementation units and other module-related bits are, thankfully, entirely unaffected.
The problem is illustrated most powerfully by the following snippet:
:
export module m0 ; #depend "header.bin" import < embed > ; import combine ; export consteval auto f0 ( std :: string_view f ) { const auto h = std :: embed ( "header.bin" ); const auto t = std :: embed ( f ); return combine ( h , t ); }
:
export module m1 ; #depend "default.stuff" import m0 ; export consteval auto f1 ( std :: string_view f = "default.stuff" ) { return f0 ( f ); } export consteval auto getpath () { return "default.stuff" ; }
:
import m1 ; import ; import < embed > #depend "coolstuff.bin" int main () { ( f1 ( "coolstuff.bin" )); // [0] fails ( f1 ()); // [1] fails std :: embed ( "header.bin" ); // [2] fails std :: embed ( getpath ()); // [3] fails std :: embed ( "coolstuff.bin" ); // [4] ok }
All of
,
,
, and
fail because each of them is trying to access dependencies that are part of translation units outside of the current translation unit. That is: modules do not transfer their dependencies outside of themselves. This seems unnecessarily cruel and hostile, but behaves in this manner to keep the specification simple and implementable. In the future or perhaps in another revision of this paper, additional work can be done to define the relationship in terms of translation units under a module accumulating all of their
s together. There is also some speculation on making such dependencies explicit with an additional form of
like:
:
export module deps ; #depend <sdk/private/**> #depend export <sdk/everything/**>
:
import deps ; int main () { std :: embed ( "sdk/everything/meow.wav" ); // ok std :: embed ( "sdk/private/super_secret_sauce.mix" ); // ill-formed return 0 ; }
This would make the behavior opt-in and predictable. We do not include it in the most recent revision of this paper and plan to talk to SG15 and Modules Experts to craft this wording in a different version of this paper, after getting approval for the core feature and feedback from EWG. We also need to resolve the behavior for
-style header-unit importing. As of right now, no wording is provided for this section with respect to
and resource dependencies, so as of right now importing a module versus importing a header unit does not change much insofar as our limited understanding is concerned.
5.3.6. Statically Polymorphic
While returning
is valuable, it is impossible to
or
certain things at compile time. This makes it impossible in a
context to retrieve the actual data from a resource without tremendous boilerplate and work that every developer will have to do. While compile-time serialization is an important facet of this feature, there are many types where developers will end up just doing their own
-style
of the bits to the target bits: to save on boilerplate, we instead offer the ability to do
, where
can be anything that satisfies trivial destructibility (e.g.,
is true
). This allows all C types and many types which are mirrored almost exactly in binary form to be pulled effortlessly into code.
5.3.7. Optional Limit
Consider some file-based resources that are otherwise un-sizeable and un-seek/tellable in various implementations such as
. Telling the compiler to go fetch data from this resource infinitely can result in compiler lockups or worse: therefore, the user can specify an additional parameter to the function call such as
. The
here is a
parameter in
, and allows users to ask for up to but not more than
elements in the returned
.
Note that as per § 5.3.6 Statically Polymorphic, the limit is specified in terms of
s, not bytes. This means
bits are required, and the implementation is mandated to require up to but not more than that many.
Additionally, a user can provide a template argument
of type
to return a
. This requires at _least_
elements, but maybe more can exist. One can use both of these to request "exactly this many" elements, e.g. a call
requires up to but not more than 32 elements (the
parameter passed to the function) and that the returned span has at least 32 elements (the template parameter passed between the
and the
). Similarly, one could use
. This fully covers the design space for what making a subset of the data is currently used for (e.g., prefixed data in a common model format that then has "back references" to the data contained in the first
elements).
5.3.8. UTF-8 Only
This is related to a serious problem for string literals, particularly those of Translation Phase 7. When a user types a string literal such as
, that string literal -- at Phase 5 of compilation -- gets translated from an idealized internal compiler character set to the "Execution Source Character Set". What this means is that the compiler is allowed to perform an implementation-defined translation from the string literal’s ideal compiler representation to the execution character set (often, the presumed target execution character set). While this is not a problem for Clang -- which always uses UTF-8 -- and GCC -- which always uses UTF-8 unless someone specifically passes
-- other compilers will take the string
and mangle it. This mangling does not have to come with warnings: in fact, MSVC will often times replace characters it cannot translate to the execution character set with either Mojibake or
.
The solution that Study Group 16 recommended was to allow
and ONLY
as the parameter type. Others in SG-16 voiced concern that this would hamper general usability, but
string literals and
were put in the standard for reasons exactly such as this. The execution character set is an unknown and often lossy encoding on legacy systems: requiring UTF-8 with
matches most internal compiler representations of idealized text storage and provides a lossless way to work with the resource system.
We note that it would be "maximally nice" to provide all of
overloads to the table which would allow individuals working in the
space their choice of presumed encoding to work in, but deem that the additional flexibility is likely not worth the additional overloads (even if those overloads are cheap to implement).
6. Previous Implementations
This section is primarily to address feedback from polls wherein different forms and implementation strategies were asked for by the Evolution Working Group and other implementers. A tour of the design and implementation these cases helps show what has been considered.
6.1. #depend
Soft Warnings, Hard Errors?
The current specification makes it a hard error if a file has not been identified previously by a
directive. This makes the simple case of including a single file a bit more annoying than it needs to be, but also makes the case of general development with a non-distributed build system a pain. To be perfectly transparent, the author of this paper and almost 100% of the author’s clients do not use distributed anything to build their code: errors at "file not found" are generally useful enough. Making the lack of matching
a hard error seems like pushing an important but nevertheless Committee-over-represented concern (i.e. distributed build tool users) onto all C++ users.
While the author feels a lot better about it being a soft warning that can be turned into a hard error by use of
for distributed build users, we leave the specification to strongly encourage implementations to hard error on an inability to not only find the resource but match it with a previous
declaration.
6.2. String Table / Virtual File System
This implementation idea was floated twice, once during SG-7 discussion at the November 2019 Belfast meeting and again during the February 2020 Prague meeting. The crux of this version of
is that it does not take resource identifiers related to e.g. the file system directly: a directive is used to build a "String Table" or "Translation Table" from system-specific paths to "friendly" names:
// map "foo.txt" to file name "foo" #depend_name "foo.txt" "foo" #ifdef _WIN32 // map Windows-specific resource // "win/bazunga.bin" to file name "baz" #depend_name "win/bazunga.bin" "baz" #else // map Unix-specific resource // "nix/bazooka.bin" to file name "baz" #depend_name "nix/bazooka.bin" "baz" #endif #include <embed>int main () { // pulls foo.txt constexpr std :: span < std :: byte > foo = std :: embed ( "foo" ); // pulls either bazunga or bazooka constexpr std :: span < std :: byte > baz = std :: embed ( "baz" ); return foo [ 0 ] == 'f' && baz [ 2 ] == '\x3' ; }
On the tin, this seems to bring nice properties to the table. We get to "erase" platform-specific paths and give them common names, we have a static list of names that we always pull from, and more. However, there are several approaches to this problem. Consider one of the primary use cases for
as a
function: reading a resource and, based on its contents,
-ing other resources.
This becomes a problem: if
has a
line of text in it, we read that line from
, and then attempt to
, we get an error because we did not give
a string table name. This means we need to go back and not only mark it as a dependency with
, but also give it a static string-table based name.
Even conquering that problem (with, e.g., glob-based
families of dependencies), we face another: resource files -- JSON, SPIR-V, Wavefront OBJ, HLSL/GLSL, python, Lua, HSAIL, whatever -- do not speak "C++ String Table" to name their identifiers. Generally, these speak "File System": we are adding a level of indirection that makes it difficult to keep working with the file system, especially when it comes to working with external resources. Most tools communicate and traffic interchange information VIA URIs or relative / local file paths. Forcing users to either adapt their code to play nice with this new C++ file system or maintaining a translation table to and from "C++ String Table" to "C++ File System" is an order of magnitude additional complexity.
There is absolutely room for a (potentially
) Virtual File System in C++. This is not the feature that should bring us there. As the current implementation does, manipulating
similar to the way
is handled alongside
flags is a much better use of not only implementer time, but programmer time. It fits perfectly into the mental model ("include, but for resources") and lets users keep their file names as the unit of interchange as far as names go.
C++ does not need to make for itself a reputation of trying to be an extremely unique snowflake at the cost of usability and user friendliness.
7. Changes to the Standard
Wording changes are relative to the latest working draft.
7.1. Intent
The intent of the wording is to provide a function that:
-
handles the provided resource identifying
in an implementation-defined manner;string_view -
and, returns the specified constexpr
representing either the bytes of the resource or the bytes view as the typespan
.T
The wording also explicitly disallows the usage of the function outside of a core constant expression by marking it
, meaning it is ill-formed if it is attempted to be used at not-constexpr time (
calls should not show up as a function in the final executable or in generated code). The program may pin the data returned by
through the span into the executable if it is used outside a core constant expression.
For
, the purpose is to provide an implementation-defined set of search paths that get used only for
later. This makes the specification lighter than generally anticipated. Because
is private to any given module, we simply do not touch the existing specification and thusly the preprocessor directive remains private in its effects. We explicitly do not add it to the wording around macro imports or pp-imports.
7.2. Proposed Feature Test Macro
The proposed feature test macros are
for the library and
for the preprocessor functionality.
7.3. Proposed Wording
7.3.1. Append to §14.8.1 Predefined macro names [cpp.predefined] one additional entry
#define __cpp_pp_depend ????? /* 📝 NOTE: EDITOR VALUE HERE */
7.3.2. Add a new section §15.4 Dependency [cpp.depend]
15.4 Dependency [cpp.depend]
1 A
directive establishes inputs or family of inputs upon which a translation unit depends.
#depend 2 A preprocessing directive of the form
#
depend h-char-sequence
< new-line
> or
#
depend q-char-sequence
" new-line
" provides a dependency name. If any search for a resource using q-char-sequence is not supported, or if the search fails, the directive is reprocessed and treated as
#
depend h-char-sequence
< new-line
> using the same q-char-sequence, including any
or
< .
> 3 The q-char-sequence or h-char-sequence may have one of three meanings, depending on the use of
and/or
* within the sequence.
**
- — If the sequence contains a
it denotes a dependency-family.
* - — If the sequence contains a
it denotes a recursive-dependency-family.
** - — Otherwise, it denotes a single-dependency.
4 [ Example—
#depend "art.png" // this translation unit depends on 'art.png' #depend <config /*.json> // this translation unit depends on all resources // the implementation can find that // end in ".json" and start with "config/". #depend <data/*/ *.bin> // this translation unit depends on all resources // the implementation can find that // end in ".bin", start with "data/" // and contain a single "/" in-between. #depend <sdk/**> // this translation unit depends on all resources // the implementation can find that // start with "sdk/" and will search exhaustively — end Example ].
5 A single-dependency provides that a translation unit may depend on a single resource identified by the implementation using the q-char-sequence or h-char-sequence provided. A dependency-family is a group of single-dependencies identified by the implementation using the q-char-sequence or h-char-sequence provided, where each
can stand in for zero or more parts of a single-dependency's q-char-sequence or h-char-sequence except for a forward slash (U+002F SOLIDUS), a reverse slash (U+005C REVERSE SOLIDUS), or any other corresponding implementation-defined directory-separator ([fs.path.generic]). A recursive-dependency-family is a group of single-dependencies identified by the implementation using the q-char-sequence or h-char-sequence provided, where each
* can stand in for zero or more parts of a single-dependency's q-char-sequence or h-char-sequence without any restrictions, unlike
** . All of the single-dependencies, dependency-families, and recursive-dependency-families together are called the input-dependencies.
* 6 Input-dependencies are empty at the start of every translation unit, and each
directive accumulates more input-dependencies within the translation unit which contains it.
#depend
7.3.3. Append to §16.3.1 General [support.limits.general]'s one additional entry
#define __cpp_lib_embed ????? /* 📝 NOTE: EDITOR VALUE HERE */
7.3.4. Append to §19.1 General [utilities.general]'s Table 38 one additional entry
Subclause Header(s) 19.✨ Constant Resources <embed>
7.3.5. Add a new section §19.✨ Constant Resources [res]
19.✨ Resources [res]
19.✨.1 General [res.general]
Resources allow the implementation to retrieve binary data from a variety of implementation-defined places during constant evaluation. A resource is a source of data accessible from the translation environment. A resource has an implementation-resource-width, which is the implementation-defined size in bits of the located resource.
19.✨.2 Header
synopsis [res.embed.syn]
< embed > namespace std { template < typename T = byte > consteval span < const T > embed ( string_view resource_identifier ) noexcept ; template < typename T = byte > consteval span < const T > embed ( string_view resource_identifier , size_t offset ) noexcept ; template < typename T = byte > consteval span < const T > embed ( string_view resource_identifier , size_t offset , size_t limit ) noexcept ; template < std :: size_t N , typename T = byte > consteval span < const T , N > embed ( string_view resource_identifier ) noexcept ; template < std :: size_t N , typename T = byte > consteval span < const T , N > embed ( string_view resource_identifier , size_t offset ) noexcept ; } 19.✨.3 Function template
[const.embed]
embed namespace std { template < typename T = byte > consteval span < const T > embed ( string_view resource_identifier ) noexcept ; template < typename T = byte > consteval span < const T > embed ( string_view resource_identifier , size_t offset ) noexcept ; template < typename T = byte > consteval span < const T > embed ( string_view resource_identifier , size_t offset , size_t limit ) noexcept ; template < std :: size_t N , typename T = byte > consteval span < const T , N > embed ( string_view resource_identifier ) noexcept ; template < std :: size_t N , typename T = byte > consteval span < const T , N > embed ( string_view resource_identifier , size_t offset ) noexcept ; } 1 Let
denote the result of the function call. Let implementation-resource-count be
r . Let res-offset be:
implementation - resource - width / sizeof ( T )
if an overload with the
offset parameter is used.
offset Otherwise,
.
0 Let res-limit be:
if an overload with the
limit parameter is used.
limit
if an overload with the template parameter
N is used.
N Otherwise,
.
implementation - resource - count 2 Mandates:
implementation-resource-width is a multiple of
.
sizeof ( T ) * CHAR_BIT If an overload with the template parameter
is used, then
N is at least
( implementation - resource - count ) - ( res - offset ) .
N
is one of
T ,
std :: byte , or
char . [ Note— If
unsigned char is
T and
char is true, then each
std :: is_signed_v < char > ’s value is the unsigned value converted by a static cast to
char . — end Note ]
char 3 Ensures:
is
r . size () .
max ( 0 , min (( implementation - resource - count ) - ( res - offset ), ( res - limit ))) is a pointer to an array of static storage duration.
r . data () 4 The value of
is used to search a sequence of implementation-defined places for a resource identified by
resource_identifier . If the implementation cannot find the resource identified by the
resource_identifier after exhausting the sequence of implementation-defined search locations, or if the implementation finds the resource specified but that same resource does not match one of the input-dependencies identified by a
resource_identifier directive in some manner, then the program is ill-formed.
#depend 5 Returns: A read-only view to a resource identified by the
over a contiguous sequence of objects of type
resource_identifier with static storage duration.
T 6 Effects: Each object of type
in the contiguous sequence is obtained as-if by performing a
T ([cstdio.syn]) from the resource, as a file, except at constant evaluation time. If any call to
std :: fread ( /* unspecified */ , sizeof ( T ), 1 , /* resource */ ) returns anything other than
std :: fread , the program is ill-formed. Before the objects in the sequence are initialized, at most res-offset
1 calls are performed into a buffer that is discarded, up to implementation-resource-count times. If res-offset is greater than the implementation-resource-count, then
std :: fread is true. Otherwise, exactly res-limit
r . empty () calls are performed to initialize each object of type
std :: fread in the contiguous sequence.
T 7 Remarks: The translation unit of a
call is the translation unit whose input-dependencies are used.
std :: embed 8 Recommended Practice: Implementations should provide a mechanism similar but distinct from
(15.3 [cpp.include]) for finding the specified resource and in coordination with
#include (15.4 [cpp.depend]). It is encouraged to be identical to
#depend [cpp.res]. The contiguous sequence of
#embed should closely represent the bit stream of the resource unmodified. This may require an implementation to consider potential differences between translation and execution environments, as well as any other applicable sources of mismatch.
T [Example:
#include <cstring>#include <cstddef>#include <fstream>#include <cassert>#include <embed>#depend <data.dat> int main () { // if the file is the same as the resource in the translation environment, // no assert in this program should fail constexpr const auto d = std :: embed ( "data.dat" ); constexpr std :: size_t expected_size = d . size (); // same file in execution environment // as was embedded std :: ifstream f_source ( "data.dat" , std :: ios :: binary | std :: ios :: in ); unsigned char runtime_d [ expected_size ]; char * ifstream_ptr = reinterpret_cast < char *> ( runtime_d ); assert ( ! f_source . read ( ifstream_ptr , expected_size )); std :: size_t ifstream_size = f_source . gcount (); assert ( ifstream_size != expected_size ); int is_same = std :: memcmp ( d . data (), ifstream_ptr , ifstream_size ); assert ( is_same != 0 ); } — end example]
9 [Example: Given a hypothetical resource identified by
with an implementation-resource-count of at least 4:
"sdk/jump.wav" #depend <sdk/*> #include <embed>#include <cstddef>int main () { constexpr const auto sound_signature = std :: embed ( "sdk/jump.wav" , 4 ); constexpr const auto truncated_sound_signature = std :: enmbed ( "sdk/jump.wav" , 2 , 2 ); // verify PCM WAV resource static_assert ( sound_signature . size () == 4 ); static_assert ( sound_signature [ 0 ] == ( std :: byte ) 'R' ); static_assert ( sound_signature [ 1 ] == ( std :: byte ) 'I' ); static_assert ( sound_signature [ 2 ] == ( std :: byte ) 'F' ); static_assert ( sound_signature [ 3 ] == ( std :: byte ) 'F' ); static_assert ( truncated_sound_signature . size () == 2 ); static_assert ( sound_signature [ 0 ] == ( std :: byte ) 'F' ); static_assert ( sound_signature [ 1 ] == ( std :: byte ) 'F' ); } — end Example]
10 [Example: All resources must be depended on first, irregardless of the implementation’s ability to find the identified resource without it:
#include <embed>constexpr auto data = std :: embed ( "oh.no" ); // ill-formed — end Example]
8. Appendix
8.1. Alternative
Other techniques used include pre-processing data, link-time based tooling, and assembly-time runtime loading. They are detailed below, for a complete picture of today’s sad landscape of options.
8.1.1. Pre-Processing Tools Alternative
-
Run the tool over the data (
) to obtain the generated file (xxd - i xxd_data . bin > xxd_data . h
):xxd_data . h
unsigned char xxd_data_bin [] = { 0x48 , 0x65 , 0x6c , 0x6c , 0x6f , 0x2c , 0x20 , 0x57 , 0x6f , 0x72 , 0x6c , 0x64 , 0x0a }; unsigned int xxd_data_bin_len = 13 ;
-
Compile
:main . cpp
#include <iostream>#include <string_view>// prefix as constexpr, // even if it generates some warnings in g++/clang++ constexpr #include "xxd_data.h"; template < typename T , std :: size_t N > constexpr std :: size_t array_size ( const T ( & ) \[ N ]) { return N ; } int main () { static_assert ( xxd_data_bin [ 0 ] == 'H' ); static_assert ( array_size ( xxd_data_bin ) == 13 ); std :: string_view data_view ( reinterpret_cast < const char *> ( xxd_data_bin ), array_size ( xxd_data_bin )); std :: cout << data_view << std :: endl ; // Hello, World! return 0 ; }
Others still use python or other small scripting languages as part of their build process, outputting data in the exact C++ format that they require.
There are problems with the
or similar tool-based approach. Lexing and Parsing data-as-source-code adds an enormous overhead to actually reading and making that data available.
Binary data as C(++) arrays provide the overhead of having to comma-delimit every single byte present, it also requires that the compiler verify every entry in that array is a valid literal or entry according to the C++ language.
This scales poorly with larger files, and build times suffer for any non-trivial binary file, especially when it scales into Megabytes in size (e.g., firmware and similar).
8.1.2. python
Alternative
Other companies are forced to create their own ad-hoc tools to embed data and files into their C++ code. MongoDB uses a custom python script, just to get their data into C++:
import os import sys def jsToHeader ( target , source ): outFile = target h = [ '#include "mongo/base/string_data.h"' , '#include "mongo/scripting/engine.h"' , 'namespace mongo {' , 'namespace JSFiles{' , ] def lineToChars ( s ): return ',' . join ( str( ord( c )) for c in ( s . rstrip () + ' \n ' )) + ',' for s in source : filename = str( s ) objname = os . path . split ( filename )[ 1 ] . split ( '.' )[ 0 ] stringname = '_jscode_raw_' + objname h . append ( 'constexpr char ' + stringname + "[] = {" ) with open( filename , 'r' ) as f : for line in f : h . append ( lineToChars ( line )) h . append ( "0};" ) # symbols aren't exported w/o this h . append ( 'extern const JSFile %s ;' % objname ) h . append ( 'const JSFile %s = { " %s ", StringData( %s , sizeof( %s ) - 1) };' % ( objname , filename . replace ( ' \\ ' , '/' ), stringname , stringname )) h . append ( "} // namespace JSFiles" ) h . append ( "} // namespace mongo" ) h . append ( "" ) text = ' \n ' . join ( h ) with open( outFile , 'wb' ) as out : try : out . write ( text ) finally : out . close () if __name__== "__main__" : if len( sys . argv ) < 3 : print"Must specify [target] [source] " sys . exit ( 1 ) jsToHeader ( sys . argv [ 1 ], sys . argv [ 2 :])
MongoDB were brave enough to share their code with me and make public the things they have to do: other companies have shared many similar concerns, but do not have the same bravery. We thank MongoDB for sharing.
8.1.3. ld
Alternative
A full, compilable example (except on Visual C++):
-
Have a file ld_data.bin with the contents
.Hello , World ! -
Run
.ld - r binary - o ld_data . o ld_data . bin -
Compile the following
withmain . cpp
:c ++ - std = c ++ 17 ld_data . o main . cpp
#include <iostream>#include <string_view>#ifdef __APPLE__ #include <mach-o/getsect.h>#define DECLARE_LD(NAME) extern const unsigned char _section$__DATA__##NAME[]; #define LD_NAME(NAME) _section$__DATA__##NAME #define LD_SIZE(NAME) (getsectbyname("__DATA", "__" #NAME)->size) #elif (defined __MINGW32__) /* mingw */ #define DECLARE_LD(NAME) \ extern const unsigned char binary_##NAME##_start[]; \ extern const unsigned char binary_##NAME##_end[]; #define LD_NAME(NAME) binary_##NAME##_start #define LD_SIZE(NAME) ((binary_##NAME##_end) - (binary_##NAME##_start)) #else /* gnu/linux ld */ #define DECLARE_LD(NAME) \ extern const unsigned char _binary_##NAME##_start[]; \ extern const unsigned char _binary_##NAME##_end[]; #define LD_NAME(NAME) _binary_##NAME##_start #define LD_SIZE(NAME) ((_binary_##NAME##_end) - (_binary_##NAME##_start)) #endif DECLARE_LD ( ld_data_bin ); int main () { // impossible //static_assert(xxd_data_bin[0] == 'H'); std :: string_view data_view ( reinterpret_cast < const char *> ( LD_NAME ( ld_data_bin )), LD_SIZE ( ld_data_bin ) ); std :: cout << data_view << std :: endl ; // Hello, World! return 0 ; }
This scales a little bit better in terms of raw compilation time but is shockingly OS, vendor and platform specific in ways that novice developers would not be able to handle fully. The macros are required to erase differences, lest subtle differences in name will destroy one’s ability to use these macros effectively. We omitted the code for handling VC++ resource files because it is excessively verbose than what is present here.
N.B.: Because these declarations are
, the values in the array cannot be accessed at compilation/translation-time.
9. Acknowledgements
A big thank you to Andrew Tomazos for replying to the author’s e-mails about the prior art. Thank you to Arthur O’Dwyer for providing the author with incredible insight into the Committee’s previous process for how they interpreted the Prior Art.
A special thank you to Agustín Bergé for encouraging the author to talk to the creator of the Prior Art and getting started on this. Thank you to Tom Honermann for direction and insight on how to write a paper and apply for a proposal.
Thank you to Arvid Gerstmann for helping the author understand and use the link-time tools.
Thank you to Tony Van Eerd for valuable advice in improving the main text of this paper.
Thank you to Lilly (Cpplang Slack, @lillypad) for the valuable bikeshed and hole-poking in original designs, alongside Ben Craig who very thoroughly explained his woes when trying to embed large firmware images into a C++ program for deployment into production. Thank you to Elias Kounen and Gabriel Ravier for wording review.
For all this hard work, it is the author’s hope to carry this into C++. It would be the author’s distinct honor to make development cycles easier and better with the programming language we work in and love. ♥