x = initial_value
x_last = x

threshold = minimum_change
MAXITER = maximum_iterations_desired
iterations = 0

while iterations < MAXITER and x - x_last > threshold:
x_last = x
x =...

Try this from the interpreter (after creating a window)

while True:
print pygame.event.wait()

to see all the events a window typically recieves.

For a program run from a file, even if it doesn't do any event processing, the window's lifetime will be so short that it probably won't have a chance for any unprocessed events to pile up. So that...

If I've understood correctly, flip() is specifically for double-buffered surfaces ... or more specifically, for changing buffers on surfaces for which you're taking advantage of SDL double buffering...

Just typing at the interpreter so far, but I'll try loading a file. BRB.

[Edit]
Okay, it works. This seems a bit off to me; if I call the update() function it ought to do what it's supposed to,...

(Google turned up this thread for me...)

Same problem. I've tried it by typing right into Python, from the Windows shell (cmd.exe) and from a Cygwin bash shell, and got slightly different behavior...

leaves and dust

Code Style
---------------

Comments are useful for telling people WTF this code is supposed to do, but there's another aspect to readability - formatting!

Most languages allow a programmer to...

Consider the definition of a stack - last-in, first-out. If you load a bunch of stuff into a stack, and then take it all out again, you now have your original items *in reverse order*.

Take the points (1,1), (1,-1), (-1,1) and (-1,-1). Stretch the set to however wide/tall you need, then run all four through

x *= cos(a);
y *= sin(a);

It's the same principle as in the...

Construct the formula for the ellipse in standard position, and then use an affine transformation to rotate it. Better yet, if you need to draw it to screen, construct the parametric formula for the...

The Maintenance-Time Error
The original author didn't comment, used crappy and inconsistent code style, and obfuscated because it made him/her feel clever. So now when the system needs updating, the...

Haskell is a functional programming language. Similar in that respect to LISP or Scheme, but it is a lot more rigorous about types and formal math. I had the great luck to be in the 'guinea-pig'...

lmao.

Might I just bring this down to earth a bit and ask if you don't think that many bafrickingzillion possible distinct hashes will be ENOUGH??

That's exactly the question that logarithms will answer. Were invented to answer.

Going back to the definition: a^x=b --> log_a(b)=x, we have 36 as the base, and we know the result of the...

lol.
Winzip doing a pretty good job, huh?

Does Windows filter the input so much that typing ALT+(ASCII) codes won't produce the right results?

*Nuez goes to check.

Yeah, guess it does. :rolleyes:

For obvious reasons I can't recite code from memory that'll do what you're asking for, but there does exist a regexp-->DFA algorithm...on paper. You're probably already familiar with it, it's the one...