Am 03.01.16 um 08:04 schrieb Random832:
Michael Vilain writes:
We used stash/bitbucket at my last contract. It's the second site I've
come across that used Atlasian's toolset. Yes, I know it's not
statistically significant.
Anyway, the pull/merge request workflow is becoming pretty standard.
Michael Vilain writes:
> We used stash/bitbucket at my last contract. It's the second site I've
> come across that used Atlasian's toolset. Yes, I know it's not
> statistically significant.
>
> Anyway, the pull/merge request workflow is becoming pretty standard.
I think you're missing a disti
the install of the basic 2.7 seems to go ok but when installing the win32
extensions, I get:
close failed in file object destructor:
sys.excepthook is missing
lost sys.stderr
I've tried installing as administrator but no joy. what should I try next?
--
https://mail.python.org/mailman/listinfo/
Michael Torrie writes:
> On 01/02/2016 12:02 AM, Ben Finney wrote:
> > GitHub's “pull request” workflow is entirely proprietary and can
> > only be done within GitHub.
>
> Really? This seems like an entirely artificial github requirement.
Yes, it is.
> There's absolutely no reason why github c
On 01/01/2016 11:43 PM, Steven D'Aprano wrote:
> On Sat, 2 Jan 2016 07:09 am, Chris Angelico wrote:
>
>> Yes, git is a capable tool. But so is Mercurial, and the arguments
>> weren't primarily based on differences in functionality (which are
>> pretty minor). It's mainly about the network effect.
On 01/02/2016 12:02 AM, Ben Finney wrote:
> What is being done to stave off the common response, addressed by GitHub
> users to people submitting a change as a link to their Git repository,
> of “can you please submit that as a GitHub pull request”?
>
> That common response makes for an unnecessar
let's put an end to this.
from math import log
# simple one to understand. complexity: O(n*log(n))
def countzeros_va(n):
count = 0
for x in xrange(1, n + 1):
while x % 5 == 0:
count += 1
x //= 5
return count
# better approach. complexity: O(log(n))
def
"Chris Angelico" wrote in message
news:mailman.64.1451433611.11925.python-l...@python.org...
On Wed, Dec 30, 2015 at 8:43 AM, Skybuck Flying
wrote:
Not at all, these assembler statements can be replaced with python
statements and then you have the exact same problem ! ;)
"
Then do so. G
Chris Angelico :
> On Sun, Jan 3, 2016 at 11:33 AM, Marko Rauhamaa wrote:
>> Teamware didn't have to pick any of them since Teamware's commits
>> were done per individual files. The repository didn't have a commit
>> history.
>>
>> Thus, Teamware was equivalent to Hg/Git with each file treated as
On Sun, Jan 3, 2016 at 11:33 AM, Marko Rauhamaa wrote:
>> That's a constantly-debated point, and it's actually possible to make
>> git accept this, although it's not a normal workflow. Instead, you
>> just 'git pull' (possibly with --rebase) before you 'git push'. You
>> either create a new merge
On 01/01/2016 19:39, Mark Lawrence wrote:
Please see
https://mail.python.org/pipermail/core-workflow/2016-January/000345.html
This should encourage developers at all levels to help out, such that
the list of open issues on the bug tracker falls drastically.
One thing that I forgot is that if
Chris Angelico :
> On Sun, Jan 3, 2016 at 1:52 AM, Marko Rauhamaa wrote:
>> Terminology aside, if I do this with Git:
>>
>>-++>
>> \ ^
>> \pull /push
>>v /
>>
Robin Koch writes:
> Am 02.01.2016 um 22:57 schrieb Chris Angelico:
> >>> But did you actually test it?
> >>
> >> Yes, should work for n >= 1.
By “test it”, Chris of course means test it *by implementing it in a
program and running that program in Python*.
> >> Why do you ask?
> >
> > Your "sho
Am 02.01.2016 um 22:57 schrieb Chris Angelico:
On Sun, Jan 3, 2016 at 3:56 AM, Robin Koch wrote:
Am 02.01.2016 um 17:09 schrieb Tony van der Hoff:
On 02/01/16 16:57, Robin Koch wrote:
sum([int(0.2**k*n) for k in range(1, int(log(n, 5))+1)])
But did you actually test it?
Yes, should wo
Mark Lawrence wrote:
> Please don't top post, it's extremely annoying when trying to follow
> long threads.
As are full quotes.
--
PointedEars
Twitter: @PointedEars2
Please do not cc me. / Bitte keine Kopien per E-Mail.
--
https://mail.python.org/mailman/listinfo/python-list
On Sun, Jan 3, 2016 at 7:39 AM, Carlos Barera wrote:
> Turns out it wasn't running against the server I thought it was.
> Apologies for the spam.
Heh. No problem. That's part of why I suggested running it from the
shell. There are two possibilities: either it also fails from the
shell (in which c
On Sun, Jan 3, 2016 at 3:56 AM, Robin Koch wrote:
> Am 02.01.2016 um 17:09 schrieb Tony van der Hoff:
>>
>> On 02/01/16 16:57, Robin Koch wrote:
>>>
>>> sum([int(0.2**k*n) for k in range(1, int(log(n, 5))+1)])
>>
>>
>> But did you actually test it?
>
>
> Yes, should work for n >= 1.
>
> Why do you
On 02/01/2016 20:09, yehudak . wrote:
Hi again,
I looked a little deeper at your code. Smart solution and kudos.
Yehuda
Still top posting? Thanks a bunch.
--
My fellow Pythonistas, ask not what our language can do for you, ask
what you can do for our language.
Mark Lawrence
--
https://mai
On 02/01/2016 20:02, yehudak . wrote:
Hello vbr,
That's EXACTLY what I needed. rstrip is new for me so I'm going to Dr.
Google to learn.
On my efforts I was struggling with .pop() but wasn't very successful...
Thank you so much,
Yehuda
How many times do you have to be asked to not top post?
Hi again,
I looked a little deeper at your code. Smart solution and kudos.
Yehuda
On Sat, Jan 2, 2016 at 10:02 PM, yehudak . wrote:
> Hello vbr,
> That's EXACTLY what I needed. rstrip is new for me so I'm going to Dr.
> Google to learn.
>
> On my efforts I was struggling with .pop() but wasn't
Hello vbr,
That's EXACTLY what I needed. rstrip is new for me so I'm going to Dr.
Google to learn.
On my efforts I was struggling with .pop() but wasn't very successful...
Thank you so much,
Yehuda
On Sat, Jan 2, 2016 at 8:29 PM, Vlastimil Brom
wrote:
> 2016-01-02 18:34 GMT+01:00 yehudak . :
>
Turns out it wasn't running against the server I thought it was.
Apologies for the spam.
-carlos
On Wed, Dec 30, 2015 at 11:02 PM Cameron Simpson wrote:
> On 30Dec2015 21:14, Carlos Barera wrote:
> >Trying to run a specific command (ibstat) installed in /usr/sbin on an
> >Ubuntu 15.04 machine
2016-01-02 18:34 GMT+01:00 yehudak . :
[partly edited for bottom posting]
> On Sat, Jan 2, 2016 at 5:24 PM, Vlastimil Brom
> wrote:
>>
>> 2016-01-02 14:14 GMT+01:00 yehudak . :
>> >
[...]>> > On Sat, Jan 2, 2016 at 2:44 PM, Vlastimil Brom
>> >
>> > wrote:
>> >>
>> >> 2016-01-02 12:49 GMT+01:00 :
On 02.01.16 18:33, Tim Chase wrote:
or mathematically:
sum(1 for _ in itertools.takewhile(
lambda x: n % (10**x) == 0,
itertools.count(1)))
The mathematician would prove that the result is not larger than 100/4.
--
https://mail.python.org/mailman/listinfo/python-list
On 02/01/2016 17:34, yehudak . wrote:
vbr,
I tried using .pop() but could not get what I wanted .Also, I can't see an
advantage in reversing the number.
Would you care to write explicitly the program for me (and probably for
other too)?
Brute Force is the style I'm thinking about.
Sorry, but I l
vbr,
I tried using .pop() but could not get what I wanted .Also, I can't see an
advantage in reversing the number.
Would you care to write explicitly the program for me (and probably for
other too)?
Brute Force is the style I'm thinking about.
Sorry, but I learn most from viewing the code.
Apprec
On Sat, Jan 2, 2016 at 2:56 PM, Robin Koch wrote:
>
> Yes, should work for n >= 1.
>
The first power of 10 for which it fails in my machine is 10 ^ 17,
which is not that much for modern computers. Discrete math should not
meet floating points.
I would post the "canonical" solution here if Peter
Robin Koch wrote:
> Am 02.01.2016 um 12:49 schrieb katye2...@gmail.com:
>
>> I'm trying to write a python program to find how many trailing zeros
>> are in 100! (factorial of 100). I used factorial from the math
>> module, but my efforts to continue failed. Please help.
>
> Using not Python, but
Am 02.01.2016 um 17:09 schrieb Tony van der Hoff:
On 02/01/16 16:57, Robin Koch wrote:
sum([int(0.2**k*n) for k in range(1, int(log(n, 5))+1)])
But did you actually test it?
Yes, should work for n >= 1.
Why do you ask?
--
Robin Koch
--
https://mail.python.org/mailman/listinfo/python-list
On 02/01/16 16:57, Robin Koch wrote:
> sum([int(0.2**k*n) for k in range(1, int(log(n, 5))+1)])
But did you actually test it?
--
Tony van der Hoff | mailto:t...@vanderhoff.org
Ariège, France |
--
https://mail.python.org/mailman/listinfo/python-list
On 2016-01-02 03:49, katye2...@gmail.com wrote:
> I'm trying to write a python program to find how many trailing
> zeros are in 100! (factorial of 100). I used factorial from the
> math module, but my efforts to continue failed. Please help.
Pretty easy to do with strings:
from math import fact
On 2016-01-02 17:43, Steven D'Aprano wrote:
> Oh, and talking about DVCS:
>
> https://bitquabit.com/post/unorthodocs-abandon-your-dvcs-and-return-to-sanity/
The arguments there are pretty weak.
Not working offline? I use that *ALL* *THE* *TIME*. Maybe the
author lives some place where the main
Am 02.01.2016 um 14:14 schrieb yehudak .:
Thank you so much, but...
All that is Chinese for me.
Can you show a 'normal' Python code for me?
How about:
>>> from math import log
>>> sum([int(0.2**k*n) for k in range(1, int(log(n, 5))+1)])
}:-)
(That implements my procedure in my other answe
Am 02.01.2016 um 12:49 schrieb katye2...@gmail.com:
I'm trying to write a python program to find how many trailing zeros
are in 100! (factorial of 100). I used factorial from the math
module, but my efforts to continue failed. Please help.
Using not Python, but math:
Every "0" at the end of 1
On Saturday, January 2, 2016 at 6:14:24 PM UTC+5:30, Robert wrote:
> Hi,
>
> I read a code snippet, in which object w_A is:
>
>
> w_A
> Out[48]: array([ 0.10708809, 0.94933575, 0.8412686 , 0.03280939,
> 0.59985308])
>
>
> Then, I don't know what is '[: ' below:
> vs_A = w_A[:, None] * xs
On Sat, 2 Jan 2016 11:44 pm, Robert wrote:
> Hi,
>
> I read a code snippet, in which object w_A is:
>
>
> w_A
> Out[48]: array([ 0.10708809, 0.94933575, 0.8412686 , 0.03280939,
> 0.59985308])
w_A looks like a numpy array of five values.
http://docs.scipy.org/doc/numpy/reference/arrays.ht
On 02/01/2016 13:14, yehudak . wrote:
Vlastimil,
Thank you so much, but...
All that is Chinese for me.
Can you show a 'normal' Python code for me?
Yehuda
On Sat, Jan 2, 2016 at 2:44 PM, Vlastimil Brom
wrote:
2016-01-02 12:49 GMT+01:00 :
Hi, newbie here!
I'm trying to write a python program
2016-01-02 14:14 GMT+01:00 yehudak . :
> Vlastimil,
> Thank you so much, but...
> All that is Chinese for me.
> Can you show a 'normal' Python code for me?
>
> Yehuda
>
> On Sat, Jan 2, 2016 at 2:44 PM, Vlastimil Brom
> wrote:
>>
>> 2016-01-02 12:49 GMT+01:00 :
>> > Hi, newbie here!
>> > I'm tryi
On Sun, Jan 3, 2016 at 1:52 AM, Marko Rauhamaa wrote:
> Terminology aside, if I do this with Git:
>
>-++>
> \ ^
> \pull /push
>v /
>+--+
>
On Sat, Jan 2, 2016 at 8:14 AM, yehudak . wrote:
> Vlastimil,
> Thank you so much, but...
> All that is Chinese for me.
> Can you show a 'normal' Python code for me?
>
> Yehuda
>
> On Sat, Jan 2, 2016 at 2:44 PM, Vlastimil Brom
> wrote:
>
> > 2016-01-02 12:49 GMT+01:00 :
> > > Hi, newbie here!
Chris Angelico :
> On Sun, Jan 3, 2016 at 1:26 AM, Marko Rauhamaa wrote:
>> A conflict is when there have been two parallel changes to the same
>> versioned target. In the case of Hg and Git, the whole repo is the
>> target.
>
> No, that's just a merge.
>
> https://git-scm.com/book/en/v2/Git-Bran
On Sun, Jan 3, 2016 at 1:26 AM, Marko Rauhamaa wrote:
> Chris Angelico :
>
>> I don't think you understand the meaning of "merge conflict", then. A
>> merge conflict is when you cannot simply merge the changes.
>
> A conflict is when there have been two parallel changes to the same
> versioned tar
On Sat, Jan 2, 2016 at 5:12 AM, Chris Angelico wrote:
> On Sat, Jan 2, 2016 at 5:43 PM, Steven D'Aprano wrote:
>> There are times where everybody should do the same thing -- choosing whether
>> to drive on the left or the right side of the road, for example. And there
>> are times where following
Vlastimil,
Thank you so much, but...
All that is Chinese for me.
Can you show a 'normal' Python code for me?
Yehuda
On Sat, Jan 2, 2016 at 2:44 PM, Vlastimil Brom
wrote:
> 2016-01-02 12:49 GMT+01:00 :
> > Hi, newbie here!
> > I'm trying to write a python program to find how many trailing zeros
I also collect data by sweeping multiple parameters in a similar fashion. I
find pandas very convenient for analysis.
I don't use all the features of pandas. I mainly use it for selecting
certain rows from the data, sometimes using database style merge
operations, and plotting using matplotlib. Thi
Chris Angelico :
> I don't think you understand the meaning of "merge conflict", then. A
> merge conflict is when you cannot simply merge the changes.
A conflict is when there have been two parallel changes to the same
versioned target. In the case of Hg and Git, the whole repo is the
target.
>
Hi,
I read a code snippet, in which object w_A is:
w_A
Out[48]: array([ 0.10708809, 0.94933575, 0.8412686 , 0.03280939,
0.59985308])
Then, I don't know what is '[: ' below:
vs_A = w_A[:, None] * xs
I don't find the answer after searching around
Could you explain above code to me?
Than
2016-01-02 12:49 GMT+01:00 :
> Hi, newbie here!
> I'm trying to write a python program to find how many trailing zeros are in
> 100! (factorial of 100).
> I used factorial from the math module, but my efforts to continue failed.
> Please help.
>
> Thank you,
> Yehuda
> --
> https://mail.python.o
On Saturday, January 2, 2016 at 1:49:47 PM UTC+2, katy...@gmail.com wrote:
> Hi, newbie here!
> I'm trying to write a python program to find how many trailing zeros are in
> 100! (factorial of 100).
> I used factorial from the math module, but my efforts to continue failed.
> Please help.
>
> Th
On 2 January 2016 at 22:49, wrote:
> Hi, newbie here!
Hi Yehuda
> I'm trying to write a python program to find how many trailing zeros are in
> 100! (factorial of 100).
> I used factorial from the math module, but my efforts to continue failed.
> Please help.
There is a special mailing list
Hi, newbie here!
I'm trying to write a python program to find how many trailing zeros are in
100! (factorial of 100).
I used factorial from the math module, but my efforts to continue failed.
Please help.
Thank you,
Yehuda
--
https://mail.python.org/mailman/listinfo/python-list
On 31.12.2015 21:18, Ben Finney wrote:
> As best I can tell, Steven is advocating a way to obscure information
> from the traceback, on the assumption the writer of a library knows that
> I don't want to see it.
How do you arrive at that conclusion? The line that raises the exception
is exactly t
On Sat, Jan 2, 2016 at 10:22 PM, Marko Rauhamaa wrote:
> Chris Angelico :
>
>> On Sat, Jan 2, 2016 at 8:48 PM, Marko Rauhamaa wrote:
>>> Having struggled with Perforce, SVN and CVS, I was hopeful Mercurial
>>> would be everything Teamware was.
>>>
>>> Unfortunately, it wasn't. The big disappointm
Chris Angelico :
> On Sat, Jan 2, 2016 at 8:48 PM, Marko Rauhamaa wrote:
>> Having struggled with Perforce, SVN and CVS, I was hopeful Mercurial
>> would be everything Teamware was.
>>
>> Unfortunately, it wasn't. The big disappointment was the treatment of
>> a repository as the atomic unit.
>
>
On Sat, Jan 2, 2016 at 8:48 PM, Marko Rauhamaa wrote:
> Having struggled with Perforce, SVN and CVS, I was hopeful Mercurial
> would be everything Teamware was.
>
> Unfortunately, it wasn't. The big disappointment was the treatment of a
> repository as the atomic unit.
You'll need to elaborate on
Steven D'Aprano :
> Oh, and talking about DVCS:
>
> https://bitquabit.com/post/unorthodocs-abandon-your-dvcs-and-retur
> n-to-sanity/
It's interesting how different opinions people can have about version
control. I also have mine.
I have seen the paradise, which was Sun's Teamware. I haven't tri
56 matches
Mail list logo
