transfem rabbit that does lisp as a hobby volunteer frontend developer @stoat.chat
transfem rabbit that does lisp as a hobby volunteer frontend developer @stoat.chat
Reference
Channels are queues that carry values and support multiple writers and readers. Channels are created with chan. Values in a channel are stored in a buffer. Buffers are never unbounded and there are several provided buffer types:
Stream Processing: Continuous Processing of Data Streams
Explore the Stream Processing design pattern for continuous asynchronous data flow, enhancing real-time data processing capabilities in enterprise applications using Clojure and leveraging functional programming principles.
Nintendo 3DS Touchscreen Replacement
No, Mario, go over there! Touchscreen not responding correctly? You might need a new one.
The CSS Selection - 2026 Edition - Project Wallace
The CSS Selection shows real-world CSS usage from over 100,000 websites and looks at the most important metrics.
Practical: A Simple Database
Obviously, before you can start building real software in Lisp, you'll have to learn the language. But let's face it--you may be thinking, "'Practical Common Lisp,' isn't that an oxymoron? Why should you be expected to bother learning all the details of a language unless it's actually good for something you care about?" So I'll start by giving you a small example of what you can do with Common Lisp. In this chapter you'll write a simple database for keeping track of CDs. You'll use similar techniques in Chapter 27 when you build a database of MP3s for our streaming MP3 server. In fact, you could think of this as part of the MP3 software project--after all, in order to have a bunch of MP3s to listen to, it might be helpful to be able to keep track of which CDs you have and which ones you need to rip.
LinkedLists
A linked list is a linear data structure where each element is a separate object. Each element (we will call it a node) of a list is comprising of two items - the data and a reference to the next node. The last node has a reference to null. The entry point into a linked list is called the head of the list. It should be noted that head is not a separate node, but the reference to the first node. If the list is empty then the head is a null reference.
