{"batchcomplete":"","continue":{"lecontinue":"20260405125954|1521","continue":"-||"},"query":{"logevents":[{"logid":1531,"ns":0,"title":"Racket/RLE","pageid":365,"logpage":365,"revid":1848,"params":{},"type":"create","action":"create","user":"Anders","timestamp":"2026-04-11T14:38:41Z","comment":"Skapade sidan med '<pre>  #lang racket  ;;;;; ;; RLE \u2013 Run Length Encoder ;; ;; I/O via stdio <infil >utfil ;; ;; Kodar data genom att r\u00e4kna antal f\u00f6rekomster av samma tecken/byte i rad och ;; ers\u00e4tter den med ett cons-par (antal . tecken) tills n\u00e4sta f\u00f6rekomst finns. ;; Kan operera bin\u00e4rt men med begr\u00e4nsningen av max 255 bytes konsekutivt sedan ;; startas en ny ram. ;; ;; racket rle.rkt [ --encode | --decode | --help ] [ --binary ] < infil > utfil ;; ;; --encode kodar stdin till...'"},{"logid":1530,"ns":0,"title":"Racket/3D-boll","pageid":364,"logpage":364,"revid":1843,"params":{},"type":"create","action":"create","user":"Anders","timestamp":"2026-04-07T17:59:56Z","comment":"Skapade sidan med '<pre>  #lang racket (require plot) (require racket/pretty) ;; En pixelboll iracket ;; Fr\u00e5n Buzzern skrivet under p\u00e5skhelgen  (define \u03c0 (acos -1)) (define VERTICAL-SPLIT 16) (define HORIZONTAL-SPLIT 16) (define PARTICLE-SIZE (* VERTICAL-SPLIT HORIZONTAL-SPLIT)) (define particles (for/vector ([i (in-range PARTICLE-SIZE)])                     (make-vector 3)))  ;; from scheme.com since normal scheme lacks for/vector (define make-matrix   (lambda (rows columns)     (do ((...'"},{"logid":1529,"ns":0,"title":"Racket/Markov","pageid":363,"logpage":363,"revid":1840,"params":{},"type":"create","action":"create","user":"Anders","timestamp":"2026-04-07T14:16:08Z","comment":"Skapade sidan med '<pre> #lang racket  ;;;;; ;; Markovkedja av tredje ordningen ;; ;; Tar en textfil eller stdin och bygger statistik \u00f6ver orden i tre gram ;; d\u00e4refter producerar den en 150 ord l\u00e5ng text baserad p\u00e5 den statistiken ;; ;; T\u00e4pp-Anders Sikvall, anders@sikvall.se, 2026-04-07 ;;;;;  (require racket/string          racket/port)  ;; ================================================ ;; MARKOVKEDJA \u2013 TREDJE ORDNINGEN (3-gram)  ;; ===============================================...'"},{"logid":1528,"ns":0,"title":"Racket/base24","pageid":362,"logpage":362,"revid":1837,"params":{},"type":"create","action":"create","user":"Anders","timestamp":"2026-04-07T13:04:43Z","comment":"Skapade sidan med '<pre> #lang racket  ;;;;; ;; BASE24 encoder/decoder ;; T\u00e4pp-Anders Sikvall, anders@sikvall.se, 2026-04-97 ;; ;; USAGE ;;          racket base24.rkt --encode < INPUT_FILE > OUTPUT_FILE ;;          racket base24.rkt --decode < INPUT_FILE > OUTPUT_FILE ;; ;; COMMENT ;;          This does not precede the coded data with any kind of header ;;          and the error control and handling is abysmally minimal but ;;          it shows the ease of implementing something like this...'"},{"logid":1527,"ns":0,"title":"Racket/Posits","pageid":361,"logpage":361,"revid":1833,"params":{},"type":"create","action":"create","user":"Anders","timestamp":"2026-04-05T13:01:42Z","comment":"Skapade sidan med '<pre> #lang racket  ;;;;; ;; En enkel implementation av Posists eller Unum typ III ;; i Racket f\u00f6r skojs skull och f\u00f6r att l\u00e4ra sig mer ;; ;; T\u00e4pp-Anders Sikvall anders@sikvall.se 2026-04-04 ;; ;; Posit representeras som ett heltal (bitm\u00f6nster, 0 till 2^n-1). ;; Parametrar: n = totalt antal bits, es = antal exponent-bits (t.ex. n=16, es=1 f\u00f6r posit16). ;; Inneh\u00e5ller: ;;  * Konvertering till/fr\u00e5n generiska tal (number->posit och posit->number) ;;  * Addition, subt...'"},{"logid":1526,"ns":0,"title":"Racket/Posits","pageid":361,"logpage":351,"params":{},"type":"delete","action":"delete","user":"Anders","timestamp":"2026-04-05T13:01:35Z","comment":"inneh\u00e5llet var: \"<pre> #lang racket  ;;;;; ;; En enkel implementation av Posists eller Unum typ III ;; i Racket f\u00f6r skojs skull och f\u00f6r att l\u00e4ra sig mer ;; ;; T\u00e4pp-Anders Sikvall anders@sikvall.se 2026-04-04 ;; ;; Posit representeras som ett heltal (bitm\u00f6nster, 0 till 2^n-1). ;; Parametrar: n = totalt antal bits, es = antal exponent-bits (t.ex. n=16, es=1 f\u00f6r posit16). ;; Inneh\u00e5ller:...\", den enda som skrivit var \"[[Special:Contributions/Anders|Anders]]\" ([[User talk:Anders|diskussion]])"},{"logid":1525,"ns":0,"title":"Racket/Neural","pageid":360,"logpage":360,"revid":1832,"params":{},"type":"create","action":"create","user":"Anders","timestamp":"2026-04-05T13:01:16Z","comment":"Skapade sidan med '<pre> #lang racket  ;;;;; ;; Neuralt n\u00e4t implementerad i Racket ;; T\u00e4pp-Anders Sikvall 2026-04-03 anders@sikvall.se ;;;;;    ;;;;; NEURALT N\u00c4T ;;; ;; Detta program implementerar ett litet neuralt n\u00e4t och tr\u00e4nar det p\u00e5 sannings- ;; tabellen f\u00f6r XOR. Efter n\u00e5gra tusen epoker ska prediktionerna ligga extremt n\u00e4ra ;; f\u00f6ljande: ;; ;; a,b \u2192 a XOR b ;; 0,0 \u2192    0 ;; 0,1 \u2192    1 ;; 1,0 \u2192    1 ;; 1,1 \u2192    0 ;; ;; Implementationen har tv\u00e5 input-neuroner f\u00f6r a...'"},{"logid":1524,"ns":0,"title":"Racket/Neural","pageid":360,"logpage":350,"params":{},"type":"delete","action":"delete","user":"Anders","timestamp":"2026-04-05T13:01:12Z","comment":"inneh\u00e5llet var: \"<pre> #lang racket  ;;;;; ;; Neuralt n\u00e4t implementerad i Racket ;; T\u00e4pp-Anders Sikvall 2026-04-03 anders@sikvall.se ;;;;;    ;;;;; NEURALT N\u00c4T ;;; ;; Detta program implementerar ett litet neuralt n\u00e4t och tr\u00e4nar det p\u00e5 sannings- ;; tabellen f\u00f6r XOR. Efter n\u00e5gra tusen epoker ska prediktionerna ligga extremt n\u00e4ra ;; f\u00f6ljande: ;; ;; a,b \u2192 a XOR b ;; 0,0 \u2192    0 ;;...\", den enda som skrivit var \"[[Special:Contributions/Anders|Anders]]\" ([[User talk:Anders|diskussion]])"},{"logid":1523,"ns":0,"title":"Racket/Genetic","pageid":359,"logpage":359,"revid":1831,"params":{},"type":"create","action":"create","user":"Anders","timestamp":"2026-04-05T13:00:43Z","comment":"Skapade sidan med '<pre>  #lang racket  ;;;;; ;; Genetisk algoritm implementerad i Racket ;; T\u00e4pp-Anders Sikvall 2026-04-03 anders@sikvall.se ;;;;;   ;; ================================================================ ;; Genetisk algoritm \u2013 Hitta kromosom med: ;;   1. De f\u00f6rsta 10 bitarna = 1 ;;   2. Totalt antal 1:or s\u00e5 n\u00e4ra 50 som m\u00f6jligt ;; ================================================================  ;; --------------------- Parametrar --------------------- (define populatio...'"},{"logid":1522,"ns":0,"title":"Racket/Genetic","pageid":359,"logpage":349,"params":{},"type":"delete","action":"delete","user":"Anders","timestamp":"2026-04-05T13:00:38Z","comment":"inneh\u00e5llet var: \"<pre>  #lang racket  ;;;;; ;; Genetisk algoritm implementerad i Racket ;; T\u00e4pp-Anders Sikvall 2026-04-03 anders@sikvall.se ;;;;;   ;; ================================================================ ;; Genetisk algoritm \u2013 Hitta kromosom med: ;;   1. De f\u00f6rsta 10 bitarna = 1 ;;   2. Totalt antal 1:or s\u00e5 n\u00e4ra 50 som m\u00f6jligt ;; ==========================================...\", den enda som skrivit var \"[[Special:Contributions/Anders|Anders]]\" ([[User talk:Anders|diskussion]])"}]}}