Coffeehouse Thread

10 posts

JavaScript engines

Back to Forum: Coffeehouse
  • User profile image
    Erisan
  • User profile image
    stun

    Holy cow !!!

    SquirrelFish Extreme: 943.3 ms
    V8: 1280.6 ms
    TraceMonkey: 1464.6 ms

  • User profile image
    Bass

    I heard SquirrelFish Extreme can execute an infinite loop in 3 seconds. Is this true?


  • User profile image
    Yggdrasil

    Bass said:
    I heard SquirrelFish Extreme can execute an infinite loop in 3 seconds. Is this true?


    Only for very small values of infinity.

  • User profile image
    evildictait​or

    Bass said:
    I heard SquirrelFish Extreme can execute an infinite loop in 3 seconds. Is this true?


    And it can solve NP-complete problems in polynomial time.

  • User profile image
    JChung2006

    It looks like Allen Wirfs-Brock and Pratap Lakshman have some work to do for the next JScript.  Chop chop, fellas!

  • User profile image
    stun

    I heard SquirrelFish Extreme can execute an infinite loop in 3 seconds. Is this true?
    Only for very small values of infinity.
    And it can solve NP-complete problems in polynomial time.
    Chuck Norris owns all of you.
    He counted to the Infinity twice in a O(1) time.
    Chuck Norris does not need to solve the NP-complete problem.
    He himself is The Solution. Tongue Out

  • User profile image
    Sampy

    stun said:
    I heard SquirrelFish Extreme can execute an infinite loop in 3 seconds. Is this true?
    Only for very small values of infinity.
    And it can solve NP-complete problems in polynomial time.
    Chuck Norris owns all of you.
    He counted to the Infinity twice in a O(1) time.
    Chuck Norris does not need to solve the NP-complete problem.
    He himself is The Solution. Tongue Out
    I lol'd

  • User profile image
    Ion Todirel

    stun said:
    I heard SquirrelFish Extreme can execute an infinite loop in 3 seconds. Is this true?
    Only for very small values of infinity.
    And it can solve NP-complete problems in polynomial time.
    Chuck Norris owns all of you.
    He counted to the Infinity twice in a O(1) time.
    Chuck Norris does not need to solve the NP-complete problem.
    He himself is The Solution. Tongue Out
    lol how true Smiley

  • User profile image
    intelman

    I like how they can't include IE8 in the benchmarks because it is 8-10 times slower...



    IE8 is ~ 10 times slower than the others.
    So it doesn’t really qualify for this benchmark.. It would only make the bar graph unreadable.


    Guess that is why I use Mozilla Nightlies and Google Chrome...

Comments closed

Comments have been closed since this content was published more than 30 days ago, but if you'd like to continue the conversation, please create a new thread in our Forums, or Contact Us and let us know.