in reply to Re: Faster push and shift
in thread Faster push and shift

What’s the difference here, BrowserUK?   (Really, that’s quite the sincere question.)   Kindly enlighten us all:   What is the key change from the OP that will make it faster, and how much faster do you predict it now will be?   ... And under what governing assumptions?

Replies are listed 'Best First'.
Re^3: Faster push and shift
by BrowserUk (Patriarch) on Feb 16, 2012 at 14:49 UTC
    how much faster do you predict it now will be?

    Doing it the OPs way on 1 million records takes 3.3 seconds:

    c:\test>junk91 junk.dat 3.25699996948242 ([1, 3, 4, 4, 1, 3, 2], [4, 4, 4, 4, 4, 4, 4])

    Same file doing it my way produces the same results in 1/2 a millisecond:

    c:\test>junk91-2 junk.dat 0.000479936599731445 ([1, 3, 4, 4, 1, 3, 2], [4, 4, 4, 4, 4, 4, 4])

    I make that 6,600 times faster. The OPs mileage my vary.


    With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
    Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
    "Science is about questioning the status quo. Questioning authority".
    In the absence of evidence, opinion is indistinguishable from prejudice.

    The start of some sanity?