WG21 PAPERS

Mailings Beta

Volunteer-driven · Not affiliated with WG21 or ISO

Filter and export papers from the C++ Committee’s monthly mailings by time frame and audience using the options below, or refine your export further with the Select button. Links point directly to the official WG21 papers on open-std.org.

Submit Issue C++ Standards Committee Papers

1 · Year 1 · Month

Select the arrow to the right of the year to filter for specific months.

Add Year +

Select Years To Display

Current Years Selected

2026 2025

Group by date?

Select	Paper	Title	Authors	Audience	Doc Date	Mailing Date
	P4337R0	emplace_from	Robert Leahy R. Leahy	LEWG SG18	2026-08-03	2026-08
Doc Date 2026-08-03 Mailing Date 2026-08 Unassigned Author(s) Robert Leahy Target Audience LEWG SG18 Tracking issue View on GitHub Abstract Enabled by variadic templates and forwarding references, C++11 brought emplace construction. Containers, wrappers, et cetera could provide variadic constructors or functions which forwarded arguments through to a constructor of some wrapped or contained type thereby creating an instance of that type without intervening temporaries (which would be copied or moved from).
	P4338R0	deduce	Robert Leahy R. Leahy	LEWG SG18	2026-08-03	2026-08
Doc Date 2026-08-03 Mailing Date 2026-08 Unassigned Author(s) Robert Leahy Target Audience LEWG SG18 Tracking issue View on GitHub Abstract `emplace_from` is a proposed standard library class template which enables emplace functionality (e.g. `std::vector::emplace_back`, `std::optional::emplace`, et cetera) to be used to construct immovable types returned by factory functions (e.g. `std::execution::connect`).
	P4343R0	Adding clear() to Container Adaptors	Shubham Avasthi S. Avasthi	SG18	2026-08-11	2026-08
Doc Date 2026-08-11 Mailing Date 2026-08 Unassigned Author(s) Shubham Avasthi Target Audience SG18 Revisions R1 Tracking issue View on GitHub Abstract Currently, there is no standardized, zero-overhead way to clear the elements of container adaptors. When developers need to reuse a <ins>std::priority_queue or std::queue</ins> in a performance-critical loop, they are forced to use one of two suboptimal workarounds:

Showing 3 of 3 papers · source: open-std.org

Mailings Beta

Sign in