Timeline for Binary Stream With Unknown Byte-Width
Current License: CC BY-SA 3.0
22 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 15, 2022 at 9:57 | history | edited | Wheat Wizard♦ | edited tags | |
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot | Commonmark migration | |
| Aug 12, 2015 at 21:58 | answer | added | nimi | timeline score: 2 | |
| Aug 12, 2015 at 21:11 | comment | added | LivingInformation | @nimi I would consider that part of stream generation, as the generation could be set up in such a way as to report the bit number in addition to the bit, on every consume. For example, in Python, you could return a tuple of (bit, bit_num). | |
| Aug 12, 2015 at 21:09 | comment | added | nimi | Does the code for counting the bits that are consumed add to the golf score or are they part of the scaffolding/stream generation/boilerplate? | |
| Aug 11, 2015 at 15:25 | history | tweeted | twitter.com/#!/StackCodeGolf/status/631124186694569984 | ||
| Aug 10, 2015 at 16:27 | comment | added | LivingInformation | @BrainSteel you can treat it as either, but its probably easier to consume bit-by-bit if you use characters representing 1 and 0 (due to being unable to consume single bits in stdin, I believe you can only consume byte-by-byte in most environments, making consuming it one bit at a time difficult). When I have time, I'll be posting a python controller producing proper input for a program, but if you use another language, you'll need some way of generating streams. | |
| Aug 10, 2015 at 15:58 | comment | added | BrainSteel | Is the bit stream a literal bit stream in the form of random bytes that are shoved into stdin, or is it a string of characters, each representing a 1 or a 0? e.g. "1001110101100..." Also, is it necessary that we write a full program? | |
| Aug 10, 2015 at 15:01 | history | edited | LivingInformation | CC BY-SA 3.0 | deleted 1 character in body |
| Aug 10, 2015 at 11:08 | comment | added | orlp | Also, I assume we have to read the stream bit by bit, and can not skip elements? | |
| Aug 10, 2015 at 10:51 | comment | added | orlp | In nearly all modern contexts the byte refers to an octet of bits. Perhaps you could use a word that causes less confusion? (word, grouping, chunk, etc). | |
| Aug 10, 2015 at 7:43 | history | edited | LivingInformation | CC BY-SA 3.0 | edited title |
| Aug 10, 2015 at 7:33 | history | edited | LivingInformation | CC BY-SA 3.0 | added 124 characters in body |
| Aug 10, 2015 at 7:23 | review | Close votes | |||
| Aug 10, 2015 at 14:34 | |||||
| Aug 10, 2015 at 7:09 | history | edited | LivingInformation | CC BY-SA 3.0 | added 1 character in body |
| Aug 10, 2015 at 6:53 | history | edited | LivingInformation | CC BY-SA 3.0 | added 1 character in body |
| Aug 10, 2015 at 6:41 | comment | added | LivingInformation | @isaacg oops, I forgot to give a range on the bit-widths! The width will always be between 3 and 16, sorry about that. | |
| Aug 10, 2015 at 6:40 | history | edited | LivingInformation | CC BY-SA 3.0 | added 54 characters in body |
| Aug 10, 2015 at 6:39 | comment | added | izzyg | @LivingInformation Suppose the program has read 110. Can the program terminate and return bit width 1? If not, what is the maximum base, so the program can actually terminate? | |
| Aug 10, 2015 at 6:36 | comment | added | LivingInformation | @Sp3000 Added 2 examples for base 5 and base 10. Does that make any more sense? | |
| Aug 10, 2015 at 6:35 | history | edited | LivingInformation | CC BY-SA 3.0 | added 313 characters in body |
| Aug 10, 2015 at 6:16 | history | asked | LivingInformation | CC BY-SA 3.0 |