On 5 July 2013 17:25, MRAB wrote:
> For comparison, here's my solution:
Unfortunately, there are some sudokus that require guessing - your
algorithm will not solve those. A combination algorithm would be best,
AFAIK.
-
FWIW, this is my interpretation of the original algorithm:
from collec
On 6 July 2013 04:25, Roy Smith wrote:
> In article ,
> Rustom Mody wrote:
>
>> > I'm a vi user. Once I mastered "hit ESC by reflex when you pause
>> > typing an insert" I was never confused above which mode I was in.
>> >
>> > And now my fingers know vi.
>
> All the vi you need to know:
>
> :
On 6 July 2013 06:19, rusi wrote:
> On Saturday, July 6, 2013 10:05:14 AM UTC+5:30, Joshua Landau wrote:
>> I never got why Vi doesn't support Ctrl-C by default -- it's not like
>> it's a used key-combination and it would have helped me so many times
>> when I
On 6 July 2013 13:59, Russel Walker wrote:
> Since I've already wasted a thread I might as well...
>
> Does this serve as an acceptable solution?
>
> def supersum(sequence, start=0):
> result = type(start)()
> for item in sequence:
> try:
> result += supersum(item, star
On 6 July 2013 15:58, wrote:
> I have a python program that reads test result information from SQL and
> creates the following data that I want to capture in a data structure so it
> can be prioritized appropriately :-
>
> test_name new fail P1
> test_n
On 7 July 2013 04:56, Steven D'Aprano
wrote:
> I sometimes find myself needing to promote[1] arbitrary numbers
> (Decimals, Fractions, ints) to floats. E.g. I might say:
>
> numbers = [float(num) for num in numbers]
>
> or if you prefer:
>
> numbers = map(float, numbers)
>
> The problem with this
On 7 July 2013 05:48, Steven D'Aprano
wrote:
> On Sun, 07 Jul 2013 05:17:01 +0100, Joshua Landau wrote:
>
>> On 7 July 2013 04:56, Steven D'Aprano
>> wrote:
> ...
>>> def promote(x):
>>> if isinstance(x, str): raise TypeError return f
On 7 July 2013 06:14, Joshua Landau wrote:
> On 7 July 2013 05:48, Steven D'Aprano
> wrote:
>> On Sun, 07 Jul 2013 05:17:01 +0100, Joshua Landau wrote:
>>
>>> On 7 July 2013 04:56, Steven D'Aprano
>>> wrote:
>> ...
>>>> def pr
On 7 July 2013 09:15, Vlastimil Brom wrote:
> 2013/7/7 Steven D'Aprano :
>> I sometimes find myself needing to promote[1] arbitrary numbers
>> (Decimals, Fractions, ints) to floats. E.g. I might say:
>>
>> numbers = [float(num) for num in numbers]
>>
>> or if you prefer:
>>
>> numbers = map(float,
On 5 July 2013 08:34, Chris Angelico wrote:
> On Fri, Jul 5, 2013 at 5:23 PM, Νίκος Gr33k wrote:
>> Of course we all know that a serial/patch/keygen/crack can be found for this
>> great edit very easily on warez or torrentz sites so it was like a common
>> secret to all of us.
>
> Actually no, I
On 8 July 2013 09:53, Sanza101 wrote:
> I just started using Python recently, and i need help with the following:
> Please assist.
Rather than saying you want help with "Please assist", why don't you
ask a question?
I find when people start their post with "I need help, please help"
they forget
On 8 July 2013 00:32, Xue Fuqiao wrote:
> Hi all,
>
> (English is not my native language; please excuse typing errors.)
>
> I'm a Python newbie and just started reading PEP 8. PEP says:
>
> ---
> |The closing brace/bracket/parent
On 8 July 2013 13:05, Sandile Mnukwa wrote:
> Hi Joshua,
Hello.
You replied off-list (to me only, not to Python-list). I imagine this
was a mistake, so I'm posting to Python-list again. If this wasn't a
mistake, then I apologize and suggest telling people when you mean to
reply off-list.
Also,
On 8 July 2013 13:02, Steven D'Aprano
wrote:
> On Mon, 08 Jul 2013 11:39:21 +0100, Joshua Landau wrote:
> Imagine:
>>
>> """
>> a_wonderful_set_of_things = {
>> bannanas_made_of_apples,
>> chocolate_covered_horn
On 8 July 2013 13:27, Dave Angel wrote:
> One of your classmates has already posted the question. However, you win
> the prize for a better subject line. Or are you the same student, changing
> your name and wasting our time by starting a new thread.
Considering the body of the question and his
On 8 July 2013 12:54, Neil Cerutti wrote:
> On 2013-07-07, Steven D'Aprano wrote:
>> On Fri, 05 Jul 2013 13:24:43 +, Neil Cerutti wrote:
>>
>>> for x in range(4):
>>>print(x)
>>> print(x) # Vader NOoOO!!!
>>
>> That loops do *not* introduce a new scope is a feature, not a bug. It
On 4 July 2013 05:36, Chris Angelico wrote:
> On Thu, Jul 4, 2013 at 2:30 PM, Joshua Landau
> wrote:
>> That said, I'm not too convinced. Personally, the proper way to do
>> what you are talking about is creating a new closure. Like:
>>
>> for i i
On 8 July 2013 21:52, CM wrote:
> I'm looking for a Pythonic way to do the following:
>
> I have data in the form of a long list of tuples. I would like to break that
> list into four sub-lists. The break points would be based on the nth
> occasion of a particular tuple. (The list represents
On 8 July 2013 22:24, Joshua Landau wrote:
> if count == 60:
Obviously this should be:
if count == length:
--
http://mail.python.org/mailman/listinfo/python-list
On 8 July 2013 21:43, Skip Montanaro wrote:
> I have an idea. Take the threads where students ask the list to do
> their homework for them (but don't have the cojones to admit that's
> what they are doing), and merge them with the obfuscated Python idea.
> A group of people could come up with the
On 8 July 2013 22:38, MRAB wrote:
> On 08/07/2013 21:56, Dave Angel wrote:
>> Characters do not have a width.
>
> [snip]
>
> It depends what you mean by "width"! :-)
>
> Try this (Python 3):
>
print("A\N{FULLWIDTH LATIN CAPITAL LETTER A}")
> AＡ
Serious question: How would one find the width
On 9 July 2013 02:45, wrote:
> all,
>
> I am unhappy with the general Python documentation and tutorials. I have
> worked with Python very little and I'm well aware of the fact that it is a
> lower-level language that integrates with the shell.
>
> I came from a VB legacy background and I've a
On 9 July 2013 03:08, Adam Evanovich wrote:
> Joshua,
>
> Why did you send me an email reply instead of replying in the google groups?
Apologies, although it's not quite that simple. I access this list the
way it was originally intended -- through EMail. I replied "to all",
which default to both
On 9 July 2013 05:46, CM wrote:
*I said*:
>> There are projects that "bundle" the CPython interpreter with your
>> project, but this makes those files really big.
>
> Maybe 5-20 MB. That's a lot bigger than a few hundred K, but it's not that
> important to keep size down, really.
Fair enough. I
On 10 July 2013 00:35, CM wrote:
> On Tuesday, July 9, 2013 5:13:17 PM UTC-4, Joshua Landau wrote:
>> On 9 July 2013 03:08, Adam Evanovich wrote:
>> > Can you wrap source code/libs/apps into an EXE and just
>> > send that to the end user? Or is it more complicated fo
On , CM wrote:
> What I was thinking of was that if you are going to sell software, you want
> to make it as easy as possible, and that includes not making the potential
> customer have to install anything, or even agree to allow you to "explicitly"
> install a runtime on their computer. If th
On 10 July 2013 05:49, CM wrote:
> On Wednesday, July 10, 2013 12:12:16 AM UTC-4, Joshua Landau wrote:
>> On , CM wrote:
>>
>> > What I was thinking of was that if you are going to sell software, you
>> > want to make it as easy as possible, and that includ
On 10 July 2013 10:12, Ian Kelly wrote:
> On Wed, Jul 10, 2013 at 2:46 AM, Mats Peterson wrote:
>>> Then they would have full control of this list and what gets pos
>>
>> Ahhh so this is pos, right? Telling the truth? Interesting.
>
> I don't know what you mean by that, but since the joke app
On 10 July 2013 08:55, Mats Peterson wrote:
> . [anumuson from Stack Overflow] has deleted all
> my postings regarding Python regular expression matching being
> extremely slow compared to Perl. Additionally my account has been
> suspended for 7 days. .
Whilst I don't normally respond to trolls,
Google Groups is writing about your recently sent mail to "Joshua
Landau". Unfortunately this address has been discontinued from usage
for the foreseeable future. The sent message is displayed below:
On 10 July 2013 12:08, Robert Kern wrote:
>
> On 2013-07-10 10:52, Jos
On 10 July 2013 13:01, Mats Peterson wrote:
> Antoon Pardon wrote:
>> Op 10-07-13 11:03, Mats Peterson schreef:
>>> Not a troll. It's just hard to convince Python users that their beloved
>>> language would have inferior regular expression performance to Perl.
>>
>> All right, you have convinced
On 10 July 2013 12:14, Antoon Pardon wrote:
> Op 10-07-13 11:03, Mats Peterson schreef:
>> Not a troll. It's just hard to convince Python users that their beloved
>> language would have inferior regular expression performance to Perl.
>
> All right, you have convinced me. Now what? Why should I ca
On 10 July 2013 13:35, Skip Montanaro wrote:
>> Either that or it's funny only to other Australians.
>
> Or the Dutch.
Or us Brits.
--
http://mail.python.org/mailman/listinfo/python-list
On 10 July 2013 15:00, Chris Angelico wrote:
> And now for something completely different.
>
> I knocked together a prime number generator, just for the fun of it,
> that works like a Sieve of Eratosthenes but unbounded. It keeps track
> of all known primes and the "next composite" that it will pr
On 10 July 2013 10:00, Steven D'Aprano wrote:
> On Wed, 10 Jul 2013 07:55:05 +, Mats Peterson wrote:
>
>> A moderator who calls himself “animuson” on Stack Overflow doesn’t want
>> to face the truth. He has deleted all my postings regarding Python
>> regular expression matching being extremely
On 10 July 2013 17:15, Chris Angelico wrote:
> On Thu, Jul 11, 2013 at 1:47 AM, bas wrote:
>> On Wednesday, July 10, 2013 5:12:19 PM UTC+2, Chris Angelico wrote:
>>> Well, that does answer the question. Unfortunately the use of lambda
>>> there has a severe performance cost [ ...]
>> If you care
On 10 July 2013 18:15, Steven D'Aprano
wrote:
> On Wed, 10 Jul 2013 16:54:02 +0100, Joshua Landau wrote:
>
>> On 10 July 2013 10:00, Steven D'Aprano wrote:
>>> On Wed, 10 Jul 2013 07:55:05 +, Mats Peterson wrote:
>>>
>>>> A moderator wh
On 10 July 2013 17:18, Ethan Furman wrote:
> On 07/10/2013 08:54 AM, Joshua Landau wrote:
>>
>> On 10 July 2013 10:00, Steven D'Aprano wrote:
>>>
>>> On Wed, 10 Jul 2013 07:55:05 +, Mats Peterson wrote:
>>>
>>>> A moderator who call
On 10 July 2013 19:56, Ian Kelly wrote:
> On Wed, Jul 10, 2013 at 11:47 AM, Joshua Landau wrote:
>>>> If you care about speed, you might want to check the heapq module.
>>>> Removing the smallest item and inserting a new item in a heap both cost
>>>> O(
On 11 July 2013 00:18, CM wrote:
>
>> I was mainly talking in the context of the original post, where it
>> seems something slightly different was meant. If you're deploying to
>> customers, you'd want to offer them an installer. At least, I think
>> you would. That's different from packing Python
On 30 June 2013 07:06, Chris Angelico wrote:
> So, here's a challenge: Come up with something really simple, and
> write an insanely complicated - yet perfectly valid - way to achieve
> the same thing. Bonus points for horribly abusing Python's clean
> syntax in the process.
This occurred to me o
I have this innocent and simple code:
from collections import deque
exhaust_iter = deque(maxlen=0).extend
exhaust_iter.__doc__ = "Exhaust an iterator efficiently without
caching any of its yielded values."
Obviously it does not work. Is there a way to get it to work simply
and without creating a
On 11 July 2013 04:57, Ben Finney wrote:
> Joshua Landau writes:
>
>> I have this innocent and simple code:
>>
>> from collections import deque
>> exhaust_iter = deque(maxlen=0).extend
>> exhaust_iter.__doc__ = "Exhaust an iterator efficiently wit
On 11 July 2013 05:13, Joshua Landau wrote:
>
Ah, I get it. It is easy to misread my post as "I have this
exhaust_iter" and it's obvious it doesn't work because why else would
I post here what do I do HALP!
Yeah, sorry -- it wasn't meant to come across that way
On 11 July 2013 07:06, Steven D'Aprano wrote:
>
> But really, I'm having trouble understanding what sort of application
> would have "run an iterator to exhaustion without doing anything with the
> values" as the performance bottleneck :-)
Definitely not this one. Heck, there's even no real reaso
On 12 July 2013 04:43, alex23 wrote:
>
> My last post seems to have been eaten by either Thunderbird or the
> EternalSeptember servers, but it contained an erroneous claim that the
> straight function version performed as well as the factory one. However, in
> the interim a co-worker has come up w
On 12 July 2013 10:27, Chris Angelico wrote:
> On Fri, Jul 12, 2013 at 7:23 PM, wrote:
>>
>> I would not care too much about the performance
>> of re.
>>
>> With the new Flexible String Representation, you
>> can use a logarithmic scale to compare re results.
>> To be honest, there is improvment
On 12 July 2013 11:45, Devyn Collier Johnson wrote:
> Could you explain what you mean? What and where is the new Flexible String
> Representation?
Do not worry. jmf is on about his old rant comparing broken previous
versions of Python to newer ones which in some microbenchmarks are
slower. I don'
On 9 July 2013 10:34, wrote:
> There is no symbole for radian because mathematically
> radian is a pure number, a unitless number. You can
> hower sepecify a = ... in radian (rad).
>
Isn't a superscript "c" the symbol for radians?
--
http://mail.python.org/mailman/listinfo/python-list
On 14 July 2013 04:09, wrote:
> http://stackoverflow.com/questions/17632246/beazley-4e-p-e-r-page29-unicode
>
> "directly writing a raw UTF-8 encoded string such as 'Jalape\xc3\xb1o' simply
> produces a nine-character string U+004A, U+0061, U+006C, U+0061, U+0070,
> U+0065, U+00C3, U+00B1, U+00
On 15 July 2013 16:50, Jack Bates wrote:
> Hello,
>
> Is the following code supposed to be an UnboundLocalError?
> Currently it assigns the value 'bar' to the attribute baz.foo
>
>foo = 'bar'
>class baz:
> foo = foo
I have two responses because I'm not sure what you're saying. Take
On 15 July 2013 23:21, Ben Last wrote:
> Hi all
>
> I'd be interested in comments on a fluent regular expression generator I've
> been playing with (inspired by the frustrations of a friend of mine who's
> learning).
>
> The general use case is to be able to construct RE strings such as:
>
> r'^\(
On 16 July 2013 07:55, Mohan L wrote:
>
> Dear All,
>
> Here is my script :
>
> #!/usr/bin/python
> import re
>
> # A string.
> logs = "date=2012-11-28 time=21:14:59"
>
> # Match with named groups.
> m =
> re.match("(?P(date=(?P[^\s]+))\s+(time=(?P[^\s]+)))",
> logs)
>
> # print
> print m.groupdic
On 16 July 2013 16:38, MRAB wrote:
> On 16/07/2013 11:18, Mohan L wrote:
>>
>> I using another third party python script. It takes the regex from
>> configuration file. I can't write any code. I have to do all this in
>> single regex.
>>
> A capture group captures a single substring.
>
> What you'
On 17 July 2013 07:15, wrote:
> Not sure, I'm correct. I took you precise string to
> refresh my memory.
I'm glad to see you doing something else, but I don't think you
understood his problem. Note that his problem has not solution, which
a few seconds of Googling has confirmed to me.
--
http:/
On 16 July 2013 23:43, John Ladasky wrote:
>
> Well, a few other parents caught wind of what I was doing with my son, and
> they asked me whether I could tutor their kids, too. I accepted the jobs
> (for pay, actually).
>
> The kids all claim to be interested. They all want to write the next g
On 18 July 2013 00:58, CTSB01 wrote:
> Please let me know if this is unclear. I will certainly continue revising
> until it makes sense to those reading.
Can you summarize what your question is? Leave aside the details of
the function, just explain what thing in particular you aren't able
to do
On 19 July 2013 23:35, Chris Angelico wrote:
> On Sat, Jul 20, 2013 at 4:54 AM, wrote:
>> And do not forget memory. The €uro just become expensive.
>>
> sys.getsizeof('
>> )
>> 26
> sys.getsizeof('€')
>> 40
>>
>> I do not know. When an €uro char need 14 bytes more that
>> a dollar, I bel
On 19 July 2013 18:29, Serhiy Storchaka wrote:
> 19.07.13 19:22, Steven D'Aprano написав(ла):
>
>> I also expect that the string replace() method will be second fastest,
>> and re.sub will be the slowest, by a very long way.
>
>
> The string replace() method is fastest (at least in Python 3.3+). S
On 20 July 2013 12:57, Serhiy Storchaka wrote:
> 20.07.13 14:16, Joshua Landau написав(ла):
>>
>> On 19 July 2013 18:29, Serhiy Storchaka wrote:
>>>
>>> The string replace() method is fastest (at least in Python 3.3+). See
>>> implementation of html.
On 20 July 2013 19:04, Dave Angel wrote:
> On 07/20/2013 01:03 PM, Joshua Landau wrote:
>>
>> Still, it seems to me that it should be optimizable for sensible
>> builtin types such that .translate is significantly faster, as there's
>> no theoretical extra work
On 20 July 2013 19:37, Joshua Landau wrote:
> mapping int -> int
Well, on second thought it's not quite this unless it's a 1:1 mapping.
Point remains valid, though, I think.
--
http://mail.python.org/mailman/listinfo/python-list
On 20 July 2013 22:56, Dave Angel wrote:
> On 07/20/2013 02:37 PM, Joshua Landau wrote:
>>
>> The problem can be solved, I'd imagine, for builtin types. Just build
>> an internal representation upon calling .translate that's faster. It's
>> especially
On 21 July 2013 08:44, Serhiy Storchaka wrote:
> 20.07.13 20:03, Joshua Landau написав(ла):
>
>> Still, it seems to me that it should be optimizable for sensible
>> builtin types such that .translate is significantly faster, as there's
>> no theoretical extra work tha
On 20 July 2013 21:22, wrote:
> Ok, I'm working on a predator/prey simulation, which evolve using genetic
> algorithms. At the moment, they use a quite simple feed-forward neural
> network, which can change size over time. Each brain "tick" is performed by
> the following function (inside the
On 21 July 2013 13:28, Serhiy Storchaka wrote:
> 21.07.13 14:29, Joshua Landau написав(ла):
>
>> On 21 July 2013 08:44, Serhiy Storchaka wrote:
>>>
>>> 20.07.13 20:03, Joshua Landau написав(ла):
>>>
>>>> Still, it seems to me that it should
On 23 July 2013 13:34, wrote:
> Hello!
> This is my first post, nice to meet you all!
> I`m biology student from Russia, trying to learn python to perform some
>
> simple simulations.
>
> Here`s my first problem.
> I`m trying to perform some simple 2d vector rotations in pygame, in order
>
> to l
On 25 July 2013 14:24, Devyn Collier Johnson wrote:
> Aloha Python Users!
>
>I made a Python3 module that allows users to use certain Linux shell
> commands from Python3 more easily than using os.system(),
> subprocess.Popen(), or subprocess.getoutput(). This module (once placed
> with the oth
On 26 July 2013 16:08, Alister wrote:
> >
> > The main point of this is for shell users that are using Python and do
> > not know some of the Python commands. This module would make Python more
> > like a Linux shell. For instance, a shell user would type boash.uname()
> > because they may not kn
On 28 July 2013 09:45, Antoon Pardon wrote:
> Op 27-07-13 20:21, wxjmfa...@gmail.com schreef:
>
>> utf-8 or any (utf) never need and never spend their time
>> in reencoding.
>>
>
> So? That python sometimes needs to do some kind of background
> processing is not a problem, whether it is garbage c
On 28 July 2013 19:29, Chris Angelico wrote:
> On Sun, Jul 28, 2013 at 7:19 PM, Joshua Landau wrote:
> > On 28 July 2013 09:45, Antoon Pardon
> wrote:
> >>
> >> Op 27-07-13 20:21, wxjmfa...@gmail.com schreef:
> >>>
> >>> utf-8 or an
On 29 July 2013 07:25, Serhiy Storchaka wrote:
> 28.07.13 22:59, Roy Smith написав(ла):
>
>The input is an 8.8 Mbyte file containing about 570,000 lines (11,000
>> unique strings).
>>
>
> Repeat you tests with totally unique lines.
Counter is about ½ the speed of defaultdict in that case (a
On 29 July 2013 12:46, Stefan Behnel wrote:
> Steven D'Aprano, 28.07.2013 22:51:
> > Calling Counter ends up calling essentially this code:
> >
> > for elem in iterable:
> > self[elem] = self.get(elem, 0) + 1
> >
> > (although micro-optimized), where "iterable" is your data (lines).
> > Calli
On 29 July 2013 19:36, Lele Gaifax wrote:
> This thread did not mention alternative and existing modules with
> (almost) the same goal, two come to mind:
>
> * https://pypi.python.org/pypi/sh
> * https://pypi.python.org/pypi/sarge
Actually, I noted both those and plumbum.
--
http://mail.python
On 29 July 2013 22:18, Skip Montanaro wrote:
> For the purposes of limiting the length you need to scan between first
> and last column, I would recommend leaving the recommended line length
> to ~ 80 columns.
>
> Just for grins, I grabbed a non-computer book, Atul Gawande's
> "Checklist Manifest
On 29 July 2013 22:34, Steven D'Aprano wrote:
> On Mon, 29 Jul 2013 15:18:59 -0500, Ed Leafe wrote:
>
> > On Jul 29, 2013, at 3:08 PM, Joel Goldstick
> > wrote:
> >> Not performance, but human readability
> >
> > IMO, this isn't always the case. There are many lines of code
> that are
> >
On 29 July 2013 21:23, Devyn Collier Johnson wrote:
>
> On 07/29/2013 04:20 PM, Tim Chase wrote:
>
>> On 2013-07-29 16:09, Dave Angel wrote:
>>
>>> On 07/29/2013 03:48 PM, Devyn Collier Johnson wrote:
>>>
The PEP8 recommends importing like this:
import os
import re
no
On 29 July 2013 23:22, Devyn Collier Johnson wrote:
> Duh, thanks for the tip (^u^), but I still get an error (different error).
> NOTE: this is all python2.7 code because Pyglet supposedly has issues with
> Python3.
>
> collier@Nacho-Laptop:~$ pip install pyglet
> Downloading/unpacking pyglet
>
On 29 July 2013 23:04, John Ladasky wrote:
> For whatever reason, the pyglet package is getting a lot of attention on
> c.l.python these past few days. I am guilty of generating some of that
> potentially off-topic conversation myself. At the end of my last thread, I
> reported that I had found
On 30 July 2013 00:08, Rhodri James wrote:
> On Mon, 29 Jul 2013 22:09:10 +0100, Steven D'Aprano <
> steve+comp.lang.python@**pearwood.info>
> wrote:
>
> On Mon, 29 Jul 2013 15:43:49 -0400, Devyn Collier Johnson wrote:
>>
>> In Python programming, the PEP8 recommends limiting lines to a maximum
On 30 July 2013 01:41, Rhodri James wrote:
> On Tue, 30 Jul 2013 01:11:18 +0100, Joshua Landau
> wrote:
>
> On 30 July 2013 00:08, Rhodri James wrote:
>>
>>> I'm working on some shonky C code at the moment that inconsistent
>>> indentation and very lon
On 30 July 2013 16:44, Skip Montanaro wrote:
> > So if everyone basically follows PEP8 we all benefit from playing by
> > the same game rules, as it were.
>
> (I think I'm agreeing with you, but nonetheless, I will forge ahead.)
>
> To the extent that 80-column window widths have been common for
On 30 July 2013 17:39, Antoon Pardon wrote:
> Op 30-07-13 18:13, MRAB schreef:
>
> On 30/07/2013 15:38, Antoon Pardon wrote:
>>
>>> Op 30-07-13 16:01, wxjmfa...@gmail.com schreef:
>>>
I am pretty sure that once you have typed your 127504 ascii
characters, you are very happy the bu
On 30 July 2013 18:08, Vito De Tullio wrote:
> Ed Leafe wrote:
>
> > I had read about a developer who switched to using proportional fonts for
> > coding, and somewhat skeptically, tried it out. After a day or so it
> > stopped looking strange, and after a week it seemed so much easier to
> > rea
On 30 July 2013 18:52, Grant Edwards wrote:
> On 2013-07-30, Joshua Landau wrote:
> > On 30 July 2013 18:08, Vito De Tullio wrote:
> >
> >> Ed Leafe wrote:
> >>
> >> > I had read about a developer who switched to using proportional fonts
> for
&
On 30 July 2013 22:47, Cameron Simpson wrote:
> On 30Jul2013 09:12, cool1...@gmail.com wrote:
> | ** urlib, urlib2
>
> Sure. And I'd use BeautifulSoup to do the parse. You'll need to fetch that.
> So: urllib[2] to fetch the document and BS to parse it for links,
> then urllib[2] to fetch the lin
On 6 September 2012 18:59, wrote:
> I want to print a series of list elements some of which may not exist,
> e.g. I have a line:-
>
> print day, fld[1], balance, fld[2]
>
> fld[2] doesn't always exist (fld is the result of a split) so the
> print fails when it isn't set.
>
What I might do i
On 10 September 2012 23:25, Vojtěch Polášek wrote:
> while running == True:
> for event in pygame.event.get():
> if event.type == blahblahblah, #processing various events
> blahblahblah, contiuing the code after events are analysed
>
> I am looking mainly for keyboard events. I no
Were I to make a language to compile to Python, it is highly likely I would
need to use hidden variable names to work constructs that Python alone does
not have. This is the situation I face.
If I were to use internal double-underscored names of the form __BS_*
internalname*__, would the compiled
On 11 September 2012 23:22, Chris Angelico wrote:
> On Wed, Sep 12, 2012 at 8:09 AM, Joshua Landau
> wrote:
> > If I were to use internal double-underscored names of the form
> > __BS_internalname__, would the compiled code be able to assume that
> no-one
> > had over
:P
I'm just using EMail through GMail, posting to python-list@python.org. If
that is the wrong way, I would love to know what I should be doing.
> On Wed, 12 Sep 2012 08:22:17 +1000, Chris Angelico wrote:
>
> > On Wed, Sep 12, 2012 at 8:09 AM, Joshua Landau
> > wrote:
> &
email address.
> On Wed, 12 Sep 2012 08:52:10 +1000, Chris Angelico wrote:
>
> > On Wed, Sep 12, 2012 at 8:48 AM, Joshua Landau
> > wrote:
> >>
> >> Well, the problem is that a lot of collisions aren't predictable.
> >> "locals()['foo&#
This is an email address linked to my GMail account. If this works better,
tell me and I'll switch. It's still sending through GMail though.
--
http://mail.python.org/mailman/listinfo/python-list
On 12/09/2012, Chris Angelico wrote:
> On Wed, Sep 12, 2012 at 11:38 AM, Joshua Landau
> wrote:
>> On 12 September 2012 02:14, Steven D'Aprano
>> wrote:
>>>
>>> On Wed, 12 Sep 2012 08:52:10 +1000, Chris Angelico wrote:
>>>
>>> > Inl
On 13 September 2012 20:53, Mark Lawrence wrote:
> On 13/09/2012 19:39, Prasad, Ramit wrote:
>
>> Dwight Hutto wrote:
>>
>>> Why don' you just time it,eit lops through incrementing thmax input/
>>>
>>
>> What? Without context I have no idea what this means.
>>
>
> You're wasting your time, I've
On 14 September 2012 18:30, Chris Angelico wrote:
> On Sat, Sep 15, 2012 at 2:15 AM, andrea crotti
> wrote:
> > The poor algorithm is much more close to the mathematical definition
> > than the smarter iterative one.. And in your second version you
> > include some ugly caching logic inside it,
On 17 September 2012 23:31, Wanderer wrote:
> I need to divide a 512x512 image array with the first horizontal and
> vertical division 49 pixels in. Then every 59 pixels in after that. hsplit
> and vsplit want to start at the edges and create a bunch of same size
> arrays. Is there a command to c
On 21 September 2012 21:49, Ian Kelly wrote:
> On Fri, Sep 21, 2012 at 1:54 PM, 8 Dihedral
> wrote:
> > I don't think functional aspects are only marked as lazy
> > programming.
>
> He wrote "lazy evaluation", not "lazy programming". Two entirely
> different things.
>
> > It just means when
On 23 September 2012 23:57, Ian Kelly wrote:
> On Sun, Sep 23, 2012 at 4:24 PM, Joshua Landau
> wrote:
> > The docs describe identifiers to have this grammar:
> >
> > identifier ::= xid_start xid_continue*
> > id_start ::= Lo,
> > Nl, the
On 24 September 2012 03:42, Terry Reedy wrote:
> On 9/23/2012 6:57 PM, Ian Kelly wrote:
>
>> On Sun, Sep 23, 2012 at 4:24 PM, Joshua Landau
>> wrote:
>>
>>> The docs describe identifiers to have this grammar:
>>>
>>> identifier ::= xid_star
101 - 200 of 437 matches
Mail list logo
