Timeline for Is this number a factorial?
Current License: CC BY-SA 4.0
47 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 28, 2021 at 23:26 | history | edited | Deadcode | CC BY-SA 4.0 |
Update TIOs to have no-newline end
|
| Mar 25, 2021 at 0:07 | history | edited | Deadcode | CC BY-SA 4.0 |
I realized that when used inside a loop, molecular lookahead may be able to do things that are impossible with variable-length lookbehind, because the rollback done by a lookbehind has to be popped out of before going to the next iteration.
|
| Mar 18, 2021 at 23:12 | history | edited | Deadcode | CC BY-SA 4.0 |
added 4 characters in body
|
| Mar 18, 2021 at 23:03 | history | edited | Deadcode | CC BY-SA 4.0 |
Add 92 byte regex adapted into a 99 byte return inverse factorial regex with molecular lookahead + reset start
|
| Mar 18, 2021 at 22:24 | history | edited | Deadcode | CC BY-SA 4.0 |
Add 92 byte regex adapted into a 103 byte molecular lookahead return inverse factorial regex
|
| Mar 18, 2021 at 20:27 | history | edited | Deadcode | CC BY-SA 4.0 |
edited body
|
| Mar 18, 2021 at 20:22 | history | edited | Deadcode | CC BY-SA 4.0 |
Add molecular lookahead version of return inverse factorial
|
| Mar 18, 2021 at 20:04 | history | edited | Deadcode | CC BY-SA 4.0 |
Demonstrate that the 96 byte version returns the inverse factorial minus 1 in a capture group, and edit "accident" -> "coincidence"
|
| Mar 18, 2021 at 19:41 | history | edited | Deadcode | CC BY-SA 4.0 |
Improve literal accuracy of the comments for the inverse factorial optimized version
|
| Mar 18, 2021 at 12:39 | history | edited | Deadcode | CC BY-SA 4.0 |
-3 bytes on return inverse factorial version
|
| Mar 18, 2021 at 11:57 | history | edited | Deadcode | CC BY-SA 4.0 |
Optimize the ECMAScript + \K version of the inverse factorial optimized regex
|
| Mar 18, 2021 at 11:46 | history | edited | Deadcode | CC BY-SA 4.0 |
Add comparable ECMAScript + \K version (without the minus 1)
|
| Mar 18, 2021 at 11:40 | history | edited | Deadcode | CC BY-SA 4.0 |
Add a version optimized for returning the inverse factorial as a match
|
| Mar 18, 2021 at 4:19 | history | edited | Deadcode | CC BY-SA 4.0 |
-1 byte on "Return inverse factorial or no-match, in ECMAScript + \K"
|
| Mar 18, 2021 at 4:11 | history | edited | Deadcode | CC BY-SA 4.0 |
-2 bytes on "Return inverse factorial or no-match, in ECMAScript + \K"
|
| Mar 18, 2021 at 3:54 | history | edited | Deadcode | CC BY-SA 4.0 |
Optimize the plain ECMAScript version of "Return inverse factorial or no-match" from 112 → 109 bytes
|
| Mar 18, 2021 at 3:48 | history | edited | Deadcode | CC BY-SA 4.0 |
Oops, had updated the "Return inverse factorial or no-match" TIO but not its plain markdown
|
| Mar 14, 2021 at 18:35 | history | edited | Deadcode | CC BY-SA 4.0 |
Edit the explanation paragraph to be up-to-date with the 92 byte regex
|
| Mar 13, 2021 at 12:16 | history | edited | Deadcode | CC BY-SA 4.0 |
Move the -n byte attributions to the top for visibility
|
| Mar 13, 2021 at 12:09 | history | edited | Deadcode | CC BY-SA 4.0 |
edited body
|
| Mar 13, 2021 at 12:03 | history | edited | Deadcode | CC BY-SA 4.0 |
Grimy → Grimmy
|
| Mar 13, 2021 at 11:58 | history | edited | Deadcode | CC BY-SA 4.0 |
Use an atom ⚛ symbol to denote solutions that used non-atomic lookahead
|
| Mar 13, 2021 at 9:02 | history | edited | Deadcode | CC BY-SA 4.0 |
-26 bytes thanks to Grimy in collaboration with H.PWiz
|
| Mar 13, 2021 at 7:38 | history | edited | Deadcode | CC BY-SA 4.0 |
this should have been done in the previous edit
|
| Feb 21, 2019 at 7:15 | history | edited | Deadcode | CC BY-SA 4.0 |
Drop 1 byte thanks to a trick found by Grimy
|
| Feb 21, 2019 at 7:00 | history | edited | Deadcode | CC BY-SA 4.0 |
In the length history, don't include the overhead used to return inverse factorial (i.e. just show the length a true/false version would have)
|
| Feb 5, 2019 at 20:42 | history | edited | Deadcode | CC BY-SA 4.0 |
Golf down the C# (.NET) TIO a bit
|
| Feb 5, 2019 at 19:24 | history | edited | Deadcode | CC BY-SA 4.0 |
Clarify the exponential-slowdown version and its TIO link
|
| Feb 5, 2019 at 12:17 | history | edited | Deadcode | CC BY-SA 4.0 |
Enable ECMAScript emulation mode in the .NET TIO link
|
| Feb 5, 2019 at 11:02 | history | edited | Deadcode | CC BY-SA 4.0 |
Replace slow Retina TIO with much faster C# (.NET) + RegexOptions.Compiled
|
| Feb 4, 2019 at 0:35 | history | edited | Deadcode | CC BY-SA 4.0 |
Replace Retina TIO code with much faster JavaScript; add note about slow-version not working in ECMAScript
|
| Jan 26, 2019 at 2:25 | history | edited | Deadcode | CC BY-SA 4.0 |
Use the more compact form of the language name
|
| Jan 26, 2019 at 2:04 | history | edited | Deadcode | CC BY-SA 4.0 |
one TIO link was next to the wrong version of the regex
|
| Jan 25, 2019 at 7:40 | history | edited | Deadcode | CC BY-SA 4.0 |
Show the exponential-slowdown byte count prominently
|
| Jan 25, 2019 at 6:24 | history | edited | Deadcode | CC BY-SA 4.0 |
Add note about exponential slowdown golf optimization
|
| Jan 24, 2019 at 18:43 | history | edited | Deadcode | CC BY-SA 4.0 |
Put the explanation of generalized division in a spoiler tag
|
| Jan 23, 2019 at 20:12 | history | edited | Deadcode | CC BY-SA 4.0 |
Optimize the "Try it online" Retina code
|
| Jan 23, 2019 at 4:39 | history | edited | Deadcode | CC BY-SA 4.0 |
Replace "Try it online" links with ones that support and use ranges
|
| Jan 22, 2019 at 23:17 | history | edited | Deadcode | CC BY-SA 4.0 |
Replace "Try it online" link with one in which the code box contains only the regex
|
| Jan 22, 2019 at 22:48 | history | edited | Deadcode | CC BY-SA 4.0 |
Use a much better Retina program to show the return values of the 125 byte regex
|
| Jan 22, 2019 at 11:00 | history | edited | Deadcode | CC BY-SA 4.0 |
Provide a "Try it online" link for the index-returning version
|
| Jan 22, 2019 at 4:41 | history | edited | Deadcode | CC BY-SA 4.0 |
Delineate the different versions of the regex more clearly
|
| Jan 22, 2019 at 4:33 | history | edited | Deadcode | CC BY-SA 4.0 |
Returning the inverse factorial isn't part of the required task here, so, 125 → 119 bytes
|
| Jan 22, 2019 at 4:20 | history | edited | Deadcode | CC BY-SA 4.0 |
deleted 26 characters in body
|
| Jan 22, 2019 at 4:14 | history | edited | Deadcode | CC BY-SA 4.0 |
added 8 characters in body
|
| Jan 22, 2019 at 4:07 | history | edited | Deadcode | CC BY-SA 4.0 |
deleted 5 characters in body
|
| Jan 22, 2019 at 4:01 | history | answered | Deadcode | CC BY-SA 4.0 |