Re: [python-committers] [Python-Dev] Reminder: Python 3.5 beta 1 will be tagged tomorrow

2015-05-23 Thread Tal Einat
On Sat, May 23, 2015 at 1:34 AM, Berker Peksağ berker.pek...@gmail.com wrote: On Sat, May 23, 2015 at 12:53 AM, Chris Barker chris.bar...@noaa.gov wrote: On Fri, May 22, 2015 at 2:33 PM, Larry Hastings la...@hastings.org wrote: On 05/22/2015 02:29 PM, Chris Barker wrote: Is it too late

Re: [python-committers] [Python-Dev] Reminder: Python 3.5 beta 1 will be tagged tomorrow

2015-05-23 Thread Nick Coghlan
On 23 May 2015 at 19:29, Tal Einat talei...@gmail.com wrote: On Sat, May 23, 2015 at 1:34 AM, Berker Peksağ berker.pek...@gmail.com wrote: On Sat, May 23, 2015 at 12:53 AM, Chris Barker chris.bar...@noaa.gov wrote: On Fri, May 22, 2015 at 2:33 PM, Larry Hastings la...@hastings.org wrote:

Re: [python-committers] [Python-Dev] Reminder: Python 3.5 beta 1 will be tagged tomorrow

2015-05-23 Thread Larry Hastings
On 05/23/2015 06:25 AM, Nick Coghlan wrote: I filed http://bugs.python.org/issue24270 to track this, but there's a fair bit of work to be done to integrate the changes into the existing math module's code, tests and documentation. I'm willing to consider a feature freeze exception for this, as

Re: [python-committers] [Python-Dev] Reminder: Python 3.5 beta 1 will be tagged tomorrow

2015-05-22 Thread Larry Hastings
On 05/22/2015 02:29 PM, Chris Barker wrote: Is it too late to get the isclose() code (PEP 485) into 3.5? I posted the code here, and got a tiny bit of review, but have not yet merged it into the source tree -- and don't know the process for getting it committed to the official source. So --

Re: [python-committers] [Python-Dev] Reminder: Python 3.5 beta 1 will be tagged tomorrow

2015-05-22 Thread Berker Peksağ
On Sat, May 23, 2015 at 12:53 AM, Chris Barker chris.bar...@noaa.gov wrote: On Fri, May 22, 2015 at 2:33 PM, Larry Hastings la...@hastings.org wrote: On 05/22/2015 02:29 PM, Chris Barker wrote: Is it too late to get the isclose() code (PEP 485) into 3.5? ... Hopefully you can find a