[Bug c++/78011] New: Compiler error when initializing a member of template type where the second template argument is a typedef

: UNCONFIRMED Severity: normal Priority: P3 Component: c++ Assignee: unassigned at gcc dot gnu.org Reporter: b.stanimirov at abv dot bg Target Milestone: --- Repro: typedef int int32; struct foo { std::map bar = std::map{}; }; If the initialization

[Bug libstdc++/98473] New: std::vector::insert(pos, first, last) doesn't compile for T which has a deleted assignment operator

tatus: UNCONFIRMED Severity: normal Priority: P3 Component: libstdc++ Assignee: unassigned at gcc dot gnu.org Reporter: b.stanimirov at abv dot bg Target Milestone: --- Create a class `X` which is copy-constructible but not copy-assignable ``` struct X {

[Bug libstdc++/98473] std::vector::insert(pos, first, last) doesn't compile for T which has a deleted assignment operator

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98473 --- Comment #2 from Borislav Stanimirov --- (In reply to Jonathan Wakely from comment #1) > To meet the requirements of the standard we would need to insert them at the > end and then use std::rotate to reposition them. Or, to save move assignm

[Bug libstdc++/98473] std::vector::insert(pos, first, last) doesn't compile for T which has a deleted assignment operator

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98473 --- Comment #3 from Borislav Stanimirov --- By the way, this is not just some esoteric synthetic example. A type which is copy-constructible but not copy-assignable is very useful to model immutable objects.

[Bug libstdc++/108714] New: Algorithms in require predicates to be copyable

: P3 Component: libstdc++ Assignee: unassigned at gcc dot gnu.org Reporter: b.stanimirov at abv dot bg Target Milestone: --- Simple repro: ``` #include #include struct noncopyable { noncopyable(); noncopyable(const noncopyable&) = delete; noncopy

[Bug libstdc++/108118] New: std::weak_ptr lacks a self-usurp check on move

Component: libstdc++ Assignee: unassigned at gcc dot gnu.org Reporter: b.stanimirov at abv dot bg Target Milestone: --- If one somehow move-assigns a weak pointer to itself, it gets destroyed. Demo: https://godbolt.org/z/eWdhYMhYe

[Bug tree-optimization/104165] [12 Regression] -Warray-bounds for unreachable code inlined from std::sort()

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104165 Borislav Stanimirov changed: What|Removed |Added CC||b.stanimirov at abv dot bg

[Bug c++/121122] New: -Wdangling-reference false postitive when adding a non-dangling reference to the mix

Severity: normal Priority: P3 Component: c++ Assignee: unassigned at gcc dot gnu.org Reporter: b.stanimirov at abv dot bg Target Milestone: --- I reproduce this without fail on gcc 13 to trunk (as of this post) This code expectedly produces no warnings

[Bug c++/121327] New: Not-matching concept fails to compile with error "depends on itself"

ty: normal Priority: P3 Component: c++ Assignee: unassigned at gcc dot gnu.org Reporter: b.stanimirov at abv dot bg Target Milestone: --- Consider the simple class: ``` template class id { T m_id; public: constexpr id() : m_id() {} constexpr boo

[Bug c++/121327] Not-matching concept fails to compile with error "depends on itself"

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=121327 --- Comment #1 from Borislav Stanimirov --- So, the problem is that `std::equality_comparable_with` is bidirectional. It checks lhs==rhs and rhs==lhs. Using it with two id types will lead to an infinite recursion of checking `rhs==X`. The reaso