[ANN] aioxmpp 0.11.0 released

key [7]. kind regards, Jonas [1]: https://github.com/horazont/aioxmpp [2]: https://pypi.python.org/pypi/aioxmpp [3]: https://docs.zombofant.net/aioxmpp/0.11/ [4]: https://lists.zombofant.net/mailman/listinfo/aioxmpp-devel [5]: https://github.com/horazont/aioxmpp/issues [6]: aiox

Re: Not a python question, just programming logic trap?

Den torsdag 14 mars 2019 kl. 06:09:02 UTC+1 skrev Rick Johnson: > jonas.t...@gmail.com wrote: > > Nah i can't see the error is due to the "If clause" branching possibly it > > should been an elseif at instead of separate if. No there is something > > going wrong with the variables. > > Well, the

Not a python question, just programming logic trap?

Anyone who is good at see logic traps in programming? comp.lang.javascript is defunct so i try here. Using the metronome. https://midisequenser.000webhostapp.com I've tried to understand how following code can lead to that after the keyreleased the front of the keyed scrollbar raise/extend f

[ANN] aioxmpp 0.10.1 released

chat [6], whatever floats your boat. Please direct security-relevant issue reports directly to me (jo...@wielicki.name), preferably encrypted using my GPG public key [7]. kind regards, Jonas [1]: https://github.com/horazont/aioxmpp [2]: https://pypi.python.org/pypi/aioxmpp [3]: https

[ANN] aioxmpp 0.10 released

Dear subscribers, We are pleased to announce the release of aioxmpp 0.10. The current release can be obtained from GitHub [1] (check out the v0.10.0 tag) or PyPI [2]. The HTML documentation can be found at [3]. Examples can be found in the GitHub repository, in the examples sub directory. a

Output not defined

Can any web programmer tell me why output is not defined? I know this is python group but my code is so rudimentary that probably any sufficient good webprogrammer can figure it out, but i am lost."I've tried comp.lang.javascript" Problem is I've looked upon this for a week or two, and i just ca

[ANN] aioxmpp 0.9 released

Multi-User chat [6], whatever floats your boat. Please direct security-relevant issue reports directly to me (jo...@wielicki.name), preferably encrypted using my GPG public key [7]. best regards and happy-asyncio-ing, Jonas Wielicki [1]: https://github.com/horazont/aioxmpp [2]: https

[ANN] aioxmpp 0.8 released

using my GPG public key [7]. best regards and happy-asyncio-ing, Jonas Wielicki [1]: https://github.com/horazont/aioxmpp [2]: https://pypi.python.org/pypi/aioxmpp [3]: https://docs.zombofant.net/aioxmpp/0.8/ [4]: https://lists.zombofant.net/mailman/listinfo/aioxmpp-devel [5]: https

[ANN] aioxmpp 0.7.2 released

), preferrably encrypted using my GPG public key [7]. best regards and happy-asyncio-ing, Jonas Wielicki footnote 1: 0.7.0 and 0.7.1 are functionally identical. I messed up the 0.7.0 release by forgetting to change the license in the setup.py to LGPLv3+, which made PyPI show the incorrect GPLv3 license

[ANN] aioxmpp 0.7.1 (sic!) released

-relevant issue reports directly to me (jo...@wielicki.name), preferrably encrypted using my GPG public key [8]. best regards and happy-asyncio-ing, Jonas Wielicki footnote 1: 0.7.0 and 0.7.1 are functionally identical. I messed up the 0.7.0 release by forgetting to change the license in the

Re: Compression of random binary data

Den onsdag 13 juli 2016 kl. 12:05:03 UTC+2 skrev jonas.t...@gmail.com: > Den onsdag 13 juli 2016 kl. 04:29:48 UTC+2 skrev Steven D'Aprano: > > On Wed, 13 Jul 2016 03:35 am, jonas.thornv...@gmail.com wrote: > > > > > No it is only compressible down to a limit given by the algorithm. > > > > Right!

Re: Compression of random binary data

Den onsdag 13 juli 2016 kl. 04:29:48 UTC+2 skrev Steven D'Aprano: > On Wed, 13 Jul 2016 03:35 am, jonas.thornv...@gmail.com wrote: > > > No it is only compressible down to a limit given by the algorithm. > > Right! Then there is data that you can't compress. > > Suppose you have some data: > >

Re: Compression of random binary data

Den onsdag 13 juli 2016 kl. 04:29:48 UTC+2 skrev Steven D'Aprano: > On Wed, 13 Jul 2016 03:35 am, jonas.thornv...@gmail.com wrote: > > > No it is only compressible down to a limit given by the algorithm. > > Right! Then there is data that you can't compress. > > Suppose you have some data: > >

Re: Compression of random binary data

Den onsdag 13 juli 2016 kl. 00:24:23 UTC+2 skrev Ian: > On Tue, Jul 12, 2016 at 11:35 AM, wrote: > > > > No it is only compressible down to a limit given by the algorithm. > > Then your algorithm does not compress random data as you claimed. > > For some input, determine the limiting output tha

Re: Compression of random binary data

Den onsdag 13 juli 2016 kl. 00:24:23 UTC+2 skrev Ian: > On Tue, Jul 12, 2016 at 11:35 AM, wrote: > > > > No it is only compressible down to a limit given by the algorithm. > > Then your algorithm does not compress random data as you claimed. > > For some input, determine the limiting output tha

Re: Compression of random binary data

Den tisdag 12 juli 2016 kl. 21:40:36 UTC+2 skrev jonas.t...@gmail.com: > Den tisdag 12 juli 2016 kl. 20:20:52 UTC+2 skrev Michael Torrie: > > On 07/12/2016 11:46 AM, jonas.thornv...@gmail.com wrote: > > > Well the algorithm start with looking up a suitable folding structure > > > "close enough to t

Re: Compression of random binary data

Den tisdag 12 juli 2016 kl. 20:20:52 UTC+2 skrev Michael Torrie: > On 07/12/2016 11:46 AM, jonas.thornv...@gmail.com wrote: > > Well the algorithm start with looking up a suitable folding structure > > "close enough to the number", then it works down the folding > > structure finding the fold where

Re: Compression of random binary data

Den tisdag 12 juli 2016 kl. 20:20:52 UTC+2 skrev Michael Torrie: > On 07/12/2016 11:46 AM, jonas.thornv...@gmail.com wrote: > > Well the algorithm start with looking up a suitable folding structure > > "close enough to the number", then it works down the folding > > structure finding the fold where

Re: Compression of random binary data

Den tisdag 12 juli 2016 kl. 17:19:54 UTC+2 skrev Steven D'Aprano: > On Wed, 13 Jul 2016 12:29 am, jonas.thornv...@gmail.com wrote: > > > Den tisdag 12 juli 2016 kl. 05:01:20 UTC+2 skrev Lawrence D’Oliveiro: > >> On Tuesday, July 12, 2016 at 5:52:27 AM UTC+12, jonas.t...@gmail.com > >> wrote: > >>

Re: Compression of random binary data

Den tisdag 12 juli 2016 kl. 17:12:01 UTC+2 skrev Steven D'Aprano: > On Wed, 13 Jul 2016 12:24 am, jonas.thornv...@gmail.com wrote: > > > Den måndag 11 juli 2016 kl. 20:38:51 UTC+2 skrev Steven D'Aprano: > >> On Tue, 12 Jul 2016 03:52 am, jonas.thornv...@gmail.com wrote: > >> > >> > What kind of s

Re: Compression of random binary data

Den tisdag 12 juli 2016 kl. 05:01:20 UTC+2 skrev Lawrence D’Oliveiro: > On Tuesday, July 12, 2016 at 5:52:27 AM UTC+12, jonas.t...@gmail.com wrote: > > > What kind of statistic law or mathematical conjecture or is it even a > > physical law is violated by compression of random binary data? > >

Re: Compression of random binary data

Den måndag 11 juli 2016 kl. 20:38:51 UTC+2 skrev Steven D'Aprano: > On Tue, 12 Jul 2016 03:52 am, jonas.thornv...@gmail.com wrote: > > > What kind of statistic law or mathematical conjecture or is it even a > > physical law is violated by compression of random binary data? > > The pigeon hole pr

Re: Compression of random binary data

Den måndag 11 juli 2016 kl. 20:24:37 UTC+2 skrev jonas.t...@gmail.com: > Den måndag 11 juli 2016 kl. 20:09:39 UTC+2 skrev Waffle: > > On 11 July 2016 at 20:52, wrote: > > > What kind of statistic law or mathematical conjecture or is it even a > > > physical law is violated by compression of ran

Re: Compression of random binary data

Den måndag 11 juli 2016 kl. 20:09:39 UTC+2 skrev Waffle: > On 11 July 2016 at 20:52, wrote: > > What kind of statistic law or mathematical conjecture or is it even a > > physical law is violated by compression of random binary data? > > > > I only know that Shanon theorised it could not be done

Compression of random binary data

What kind of statistic law or mathematical conjecture or is it even a physical law is violated by compression of random binary data? I only know that Shanon theorised it could not be done, but were there any proof? What is to say that you can not do it if the symbolic representation is riche

[ANN] aioxmpp 0.6 released

. Please direct security-relevant issue reports directly to me (jo...@wielicki.name), preferrably encrypted using my GPG public key [9]. best regards and happy-asyncio-ing, Jonas Wielicki [1]: https://github.com/horazont/aioxmpp [2]: https://pypi.python.org/pypi/aioxmpp [3]: https

Re: Compact connected regular graphs

Den söndag 6 mars 2016 kl. 12:01:02 UTC+1 skrev Mark Lawrence: > On 06/03/2016 10:39, jonas.thornv...@gmail.com wrote: > > How come all graphs using 42 links and more then 84 nodes have compact > > regular connected solutions? > > > > Did turn off animation for more than a couple of thousands of

Compact connected regular graphs

How come all graphs using 42 links and more then 84 nodes have compact regular connected solutions? Did turn off animation for more than a couple of thousands of links so the animation is off when searching but script give message and numerical results on search. http://jt.node365.se/nodes15

Re: Condition fullfilled to early but only "sometimes"

Den tisdag 1 mars 2016 kl. 08:49:57 UTC+1 skrev Ian: > It's not at all clear what the problem is from your description. What > is it that you expect the code to do? What is it doing instead that > violates your expectation? Why are you asking for Javascript help on a > Python mailing list? > > On

Re: Condition fullfilled to early but only "sometimes"

Den tisdag 1 mars 2016 kl. 08:49:57 UTC+1 skrev Ian: > It's not at all clear what the problem is from your description. What > is it that you expect the code to do? What is it doing instead that > violates your expectation? Why are you asking for Javascript help on a > Python mailing list? > > On

Re: Condition fullfilled to early but only "sometimes"

Den tisdag 1 mars 2016 kl. 08:49:57 UTC+1 skrev Ian: > It's not at all clear what the problem is from your description. What > is it that you expect the code to do? What is it doing instead that > violates your expectation? Why are you asking for Javascript help on a > Python mailing list? > > On

Condition fullfilled to early but only "sometimes"

I've been looking at the code for two days so i am a bit crosseyed. If anyone could help me set the condition so the loop catch the last pair/pairs, it is kind of weird that it succeed sometimes and break to early and report fail others. I would be very greatful if anyone can see why it break to

Re: Loop awareness

Den måndag 29 februari 2016 kl. 21:32:51 UTC+1 skrev Ian: > On Mon, Feb 29, 2016 at 1:07 PM, wrote: > > This program creates a uniform linktree of x nodes, and it knows when it > > get stuck in a loop generating random values. > > > > Because the networks random generated, only a subset of the p

Loop awareness

This program creates a uniform linktree of x nodes, and it knows when it get stuck in a loop generating random values. Because the networks random generated, only a subset of the permutations will generate a uniform network most get stuck in loops generating random values. But the program keep

Re: General computer language, syntax question.

Den måndag 29 februari 2016 kl. 14:57:04 UTC+1 skrev jonas.t...@gmail.com: > Den måndag 29 februari 2016 kl. 14:45:37 UTC+1 skrev jonas.t...@gmail.com: > > I have a problem programming uniform networks, "x nodes with y links" that > > turn out to be really hairy to solve for me and i feel i really

Re: General computer language, syntax question.

Den måndag 29 februari 2016 kl. 14:45:37 UTC+1 skrev jonas.t...@gmail.com: > I have a problem programming uniform networks, "x nodes with y links" that > turn out to be really hairy to solve for me and i feel i really lack the > programming features > > "Actually i program in javascript" but th

General computer language, syntax question.

I have a problem programming uniform networks, "x nodes with y links" that turn out to be really hairy to solve for me and i feel i really lack the programming features "Actually i program in javascript" but the problem seem general for all programming languages including Pyhton. For a beauti

Re: Primality sieve challenge

Den söndag 17 januari 2016 kl. 10:44:47 UTC+1 skrev jonas.t...@gmail.com: > Maybe we could have a challenge finding the base with best reducion factor > upto base 100 00? One probably do not want to store more vectors than > that in memory, and i guess > > Reducing composites in the integer

Primality sieve challenge

Maybe we could have a challenge finding the base with best reducion factor upto base 100 00? One probably do not want to store more vectors than that in memory, and i guess Reducing composites in the integer field http://jt.node365.se/composite.html I've made my own kind of primality sieve

Re: Keen eyes

Den lördag 16 januari 2016 kl. 23:30:48 UTC+1 skrev Chris Angelico: > On Sun, Jan 17, 2016 at 9:23 AM, wrote: > > function factor_it(i){ > > prime=true; > > sqroot=Math.floor(Math.sqrt(i)); > > for (j=2;j > {return prime}} > > return prime; > > } > > A couple of potential problems here. The firs

Re: Keen eyes

Den lördag 16 januari 2016 kl. 23:30:48 UTC+1 skrev Chris Angelico: > On Sun, Jan 17, 2016 at 9:23 AM, wrote: > > function factor_it(i){ > > prime=true; > > sqroot=Math.floor(Math.sqrt(i)); > > for (j=2;j > {return prime}} > > return prime; > > } > > A couple of potential problems here. The firs

Keen eyes

This is not python just a short snippet of javascript that refuse tracing, i've staired blind upon it but since it does something weird with allocating memory i have no idea what is going on and the parrots and monkeys at comp.lang.javascript refuse to give a hint. Something in those loops real

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: 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: __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: 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: 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: 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: 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. 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. 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: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. 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. 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

Linear time baseconversion

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

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

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,

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: 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: 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: 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: 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: 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 >

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: 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

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. 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. 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: 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 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. 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. 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

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. 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

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 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 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. 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. 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. 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. 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. 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. 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

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: 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

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: 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: 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. 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

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: 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 >>

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

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: Bug in timsort!?

On 25.02.2015 19:41, Sturla Molden wrote: > On 25/02/15 18:22, Mario Figueiredo wrote: > >> And also presented a solution. > > Which also was incorrect :-D > > But now Benjamin Peterson has finally fixed it, it appears: > > http://bugs.python.org/issue23515 It would be too great if anyone repl

Re: Bug in timsort!?

On 25.02.2015 14:58, Sturla Molden wrote: > On 24/02/15 22:34, Roy Smith wrote: >> http://envisage-project.eu/proving-android-java-and-python-sorting-algorithm-is-broken-and-how-to-fix-it/ >> >> > […] > > Oh yes, and they mention that TimSort is used on billions of devices due > to Android mobile p

Re: Question on asyncio

On 23.02.2015 14:27, Marko Rauhamaa wrote: > pfranke...@gmail.com: >> The corresponding call is a call to the python smbus library. It >> includes several sleeps (even though they are only about 50ms). >> Therefore I think it is worthwhile to encapsulate it into a coroutine. > > Maybe. Then you'll

  1   2   3   >