Timeline for Base Conversion With Strings
Current License: CC BY-SA 3.0
37 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Aug 16, 2018 at 17:30 | answer | added | Shaggy | timeline score: 1 | |
| Mar 25, 2016 at 13:52 | answer | added | Ven | timeline score: 3 | |
| Jan 22, 2016 at 17:47 | vote | accept | Mwr247 | ||
| Jan 18, 2016 at 12:06 | answer | added | Neil | timeline score: 3 | |
| Jan 14, 2016 at 16:50 | answer | added | Mwr247 | timeline score: 2 | |
| Jan 13, 2016 at 12:26 | history | edited | Martin Ender | CC BY-SA 3.0 |
clarified rule on leading zeroes based on test case
|
| Jan 12, 2016 at 23:43 | history | edited | Mwr247 | CC BY-SA 3.0 |
deleted 2 characters in body
|
| Jan 12, 2016 at 23:41 | comment | added | Mwr247 | @ThomasKwa But then someone might try a base-10 string ;) | |
| Jan 12, 2016 at 23:31 | comment | added | lirtosiast | There's no such thing as a base-10 integer datatype. Just say input will be in base ten. | |
| Jan 12, 2016 at 23:13 | answer | added | Digital Trauma | timeline score: 3 | |
| Jan 12, 2016 at 18:18 | answer | added | quintopia | timeline score: 6 | |
| Jan 12, 2016 at 17:48 | comment | added | quintopia | @Mwr247 clearly you meant "standard-digit 7 days" or "standard-digit 7 base-standard-digit-A days" which is redundant with the former. | |
| Jan 12, 2016 at 16:09 | answer | added | Martin Ender | timeline score: 5 | |
| Jan 12, 2016 at 16:08 | history | edited | Mwr247 | CC BY-SA 3.0 |
added 9 characters in body
|
| Jan 12, 2016 at 16:04 | comment | added | Mwr247 | @quintopia It was really more a self reference to a previous challenge I made, from which I copied the post template for this one, as well as a reference to the challenge itself and bases. For that matter, isn't "base-10" indeterminate itself, since every base has a 10? ;) | |
| Jan 12, 2016 at 16:01 | history | edited | Mwr247 | CC BY-SA 3.0 |
Fixed bad test case, and made rules clearer
|
| Jan 12, 2016 at 15:59 | comment | added | Mwr247 | @Mego Good point on the base conversion loophole. It'd probably be simpler to just say no built-in base change at all, especially since no answers use it yet. | |
| Jan 12, 2016 at 15:21 | comment | added | quintopia | "7 base-10 days" I guess since this thing uses arbitrary characters as digits, "7" could stand for any number. For instance, if the character set is the ASCII characters from code 46 to code 55, then this challenge will end in 10 days. On the other hand, if using the standard digits, why specify a base? The symbol 7 represents the number 7 in any base that uses it. | |
| Jan 12, 2016 at 3:21 | comment | added | user45941 | Now that this question has an answer, I have voted to close the older one as a dupe of this one. | |
| Jan 12, 2016 at 3:11 | answer | added | Sherlock9 | timeline score: 6 | |
| Jan 12, 2016 at 2:58 | answer | added | Sherlock9 | timeline score: 4 | |
| Jan 11, 2016 at 23:38 | comment | added | user45941 |
Could you elaborate a bit on You cannot use built in change-of-base functions to convert the entire input string/number at once? Specifically, could I use a built-in to convert the input to a intermediate base? Can I then use a built-in to convert to the target base? Would something like convert input with canonical form for given base; convert to base 10; convert to target base; convert back to specified character set with string replacement?
|
|
| Jan 11, 2016 at 23:31 | history | tweeted | twitter.com/StackCodeGolf/status/686692006358302723 | ||
| Jan 11, 2016 at 23:22 | history | reopened |
Mwr247 user45941 wizzwizz4 MegaTom LegionMammal978 |
||
| Jan 11, 2016 at 21:04 | comment | added | user45941 | While this challenge is very similar to the previous one, I'd actually be in favor of closing the previous one as a dupe of this one. This challenge is much clearer and higher quality than the old one. | |
| Jan 11, 2016 at 19:55 | review | Reopen votes | |||
| Jan 11, 2016 at 23:24 | |||||
| Jan 11, 2016 at 19:43 | history | edited | Mwr247 | CC BY-SA 3.0 |
Further clarification and simplification
|
| Jan 11, 2016 at 19:23 | history | edited | Mwr247 | CC BY-SA 3.0 |
Changed opening from implying this was a first of it's kind, to clarifying the difference
|
| Jan 11, 2016 at 19:10 | comment | added | Mwr247 | @PeterTaylor Plus, the other question was asked 4 years ago and received only two valid answers (and with one already accepted, little reason to bump). I'm willing to bet the community would enjoy this challenge, with little impact from the previous one, or feelings of "repetitiveness". | |
| Jan 11, 2016 at 19:04 | comment | added | Mwr247 | @PeterTaylor Well dang, somehow missed that one in my search. Still, I would argue they are different enough. The other one involves a default character set, multi-byte sequences, error handling, and sequence-to-sequence conversion. All these add to much larger bloat in the answers, and focus on different optimizations. This challenge is much more trimmed down, and will result in completely different code from the other challenge (short of the core algorithm). | |
| Jan 11, 2016 at 18:50 | comment | added | Peter Taylor | We have had one designed to tackle arbitrary length numbers. | |
| Jan 11, 2016 at 18:50 | history | closed | Peter Taylor code-golf Users with the code-golf badge or a synonym can single-handedly close code-golf questions as duplicates and reopen them as needed. | Duplicate of Write a base X to base Y function [duplicate] | |
| Jan 11, 2016 at 18:17 | history | edited | Mwr247 | CC BY-SA 3.0 |
Clarified rules
|
| Jan 11, 2016 at 18:05 | history | edited | Mwr247 | CC BY-SA 3.0 |
Added a few more example cases
|
| Jan 11, 2016 at 18:00 | history | edited | Mwr247 | CC BY-SA 3.0 |
Added a few more example cases
|
| Jan 11, 2016 at 17:46 | history | asked | Mwr247 | CC BY-SA 3.0 |