Algorithm that makes maximum compression of completly diffused data.

I am searching for the program or algorithm that makes the best possible of completly (diffused data/random noise) and wonder what the state of art compression is. I understand this is not the correct forum but since i think i have an algorithm that can do this very good, and do not know where

Re: First day beginner to python, add to counter after nested loop

Den onsdagen den 30:e oktober 2013 kl. 19:01:40 UTC+1 skrev Antoon Pardon: > Op 30-10-13 17:31, jonas.thornv...@gmail.com schreef: > > > Den onsdagen den 30:e oktober 2013 kl. 17:22:23 UTC+1 skrev Mark Lawrence: > > >> > > >> I have no need to implement a newsreader as I can quite happily send a

Re: Algorithm that makes maximum compression of completly diffused data.

Den onsdagen den 30:e oktober 2013 kl. 19:53:59 UTC+1 skrev Mark Lawrence: > On 30/10/2013 18:21, jonas.thornv...@gmail.com wrote: > > > I am searching for the program or algorithm that makes the best possible of > > completly (diffused data/random noise) and wonder what the state of art > > com

Re: Algorithm that makes maximum compression of completly diffused data.

Den onsdagen den 30:e oktober 2013 kl. 20:18:30 UTC+1 skrev Mark Lawrence: > On 30/10/2013 19:01, jonas.thornv...@gmail.com wrote: > > > > > > And your still a stupid monkey i dare you to go test your IQ. > > > > > > > It's you're as in you are and not your as in belongs to me. > > > > I h

Re: Algorithm that makes maximum compression of completly diffused data.

Den onsdagen den 30:e oktober 2013 kl. 20:18:30 UTC+1 skrev Mark Lawrence: > On 30/10/2013 19:01, jonas.thornv...@gmail.com wrote: > > > > > > And your still a stupid monkey i dare you to go test your IQ. > > > > > > > It's you're as in you are and not your as in belongs to me. > > > > I h

Re: First day beginner to python, add to counter after nested loop

Den onsdagen den 30:e oktober 2013 kl. 20:05:07 UTC+1 skrev Mark Lawrence: > On 30/10/2013 18:43, jonas.thornv...@gmail.com wrote: > > > And ***that is not by having every stupid anal monkey sitting manually > > removing linebreaks by hand*** > > > > > > Is that understood? > > > > > > > No

Re: Algorithm that makes maximum compression of completly diffused data.

Den onsdagen den 30:e oktober 2013 kl. 20:35:59 UTC+1 skrev Tim Delaney: > On 31 October 2013 05:21, wrote: > > I am searching for the program or algorithm that makes the best possible of > completly (diffused data/random noise) and wonder what the state of art > compression is. > > > > >

Re: First day beginner to python, add to counter after nested loop

Den onsdagen den 30:e oktober 2013 kl. 20:09:45 UTC+1 skrev Antoon Pardon: > Op 30-10-13 19:02, jonas.thornv...@gmail.com schreef: > > > Den onsdagen den 30:e oktober 2013 kl. 18:44:20 UTC+1 skrev MRAB: > > >> On 30/10/2013 16:31, jonas.thornv...@gmail.com wrote: > > >> > > >>> Den onsdagen den

Re: Algorithm that makes maximum compression of completly diffused data.

Den onsdagen den 30:e oktober 2013 kl. 20:46:57 UTC+1 skrev Modulok: > On Wed, Oct 30, 2013 at 12:21 PM, wrote: > > > > I am searching for the program or algorithm that makes the best possible of > completly (diffused data/random noise) and wonder what the state of art > compression is. > >

Re: Algorithm that makes maximum compression of completly diffused data.

Den onsdagen den 30:e oktober 2013 kl. 20:46:57 UTC+1 skrev Modulok: > On Wed, Oct 30, 2013 at 12:21 PM, wrote: > > > > I am searching for the program or algorithm that makes the best possible of > completly (diffused data/random noise) and wonder what the state of art > compression is. > >

Re: First day beginner to python, add to counter after nested loop

Den lördagen den 2:e november 2013 kl. 21:19:44 UTC+1 skrev Tim Roberts: > jonas.thornv...@gmail.com wrote: > > > > > >I certainly do not like the old bracket style it was a catastrophe, but > > >in honesty the gui editor of python should have what i propose, a parser > > >that indent automati

Re: First day beginner to python, add to counter after nested loop

Den lördagen den 2:e november 2013 kl. 21:19:44 UTC+1 skrev Tim Roberts: > jonas.thornv...@gmail.com wrote: > > > > > >I certainly do not like the old bracket style it was a catastrophe, but > > >in honesty the gui editor of python should have what i propose, a parser > > >that indent automati

Re: Algorithm that makes maximum compression of completly diffused data.

Den lördagen den 2:e november 2013 kl. 22:31:09 UTC+1 skrev Tim Roberts: > jonas.thornv...@gmail.com wrote: > > > > > >Well then i have news for you. > > > > Well, then, why don't you share it? > > > > Let me try to get you to understand WHY what you say is impossible. Let's > > say you d

Re: Algorithm that makes maximum compression of completly diffused data.

Den måndagen den 4:e november 2013 kl. 14:53:28 UTC+1 skrev jonas.t...@gmail.com: > Den lördagen den 2:e november 2013 kl. 22:31:09 UTC+1 skrev Tim Roberts: > > > jonas.thornv...@gmail.com wrote: > > > > > > > > > > > > > >Well then i have news for you. > > > > > > > > > > > > Well,

Re: Algorithm that makes maximum compression of completly diffused data.

Den måndagen den 4:e november 2013 kl. 15:27:19 UTC+1 skrev Dave Angel: > On Mon, 4 Nov 2013 05:53:28 -0800 (PST), jonas.thornv...@gmail.com > > wrote: > > > Den lördagen den 2:e november 2013 kl. 22:31:09 UTC+1 skrev Tim > > Roberts: > > > > Here's another way to look at it. If f(x) is smal

Re: Algorithm that makes maximum compression of completly diffused data.

Den torsdagen den 7:e november 2013 kl. 23:26:45 UTC+1 skrev Chris Angelico: > On Fri, Nov 8, 2013 at 5:59 AM, Mark Janssen > wrote: > > > I think the idea is that you could take any arbitrary input sequence, > > > view it as a large number, and then find what exponential equation can > > > pr

Re: Algorithm that makes maximum compression of completly diffused data.

Den fredagen den 8:e november 2013 kl. 03:17:36 UTC+1 skrev Chris Angelico: > On Fri, Nov 8, 2013 at 1:05 PM, wrote: > > > I guess what matter is how fast an algorithm can encode and decode a big > > number, at least if you want to use it for very big sets of random data, or > > losless video

Re: Algorithm that makes maximum compression of completly diffused data.

Den fredagen den 8:e november 2013 kl. 03:43:17 UTC+1 skrev zipher: > >> I am not sure if it is just stupidness or laziness that prevent you from > >> seeing that 4^8=65536. > > > > > > I can see that 4^8 = 65536. Now how are you going to render 65537? You > > > claimed that you could render *a

Install Tkinter for Windows 7 64-bit

I have installed Python 3.3, and i want to add a library with some basic functions like canvas and basic geomteric objects, fonts etc. Preferably something similar to the Javascript canvas. I've looked for graphic packages, and from what i can see something called Tkinter may be what i look for

Re: Install Tkinter for Windows 7 64-bit

Here is the example file i have tried. #!/usr/bin/python # -*- coding: utf-8 -*- """ ZetCode Tkinter tutorial This program draws three rectangles filled with different colors. author: Jan Bodar last modified: January 2011 website: www.zetcode.com """ from Tkinter import Tk, Canvas, Frame, BOTH

Re: Install Tkinter for Windows 7 64-bit

Den måndagen den 11:e november 2013 kl. 17:43:12 UTC+1 skrev Chris “Kwpolska” Warrick: > On Mon, Nov 11, 2013 at 5:38 PM, wrote: > > > But i have no luck runn the Tkinter example file i downloaded in idel, it > > still says no module called Tkinter. > > IDLE* > > > === > > > Traceback (most

Uncanny valley of languages

On 01.03.2015 18:34, Mark Lawrence wrote: > On 01/03/2015 17:01, Marko Rauhamaa wrote: >> Mark Lawrence : >> >>> Are you suggesting that we Brits have a single "home accent"? If you >>> are, you need to stand up as your voice is rather muffled. That by the >>> way is a British expression that may

Re: Python Worst Practices

On 01.03.2015 03:43, Chris Angelico wrote: > Imagine if all > your Python code ran twice as fast (that's slightly better than the > IronPython figure quoted!), but worked only on BSD Unix and Mac OS. Is > that something that'll make a fledgling language succeed? I heard that Swift and Objective

Re: HELP!! How to ask a girl out with a simple witty Python code??

On 09.03.2015 14:39, Omar Abou Mrad wrote: > On Thu, Mar 5, 2015 at 3:34 AM, Xrrific wrote: > >> Guys, please Help!!! >> >> I am trying to impress a girl who is learning python and want ask her out >> at the same time. >> >> Could you please come up with something witty incorporating a simple >>

More or less code in python?

function naiveAdd(base,arrOne,arrTwo) { if (arrOne.length>=arrTwo.length) {length=arrOne.length;} else {length=arrTwo.length;} out=""; remainder=0; for (i=0;i

Re: More or less code in python?

Den söndag 15 mars 2015 kl. 19:32:02 UTC+1 skrev Joel Goldstick: > On Sun, Mar 15, 2015 at 2:07 PM, wrote: > > > > > > function naiveAdd(base,arrOne,arrTwo) { > > if (arrOne.length>=arrTwo.length) {length=arrOne.length;} else > > {length=arrTwo.length;} > > out=""; > > remainder=0; > > for (i=0

Re: More or less code in python?

Den söndag 15 mars 2015 kl. 19:32:02 UTC+1 skrev Joel Goldstick: > On Sun, Mar 15, 2015 at 2:07 PM, wrote: > > > > > > function naiveAdd(base,arrOne,arrTwo) { > > if (arrOne.length>=arrTwo.length) {length=arrOne.length;} else > > {length=arrTwo.length;} > > out=""; > > remainder=0; > > for (i=0

Re: More or less code in python?

Den söndag 15 mars 2015 kl. 20:01:36 UTC+1 skrev Paul Rubin: > jonas.thornv...@gmail.com writes: > > I though it would be interesting doing comparissons in timing adding > > massive digits in different bases. Especially in Python. > > Python has built-in bignums. Try "print 2**500". I know. --

Re: More or less code in python?

Den söndag 15 mars 2015 kl. 20:01:36 UTC+1 skrev Paul Rubin: > jonas.thornv...@gmail.com writes: > > I though it would be interesting doing comparissons in timing adding > > massive digits in different bases. Especially in Python. > > Python has built-in bignums. Try "print 2**500". I will try i

Re: generator/coroutine terminology

On 16.03.2015 13:02, Steven D'Aprano wrote: > (To be honest, I'm not even sure what the use-case for close() on coroutines > is in the first place. If you don't want to send any more items into it, > just don't send any more items into it.) Just like with file-likes, it is useful to clean up resou

Re: Auto-completion: why not module name?

On 16.03.2015 17:40, Chris Angelico wrote: > This is a very plausible feature request, but be aware that it will > involve a very costly disk search. Figuring out what modules could be > imported means going through the entire Python module search path, > enumerating .py (and other) files, and that

Best search algorithm to find condition within a range

I want todo faster baseconversion for very big bases like base 1 000 000, so instead of adding up digits i search it. I need the fastest algorithm to find the relation to a decimal number. Digmult is an instance of base at a digitplace (base^x) what i try to find is the digit for the below c

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 15:30:36 UTC+2 skrev Dave Angel: > On 04/07/2015 05:44 AM, jonas.thornv...@gmail.com wrote: > > > > > > I want todo faster baseconversion for very big bases like base 1 000 000, > > so instead of adding up digits i search it. > > For this and most of the following stat

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 16:30:15 UTC+2 skrev Denis McMahon: > On Tue, 07 Apr 2015 09:29:59 -0400, Dave Angel wrote: > > > On 04/07/2015 05:44 AM, jonas.thornv...@gmail.com wrote: > > >> I want todo faster baseconversion for very big bases like base 1 000 > >> 000, so instead of adding up digi

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 16:32:56 UTC+2 skrev Ian: > On Tue, Apr 7, 2015 at 3:44 AM, wrote: > > > > > > I want todo faster baseconversion for very big bases like base 1 000 000, > > so instead of adding up digits i search it. > > > > I need the fastest algorithm to find the relation to a deci

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 17:00:53 UTC+2 skrev MRAB: > On 2015-04-07 15:36, jonas.thornv...@gmail.com wrote: > > Den tisdag 7 april 2015 kl. 16:30:15 UTC+2 skrev Denis McMahon: > >> On Tue, 07 Apr 2015 09:29:59 -0400, Dave Angel wrote: > >> > >>> On 04/07/2015 05:44 AM, jonas.thornv...@gmail.com

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 17:07:36 UTC+2 skrev Ian: > On Tue, Apr 7, 2015 at 8:36 AM, wrote: > > Den tisdag 7 april 2015 kl. 16:30:15 UTC+2 skrev Denis McMahon: > >> On Tue, 07 Apr 2015 09:29:59 -0400, Dave Angel wrote: > >> > >> > On 04/07/2015 05:44 AM, jonas.thornv...@gmail.com wrote: > >> >

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 16:30:15 UTC+2 skrev Denis McMahon: > On Tue, 07 Apr 2015 09:29:59 -0400, Dave Angel wrote: > > > On 04/07/2015 05:44 AM, jonas.thornv...@gmail.com wrote: > > >> I want todo faster baseconversion for very big bases like base 1 000 > >> 000, so instead of adding up digi

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 18:34:32 UTC+2 skrev Dave Angel: > On 04/07/2015 11:40 AM, jonas.thornv...@gmail.com wrote: > > Den tisdag 7 april 2015 kl. 16:32:56 UTC+2 skrev Ian: > >> On Tue, Apr 7, 2015 at 3:44 AM, wrote: > >>> > >>> > >>> I want todo faster baseconversion for very big bases like

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 21:27:20 UTC+2 skrev Ben Bacarisse: > Ian Kelly writes: > > > On Tue, Apr 7, 2015 at 12:55 PM, Terry Reedy wrote: > >> On 4/7/2015 1:44 PM, Ian Kelly wrote: > >> > >> def to_base(number, base): > >>> > >>> ... digits = [] > >>> ... while number > 0: > >>>

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 00:57:27 UTC+2 skrev Steven D'Aprano: > On Tue, 7 Apr 2015 07:44 pm, jonas.thornv...@gmail.com wrote: > > > > I want todo faster baseconversion for very big bases like base 1 000 000, > > so instead of adding up digits i search it. > > What digits would you use for ba

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 03:00:12 UTC+2 skrev Gregory Ewing: > Steven D'Aprano wrote: > > > What digits would you use for base one-million? > > Interesting question. Unicode currently has about > 75,000 CJK characters, so we would need to find about > 12 more independently developed cultures w

Re: Best search algorithm to find condition within a range

st, not including the memory used by > its 12 int items. (Results may vary in other versions of Python.) You can't > do arithmetic on it faster than Python's built-ins. > > Besides, it isn't clear to me whether Jonas wants to convert decimal > 293...490 *into* base 4

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 09:16:24 UTC+2 skrev Ian: > On Tue, Apr 7, 2015 at 4:35 PM, wrote: > > I am not sure you guys realised, that althoug the size of the factors to > > muliply expands according to base^(exp+1) for each digitplace the number of > > comparissons needed to reach the digit

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 09:16:24 UTC+2 skrev Ian: > On Tue, Apr 7, 2015 at 4:35 PM, wrote: > > I am not sure you guys realised, that althoug the size of the factors to > > muliply expands according to base^(exp+1) for each digitplace the number of > > comparissons needed to reach the digit

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 15:40:46 UTC+2 skrev Mel Wilson: > On Tue, 07 Apr 2015 23:19:49 -0700, jonas.thornvall wrote: > > > And you have just created 429496729 unique symbols ;), in a pencil > > stroke. > > No. You did that, when you said base 429496729. Representing the > symbols in a com

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 19:34:39 UTC+2 skrev Mel Wilson: > On Wed, 08 Apr 2015 07:56:05 -0700, jonas.thornvall wrote: > > > There is no need for inventing a new set of characters representing > > 32-bit numbers. You will not be able to learn them by heart anyway, > > unless they build on a int

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 21:28:34 UTC+2 skrev jonas.t...@gmail.com: > Den onsdag 8 april 2015 kl. 19:34:39 UTC+2 skrev Mel Wilson: > > On Wed, 08 Apr 2015 07:56:05 -0700, jonas.thornvall wrote: > > > > > There is no need for inventing a new set of characters representing > > > 32-bit numbers. Y

Re: Best search algorithm to find condition within a range

Den torsdag 9 april 2015 kl. 17:02:24 UTC+2 skrev Chris Angelico: > On Fri, Apr 10, 2015 at 12:53 AM, Alain Ketterlin > wrote: > > Ouch, you're right, I tried to stick with Marko's example and forgot the > > basics. I meant "signed ints", but the "removable" condition should be > > something like:

Re: Best search algorithm to find condition within a range

Den torsdag 9 april 2015 kl. 17:04:53 UTC+2 skrev Ian: > On Thu, Apr 9, 2015 at 8:54 AM, wrote: > > Aside from the base changer i've written a bignumb anybase generic > > multiplication, addition and subtraction routine. My goal is to make the > > arithmetic in the base of choice whatever size.

Re: Best search algorithm to find condition within a range

Den torsdag 9 april 2015 kl. 16:08:48 UTC+2 skrev Chris Angelico: > On Thu, Apr 9, 2015 at 11:57 PM, Alain Ketterlin > wrote: > > Because, in: > > > > z = x+y; // all signed ints > > if ( z < x ) > > ... > > > > either there was no overflow (and the condition is false), or there wa

Re: find all multiplicands and multipliers for a number

Den lördag 11 april 2015 kl. 09:35:22 UTC+2 skrev Steven D'Aprano: > On Sat, 11 Apr 2015 04:08 pm, Paul Rubin wrote: > > > Steven D'Aprano writes: > >> It may be a bit slow for very large numbers. On my computer, this takes > >> 20 seconds: > >> py> pyprimes.factors.factorise(2**111+1) > >> [3, 3

Generarl programming question.

If two functions crossreference eachother back and forth what happen with the local variables. Will there be a new instance of function holding the variables or do they get messed up? -- https://mail.python.org/mailman/listinfo/python-list

Re: Generarl programming question.

Den lördag 11 april 2015 kl. 17:16:09 UTC+2 skrev Chris Angelico: > On Sun, Apr 12, 2015 at 1:00 AM, wrote: > > If two functions crossreference eachother back and forth what happen with > > the local variables. > > > > Will there be a new instance of function holding the variables or do they >

Re: Generarl programming question.

Den lördag 11 april 2015 kl. 17:26:03 UTC+2 skrev Steven D'Aprano: > On Sun, 12 Apr 2015 01:00 am, jonas.thornv...@gmail.com wrote: > > > If two functions crossreference eachother back and forth what happen with > > the local variables. > > Nothing. They are local to the function that creates the

Re: Building CPython

On 16.05.2015 02:55, Gregory Ewing wrote: > BartC wrote: >> For example, there is a /specific/ byte-code called BINARY_ADD, which >> then proceeds to call a /generic/ binary-op handler! This throws away >> the advantage of knowing at byte-code generation time exactly which >> operation is needed. >

Re: Best way to rewrite Popen

On 19.05.2015 19:01, Cecil Westerhof wrote: > At the moment I am playing with things like: > p = subprocess.Popen('ls -l', shell = True, stdout = subprocess.PIPE) > > I think that most of the times this are the values I want. So it would > be nice to overrule the defaults. What is the best way

Re: Testing random

case. For some use cases, the ``fake_random`` might be good enough (unittesting would be such a case: it is certainly uniformly distributed and allows full coverage of the tested range), for others it would fail catastrophically (don’t generate your cryptographic keys with this!). cheers, Jona

Re: Did the 3.4.4 docs get published early?

On 10.06.2015 17:05, Zachary Ware wrote: > On Jun 10, 2015 9:41 AM, "Mark Lawrence" wrote: >> >> On 10/06/2015 15:11, Nicholas Chammas wrote: >>> >>> For example, here is a "New in version 3.4.4" method: >>> >>> https://docs.python.org/3/library/asyncio-task.html#asyncio.ensure_future >>> >>> Howe

Re: Set a flag on the function or a global?

-BEGIN PGP SIGNED MESSAGE- Hash: SHA512 On 16.06.2015 01:57, Steven D'Aprano wrote: > Alternatively, I can use a flag set on the function object itself: > > edir.dunders = False > > > Naturally you can always override the default by explicitly > specifying a keyword argument edir(obj,

Python functionality in Javascript

Check this out using a 8 digit base with a 100 digit number no problem. http://jt.node365.se/baseconversion3.html -- https://mail.python.org/mailman/listinfo/python-list

Linear time baseconversion

http://jt.node365.se/baseconversion8.html -- https://mail.python.org/mailman/listinfo/python-list

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 01:11:51 UTC+2 skrev Ian: > On Mon, Jun 29, 2015 at 4:56 PM, Ian Kelly wrote: > > On Mon, Jun 29, 2015 at 4:39 PM, wrote: > >> http://jt.node365.se/baseconversion8.html > > > > Back of the envelope mental calculation, that appears to be quadratic, > > not linear. Doub

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 01:11:51 UTC+2 skrev Ian: > On Mon, Jun 29, 2015 at 4:56 PM, Ian Kelly wrote: > > On Mon, Jun 29, 2015 at 4:39 PM, wrote: > >> http://jt.node365.se/baseconversion8.html > > > > Back of the envelope mental calculation, that appears to be quadratic, > > not linear. Doub

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 02:09:17 UTC+2 skrev Ben Bacarisse: > Ian Kelly writes: > > > On Mon, Jun 29, 2015 at 4:56 PM, Ian Kelly wrote: > >> On Mon, Jun 29, 2015 at 4:39 PM, wrote: > >>> http://jt.node365.se/baseconversion8.html > > > By the way, I think you have a bug. I did my time test

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 11:08:01 UTC+2 skrev Christian Gollwitzer: > Am 30.06.15 um 10:52 schrieb jonas.thornv...@gmail.com: > > It still bug out on very big numbers if base outside integer scope. > > I am very keen on suggestions regarding the logic to make it faster. > > Concerning the algor

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 11:08:01 UTC+2 skrev Christian Gollwitzer: > Am 30.06.15 um 10:52 schrieb jonas.thornv...@gmail.com: > > It still bug out on very big numbers if base outside integer scope. > > I am very keen on suggestions regarding the logic to make it faster. > > Concerning the algor

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 11:35:06 UTC+2 skrev jonas.t...@gmail.com: > Den tisdag 30 juni 2015 kl. 11:08:01 UTC+2 skrev Christian Gollwitzer: > > Am 30.06.15 um 10:52 schrieb jonas.thornv...@gmail.com: > > > It still bug out on very big numbers if base outside integer scope. > > > I am very keen

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 11:43:55 UTC+2 skrev jonas.t...@gmail.com: > Den tisdag 30 juni 2015 kl. 11:35:06 UTC+2 skrev jonas.t...@gmail.com: > > Den tisdag 30 juni 2015 kl. 11:08:01 UTC+2 skrev Christian Gollwitzer: > > > Am 30.06.15 um 10:52 schrieb jonas.thornv...@gmail.com: > > > > It still b

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 15:22:44 UTC+2 skrev jonas.t...@gmail.com: > Den tisdag 30 juni 2015 kl. 11:43:55 UTC+2 skrev jonas.t...@gmail.com: > > Den tisdag 30 juni 2015 kl. 11:35:06 UTC+2 skrev jonas.t...@gmail.com: > > > Den tisdag 30 juni 2015 kl. 11:08:01 UTC+2 skrev Christian Gollwitzer: > >

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 18:12:46 UTC+2 skrev Michael Torrie: > Do you have some Python code to show us? No i just thought you would find the digit search algorithm interesting. -- https://mail.python.org/mailman/listinfo/python-list

Re: Bug in floating point multiplication

I fried my AMD Bulldozer last week, so I cannot check there. regards, jonas -BEGIN PGP SIGNATURE- Version: GnuPG v2 iQIcBAEBCgAGBQJVmjunAAoJEMBiAyWXYliKzDwP+wcCn9AW7EdZ/gHEmw6vW9sL MFUszpPQ3+HYPLuMn35tAy31GDozCBHze8AISHzL0oWCj6u1x7z4gxY0MKaAsRuh Gp5R5W+KHpE0tYps65SHUFUxCvf5YSR4

Re: Python Questions - July 25, 2015

-BEGIN PGP SIGNED MESSAGE- Hash: SHA512 Hi, These are quite a few questions and I’ll try to answer some of them. I have cut out the windows specific questions because I cannot answer them . On 25.07.2015 11:39, E.D.G. wrote: > At the moment our Perl programs use Windows "Pipes" plus file

Re: __main__ vs official module name: distinct module instances

-BEGIN PGP SIGNED MESSAGE- Hash: SHA512 On 02.08.2015 05:53, Cameron Simpson wrote: > When invoked this way, the module cs.app.maildb that is being > executed is actually the module named "__main__". If some other > piece of code imports "cs.app.maildb" they get a _different_ > instance

Re: Hooking Mechanism when Entering and Leaving a Try Block

-BEGIN PGP SIGNED MESSAGE- Hash: SHA512 On 13.08.2015 08:26, Sven R. Kunze wrote: > > So, I take this as a "my personal preference guideline" because I > cannot find an official document for this (maybe, I am looking at > the wrong places). - From RFC 1855 (Netiquette Guidelines

Re: Python handles globals badly.

-BEGIN PGP SIGNED MESSAGE- Hash: SHA512 On 08.09.2015 16:31, Ian Kelly wrote: > On Tue, Sep 8, 2015 at 5:55 AM, Vladimir Ignatov > wrote: >>> I had some experience programming in Lua and I'd say - that >>> language is bad example to follow. Indexes start with 1 (I am >>> not kidding) >

Re: Why is it impossible to create a compiler than can compile Python to machinecode like C?

http://www.youtube.com/watch?v=EBRMq2Ioxsc Jonas. -- http://mail.python.org/mailman/listinfo/python-list

Python forum

Hi, I'm going to say a suggestion, why don't you create a forum like the one of Ruby (http://www.rubyforums.com/)? for the novices this is a great help, better than a mail list It's also worth noting that rubyforums.com has nearly no posts (six total) because it takes very just a short time worki

Re: Python forum

Skip Montanaro wrote: > I wonder if there's a way to gateway the tutor list to the > python-forum.org forum, probably to the beginner's forum. > > Skip > > Totally in agreement with this. Thus each one chooses if wants to posting from forum or mailing list -- http://mail.python.org/mailman/li

Re: Python forum

Dave Brueck wrote: > Amen! Generally they are an abomination. > > To make matters worse, many forums that become popular are saddled with so > many > advertisements that moving from one message to another becomes a... > grueling... > lesson... in... patience. > > -Dave Then that hasn't happ

Re: Python forum

Markus Weihs wrote: > > If you speak German, there is a forum at www.python-forum.de . > There is also an english one at http://python-forum.org/py/index.php, > but as you can see, there's not much traffic :-/ > There are few messages because they are not known. I believe that they would be due

Re: Python forum

[EMAIL PROTECTED] wrote: > > What's wrong with this web forum ;-) > > http://groups-beta.google.com/group/comp.lang.python?hl=en > > c.l.python is a mailing list, usenet group and a web forum. How you > access it is up to you. There are also other nntp-to-web sites out > there, and you can even

Re: [Tutor] kernel serie

Max Noel wrote: > > The [:2] is unnecessary, as you're limiting the number of splits to > 2, so the resulting list from split() can't have more than 3 elements. > Without the [:2], it fails > Also, note that this code will likely cause the program to crash on > any system that isn't L

Re: [Tutor] Comparing a string

Alan G wrote: >>I'm tryin compare a string with a value with style of > > Use regular expressions and turn it around: > > import re > s = 'i686' > ex = re.compile('i?86') > if ex.match(s): print 'they match!' > > Is that what you mean? > > Alan G. > > Thanks, that's the way. But in a express

Weird gcc errors while installing "MySQL-python" module

Hi guys, I´m experiencing weird error messages while installing MySQL-python with easy_install... I have no idea where the errors come from. Read the whole output at http://pastebin.com/m3859cf40 It´s really a lot... Someone got ideas? Greets Jonas -- http://mail.python.org/mailman/listinfo

limiting memory consumption of Python itself or a dict in a Python program

limit"s and catching MemoryError? Thanks for your help, Jonas -- http://mail.python.org/mailman/listinfo/python-list

cPickle asymptotic performance?

Hello, I've done some benchmarking while attempting to serialize my (large) graph data structure with cPickle; I'm seeing superlinear performance (plotting it seems to suggest n^2 where n is the number of nodes of my graph), in the duration of the pickle.dump calls and I can't quite figure out wh

Re: cPickle asymptotic performance?

On Thu, 2008-06-12 at 20:57 +0200, Hrvoje Niksic wrote: > Eric Jonas <[EMAIL PROTECTED]> writes: > > > I've done some benchmarking while attempting to serialize my (large) > > graph data structure with cPickle; I'm seeing superlinear performance > > (plo

Strange urllib.unquote() behavior

n a Google App Engine request handler. So right now I have to apply unquote() twice in order to get the correct result. Any clue much appreciated. --Jonas Galvez -- http://mail.python.org/mailman/listinfo/python-list

ANN: XML builder for Python

03"; /> urn:uuid:1225c695-cfb8-4ebb--80da344efa6a 2003-12-13T18:30:02Z Some text. http://github.com/galvez/gae-rest/tree/258066f5e1a32c999e04a9313943fdfa8e64edd9/xmlbuilder.py --Jonas Galvez -- http://mail.python.org/mailman/listinfo/python-list

Re: ANN: XML builder for Python

as simple as possible, so I wouldn't even have to assign a variable on the with block ("as something"). I plan to add some validation and error checking, but for generating feeds for my Atom store it's reasonably fast and lean (just over 50 lines of code). --Jonas

Re: ANN: XML builder for Python

aving other child elements. I believe my xmlbuilder will work well for Atom, XML-RPC, SOAP etc, but definitely not for HTML! :) Overriding + is a rather clever way to prevent this (so you can actually know you're calling it inline), but I don't really see a need for it for most things XML. --Jonas Galvez, http://jonasgalvez.com.br/log -- http://mail.python.org/mailman/listinfo/python-list

Re: ANN: XML builder for Python

as suggested previously might be a good solution if you want to preserve what you've generated, tho. --Jonas Galvez -- http://mail.python.org/mailman/listinfo/python-list

Re: HTTP request error with urlopen

) file_source=open("google_source.txt", 'w') file_source.write(urllib2.urlopen(req).read()) file_source.close() I think Google blocks the User-Agent urllib2 sends. --Jonas Galvez, http://jonasgalvez.com.br/log On Thu, Jul 3, 2008 at 3:52 AM, spandana g <[EMAIL PROTECTED]> wrote: > He

Possibly something wrong with mailman ?

I'm getting lot's of messages to: undisclosed-recipients:; Which horribly scrambles my email, since no filters are applied to them. -- http://mail.python.org/mailman/listinfo/python-list

Re: Apple Mac OS X 10.6 support & compatability with Python 3 ?

gt; -- > http://mail.python.org/mailman/listinfo/python-list Met vriendelijke groeten, Jonas Geiregat jo...@geiregat.org -- http://mail.python.org/mailman/listinfo/python-list

Re: Communication between python and wxWidgets.. Help needed...

Op 19-nov-09, om 09:42 heeft Jebagnana Das het volgende geschreven: Hi Friends, I want to thank you all for doing a great job.. I seek your suggestions and valuable guidance regarding two things. 1) I'm using python 3.1.1 and wxWidgets for GUI development in my project ..

[C-API] malloc error in PyDict_New

blob/master/bjoern.c#L32 Thanks for your help! Jonas -- http://mail.python.org/mailman/listinfo/python-list

Weird Python behaviour

;]!? Is there a simple solution that separates f1 and f2 without forcing me to write code for the special case when you don't feed members to the __init__()-function? /Jonas -- http://mail.python.org/mailman/listinfo/python-list

Re: Weird Python behaviour

On 10 Ago, 13:58, Jonas Nilsson wrote: You stumbled in two python common pitfalls at once :-) One, the default arguments issue, was already pointed to you. The other one is that python variables are just names for objects. Assigning a variable never mean making a copy, it just means

<    1   2   3   >