Timeline for Gray codes addition — Take 2
Current License: CC BY-SA 3.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2017 at 12:40 | history | edited | CommunityBot | replaced http://stackoverflow.com/ with https://stackoverflow.com/ | |
| Apr 13, 2017 at 12:40 | history | edited | CommunityBot | replaced http://codereview.stackexchange.com/ with https://codereview.stackexchange.com/ | |
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot | replaced http://math.stackexchange.com/ with https://math.stackexchange.com/ | |
| Nov 6, 2016 at 12:21 | history | edited | Morwenn | CC BY-SA 3.0 | Described the notation prior to its used. |
| Nov 6, 2016 at 11:49 | history | edited | Morwenn | CC BY-SA 3.0 | Lucas -> Lucal |
| Jun 3, 2015 at 12:57 | history | edited | Morwenn | CC BY-SA 3.0 | Added terminology link to Math.SE. |
| May 4, 2015 at 15:16 | vote | accept | Morwenn | ||
| Apr 22, 2015 at 9:05 | answer | added | Morwenn | timeline score: 2 | |
| Apr 20, 2015 at 9:12 | answer | added | Emily L. | timeline score: 3 | |
| Apr 13, 2015 at 7:27 | history | edited | Morwenn | CC BY-SA 3.0 | Consistently use « I » instead of « we ». |
| Apr 10, 2015 at 8:35 | history | tweeted | twitter.com/#!/StackCodeReview/status/586447513349005312 | ||
| Apr 10, 2015 at 7:20 | history | edited | Morwenn | CC BY-SA 3.0 | added 104 characters in body |
| Apr 9, 2015 at 15:18 | history | edited | Morwenn | CC BY-SA 3.0 | Added note about mathematical symbols abuse. |
| Apr 9, 2015 at 12:04 | comment | added | Morwenn | @ratchetfreak Actually, the algorithm I use is derived from this one, except that I round up to the next lowest power of 2 instead of the next highest. | |
| Apr 9, 2015 at 11:41 | comment | added | Morwenn | @ratchetfreak The isomsb function is already using a bithack found on such a site. It boils down to 5 iterations for a 32-bits integer and 6 iterations for a 64-bits integer. I like it since it's generic and pretty fast. It seems that the compiler uses the fact that the bound is known at compile-time to unroll the loop, so it probably ends up with ~13 instructions for a 32-bits integer. | |
| Apr 9, 2015 at 10:45 | comment | added | ratchet freak | consider using one of the bit hacks found on this site | |
| Apr 9, 2015 at 10:25 | history | asked | Morwenn | CC BY-SA 3.0 |