Timeline for String to Bit Transition
Current License: CC BY-SA 4.0
62 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 24, 2021 at 9:56 | answer | added | emanresu A | timeline score: 2 | |
| Oct 16, 2020 at 2:33 | answer | added | LegionMammal978 | timeline score: 2 | |
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Aug 8, 2019 at 18:19 | answer | added | 640KB | timeline score: 1 | |
| Jul 25, 2019 at 11:12 | answer | added | Lamdba | timeline score: 1 | |
| Jul 25, 2019 at 7:31 | answer | added | Kevin Cruijssen | timeline score: 2 | |
| Jul 17, 2019 at 21:47 | comment | added | justhalf | @SmileAndNod On second thought, I think you don't need to handle empty string. | |
| Jul 17, 2019 at 21:46 | history | edited | justhalf | CC BY-SA 4.0 |
Clarify constraints
|
| Jul 17, 2019 at 21:46 | comment | added | justhalf | It's ok to not handle null bytes. | |
| Jul 17, 2019 at 21:20 | comment | added | celtschk | Does the code have to support embedded zero bytes? (for example, C uses zero bytes as string terminator). | |
| Jul 17, 2019 at 12:29 | comment | added | justhalf | Bits above the 7th are all 0 -> yes, since the maximum code point that I would like to test is 127 (less than 128), as given in the description. String of length 0 I haven't really considered, but I guess it should be supported. | |
| Jul 17, 2019 at 1:31 | comment | added | vo1stv | Do I need to support a string of length 0? Also, I can save a few bytes if it is guaranteed that for characters wider than 7-bits, all bits above the 7th are 0 - I'll assume that's the case unless you say otherwise | |
| Jul 17, 2019 at 1:09 | answer | added | Bryce | timeline score: 1 | |
| Jul 16, 2019 at 17:35 | history | edited | justhalf | CC BY-SA 4.0 |
Add the winner
|
| Jul 15, 2019 at 16:09 | vote | accept | justhalf | ||
| Jul 14, 2019 at 21:26 | answer | added | vo1stv | timeline score: 1 | |
| Jul 13, 2019 at 4:48 | answer | added | dana | timeline score: 0 | |
| Jul 13, 2019 at 3:00 | history | tweeted | twitter.com/StackCodeGolf/status/1149876302675156994 | ||
| Jul 11, 2019 at 10:31 | answer | added | O.O.Balance | timeline score: 1 | |
| Jul 11, 2019 at 3:45 | answer | added | dana | timeline score: 0 | |
| Jul 10, 2019 at 22:15 | answer | added | gastropner | timeline score: 1 | |
| Jul 10, 2019 at 19:29 | history | edited | Shaggy | CC BY-SA 4.0 |
deleted 1 character in body
|
| Jul 10, 2019 at 19:02 | answer | added | Xcali | timeline score: 1 | |
| Jul 10, 2019 at 18:16 | answer | added | Jordan | timeline score: 1 | |
| Jul 10, 2019 at 18:07 | answer | added | Geza Kerecsenyi | timeline score: 1 | |
| Jul 10, 2019 at 17:59 | answer | added | Quinn | timeline score: 1 | |
| Jul 10, 2019 at 17:07 | history | edited | justhalf | CC BY-SA 4.0 |
Add test case
|
| Jul 10, 2019 at 17:06 | comment | added | justhalf | Ah, ok. I am not familiar with that. Thanks for catching that! I'll add the third test case. | |
| Jul 10, 2019 at 17:05 | comment | added | Luis Mendo | @justhalf In some languages, if at least on character has all 7 bits (i.e. starts with 1) then all characters in the string are converted to 7 bits, even if fewer bytes would suffice for some characters. Consider this example in Octave, and compare with this, which only produces 6 bits. My test case was aimed to catch that sort of mistake | |
| Jul 10, 2019 at 17:01 | history | edited | justhalf | CC BY-SA 4.0 |
Clarify 7-bit ASCII characters.
|
| Jul 10, 2019 at 16:58 | comment | added | justhalf |
@LuisMendo, the % character (second test case) also starts with 0.
|
|
| Jul 10, 2019 at 16:30 | history | edited | justhalf | CC BY-SA 4.0 |
Clarify leading zeros.
|
| Jul 10, 2019 at 16:28 | answer | added | justhalf | timeline score: 1 | |
| Jul 10, 2019 at 16:26 | comment | added | justhalf | @Shaggy, yes, I perhaps should clarify that if the ascii code is less than 7-bit it should be prepended with leading zeros. And, like recursive said, the space character already has less than 7 bits. | |
| Jul 10, 2019 at 15:05 | comment | added | recursive | @Shaggy: Both test cases include a space, which has only a single bit set, and not the 7th. So I don't think the problem statement is guaranteeing that each ascii code will be exactly 7 bits in length. | |
| Jul 10, 2019 at 14:04 | answer | added | Andrei Odegov | timeline score: 2 | |
| Jul 10, 2019 at 13:06 | history | reopened | Luis Mendo code-golf Users with the code-golf badge can single-handedly close code-golf questions as duplicates and reopen them as needed. | ||
| Jul 10, 2019 at 12:40 | answer | added | Neil | timeline score: 2 | |
| Jul 10, 2019 at 11:24 | comment | added | Luis Mendo | The other challenge says converting an input stream of bits into a double-rate output stream, with each input '1' translated to a '01' and each input '0' translated to a '10'. So not dupe in my opinion. If a large number of people upvote @gastropner's comment above I can un-dupe (or any other user with that ability) | |
| Jul 10, 2019 at 10:25 | comment | added | gastropner | How is this a duplicate of the Manchester encoding challenge? Am I missing something? | |
| Jul 10, 2019 at 10:09 | history | closed | Peter Taylor code-golf Users with the code-golf badge can single-handedly close code-golf questions as duplicates and reopen them as needed. | Duplicate of Manchester encode a data stream | |
| Jul 10, 2019 at 9:44 | history | became hot network question | |||
| Jul 10, 2019 at 9:25 | comment | added | Luis Mendo |
Suggested test case ## (leading 0 bit; some answers currently fail because of that)
|
|
| Jul 10, 2019 at 9:18 | answer | added | Luis Mendo | timeline score: 5 | |
| Jul 10, 2019 at 8:42 | comment | added | user58988 | There are 7! Way at last concatenate 2 7 bits string, and you not show either in example which one | |
| Jul 10, 2019 at 8:40 | review | Close votes | |||
| Jul 10, 2019 at 10:09 | |||||
| Jul 10, 2019 at 8:17 | answer | added | Elcan | timeline score: 2 | |
| Jul 10, 2019 at 8:08 | answer | added | Expired Data | timeline score: 3 | |
| Jul 10, 2019 at 7:32 | answer | added | Shaggy | timeline score: 4 | |
| Jul 10, 2019 at 6:58 | answer | added | Nick Kennedy | timeline score: 3 | |
| Jul 10, 2019 at 5:53 | answer | added | mkst | timeline score: 1 | |
| Jul 10, 2019 at 5:46 | answer | added | Adám | timeline score: 2 | |
| Jul 10, 2019 at 5:15 | answer | added | xnor | timeline score: 6 | |
| Jul 10, 2019 at 4:35 | answer | added | Value Ink | timeline score: 2 | |
| Jul 10, 2019 at 3:44 | answer | added | Chas Brown | timeline score: 1 | |
| Jul 10, 2019 at 3:27 | history | edited | justhalf | CC BY-SA 4.0 |
Fix typo
|
| Jul 10, 2019 at 3:26 | comment | added | justhalf | Oops, yeah, sorry, fixed that. Error after editing. Thanks @ChasBrown | |
| Jul 10, 2019 at 3:10 | comment | added | Chas Brown |
I'm confused - don't you mean 1 if the bit is different than the previous one?
|
|
| Jul 10, 2019 at 2:57 | answer | added | recursive | timeline score: 1 | |
| Jul 10, 2019 at 2:12 | answer | added | NinjaBearMonkey | timeline score: 2 | |
| Jul 10, 2019 at 1:46 | history | edited | justhalf | CC BY-SA 4.0 |
Add test cases
|
| Jul 10, 2019 at 1:37 | history | asked | justhalf | CC BY-SA 4.0 |