| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2014-07-03 | Swap to bitwise hasSet() | Eric Anderson | |
| Using bitwise operations yields over a 2x speedup. The iteration order of hasSet was reversed which causes it to be within 60% of the performance of hasSetWithLast, instead of 6x slower. It was also rewritten to use hasSetWithLast for better code reuse. | |||
| 2014-07-03 | go fmt fixes | Eric Anderson | |
| 2014-07-02 | Reversed the card order | Joe Anderson | |
| 2014-07-02 | Added arg parsing and test case, fixed an ungeneralized 18 | Joe Anderson | |
| 2014-07-01 | Generalize to any dimension, organizing in the process | Eric Anderson | |
| 2014-06-30 | Performance improvements, tests, and benchmarks | Eric Anderson | |
| 2014-06-30 | Faithful port to Go | Eric Anderson | |
| It is around 60 times faster | |||
 |
index : capset | |
| Capset discovery tool | ejona86@gmail.com jandew@gmail.com |
| summaryrefslogtreecommitdiff |