Skip to content

Inefficient first N primes find web app for performance profiling

Notifications You must be signed in to change notification settings

bahmutov/vanilla-primes

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

17 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

vanilla-primes

Vanilla JS application to find first N primes to show performance profiling

Use code snippets

Tags:

  • 0-profile-method-call - initial unoptimized application. Try finding 1000 primes, should take about 8 seconds.
  • 1-removed-try-catch - removed first bottleneck, should take less than 5 seconds.
  • 2-reuse-primes - reusing previously found primes, makes finding 10k primes very fast.

The next two steps require running static server in order to load the web worker script.

  • 3-web-worker - moved primes computation to a web worker.
  • 4-paint-profile - profile paint of expensive CSS property (box-shadow in index.html)

If you need angular version of this application, see bahmutov/primes.

Small print

Author: Gleb Bahmutov © 2014

License: MIT - do anything with the code, but don't blame me if it does not work.

Spread the word: tweet, star on github, etc.

Support: if you find any problems with this module, email / tweet / open issue on Github

About

Inefficient first N primes find web app for performance profiling

Resources

Stars

Watchers

Forks

Packages

No packages published