public inbox for gcc-bugs@sourceware.org
help / color / mirror / Atom feed
* [Bug c++/12591] New: gcc accepts invalid code
@ 2003-10-12 20:45 hg211 at ural2 dot hszk dot bme dot hu
  2003-10-13  1:41 ` [Bug c++/12591] " pinskia at gcc dot gnu dot org
                   ` (5 more replies)
  0 siblings, 6 replies; 7+ messages in thread
From: hg211 at ural2 dot hszk dot bme dot hu @ 2003-10-12 20:45 UTC (permalink / raw)
  To: gcc-bugs

PLEASE REPLY TO gcc-bugzilla@gcc.gnu.org ONLY, *NOT* gcc-bugs@gcc.gnu.org.

http://gcc.gnu.org/bugzilla/show_bug.cgi?id=12591

           Summary: gcc accepts invalid code
           Product: gcc
           Version: 3.4
            Status: UNCONFIRMED
          Severity: normal
          Priority: P2
         Component: c++
        AssignedTo: unassigned at gcc dot gnu dot org
        ReportedBy: hg211 at ural2 dot hszk dot bme dot hu
                CC: gcc-bugs at gcc dot gnu dot org

gcc version 3.3.2 20030908 (Debian prerelease)
and
gcc version 3.4 20031005 (experimental)

accept this invalid code (it's invalid because the copy-constructor is
inaccessible):

class foo {
	private:
		foo(const foo &);
	public:
		foo();
};

const foo &bar = foo();


^ permalink raw reply	[flat|nested] 7+ messages in thread

end of thread, other threads:[~2003-10-14 16:39 UTC | newest]

Thread overview: 7+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2003-10-12 20:45 [Bug c++/12591] New: gcc accepts invalid code hg211 at ural2 dot hszk dot bme dot hu
2003-10-13  1:41 ` [Bug c++/12591] " pinskia at gcc dot gnu dot org
2003-10-13 10:46 ` hg211 at ural2 dot hszk dot bme dot hu
2003-10-13 11:21 ` falk at debian dot org
2003-10-13 13:53 ` hg211 at ural2 dot hszk dot bme dot hu
2003-10-13 15:58 ` pinskia at gcc dot gnu dot org
2003-10-14 16:39 ` pinskia at gcc dot gnu dot org

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).