-
floitschV8@gmail.com authored
If there are few non-zero digits and the 10^exponent fits into a double then we can compute the result using 1 (or 2) double operations. BUG= TEST= Review URL: http://codereview.chromium.org/3584015 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@5603 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
ce666fc2
| Name |
Last commit
|
Last update |
|---|---|---|
| benchmarks | ||
| include | ||
| samples | ||
| src | ||
| test | ||
| tools | ||
| .gitignore | ||
| AUTHORS | ||
| ChangeLog | ||
| LICENSE | ||
| SConstruct |