GOLF(2gg)

πŸ“¦ version 601.4.41, in ubuntu questing

πŸ’– GOLF(2gg) β€” aka the manual page for new-fifo, bestie πŸ’–

okay so you found yourself in the GOLF(2gg) corner of the dev docs, and honestly? iconic. this is the page for new-fifo. let's get into it πŸŽ€


✨ NAME ✨

new-fifo β€” (FIFO) πŸ¦‹

🎯 PURPOSE 🎯

Create FIFO list. that's the whole mission, no cap. πŸ’…

πŸ“ SYNTAX πŸ“

new-fifo <list>

🌸 DESCRIPTION 🌸

new-fifo initializes a brand-new FIFO <list> β€” and FIFO means First In First Out, so it's giving very much "queue behavior, main character energy" πŸ‘‘

<list> contains data stored on a first-in, first-out basis. and ngl, important detail: a list is accessible to the current process only β€” it's not out here sharing with everybody, it's loyal like that 🫢

Information is retrieved (possibly many times, see rewind-fifo) in the same order in which it was stored. so like, what went in first comes out first. no line-jumping, we don't do that here πŸ’€

The internal positions for write-fifo and read-fifo actions are separate, which is lowkey the slayest part: you can keep writing data to the list, and read it independently of writes in any number of retrieval passes by using rewind-fifo ✨

fr fr, that separation is the whole vibe β€” writes don't interrupt your reads, reads don't interrupt your writes. separate lanes, both thriving 🌈

🌟 EXAMPLES 🌟

new-fifo nf

that's it, that's the example, and it ate πŸ’…

πŸ‘€ SEE ALSO πŸ‘€

  • FIFO
  • delete-fifo
  • new-fifo
  • purge-fifo
  • read-fifo
  • rewind-fifo
  • write-fifo

Also: See all documentation ⭐ (go explore, bestie, there's a whole world out there πŸ¦‹)


and that's the page!! this little beauty lives in $VERSION, dated $DATE, filed under GOLF(2gg) β€” mwah, go forth and queue responsibly πŸ’–βœ¨πŸŽ€

πŸ“¦ where this page comes from