01:27:30 <esolangs> [[Language list]] https://esolangs.org/w/index.php?diff=186764&oldid=186725 * Miui * (+14) /* M */
01:37:45 -!- amby has quit (Remote host closed the connection).
01:50:12 <zzo38> Even if making a programming language or something else for some other use, sometimes you will want to know about the computational class, e.g. I had written Composite Character VM (which is not the same as: composite glyphs, combining characters, etc), which is intended to be deliberately limited but still suitable for the writing of many languages (including conlangs)
02:15:57 <esolangs> [[User:Cycwin]] https://esolangs.org/w/index.php?diff=186765&oldid=161076 * Cycwin * (+168)
02:23:17 <esolangs> [[Project Euler/1]] https://esolangs.org/w/index.php?diff=186766&oldid=186694 * PrySigneToFry * (+1488)
02:32:51 <esolangs> [[Don Giovanni/Implementations]] N https://esolangs.org/w/index.php?oldid=186767 * PrySigneToFry * (+31302) Created page with "= Python = <pre> import sys # ---------------------------------------------------------------------- # 1. Lexer # ---------------------------------------------------------------------- class Token: def __init__(self, type, value, line):
02:33:03 <esolangs> [[Don Giovanni]] https://esolangs.org/w/index.php?diff=186768&oldid=184561 * PrySigneToFry * (-31265)
02:36:30 -!- MizMahem_ has quit (Quit: Connection closed for inactivity).
03:04:14 -!- lisbeths has joined.
04:47:53 <b_jonas> ICFP contest starts in a bit more than two days
04:48:30 <zzo38> Will more information be available at that time?
04:49:54 <b_jonas> there's a teaser at https://icfpcontest2026.com/textbook
04:51:17 <b_jonas> zzo38: yes, the first version of the task specification is always revealed right as the contest starts. in many of the recent years, there was a twist, a modified version of the task specification that is revealed a day or half a day (I don't remember) after the start of the contest, with a separate scoring category for solving the first version well quickly within a day or half a day
04:55:17 <zzo38> The description there is not very elaborate but I expect would be explained more when the contest is started.
04:56:23 <zzo38> What kind of data structure implementation for in memory data might be useful for: http://pb1n.de/?684ca7
05:09:38 <b_jonas> zzo38: yes, it's just a teaser, the goal is that you shouldn't be able to guess anything important about the task description from it so it doesn't help you prepare for the task before the contest starts. (this doesn't mean that you can't prepare, obviously you can do general preparation for programming contests, only that the teaser doesn't help)
05:29:26 <b_jonas> zzo38: you want one of the balanced search trees with nodes sorted by key like a B-tree, red-black tree, or one of the many other variants. You can find an implementation in the C++ standard library as std::map, or the Rust standard library as std::collections::BTreeMap, or the Haskell ghc standard library in the Data.Map package. These have most of the operations that you're asking for, except that I
05:29:33 <b_jonas> don't quite understand what Last, Next and Prev are, the triplet seems confusing. You can iterate on the records (key-value) pairs in increasing or decreasing order from any starting point, but likely only if you don't modify the data structure during iteration, if you do modify it that invalidates your iterator and you'll have to look up the key again.
05:31:23 <b_jonas> As a personal note, reading about the algorithms for these balanced tree structured in TAOCP 6.2.3 was one of the main reason why I got interested in algorithms and programming when I was around 11 years old. TAOCP was the most interesting book in the school library.
05:33:13 <zzo38> I might have made some mistakes, e.g. Last should be less or equal key, and that Next/Prev are supposed to return a error code if there is no such record.
05:40:55 <zzo38> Also, one thing that I missed is changing the keys of existing records such that the new key does not change the order of the records when sorted by key (this can probably be done with many implementations just by changing the key stored in the record without making other changes).
05:41:44 -!- azul_ has joined.
05:43:41 <zzo38> Do you think Arne Andersson's tree (or a variant of that) is suitable?
05:44:29 <b_jonas> zzo38: in the C++ std::map API, the std::map::lower_bound api lets you find the record with the least key greater than or equal to a key argument. If you want the least key strictly greater than a key argument then there are two solutions. The traditional one (which works in C++03) is that you call lower_bound, then compare the key, then if they're equal then increment the iterator with the ++ operator
05:44:35 <b_jonas> to find the next record, but compare the incremented key to end both before and after the increment to make sure that such a record exists. The newer is to call lower_bound with a different type than the key, one that compares as if it was between two valid keys, or it has an extra 1 bit at the end of the string.
05:44:48 <b_jonas> "changing the keys of existing records such that the new key does not change the order of the records when sorted by key" => I don't think any implementation supports this
05:45:14 <b_jonas> "Arne Andersson's tree" => I don't know which one that is
05:48:28 <zzo38> By changing the keys, I mean that the new keys of several records are known to be the same order (relative to each other and all of the other records) as before, by something external, that the order would not need to be adjusted (it would also be known that nobody else is accessing the table at this time)
05:48:41 <b_jonas> one more possibility for this is sqlite, which can handle a database stored either in a temporary file or purely in the memory of the process. you create a table where you can either have the key and value in separate columns, or they can be in the same column with the key first if you know how to separate them, eg. in your case the key is fixed size. then you create an index on this key column and
05:48:44 <zzo38> Arne Andersson's tree is described at https://user.it.uu.se/~arneande/ps/simp.pdf
05:48:47 <b_jonas> possibly the other column. sqlite then lets you search by key with any comparison operator with WHERE, or iterate up or down from anywhere with WHERE ... ORDER BY
05:51:33 <b_jonas> I have to amend what I said above about modifying a key. The C++ library's std::map has methods where you give an iterator to a node of the same map as a hint for where to insert. So if you already have an iterator to the node that you want to modify then you can insert the modified values to a new node close to it using those methods, then erase the old node.
05:54:35 <zzo38> Adding SQLite might more than double the size of my existing program, so it might be better not to do that.
05:58:55 <b_jonas> Also I think Chris Okasaki's book, or maybe some other source, describes some variant of splay trees where even the semantically constant operations modify the representation of the tree, this modification is essential to guarantee the amortized time guarantees, and this has the side effect that inserting or deleting a node close to the node that you just looked up is very fast because the lookup
05:59:01 <b_jonas> rotates it to the root. So the haskell implementation of that one would let you modify keys efficiently. But if you don't want sqlite because it would double the size of the program then probably any non-esoteric Haskell implementation would be even worse.
06:00:37 <b_jonas> So I recommend either the C++ standard library or rust standard library implementation, whichever is more convenient. Possibly the implementation in the Boost Container library, but I don't think it has advantages over the C++ standard library one here.
06:01:34 <b_jonas> The advantage of the Boost Container comes up if you have other weird requests that you haven't mentioned, because it's probably easier to convince the boost library to do unusual things.
06:07:12 <zzo38> I also considered to not use a library (unless I can copy the relevant parts into my program), in order to change it according to what is suitable for this specific program.
06:08:11 <b_jonas> zzo38: anotehr possibility is APR (Apache Portable Runtime Project https://apr.apache.org/ ) library skip lists ( https://apr.apache.org/docs/apr/1.7/group__apr__skiplist.html ). I'm not completely sure but I think this can do the operations that you want, and I think it would result in a smaller program size than the other libraries that I mentioned.
06:08:56 <zzo38> I will look at that
06:11:26 <zzo38> (The article I linked to written by Andersson also mentions skip lists, and compares the speed with using a tree, although I should think that speed should not be the only consideration but it is one of them)
06:11:39 <b_jonas> zzo38: if you want to copy the relevant parts into your program and a C++ implementation is okay then the Boost Container library is probably the best. That one is header only, and you can copy just the relevant headers into your program. It depends on a few other header-only boost libraries, so you have to copy some dependencies, but I think it doesn't depend on any of the very large libraries.
06:12:28 <b_jonas> I've done this with some other header-only libraries of Boost, copying just some headers, though I haven't tried it with Container.
06:13:02 <b_jonas> the whole Boost is a very big collection, but you can take just the few directories of headers that you need and they're small
06:15:59 -!- potter has quit (Quit: Should be back momentarily).
06:16:04 <esolangs> [[Talk:SecretLang (Hellion Mode)]] https://esolangs.org/w/index.php?diff=186769&oldid=186130 * Im bad at naming * (+0) /* Guessing Area */
06:21:49 -!- potter has joined.
06:26:33 <zzo38> If I write the program carefully then the implementation of the tables can be changed without having to rewrite the rest of the program
06:32:37 -!- tromp has joined.
06:35:40 <zzo38> I looked at the source code for the skip list as well, and also the Wikipedia article about skip list; it requires random numbers and a node has many more fields than a tree would (although it might be possible to change so that some might become unnecessary)
06:55:26 <b_jonas> sure, I don't particularly like skip lists, and if you want to use randomness then I'd prefer a treap, but you wanted smaller code size and I think APR might help in that and it happens to have skip list as its implementation
06:56:30 <zzo38> Yes, and I am looking at it, to see whether or not it can be used and to learn it
06:56:47 <b_jonas> but I'm not sure in this so you'll have to double-check that
07:00:36 <b_jonas> also ais523 may have an implementation of one of the balanced trees in the future that might work and isn't esoteric
07:01:30 <b_jonas> and I think it's more likely to eventually exist than feather the language or scapegoat the version control system.
07:02:25 <ais523> I have spent the past approximately a week getting annoyed at Rust's standard library btree implementation
07:02:52 <ais523> it uses a lot of unsafe that doesn't seem necessary and subsequently turned out to be unsound
07:03:23 <ais523> so it's strongly motivating me to try to improve safe Rust to the extent that it could be written safely
07:03:38 <b_jonas> ais523: is the unsoundness with or without an incorrect comparison function?
07:04:02 <ais523> it's exception-safety, it involves catching a panic by the comparison function or a panic by the allocator
07:04:23 <ais523> (although a panicking comparison function isn't always necessarily "incorrect")
07:06:08 <b_jonas> no, I don't think panicking makes the comparison function incorrect. what makes it incorrect is if it can give different results on the same inputs, or isn't antisymmetric, or isn't transitive.
07:06:48 -!- Sgeo has quit (Read error: Connection reset by peer).
07:10:04 <b_jonas> as for recovering from catching a panic from the allocator or comparison function, libraries have to support this and it's indeed some of the hardest parts to implement correctly. even just implementing the container in safe rust needn't be enough for all the guarantees.
07:11:21 <b_jonas> I don't think I'll ever to use that feature in practice, i.e. trying to recover from a panic in the allocator or comparison function, but I also understand that it can be important for some programs
07:13:04 -!- lisbeths has quit (Quit: Connection closed for inactivity).
07:23:00 <esolangs> [[Talk:SecretLang (Hellion Mode)]] https://esolangs.org/w/index.php?diff=186770&oldid=186769 * Miui * (+88) /* miui's guess */
07:24:32 <esolangs> [[Talk:SecretLang (Hellion Mode)]] M https://esolangs.org/w/index.php?diff=186771&oldid=186770 * Miui * (+23) /* miui's guess */
07:38:21 -!- ais523 has quit (Quit: quit).
07:41:09 -!- Lord_of_Life has joined.
07:41:38 -!- tromp has quit (Quit: Textual IRC Client: www.textualapp.com).
07:49:23 <esolangs> [[Stexmix]] https://esolangs.org/w/index.php?diff=186772&oldid=186560 * Miui * (+34) link secret lang hellion mode for more context
08:04:44 <esolangs> [[Talk:SecretLang (Hellion Mode)]] https://esolangs.org/w/index.php?diff=186773&oldid=186771 * Miui * (+147) /* miui's guess */
08:18:00 <b_jonas> oren: my browser claims that https://www.orenwatson.be/fontdemo.htm has a TLS problem, possibly an expired certificate
08:20:40 <esolangs> [[Special:Log/newusers]] create * 135yshr * New user account
08:33:05 <esolangs> [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=186774&oldid=186751 * 135yshr * (+239) /* Introductions */
08:34:30 <esolangs> [[User:135yshr]] N https://esolangs.org/w/index.php?oldid=186775 * 135yshr * (+551) Created page with "Hi, I'm '''135yshr''', a software developer from Japan. I'm the creator of [[Meow (135yshr)|Meow]], a cat-themed functional programming language in which every keyword is a cat word (<code>nyan</code>, <code>meow</code>, <code>purr</code>, ...). Source files use th
08:34:48 <esolangs> [[Meow (135yshr)]] N https://esolangs.org/w/index.php?oldid=186776 * 135yshr * (+4330) Created page with "{{infobox proglang |name=Meow |paradigms=functional |author=[https://github.com/135yshr 135yshr] |year=[[:Category:2026|2026]] |typesys=gradual, static |class=[[:Category:Turing complete|Turing complete]] |refimpl=[https://github.com/135yshr/meow GitHub] |influen
08:37:10 -!- cactus-head has quit (Quit: Leaving).
08:37:19 <esolangs> [[Meow]] https://esolangs.org/w/index.php?diff=186777&oldid=134918 * 135yshr * (+22)
08:37:42 -!- cactushead has joined.
08:45:57 -!- lisbeths has joined.
09:16:08 <esolangs> [[Talk:Aheui]] https://esolangs.org/w/index.php?diff=186778&oldid=91480 * Miui * (+82) /* Project Euler 844 (Markov Numbers) */ new section
09:26:07 <esolangs> [[Brainturn]] https://esolangs.org/w/index.php?diff=186779&oldid=167385 * Win7HE * (+203) /* Hello world */
09:26:37 <esolangs> [[Brainturn]] https://esolangs.org/w/index.php?diff=186780&oldid=186779 * Win7HE * (+11) /* Hello world */
09:29:03 <esolangs> [[Brainturn]] M https://esolangs.org/w/index.php?diff=186781&oldid=186780 * Win7HE * (+2) /* Hello world */
09:40:03 <esolangs> [[Methemetics]] https://esolangs.org/w/index.php?diff=186782&oldid=185722 * Win7HE * (+12) /* */
09:41:39 <esolangs> [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=186783&oldid=186774 * Jan Ala * (+170) /* Introductions */
09:42:20 <esolangs> [[User:Win7HE]] https://esolangs.org/w/index.php?diff=186784&oldid=184460 * Win7HE * (-18) /* Outinp (hello world-able) */
09:42:31 <esolangs> [[User:Win7HE]] https://esolangs.org/w/index.php?diff=186785&oldid=186784 * Win7HE * (-15) /* Hyperinotoidion (joke language) */
09:42:46 <esolangs> [[User:Win7HE]] https://esolangs.org/w/index.php?diff=186786&oldid=186785 * Win7HE * (+17) /* Deadshark */
09:43:01 <esolangs> [[User:Win7HE]] https://esolangs.org/w/index.php?diff=186787&oldid=186786 * Win7HE * (+17) /* Deadman */
09:43:33 <esolangs> [[ABCLang]] N https://esolangs.org/w/index.php?oldid=186788 * Jan Ala * (+5296) Created page with "ABCLang is a minimalistic, Turing-complete esoteric programming language created by [[User:Jan Ala]]. It uses only three characters: a, b, and c. ==Overview== ABCLang is a stack-based virtual machine language with: * 3 characters (a, b, c) * 26 instructions (encoded as
09:43:56 <esolangs> [[Deadman]] https://esolangs.org/w/index.php?diff=186789&oldid=152269 * Win7HE * (-9) /* Commands */
09:45:01 <esolangs> [[Deadman]] https://esolangs.org/w/index.php?diff=186790&oldid=186789 * Win7HE * (-4)
09:47:23 <esolangs> [[Deadfish]] https://esolangs.org/w/index.php?diff=186791&oldid=183145 * Win7HE * (+20)
09:47:48 <esolangs> [[Talk:SecretLang (Hellion Mode)]] https://esolangs.org/w/index.php?diff=186792&oldid=186773 * PrySigneToFry * (+89) /* miui's guess */
10:06:21 <esolangs> [[Aheui]] https://esolangs.org/w/index.php?diff=186793&oldid=186763 * Miui * (+123) /* External resources */ bf->Aheui compiler (untested)
10:09:36 -!- DOS_User_webchat has joined.
10:13:25 -!- DOS_User_webchat has quit (Client Quit).
10:13:37 -!- DOS_User_webchat has joined.
10:16:09 <esolangs> [[Deadfish/Implementations (nonalphabetic and A-L)]] https://esolangs.org/w/index.php?diff=186794&oldid=174583 * Win7HE * (+2573) /* Brainfuck */
10:17:19 <esolangs> [[Deadfish/Implementations (nonalphabetic and A-L)]] M https://esolangs.org/w/index.php?diff=186795&oldid=186794 * Win7HE * (-8) /* Brainfuck */
10:19:22 -!- DOS_User_webchat has quit (Ping timeout: 245 seconds).
10:27:17 <esolangs> [[ABCLang]] https://esolangs.org/w/index.php?diff=186796&oldid=186788 * Jan Ala * (-492)
10:38:33 <esolangs> [[19 edons, 19 octons]] https://esolangs.org/w/index.php?diff=186797&oldid=186621 * Miui * (+182) added .lua
10:41:45 <esolangs> [[Talk:SecretLang (Hellion Mode)]] https://esolangs.org/w/index.php?diff=186798&oldid=186792 * Miui * (+46) /* miui's guess */
10:44:27 <esolangs> [[Talk:SecretLang (Hellion Mode)]] https://esolangs.org/w/index.php?diff=186799&oldid=186798 * PrySigneToFry * (+29)
10:53:09 <esolangs> [[BrainFuck++]] https://esolangs.org/w/index.php?diff=186800&oldid=95914 * Win7HE * (-7695) Replaced content with "[[#REDIRECT|BrainFuck+]]"
10:53:49 <esolangs> [[BrainFuck++]] https://esolangs.org/w/index.php?diff=186801&oldid=186800 * Win7HE * (+0) Redirected page to [[BrainFuck+]]
10:57:48 <esolangs> [[Rubik's Cube]] https://esolangs.org/w/index.php?diff=186802&oldid=142482 * Win7HE * (+4) /* Checker pattern */
11:12:16 <esolangs> [[Jezik]] https://esolangs.org/w/index.php?diff=186803&oldid=186689 * Zopium * (+13)
11:12:56 <esolangs> [[Bosnian]] N https://esolangs.org/w/index.php?oldid=186804 * Zopium * (+19) Redirected page to [[Jezik]]
11:15:37 <esolangs> [[SGA]] M https://esolangs.org/w/index.php?diff=186805&oldid=186707 * OfficialWatchOS7Alt * (+12) lol
11:18:49 <esolangs> [[Truth-machine]] https://esolangs.org/w/index.php?diff=186806&oldid=182937 * Zopium * (+237) /* Implementations */
11:26:33 <esolangs> [[User:PrySigneToFry/Sandbox/My Rate to the user that I know]] https://esolangs.org/w/index.php?diff=186807&oldid=185191 * PrySigneToFry * (-203)
11:27:11 <esolangs> [[User:PrySigneToFry/Sandbox/Users that is also on other place]] https://esolangs.org/w/index.php?diff=186808&oldid=185194 * PrySigneToFry * (+38)
11:28:15 <esolangs> [[Talk:SecretLang (Hellion Mode)]] https://esolangs.org/w/index.php?diff=186809&oldid=186799 * PrySigneToFry * (+90)
11:28:48 <esolangs> [[ABCLang]] https://esolangs.org/w/index.php?diff=186810&oldid=186796 * Jan Ala * (-48) /* Fibonacci */
11:28:57 <esolangs> [[ABCLang]] https://esolangs.org/w/index.php?diff=186811&oldid=186810 * Jan Ala * (+1) /* Fibonacci */
11:30:38 -!- amby has joined.
11:31:01 <esolangs> [[Talk: Meaoiu]] https://esolangs.org/w/index.php?diff=186812&oldid=186628 * PrySigneToFry * (+106) /* Program Requestation */ new section
11:31:35 <esolangs> [[User talk:Miui]] https://esolangs.org/w/index.php?diff=186813&oldid=186736 * Miui * (+114) /* as a homeless person */ new section
11:31:58 <esolangs> [[User talk:Miui]] https://esolangs.org/w/index.php?diff=186814&oldid=186813 * Miui * (+20) /* as a homeless person */
11:38:19 <esolangs> [[User talk:Miui]] https://esolangs.org/w/index.php?diff=186815&oldid=186814 * Miui * (+241) /* On indigestibility */ new section
11:44:09 <esolangs> [[XYScript]] https://esolangs.org/w/index.php?diff=186816&oldid=186562 * PrySigneToFry * (+341)
11:48:39 <esolangs> [[Brain-Flak]] https://esolangs.org/w/index.php?diff=186817&oldid=155526 * None1 * (+59) /* Interpreters */
11:49:36 <esolangs> [[User talk:Miui]] https://esolangs.org/w/index.php?diff=186818&oldid=186815 * Miui * (+44) /* On indigestibility */
11:52:42 <esolangs> [[ABCLang]] https://esolangs.org/w/index.php?diff=186819&oldid=186811 * Jan Ala * (-21) /* Instruction Set */
11:53:49 <esolangs> [[ABCLang]] https://esolangs.org/w/index.php?diff=186820&oldid=186819 * Jan Ala * (+8) /* Instruction Set */
11:55:45 <esolangs> [[ABCLang]] https://esolangs.org/w/index.php?diff=186821&oldid=186820 * Jan Ala * (+333) /* Instruction Set */
12:07:46 <esolangs> [[Interpret Esolangs Online]] https://esolangs.org/w/index.php?diff=186822&oldid=185425 * None1 * (+17) /* Introduction */
12:08:44 <esolangs> [[Special:Log/upload]] upload * Miui * uploaded "[[File:Dafne growth fractal..gif]]"
12:09:17 <esolangs> [[Dafne]] https://esolangs.org/w/index.php?diff=186824&oldid=186064 * Miui * (+113) /* Escape-time */ growth cycle fractal (dies at 5 generations)
12:46:09 <esolangs> [[Brain-Flak]] https://esolangs.org/w/index.php?diff=186825&oldid=186817 * None1 * (+39) /* Interpreters */
12:53:40 <esolangs> [[Category:Generated by AI]] https://esolangs.org/w/index.php?diff=186826&oldid=181844 * Win7HE * (+2)
13:02:18 <esolangs> [[User talk:Miui]] https://esolangs.org/w/index.php?diff=186827&oldid=186818 * Miui * (+99) /* English users are stupid */ new section
13:06:19 -!- sftp has quit (Ping timeout: 264 seconds).
13:24:57 <esolangs> [[Talk: Meaoiu]] https://esolangs.org/w/index.php?diff=186828&oldid=186812 * I am islptng * (+616)
13:34:40 <esolangs> [[Talk:Trigbf]] https://esolangs.org/w/index.php?diff=186829&oldid=186720 * Blashyrkh * (+332) /* Original examples do not work */ new section
13:35:16 -!- lisbeths has quit (Quit: Connection closed for inactivity).
13:36:48 <esolangs> [[Talk:Trigbf]] M https://esolangs.org/w/index.php?diff=186830&oldid=186829 * Blashyrkh * (+13) /* Original examples do not work */
13:42:54 <esolangs> [[ABCLang]] https://esolangs.org/w/index.php?diff=186831&oldid=186821 * Jan Ala * (+3418)
13:43:09 <esolangs> [[ABCLang]] https://esolangs.org/w/index.php?diff=186832&oldid=186831 * Jan Ala * (+2) /* External Resources */
13:51:08 <esolangs> [[FizzBuzz]] https://esolangs.org/w/index.php?diff=186833&oldid=173227 * PrySigneToFry * (+1989) Add more interpreters
13:56:52 <esolangs> [[FizzLang]] https://esolangs.org/w/index.php?diff=186834&oldid=160445 * PrySigneToFry * (+163)
14:19:51 <esolangs> [[Talk:ABCLang]] N https://esolangs.org/w/index.php?oldid=186835 * Miui * (+110) Created page with "Finally a stack that makes sense to me! ~~~~"
14:23:24 -!- Lykaina has quit (Quit: ZNC 1.9.1+deb2+b3 - https://znc.in).
14:23:59 <esolangs> [[FizzLang]] https://esolangs.org/w/index.php?diff=186836&oldid=186834 * Hammy * (+84) added hello world
14:24:26 -!- Lykaina has joined.
14:27:27 <esolangs> [[!4warning]] https://esolangs.org/w/index.php?diff=186837&oldid=186531 * Miui * (+787) link See Two and define a valid ruler obt
14:37:19 <esolangs> [[Whizz]] M https://esolangs.org/w/index.php?diff=186838&oldid=186616 * Splot-dev * (+85) Added note that I forgot to previously add regarding selecting logic.
14:37:41 -!- myname has quit (Quit: WeeChat 4.9.2).
14:56:56 <esolangs> [[Lost And Found: Kingdom of Hangul]] N https://esolangs.org/w/index.php?oldid=186839 * Miui * (+793) Created page with "'''Lost And Found: Kingdom of Hangul''' is a joke output only language that takes the source of of Jon Ripley's Lost Kingdom and compiles it to [[Aheui]] and then ''illegally'' (it is illegal to mod Jon Ripley's Lost Kingdom and change the License)
14:58:24 <esolangs> [[King In Yellow]] https://esolangs.org/w/index.php?diff=186840&oldid=186505 * Yayimhere2(school) * (+112) /* Commands */
14:59:11 <esolangs> [[Whizz]] https://esolangs.org/w/index.php?diff=186841&oldid=186838 * Splot-dev * (+509) Added Turing-Completeness proof
15:00:19 <esolangs> [[Whizz]] M https://esolangs.org/w/index.php?diff=186842&oldid=186841 * Splot-dev * (+1) Fixed syntax error
15:01:08 <esolangs> [[Whizz]] M https://esolangs.org/w/index.php?diff=186843&oldid=186842 * Splot-dev * (+0) Moved section for readability
15:03:50 <esolangs> [[ABCLang]] https://esolangs.org/w/index.php?diff=186844&oldid=186832 * Aadenboy * (+88) formatting; cats
15:13:44 <esolangs> [[Whizz]] M https://esolangs.org/w/index.php?diff=186845&oldid=186843 * Splot-dev * (+21) Added negative/positive int clarification
15:14:17 <esolangs> [[Whizz]] M https://esolangs.org/w/index.php?diff=186846&oldid=186845 * Splot-dev * (-7) Definitely identifies as a Turing tarpit, now.
17:03:20 -!- joast has quit (Quit: Leaving.).
17:03:22 <esolangs> [[TetraBit]] https://esolangs.org/w/index.php?diff=186847&oldid=184820 * CodePentuplets48 * (+25)
17:07:52 -!- azul_ has quit (Ping timeout: 254 seconds).
19:51:47 <esolangs> [[User:Aadenboy/Justec]] N https://esolangs.org/w/index.php?oldid=186848 * Aadenboy * (+1374) Created page with "'''Justec''' is an esolang made for GMTK's 2026 Game Jam. == Structure == A Justec program is a directed tree of nodes. Each node may also point to a register. Nodes may point to several other nodes, creating new program pointers as necessary, which execu
19:53:04 <esolangs> [[User:Aadenboy/randomuserpage]] https://esolangs.org/w/index.php?diff=186849&oldid=177106 * Aadenboy * (+25)
19:53:31 <esolangs> [[User:Aadenboy]] https://esolangs.org/w/index.php?diff=186850&oldid=182045 * Aadenboy * (+48) /* just some drafts */
20:34:59 -!- joast has joined.
20:36:33 <esolangs> [[Kitchen]] https://esolangs.org/w/index.php?diff=186851&oldid=186446 * AndrewBayly * (+850)
20:40:52 <esolangs> [[Kitchen]] https://esolangs.org/w/index.php?diff=186852&oldid=186851 * AndrewBayly * (+1296)
20:49:28 <esolangs> [[Kitchen]] https://esolangs.org/w/index.php?diff=186853&oldid=186852 * AndrewBayly * (+2579)
20:54:48 <esolangs> [[Kitchen]] https://esolangs.org/w/index.php?diff=186854&oldid=186853 * AndrewBayly * (+807)
20:56:49 <esolangs> [[Kitchen]] https://esolangs.org/w/index.php?diff=186855&oldid=186854 * AndrewBayly * (+454) revised content
21:12:31 <esolangs> [[Fun2]] https://esolangs.org/w/index.php?diff=186856&oldid=186447 * AndrewBayly * (+1371) rewrite
21:21:10 <esolangs> [[PrimeScript]] https://esolangs.org/w/index.php?diff=186857&oldid=186448 * AndrewBayly * (+2213) rewrite
21:21:46 <esolangs> [[PrimeScript]] M https://esolangs.org/w/index.php?diff=186858&oldid=186857 * AndrewBayly * (+0)
21:30:39 <esolangs> [[Trapdoor]] https://esolangs.org/w/index.php?diff=186859&oldid=186449 * AndrewBayly * (+1432) rewrite
21:31:42 <esolangs> [[Whizz]] M https://esolangs.org/w/index.php?diff=186860&oldid=186846 * Splot-dev * (+55) Improved infobox
21:35:18 <esolangs> [[Square]] https://esolangs.org/w/index.php?diff=186861&oldid=186450 * AndrewBayly * (+1969) rewrite
21:36:12 <esolangs> [[Square]] M https://esolangs.org/w/index.php?diff=186862&oldid=186861 * AndrewBayly * (+0)
21:37:08 <esolangs> [[Square]] M https://esolangs.org/w/index.php?diff=186863&oldid=186862 * AndrewBayly * (+0)
21:37:30 <esolangs> [[Trapdoor]] M https://esolangs.org/w/index.php?diff=186864&oldid=186859 * AndrewBayly * (+0)
21:37:57 <esolangs> [[Fun2]] M https://esolangs.org/w/index.php?diff=186865&oldid=186856 * AndrewBayly * (+0)
21:42:01 <esolangs> [[BrainFreeze]] https://esolangs.org/w/index.php?diff=186866&oldid=186451 * AndrewBayly * (+858) rewrite
21:42:20 <esolangs> [[BrainFreeze]] M https://esolangs.org/w/index.php?diff=186867&oldid=186866 * AndrewBayly * (-29)
21:45:35 <esolangs> [[Talk:Trapdoor]] N https://esolangs.org/w/index.php?oldid=186868 * Blashyrkh * (+260) Created page with "Existence of two (the more - the better) valid programs reveals the secret prime factor (using GCD). Try something ECDSA-like with one-time nonce if you want true security. --~~~~"
21:46:58 <esolangs> [[Talk:Trapdoor]] M https://esolangs.org/w/index.php?diff=186869&oldid=186868 * Blashyrkh * (+4)
21:48:42 <esolangs> [[Whizz]] https://esolangs.org/w/index.php?diff=186870&oldid=186860 * Splot-dev * (+789) Added code structures
21:49:00 <esolangs> [[Whizz]] M https://esolangs.org/w/index.php?diff=186871&oldid=186870 * Splot-dev * (+2) This should be a mini-section!
21:49:48 <esolangs> [[Whizz]] M https://esolangs.org/w/index.php?diff=186872&oldid=186871 * Splot-dev * (+13) Clarified things
21:50:01 <esolangs> [[BrainSwitch]] https://esolangs.org/w/index.php?diff=186873&oldid=186452 * AndrewBayly * (+2202)
21:50:14 <esolangs> [[Whizz]] M https://esolangs.org/w/index.php?diff=186874&oldid=186872 * Splot-dev * (+15) Clarified title
21:50:59 <esolangs> [[Whizz]] M https://esolangs.org/w/index.php?diff=186875&oldid=186874 * Splot-dev * (+50) Added depth limit
21:56:09 <esolangs> [[Fun3]] https://esolangs.org/w/index.php?diff=186876&oldid=186453 * AndrewBayly * (+2581) rewrite
22:00:05 <esolangs> [[Hard]] https://esolangs.org/w/index.php?diff=186877&oldid=186454 * AndrewBayly * (+2515)
22:02:53 <esolangs> [[Nonce]] https://esolangs.org/w/index.php?diff=186878&oldid=186455 * AndrewBayly * (+1028)
22:07:59 -!- Sgeo has joined.
22:09:50 <esolangs> [[Normal]] https://esolangs.org/w/index.php?diff=186879&oldid=186456 * AndrewBayly * (+2618)
22:15:08 <esolangs> [[PrimeIndex]] https://esolangs.org/w/index.php?diff=186880&oldid=186457 * AndrewBayly * (+2483)
22:35:39 <esolangs> [[Lost And Found: Kingdom of Hangul]] https://esolangs.org/w/index.php?diff=186881&oldid=186839 * Miui * (+102)
22:36:05 <esolangs> [[Lost And Found: Kingdom of Hangul]] https://esolangs.org/w/index.php?diff=186882&oldid=186881 * Miui * (+12)
22:37:14 <esolangs> [[Lost And Found: Kingdom of Hangul]] https://esolangs.org/w/index.php?diff=186883&oldid=186882 * Miui * (+75)
22:39:05 <esolangs> [[User talk:Miui]] https://esolangs.org/w/index.php?diff=186884&oldid=186827 * Miui * (+39) jk
23:07:55 <esolangs> [[Deadfish but in english]] N https://esolangs.org/w/index.php?oldid=186885 * Zopium * (+1895) Created page with "'''Deadfish but in english''' is [[Deadfish]], but instead of these yucky single character commands, it's sentences. {| class="wikitable" |+ Instructions |- ! What it says !! What it does |- | <code>Increment the accumulator</code> || Increments the accu
23:11:48 <korvo> Not sure whether Andrew Bayly is using a chatbot or just not imaginative. His Web apps look vibe-coded.
23:13:03 <esolangs> [[Deadfish but in english]] https://esolangs.org/w/index.php?diff=186886&oldid=186885 * Zopium * (+248)
23:18:24 <esolangs> [[XKCD Random Number]] https://esolangs.org/w/index.php?diff=186887&oldid=185799 * Zopium * (+200) /* Implementations */
23:25:29 <esolangs> [[Deadfish but in english]] https://esolangs.org/w/index.php?diff=186888&oldid=186886 * Zopium * (+103)
23:26:25 <esolangs> [[Deadfish]] https://esolangs.org/w/index.php?diff=186889&oldid=186791 * Zopium * (+66) /* Variants of deadfish */
23:28:07 <esolangs> [[User:Zopium]] https://esolangs.org/w/index.php?diff=186890&oldid=186274 * Zopium * (+30) /* Esolangs I made */
23:29:13 <esolangs> [[User:Zopium]] https://esolangs.org/w/index.php?diff=186891&oldid=186890 * Zopium * (+0)
23:31:30 <esolangs> [[User:Zopium]] https://esolangs.org/w/index.php?diff=186892&oldid=186891 * Zopium * (+89)
23:33:37 <esolangs> [[Talk:Trapdoor]] https://esolangs.org/w/index.php?diff=186893&oldid=186869 * Corbin * (+117)
23:48:01 <esolangs> [[Nonce]] https://esolangs.org/w/index.php?diff=186894&oldid=186878 * Corbin * (+9) Clean up prose. Use similar categories to [[Bubblegum]]; we don't know whether this is actually hard!