luxferre/clyx
1
0
Fork 0
Code Actions Activity

v0.3.6: map, filter, a lot of fixes

Browse Source
This commit is contained in:
Luxferre
2026-07-10 09:51:29 +03:00
parent 7b30ddacbd
commit 6c3a48d796
7 changed files with 54 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files
clyx_manual.md
+9 -1
View File
@@ -2,7 +2,7 @@
Clyx is a concatenative, stack-oriented programming language designed for simplicity, minimalism, and metaprogramming capabilities. It uses postfix notation (aka Reverse Polish Notation, RPN), where operations are performed on a global stack. Clyx features homoiconicity: code is structured as Q-forms (special forms to represent data similar to Python or Tcl lists), which can be manipulated as data and executed dynamically.
This document describes the stack effects and behavior of the **50 primitive core words**, **3 bootstrapped core words**, and **52 standard library words** present in the reference implementation.
This document describes the stack effects and behavior of the **50 primitive core words**, **3 bootstrapped core words**, and **56 standard library words** present in the reference implementation.
The Clyx runtime itself allows the programmer to redefine any already defined word, including the core ones and the ones from the standard library. Unlike e.g. Forth, where words are resolved at compile-time, Clyx words are resolved at runtime, so such redefinitions may affect all previously established behavior. That's why, as a rule, any **predefined** Clyx word, both in the language core and the standard library, must not exceed 6 characters. This is done to encourage programmers to define their own human-readable words (7+ characters long) without any risk of overwriting existing word definitions.
@@ -546,6 +546,14 @@ These words are defined in the standard library file `lib.clx` and loaded dynami
- **Stack Effect**: `( length -- [q] )`
- **Description**: Pops the `length` integer from the stack, creates a contiguous Q-form of that length where every element is the number `0`, and pushes it back onto the stack. If `length` is less than or equal to `0`, returns an empty Q-form.
#### `map`
- **Stack Effect**: `( [list] [op] -- [res] )` or `( [list] name -- [res] )`
- **Description**: Applies the operation `[op]` (either an executable Q-form or a defined word name) to each element of the Q-form `[list]`. Pushes the resulting Q-form `[res]` back onto the stack.
#### `filter`
- **Stack Effect**: `( [list] [op] -- [res] )` or `( [list] name -- [res] )`
- **Description**: Filters elements of the Q-form `[list]` by applying the predicate operation `[op]` (either an executable Q-form or a defined word name) to each element. Returns a new Q-form `[res]` containing only the elements for which the predicate returned a truthy value.
### 10.9 Bitwise Operations
#### `bitnot` (Bitwise NOT)