You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hello! This is a really cool language concept & fun to use. I noticed when writing some code in this that the 系统。扫描() function seems to have some strange behavior with long lines.
If you read a line more than 98 characters wide, 系统。扫描() will return only the first 98 bytes. If you then call 系统。扫描() again, it will return the next 98 characters, but it will skip one character.
So:
[---first 98 bytes---][1 byte][---next 98 bytes--]\n
^ first 系统。扫描() ^ second 系统。扫描()
It looks like this is just because the 系统。扫描() function has a static array on the stack.
Let me know if you'd like me to write a quick patch for that to allocate the array dynamically! Besides that the language seems to be really solid. I wrote a binary heap and Dijkstra's algorithm, and the performance is good.
(I also noticed that the language will hang indefinitely if 扫描 gets an EOF.)
The text was updated successfully, but these errors were encountered:
Hello! This is a really cool language concept & fun to use. I noticed when writing some code in this that the
系统。扫描()
function seems to have some strange behavior with long lines.If you read a line more than 98 characters wide,
系统。扫描()
will return only the first 98 bytes. If you then call系统。扫描()
again, it will return the next 98 characters, but it will skip one character.So:
It looks like this is just because the
系统。扫描()
function has a static array on the stack.Let me know if you'd like me to write a quick patch for that to allocate the array dynamically! Besides that the language seems to be really solid. I wrote a binary heap and Dijkstra's algorithm, and the performance is good.
(I also noticed that the language will hang indefinitely if
扫描
gets an EOF.)The text was updated successfully, but these errors were encountered: