@A_ It seems though, that the sandbox room serves to give you an outlet for your urge, so you can stay calm in normal chat rooms. Spamming the sandbox is fine.
"(off-topic) I'm going to have a break for a bit. I'll be back soon"
This is on-topic because this is providing information answering the question "What will the poster of the previous message be doing next?", which is the poster of this message themselves.
This is the longest reply-chain I've ever seen in a chatroom.
@TwilightSparkle You can just follow the template. '''[[1+]]''' is a stack-based esoteric programming language invented by [[User:Parcly Taxel]] where 1 is the only literal. It only has 15 possible diverse syntactic items, however despite this restricted set of instructions, it is actually very easy and user-friendly to program in. For an easy language one would expect a full set of arithmetic instructions, but 1+ only has two of them: + (addition) and * (multiplication), (message long, trunctuating.)
and this concept has beed derived from the concept of integer complexity, and it is possible to produce any numeric constant using only these two arithmetic operations. 1+ is unique as well; it has special stack-manipulating instructions such as \ (rotate the stack downwards) and / (rotate the stack upwards), which is uncommon in more normal stack-based languages such as Forth. This allows programmers to manipulate the stack much more easily, thus ensuring the easiness of programming in this.
Control flow is also relatively simple, and there are only two of them that exist in 1+: # (a goto instruction in 1+) and (|) (the way to define subprocedures). The goto instruction is capable of producing conditional statements because the * instruction can multiply a constant conditionally based on whether it is 0, and the subprocedure syntax is there for making programming even easier and higher-level.
(It is extremely long, you'll need to trunctuate some of it.)
Question
For a sequence of Positive Integers \$A\$, find the maximum hash value.
Each Integer in the sequence has a hash value.
The hash value of an Integer is defined as the number of Integers (that come before itself in the sequence, non-inclusive of itself) it divides without a remainder.
...
@Adám unfortunately you cannot do that on the fly, backticks only work for named funtions. You could do something like let f=(\x y->x+y) in 3 f4 (the let X in Y evaluates to Y (where all definitions in X are applied))
@Adám In tio you always have to write full programs, I do recommend getting GHCI (a REPL) to try things. I when I use TIO I usually still have a GHCI window open next to it) - the easiest way to get it is probably using Haskell Platform
@Adám that is the thing with functions that accept multiple different types: Either the function is totally type agnostic in which case we just have a variable as type (see example (1)), or the function might call one or more functions that are just implemented for specific types: Then the inputs must belong to a corresponding typeclass (see example 2):
ex (1): For example the function f=(,) takes two inputs and returns a pair. The signature is f :: a -> b -> (a, b). Here a and bcan be any type. To go back tot he currying: Due to the currying the -> is right-associative, that means it could also be read as f :: a -> ( b -> (a,b)), so f takes a value, and returns a function that takes another value and returns the pair composed of these two values.
ex (1b): The function f x y=[x,y] has signature f :: a -> a -> [a,a] which means again a can be any type,b ut both x and y have to have the same type. (All entries of a list have to have the same type)
@Adám you already get the error when compiling as the compiler checks that
ex (2): `f=(==)` (equivalent to `f a b = a==b` "check equality"): has signature `f :: Eq a => a -> a -> Bool` Now `a` cannot be *any* arbitrary type, it must be a type of the typeclass `Eq` (this is what `Eq a` says). So it takes two aguments and returns a bool. If you invent a new type and want to be able to check whether to values are equal, the you can implement the `Eq` typeclass.
(Similarly, if you have a function that operates on numbers, but you don't care whether it is `Int`s or `Double`s or `Rational`s then you can implement it for the typeclass `Num`. But you can only use the fun…
So print expects something "printable", this means it must be of the typeclass Show, which just implements a function from your type to a string.
Sorry for the wall of text, but I thought this might clear up some things:)
@Adám the advantage is that as soon as it compiles you can be pretty sure never to encounter an error:)
but it really forces you to think a litttle bit more before you write something in contrast to e.g. python where you can write almost anything and you then wonder why it doesn't work:)
@Adám maybe un-Haskell but certainly intelligent:)
@flawr Right, whereas APL gives you no guarantees, but isn't compiled, and will stop to let you fix the code (even what's on the stack) and then you can continue. In fact, you don't even need to define all your sub-routines; APL will ask you what names mean as it hits them, so you can define them on the fly and continue.
maybe that explains the widespread use of functional programming in Israel :D
The strictness that comes with the types really is a double edged sword: As a beginner it makes it a little bit harder to learn, but then when you write programs it can make your life a lot easier:)
@Adám That is my general impression of APL, it lets you do many things interactively, right?
@flawr Yes, everything, actually. It is a happy coincidence that our company is called Dyalog :-) as in speaking with the computer until it all runs as desired.
The objective
Given a string of Hangul syllables, sort the characters in North Korean dictionary order.
Introduction to Hangul syllables
Hangul(한글) is the Korean script invented by Sejong the Great. Hangul syllables are allocated in Unicode point U+AC00 – U+D7A3. A Hangul syllable consists of ...
@TwilightSparkle it's nothing spectacular, pretty much every quine in a language without strings is either store numbers, print source version of them, print as chars, or the same but with base decoding
also latest version ungolfed & my regolfer: https://tio.run/##ZVNBa9swFL77Vzycg@0oJVWyW1K2buutdIaxS@MMlFiJQx3J2ErLmjYMBl0SmrENRncZjB5GtksvK4xdBuk/0R/Jnpw2dMzGkp7e@z59@iSzJN4Ij1mvz5ZLH/TZexjq2bU@/6Nn85GLwy2n6Xh6PNeTr4HTaDp6PMUUJk5tCIQ9wgDM3LtPsciccsgPy5kKe6LsWMleTqinbxbznHX6Nod@rORThqOkx5/15FKf//L1@DuSbIOefQEZhyBYn2eWWHG4WJTsefrsAzjglFysHLQzqD7Qr7/RzU1v5JdQnOs5OVzwo1s43Hsww/uJerVKAUs5xLzLYlBSPrSQERfyjeihr6eXufLZ9SMU/nvLSMU5/3QxB7Fn@aZyhELWKOxXe51c3gtmExQ8NGJfPHmOPKRa9UrY43ddqtxc4NA0yH3nQn1xVa2SFQB8a2d9IiXjnLH@x9ChaMDiqkJw@uai4unZT4cSB7XdgdEaw/qPrJ11sLNcuvsnlBJa96CRDLIIjnkqm1ZgIgWbIAVkirUPoCW…
argument is the exact program size wanted (so even numbers give nothing) https://tio.run/##lVZNc9s2EL37V2x4SEmTZiQ7vYSiOkomnXYymR6YS8f1AaJgCy5FsgQkJ@3otyuLBcBPOeNqRiS42H37sNhd4JEd2NXj5u/TSezqqlHwiIJ4r0QRXyYX9X5diBzygkkJn5ko4b8LACuViil8HSqxgR3O@ZlqRPlweweseZABqQKIUoGAFH4vFX/gTVyzRnL88LXS7ewuSEjtNya3GVeLbAnoKgVWFL6IxGj2E@f1wiJFkC2XILRyyZ@cim8t7qsG/AwkvEO8ANVittn4WlFj@DIWiu8ikIHVHyPrVSAy2qlq1TTsW2vbcSa5jCWGzWd9v2MwosECyL5J9BpXexXXGCpVlEiEhd478EIZr@O82nDfMTqj7G2qknvDef5VKH9GsiP@7ab0wkmRxE0oI9oL7jamp3I4H0NxD34JaQozZwNwaOOYtUyPwAvJWxUb@lyvGX2XV/MIvXYQAOuqKjgrIWdlvZdb9J7HUvzLYZECvyqTVlEzsEqBdZ3HGI…
@dzaima with FAST=false it'll generate all programs of that length which is required to do that challenge effectively, but, as the name implies, that makes the program very very slow - 13 has been running for a long while for me (searching for the best encoding of 43 for my quine)
already got -92 bytes from optimizing 49 (11+1+"+1+"* → 1""+""*++"*) but that's 11
```
Binary to unary conversion program in Notepad.
1001<^H>1<Tab>0*<Replace-All><Content>*0<Tab>0**<Replace-All-Until-All-0's-Are-On-The-Left-Size><Content>0<Replace-All>
```
1001<^H>1<Tab>0*<Tab><Tab><Tab><Tab><Tab><Enter><Tab><Tab>*0<Right-Arrow><Tab><Tab><Tab><Tab><Tab><Enter*N(N is user-defined)><Tab><Tab>0<Tab><Tab><Tab><Tab><Tab><Tab><Enter>
@TwilightSparkle i think removing pointless constants it simplifies down to just sum(ord) though :p
because why not, a version preferring 1 and hating ": https://tio.run/##XVg7shwxCMx9iq0J9yUD@lf5Mi7nTlzl6z8PH0FrE79VDwLUIED@/evPv19/v79fr/tF1xf9/PF60Yuef/lF9PX8Lc9f@pJfVZBLfjX9ZWi374oP/21fpsnrl@Vf3j9edO/fop/IdV1vWXFoEEmzrZ/1q3kgK/vetvTzj6y7W5Tf5svlemdYkW/hjXnKt@9TrUx7p1ll3lYfVfK9hI9bom7tz1okgh/xhHuu5MS8WVJfeO4zPkv5urYuW5c7pNW7Qilv1gvvUwvTpcRKz1Zq8qDf0zdnrWz/3uJtcd50KfIzOLf15s6Zrcbdtc9enT0HRIJDv56glrRgJ6gZ143syJqTsqvHuQ0SqRFcyRfDZkZH962wptFod0ZD@GgE8upfi3gH4h4HJPsqxElk2rajgEh0sGx6MvKXcd9msmfZ1YJfvwaPpn4fGfdIdcqbsXnu4Pe@IX3nqsK6s@5bKWz0trPDsq337Y@v80Z7vPu@1c5NX7iW/B536jD/B3AcGIcfqmckx2@zPSArz…
I was practicing coding sorting algorithms, and I came up with the following implementation of merge sort, and it seemed to be correctly sorting any given array.
void mergeSort(int *array, int lo, int hi) {
if (lo == hi) return;
int mid = lo + (hi - lo) / 2;
int sz = hi - lo + 1;
...
I don't care what language. Just make it work. I write in R.
I want to generate means and standard deviations by hour on different subsets of data that partition the dataset.
In a small dataset, this is simple, just run the code I have below as an example.
In a large dataset, my method isn't ef...
Question
For a sequence of Positive Integers \$A\$, find the maximum hash value.
Each Integer in the sequence has a hash value.
The hash value of an Integer is defined as the number of Integers (that come before itself in the sequence, non-inclusive of itself) it divides without a remainder.
...
The objective
Given a string of Hangul syllables, sort the characters in North Korean dictionary order.
Introduction to Hangul syllables
Hangul(한글) is the Korean script invented by Sejong the Great. Hangul syllables are allocated in Unicode point U+AC00 – U+D7A3. A Hangul syllable consists of ...
I was practicing coding sorting algorithms, and I came up with the following implementation of merge sort, and it seemed to be correctly sorting any given array.
void mergeSort(int *array, int lo, int hi) {
if (lo == hi) return;
int mid = lo + (hi - lo) / 2;
int sz = hi - lo + 1;
...
I don't care what language. Just make it work. I write in R.
I want to generate means and standard deviations by hour on different subsets of data that partition the dataset.
In a small dataset, this is simple, just run the code I have below as an example.
In a large dataset, my method isn't ef...
