Algorithms/go-perfbook
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

mention prove pass for bce

Browse Source
This commit is contained in:
Damian Gryski 2019-03-13 09:51:47 -07:00
parent 2de923ef2e
commit ab6f5adfff
1 changed files with 1 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
performance.md
View File

@ -763,6 +763,7 @@ Tunings can take many forms.
* code size. vs branch test overhead * code size. vs branch test overhead
* using offsets instead of slice assignment can help with bounds checks, data dependencies, and code gen (less to copy in inner loop). * using offsets instead of slice assignment can help with bounds checks, data dependencies, and code gen (less to copy in inner loop).
* remove bounds checks and nil checks from loops: https://go-review.googlesource.com/c/go/+/151158 * remove bounds checks and nil checks from loops: https://go-review.googlesource.com/c/go/+/151158
* other tricks for the prove pass
* this is where pieces of Hacker's Delight fall * this is where pieces of Hacker's Delight fall
* consider different number representations: fixed-point, floating-point, (smaller) integers, * consider different number representations: fixed-point, floating-point, (smaller) integers,
* fancier: integers with error accumulators (e.g. Bresenham's line and circle), multi-base numbers / redundant number systems * fancier: integers with error accumulators (e.g. Bresenham's line and circle), multi-base numbers / redundant number systems