Anonymous user
Talk:Binary strings: Difference between revisions
m
added/forced a TOC (for now).
(→Alternative implementation: new section) |
m (added/forced a TOC (for now).) |
||
| (One intermediate revision by one other user not shown) | |||
Line 1:
__TOC__
== Break out? ==
Line 51 ⟶ 53:
For a language that has no limitations on byte values within a byte string, reimplementing something so primitive would be madness, and thankfully, no one yet has taken it seriously. Reimplement without using bytes? without using arrays? Or, use existing language features, but pointlessly wrap them in functions with more cumbersome syntax? As worded, I can't imagine the task as anything but an exercise in obfuscation. —[[User:Sonia|Sonia]] 00:29, 14 February 2011 (UTC)
:Different mood today. I posted a solution. —[[User:Sonia|Sonia]] 21:30, 18 September 2012 (UTC)
| |||