Sigmoid Social

Leonard Ritter4 days later i have the amen choppage procgen (see further up in thread) ported to LRDL.program executes in 580ms rather than tens of seconds as with soufflé :)<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/datalogue" class="mention hashtag" rel="nofollow noopener" target="_blank">#datalogue</a> <a href="https://mastodon.gamedev.place/tags/LRDL" class="mention hashtag" rel="nofollow noopener" target="_blank">#LRDL</a>

Leonard Ritteri'm renaming dldsl to LRDL, so the hashtag i use here will change too. haven't really settled on the final meaning of this acronym, but it's somewhere in the region of "Lightweight Relational Data Language" or, for my friends, "Leonard Ritter's DataLog"<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/dldsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dldsl</a> <a href="https://mastodon.gamedev.place/tags/LRDL" class="mention hashtag" rel="nofollow noopener" target="_blank">#LRDL</a>

Leonard Rittercontainers implement double-buffering for when a case appends to a set it is presently iterating. we need two paths *and* analysis to decide when implicit double-buffering can be omitted.therefore, i'm going to add one more "reversible" limitation to dldsl:cases must not mutate source sets.the limitation only really ever matters for single-case feedback loops; when your loop natively transfers data between two or more sets, you have implicit multi-buffering anyway.<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/dldsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dldsl</a>

Leonard Ritterand we have a pipeline. writes 124160 samples, completes in 80ms.a very good start.<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/dldsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dldsl</a>

Leonard Ritterand we have support for calling C externals.<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/dldsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dldsl</a>

Leonard Ritterto get dldsl audio-ready so i can port my datalogue program, i still need:* named constants * aggregates (we'll do it with relations) * basic FFI (also relations) * components (these are just hygienic namespace macros) * nested disjunctives<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/dldsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dldsl</a>

Leonard Ritternow using tarjan's SCC algorithm to toposort and isolate loops.the result is that relation rules are dependency ordered (which implies stratification).i already undertook the first steps to add subloops, but don't have good use cases yet. will wait until those pop up. here, i will likely have to add another design element to make loop boundaries more explicit.here's the generated execution plan for the fib program. not particularly interesting. i'll have better ones later.<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/dldsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dldsl</a>

Leonard Ritterexplicit semi-naivity is implemented.i also removed the expression type from its AST and instead implemented operators as simulated relations; e.g. (add x y) is internally extended to (add x y tmp) and tmp returned.i want to make it possible to generally write `rel a b ... x` as `x = rel a b ...` or `rel a b ...` when nested, so relations can be used like operators where it is useful.<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/dldsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dldsl</a>

Niko (lethal_guitar)New BioMenance Remastered dev log is up, sharing some spoiler free details about one of the new boss fights and more information about the level editor: <a href="https://lethalguitar.wordpress.com/2025/11/11/biomenace-remastered-dev-log-2/" rel="nofollow noopener" translate="no" target="_blank">https://lethalguitar.wordpress.com/2025/11/11/biomenace-remastered-dev-log-2/</a><a href="https://mastodon.social/tags/BioMenaceRemastered" class="mention hashtag" rel="nofollow noopener" target="_blank">#BioMenaceRemastered</a> <a href="https://mastodon.social/tags/IndieDev" class="mention hashtag" rel="nofollow noopener" target="_blank">#IndieDev</a> <a href="https://mastodon.social/tags/IndieGame" class="mention hashtag" rel="nofollow noopener" target="_blank">#IndieGame</a> <a href="https://mastodon.social/tags/DevLog" class="mention hashtag" rel="nofollow noopener" target="_blank">#DevLog</a>

Leonard Ritternow it's time to reintroduce rigidity to the semantics; ways to control naive and semi-naive evaluation exactly in a way that is removable when the compiler matures.the first step is to define that all rules are evaluated *naively*, in *exactly the proposed order*. but rules that are part of a cyclical dependency must be evaluated semi-naively; this means they only trigger on deltas. this becomes controllable with two new keywords:<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/dldsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dldsl</a>

screwlisp<a href="https://gamerplus.org/tags/lispGameJam" class="mention hashtag" rel="nofollow noopener" target="_blank">#lispGameJam</a> <a href="https://gamerplus.org/tags/commonLisp" class="mention hashtag" rel="nofollow noopener" target="_blank">#commonLisp</a> <a href="https://gamerplus.org/tags/programming" class="mention hashtag" rel="nofollow noopener" target="_blank">#programming</a> <a href="https://gamerplus.org/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://gamerplus.org/tags/commonLisp" class="mention hashtag" rel="nofollow noopener" target="_blank">#commonLisp</a> <a href="https://gamerplus.org/tags/mcclim" class="mention hashtag" rel="nofollow noopener" target="_blank">#mcclim</a> <a href="https://gamerplus.org/tags/nicclim" class="mention hashtag" rel="nofollow noopener" target="_blank">#nicclim</a> <a href="https://gamerplus.org/tags/gamedev" class="mention hashtag" rel="nofollow noopener" target="_blank">#gamedev</a> <a href="https://gamerplus.org/tags/itchio" class="mention hashtag" rel="nofollow noopener" target="_blank">#itchio</a> in which I play with the make-my-own-level player activity. (It's unix-surrealism-jam not just NicCLIM because it is built around the unique unix-surrealism-jam controls not my preexisting NicCLIM's)Article: <a href="https://screwlisp.small-web.org/lispgames/my-common-lisp-game-jam-self-experience/" rel="nofollow noopener" translate="no" target="_blank">https://screwlisp.small-web.org/lispgames/my-common-lisp-game-jam-self-experience/</a>Jam submission <a href="https://itch.io/jam/autumn-lisp-game-jam-2025/rate/3822491" rel="nofollow noopener" translate="no" target="_blank">https://itch.io/jam/autumn-lisp-game-jam-2025/rate/3822491</a> , my fellow jammers: + Pixel Outlaw's <a href="https://gamerplus.org/tags/interlisp" class="mention hashtag" rel="nofollow noopener" target="_blank">#interlisp</a> <a href="https://itch.io/jam/autumn-lisp-game-jam-2025/rate/4015363" rel="nofollow noopener" translate="no" target="_blank">https://itch.io/jam/autumn-lisp-game-jam-2025/rate/4015363</a> <a href="https://appdot.net/@mdhughes" class="u-url mention" rel="nofollow noopener" target="_blank">@mdhughes</a> ' MUD <a href="https://itch.io/jam/autumn-lisp-game-jam-2025/rate/4002647" rel="nofollow noopener" translate="no" target="_blank">https://itch.io/jam/autumn-lisp-game-jam-2025/rate/4002647</a>

Leonard Ritterfibonacci example works and is optimal (extends by one number per iteration)<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/dldsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dldsl</a>

Leonard Ritterthe special implementation for array containers is minimally functional: the only index that's O(1) accelerated is any index that contains i.we don't need to deduplicate since every i is unique.then there's deltas: for this we need an unordered set of updated indices; if the array isn't recursive, it's not needed. if there's only 1 update per iteration, then a loop optimization would help greatly here.one can also optimize for cases where new rows are contiguously packed.<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/dldsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dldsl</a>

Leonard Ritterwith the `@` shorthand for `(autoindex)`, we can now populate arrays<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/dldsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dldsl</a>

Leonard Rittermore vital sugar for data entry: `for` has been replaced with a repeatable `..` concatenation token, which can be used to describe trees where the top element remains constant for more than one entry.this becomes relevant when we're appending facts to arrays, where the first element is an autoindex.<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/dldsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dldsl</a>

Leonard Ritterfacts follow the same principle, just with a toplevel `then`. in conjunction with `for`, many facts can be specified for a relation without redundant mentioning of the relation name for each row.<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/dldsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dldsl</a>

Leonard Ritteroverhauled dldsl's rule syntax. all rules start with "case". head clauses (prefixed with "then") can be inserted in any order. any other clause is a body clause.<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/dldsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dldsl</a>

Filip RachůnekHi everyone! Let’s take a short break from post-processing effects. In this tutorial, I’ll be creating a dynamic ornament that at one stage resembles a magical portal and at another something like a fiery eye. Essentially, it’s another demonstration of how we can use iterations and simple functions to achieve quite interesting transformations that can be further configured and combined in new ways. <a href="https://mastodonczech.cz/tags/Godot" class="mention hashtag" rel="nofollow noopener" target="_blank">#Godot</a> <a href="https://mastodonczech.cz/tags/Godot4" class="mention hashtag" rel="nofollow noopener" target="_blank">#Godot4</a> <a href="https://mastodonczech.cz/tags/GodotEngine" class="mention hashtag" rel="nofollow noopener" target="_blank">#GodotEngine</a> <a href="https://mastodonczech.cz/tags/GodotTips" class="mention hashtag" rel="nofollow noopener" target="_blank">#GodotTips</a> <a href="https://mastodonczech.cz/tags/shaders" class="mention hashtag" rel="nofollow noopener" target="_blank">#shaders</a> <a href="https://mastodonczech.cz/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodonczech.cz/tags/indiedev" class="mention hashtag" rel="nofollow noopener" target="_blank">#indiedev</a> <a href="https://www.youtube.com/watch?v=yRA3DSgV7lw" rel="nofollow noopener" translate="no" target="_blank">https://www.youtube.com/watch?v=yRA3DSgV7lw</a>

raccoonAdded another tool to my Rust CLI tools project! It's a wrapper for Hurl that allows including/referencing one file in another. <a href="https://github.com/brenordv/rusted-toolbox/blob/master/crates/tool-whurl/readme.md" rel="nofollow noopener" translate="no" target="_blank">https://github.com/brenordv/rusted-toolbox/blob/master/crates/tool-whurl/readme.md</a><a href="https://hachyderm.io/tags/dev" class="mention hashtag" rel="nofollow noopener" target="_blank">#dev</a> <a href="https://hachyderm.io/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://hachyderm.io/tags/indieDev" class="mention hashtag" rel="nofollow noopener" target="_blank">#indieDev</a> <a href="https://hachyderm.io/tags/rust" class="mention hashtag" rel="nofollow noopener" target="_blank">#rust</a> <a href="https://hachyderm.io/tags/api" class="mention hashtag" rel="nofollow noopener" target="_blank">#api</a> <a href="https://hachyderm.io/tags/apitest" class="mention hashtag" rel="nofollow noopener" target="_blank">#apitest</a> <a href="https://hachyderm.io/tags/hurl" class="mention hashtag" rel="nofollow noopener" target="_blank">#hurl</a>

Leonard Ritteralright. so. reached a performance wall with soufflé rather quickly, but as artist-user, i had a good time. i'm going to build another datalog-esque compiler for procedural audio. maybe this is the right avenue in, bind it directly to an art-oriented use case that doesn't touch too many APIs, doesn't need a GPU, doesn't have to be realtime, and yet does a lot of possibly parallelizable float stream processing.and hopefully we can expand from there.<a href="https://mastodon.gamedev.place/tags/devlog" class="mention hashtag" rel="nofollow noopener" target="_blank">#devlog</a> <a href="https://mastodon.gamedev.place/tags/datalogue" class="mention hashtag" rel="nofollow noopener" target="_blank">#datalogue</a>

Recent searches

Search options

Administered by:

Server stats:

#devlog