Deutsch English Français Italiano |
<v0mo7t$1arr4$3@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!news.mixmin.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: Lawrence D'Oliveiro <ldo@nz.invalid> Newsgroups: comp.lang.c++,comp.lang.c Subject: Re: "White House to Developers: Using C or C++ Invites Cybersecurity Risks" Date: Mon, 29 Apr 2024 00:05:17 -0000 (UTC) Organization: A noiseless patient Spider Lines: 14 Message-ID: <v0mo7t$1arr4$3@dont-email.me> References: <us0brl$246bf$1@dont-email.me> <us1lb5$2f4n4$1@dont-email.me> <us2lfh$2ltj3$5@dont-email.me> <us2s96$2n6h3$6@dont-email.me> <us3155$2of1i$3@dont-email.me> <us4c66$346tp$3@dont-email.me> <us5d6f$3besu$3@dont-email.me> <20240305005948.00002697@yahoo.com> <us5u16$3eidj$2@dont-email.me> <20240305111103.00003081@yahoo.com> <us8821$90p$4@dont-email.me> <20240306140214.0000449c@yahoo.com> <us9nib$dski$1@dont-email.me> <20240307000008.00003544@yahoo.com> <usc58s$10cls$1@dont-email.me> <20240307134401.00007aa2@yahoo.com> <uscmub$149j3$1@dont-email.me> <usf11f$1mk5l$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Mon, 29 Apr 2024 02:05:17 +0200 (CEST) Injection-Info: dont-email.me; posting-host="04215bbbe15e1cd8ac94ba1cee5d62b8"; logging-data="1404772"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+MdyaINkJawdz8B6lhPWKf" User-Agent: Pan/0.155 (Kherson; fc5a80b8) Cancel-Lock: sha1:HHEBAjGifZ7Ms46KPRc2j7/1KN4= Bytes: 2222 On Fri, 8 Mar 2024 14:41:16 +0200, Paavo Helde wrote: > AFAIK CPython uses reference counting ... Combination of reference-counting as a first resort, with full garbage collection to deal with those less common cases where you have reference cycles. Trying to get the best of both worlds. The trouble with reference-counting is it impacts multithreading performance. However, the CPython developers have a scheme to deal with this, by making the reference counts a little less deterministic (i.e. there may be a slight delay before they become fully correct). I think this is a complicated idea, and it may take them some time to get it fully implemented.