Talk:Brain-os source code (not an esolang but an esolang-built OS)

Address layout?

I propose a better system for managing addresses:
Use a byte (or 2 bytes if more space is required) for the address, and a single byte for data. The layout looks like this: address, data, address, data...
Instead of disallowing non-zero values for data, it is possible go to the start of the memory like this:

[<<]

(NOTE: This assumes that the pointer is on an address cell, if that is not the case, a single < or > instruction is enough to move to the address cell)
This way data gets skipped, which means that non-zero values do not disrupt anything.
dragon eater SIX SEVEN 15:33, 2 February 2026 (UTC)

This doesnt seem useful at all. Also, the current system is only for holding values, it is the bottommost memory system, for which everything is built. --Yayimhere2(school) (talk) 16:18, 2 February 2026 (UTC)

Also, non-zero values are allowed, they are just incremented when not in use. [<] also makes less assumptions on how the tape works. --Yayimhere2(school) (talk) 16:21, 2 February 2026 (UTC)

See rail (data structure) for the article I stubbed on this. Corbin (talk) 19:05, 2 February 2026 (UTC)

thanks i designed my own data structure i dont need --Mrtli08 (talk) 19:08, 2 February 2026 (UTC)

Someone please make an function for x==0

we need x==0 function. the one in bf algorithms is made by me and its hell to make because pointer doesnt stay on place --Mrtli08 (talk) 18:52, 2 February 2026 (UTC)

Like, one where its y = (x==0) ?

simply like if x equals 0 then y==1 else y==0 --Mrtli08 (talk) 18:52, 2 February 2026 (UTC)