In this challenge, you will write an interpreter for 2Ω (transcribed as TwoMega), a language based loosely on brainfuck with an infinite-dimensional storage space.
The Language
2Ω contains three pieces of state:
The Tape, which is an infinite list of bits, all initialized to 0. It has a leftm...
To any rust people: How do I go about making a HashSet< MyTrait > I need to iterate through HashSet so I need Hash + Eq. To do this however I need to do HashSet<Box<MyTrait>>, if I do this though, Box will only implement Hash/Eq if MyTrait does, and if MyTrait does, Rust will throw an error saying 'MyTrait' is not an object
@Downgoat i think it works? https://tio.run/##dZJNbsIwEIXXySmGLJAjpRzAQCpVbcWmUlV6AUMdsOTEYE9E2yhnT8fOjxCim1j2ezPf8zi2dth1tZPg8Ivzo3BHzpsNLRn4r7TtMp7kvdFa7lGZynHu5a3EK7kokYqf5a4@ZPBqbCkQpc3gQ7paIzWK0QqF8PbzGdYmjooKdsKyuZO6SOEhhy1aVR2WcRvHqjzpEAIKY2@KfNDVhg8Z875BRjEESg7zskbYpN4beWHhGenCF7FgSZdx1E6Md2FRCf1yvgOS57G3QSJR70EPaXfG6BsKrNe9td9ec24B43mY2B02zXOEF8OlpqkGfD/YEOBiFcoZI2vStAlNYgo0RnBo673vYIDR/Xv0CPRwr/z/JNCAlVjbatjTc1tTsoS8SQqBQJWlUBULg9cSwSfeiV9Yw/CzcL56Mt@rgZrnnFfy4tNEZFuoykmLjBz9OQVq2tSrJyKirmYsafijvx7Z6bztuj8
Background
A triangular grid is a grid formed by tiling the plane regularly with equilateral triangles of side length 1. The picture below is an example of a triangular grid.
A triangular lattice point is a vertex of a triangle forming the triangular grid.
The origin is a fixed point on the ...
can you even implement a trait without an implementation
@Downgoat ok. this doesn't make sense? you want a hashset where every. single. subclass will probably have a different hash implementation? (ok i guess it could work but it's just weird)
@Downgoat this is as far as i got: https://tio.run/##hVLBbsIwDD23X2F6QK3G@IAMOmnaEJdJ0@gPpCyFSmkCiSvGqn5756SUlUnTLoliP7/37NjUFruutgIsfjC253bPWLOmawbuFKZ9CK/prZZSbLHUyjLm0huBo3RRIRU/i7zezWClTcURhZnBu7C1RCIK0fAS4fWc@bsJg0JBzk08tUIWCdynsEFTqt1D2A7gFVfb81DBrrV33h5dL0c6vCY0bVhWB7nI0tuqQhvI4ETNCMj@pQgtmnpLwlpDnJBpxwljLpf52zs0YATWRl3eNBejqzgibJRA6zrzjF78ls6Nf7Fml8mnPfWMhstRMJhWNcI6cdjAJeZOPZm7othDyGzww//GDZZcUnO3IuI48GokFeKlnPefay1/scNy2cP655h/TDzE@iHe6tFWDILFpYnrbnjZfj288MmUKCYxQaOmjajzq5FBmggrXqrYj0EKBMeX8y9YwmUhGVs86c/FeAPSlDElTu43A8LOS2WFwZhgfZzMNm3isgf6MZRqEkcNe3QOCE7xtuu@AQ
Arithmetic quine
Write a quine.
Well that's not very original challenge so let's spice things up.
Challenge
Write a quine and when two copies of the program are appended (see Appending)
then the quine preforms an arithmetic operation of your choice.
You can implement as many operations as you ...
@ASCII-only yeah that’s the error I was getting :(
@ASCII-only subclass? Rust doesn’t have classes? Do you mean implementation? Because that’s the point of traits, that each implementation of the trait has its own implementation
Elixir Array Syntactic Sugar
string code-golf elixir
In Elixir, (linked) lists are in the format [head | tail] where head can be anything and tail is a list of the rest of the list.
Lists can also be written like [1, 2, 3] which is equivalent to [1 | [2 | [3 | []]]]
Your task is to convert a ...
Challenge :
Push the vowels (only vowels) in the given string by 1 position to the left.
Note :
Vowels are the following characters: A, E, I, O, U
Vowel push is cyclic i.e. After rearrangement the first vowel of pushed string goes where the original first vowel was
Input :
A string line...
@BoraCalim You didn't do anything wrong. If you were suspended for a reason, you would have received a message about why. We're working on getting your account back, but there are some unusual circumstances so it might take a little bit longer than normal
CMC: compute the nth term of "the" sequence that starts like this: 0, 1, 1, 2, 8, 22, 52, 114, 240, 494, 1004, 2026, 4072, 8166, 16356, 32738, 65504, 131038, 262108, 524250, 1048536.... (This is actually accidental/undesired output of a program I'm working on, but it seemed interesting.)
Background
Some of you might see from my earlier questions that I want to sort 32 elements in fastest time with the constraint of a 256 word memory and around ~4 usuable registers.
My best result so far is ~1380 CPU clock cycles/instructions using mergesort to fully sort the list of 32 element...
Introduction
The challenge itself was something I came across and had to try and figure out for a personal of project of mine. I ended up branching out and asking family members if you could provide an equation to meet the requirements.
Note: I have (with the help of others) found a solution fo...
@ASCII-only not simple in terms of writing something, i mean
it takes a long time to write simple programs
whereas turtlèd and quarterstaff are simple in terms of the writing what you want, woefully is not, even if the algorithms in those languages are not simple either
@ASCII-only not so much a long time as in like long long time but as in, if i want to write a command, it take longer than it would in something i consider a good language
@ASCII-only if i wanted to write a program easier i wouldn't be having anything to do with woefully
also intermediate doesn't work as well here as it might with something else
like it would have to be a whole compilation thing, rather than a single step, because of the way commands have to be structured, and their relationships with each other and stuff... and it would all be very ungolfy
In this challenge, you will write an interpreter for 2Ω (transcribed as TwoMega), a language based loosely on brainfuck with an infinite-dimensional storage space.
The Language
2Ω contains three pieces of state:
The Tape, which is an infinite list of bits, all initialized to 0. It has a leftm...
Background
A triangular grid is a grid formed by tiling the plane regularly with equilateral triangles of side length 1. The picture below is an example of a triangular grid.
A triangular lattice point is a vertex of a triangle forming the triangular grid.
The origin is a fixed point on the ...
Arithmetic quine
Write a quine.
Well that's not very original challenge so let's spice things up.
Challenge
Write a quine and when two copies of the program are appended (see Appending)
then the quine preforms an arithmetic operation of your choice.
You can implement as many operations as you ...
Elixir Array Syntactic Sugar
string code-golf elixir
In Elixir, (linked) lists are in the format [head | tail] where head can be anything and tail is a list of the rest of the list.
Lists can also be written like [1, 2, 3] which is equivalent to [1 | [2 | [3 | []]]]
Your task is to convert a ...
Challenge :
Push the vowels (only vowels) in the given string by 1 position to the left.
Note :
Vowels are the following characters: A, E, I, O, U
Vowel push is cyclic i.e. After rearrangement the first vowel of pushed string goes where the original first vowel was
Input :
A string line...
Introduction
The challenge itself was something I came across and had to try and figure out for a personal of project of mine. I ended up branching out and asking family members if you could provide an equation to meet the requirements.
Note: I have (with the help of others) found a solution fo...
