Skip to main content

Timeline for Fix unbalanced brackets

Current License: CC BY-SA 3.0

12 events
when toggle format what by license comment
Sep 1, 2014 at 22:21 vote accept Vladimir Reshetnikov
Jun 24, 2013 at 19:16 comment added Johannes Kuhn @VladimirReshetnikov Yeah, you are correct. Just a few more characters. This also solved my inability to post it.
Jun 24, 2013 at 19:14 history edited Johannes Kuhn CC BY-SA 3.0
Fixed invalid unicode codepoints
Jun 24, 2013 at 18:21 comment added Vladimir Reshetnikov @JohannesKuhn Could you comment on "I use 1 character for 2 bytes"? Not every pair of bytes is a valid Unicode character.
Jun 22, 2013 at 16:49 comment added Johannes Kuhn @JanDvorak It's simple: The regexp split the string into 3 parts (on a matching brace). The first and last part together (concat) are tested if it is a balanced, the middle part ist tested too. If no regexp match, then the input only contains unmatched characters, append them to m and return false. I put the proc t ungolfed to idone
Jun 22, 2013 at 16:28 comment added John Dvorak Thanks. I was kinda hoping I would be able to read your code and extract its algorithm, but still nope :-)
Jun 22, 2013 at 12:33 history edited Johannes Kuhn CC BY-SA 3.0
added 20 characters in body
Jun 22, 2013 at 12:13 comment added Johannes Kuhn @JanDvorak Posted a decoded version. It still requires Tcl 8.6 because I use lmap not only as replacement for foreach.
Jun 22, 2013 at 12:13 history edited Johannes Kuhn CC BY-SA 3.0
added 828 characters in body
Jun 22, 2013 at 7:29 comment added John Dvorak can you please post the source code as it is after inflation?
Jun 22, 2013 at 5:36 comment added John Dvorak Perhaps you should show the unencoded version with those invalid characters replaced (there's plenty of characters outside the ASCII range if you want to) as well as the encoded version
Jun 22, 2013 at 3:13 history answered Johannes Kuhn CC BY-SA 3.0