jellylanguage
aoc2022
jellylanguage | aoc2022 | |
---|---|---|
13 | 22 | |
842 | 2 | |
- | - | |
0.0 | 10.0 | |
over 3 years ago | 8 months ago | |
Python | C | |
MIT License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
jellylanguage
-
Squeezing a sokoban game into 10 lines of Haskell
At least on the Code Golf Stack Exchange, I see a lot of people using esolangs for golfing (two random examples: Jelly [1] and O5AB1E [2]). I expect that it could be a line or two shorter at least with a change of language. As I recall some of the golfing langs also have pretty sophisticated compression techniques for strings, although they might be optimized for dictionary words. Careful distinction: they are all optimizing for bytes used, not characters used.
I don't want to neglect your shameless plug, but I struggle enough to find a solution to some of the puzzles I wrote (hence the undo), so finding the shortest path is a little daunting.
[1] https://github.com/DennisMitchell/jellylanguage
[2] https://github.com/Adriandmen/05AB1E
-
-βοΈ- Advent of Code 2022:πΏπ MisTILtoe Elf-ucation π§βπ« -βοΈ- Submissions Megathread -βοΈ-
ADDITIONAL COMMENTS: I am also solving most of these problems in Jelly, a recreational language designed for code-golf. They are in the same repository under the jelly folder.
-
-π- 2022 Day 3 Solutions -π-
Jelly (put the input in the first command line argument):
-
Is it possible to make my own language in batch?
Yes it is totally possible, Batch script is Turing complete afterall. Since you found Python tutorials, you can just apply the same concepts in Batch. The difficulty depends on the complexity of the language you're trying to make. I would recommend trying to make a stack-based language first, with the syntax similar to golfing languages (ie, one character is one "command", check out https://github.com/DennisMitchell/jellylanguage), since that would be the easiest. But obviously if you're up to it you could make a fully fledged programming language.
-
Silly Lossy Text Compression Idea
This is a basic version of many commonly used ideas for string compression in golfing languages. Jelly [0] is a good example of a more practical and versatile approach that builds on ideas such as this.
[0] https://github.com/DennisMitchell/jellylanguage/wiki/Tutoria...
-
Getting Ready to start my Career
(As an aside, some people "stop" here and then make programming languages based on this - because that is a simple interpreter... you could write a compiler for this language, or extend it - and the great golfing languages take that starting spot and keep going - don't worry about trying to replicate it, it takes some insanity to go that far - the point is that a stack based language is the starting spot for some impressive systems... like the JVM itself)
-
No more semicolon errors (source in comments)
If you like code to be as short and unreadable as possible, try out Jelly.
-
What is the highest level programming language?
Arguably, however, if you think about "High Level" in terms of "how many keystrokes do you need to do X complex task" (kinda like some mean komolgorov complexity measure over a set of tasks) then code golf languages could probably be the most "high level". Take Jelly for instance. Incomprehensible garbage when written, but goddamn if it isn't character efficient.
-
Ask HN: Who's Not Sucky to Work For?
I am waiting for a time when we get Angular or React in Jelly [1]
[1] https://github.com/DennisMitchell/jellylanguage/wiki/Tutoria...
-
Good Design is Imperfect Design Part 1: Honest Names
Being honest with naming things is also a great roundabout way to ensure you write maintainable, readable code. If the name is honest and it feels awkward, it's a good red flag that there might be a problem with the approach you're taking. I think code golf languages (a-la [0]) are a good example of this approach as well, when your language is as terse as possible, giving very deep consideration to what the language actually does is crucial.
[0] https://github.com/DennisMitchell/jellylanguage/wiki/Atoms
aoc2022
-
[2022 Day 9] "Rope Bridge". A particularly efficient implementation idea (for people who understand C++, but applicable to C/Java/Go/Rust as well)
It may be a nifty hash table (no, it is!:)) but the whole program runs about 12x slower on an M1 than my version where I first determine the max dimensions and simply allocate a grid of booleans... So I wonder how much the 8x8 bitset breakup could improve. But bitsets are a C++ feature. In C, like NRK: https://github.com/ednl/aoc2022/blob/main/09.c (my "startstoptimer.c" and .h are in the same repo)
-
[2022 Day 15 (Part 2)] [Python] I wrote a really fast solution for day 15 part 2 (less than 1ms). What do you think of the algorithm I came up with?
I also checked lines but only after doing a rotation by 45 degrees, so the lines are straight. Compiled in C, fastest run time on M1 was 26 Β΅s: https://github.com/ednl/aoc2022/blob/main/15.c
-
-π- 2022 Day 15 Solutions -π-
Same code but with preprocessed input to make it all fit into memory, runs in 7 ms on an Arduino Uno! https://github.com/ednl/aoc2022/blob/main/aoc22-15/aoc22-15.ino
-
-π- 2022 Day 13 Solutions -π-
Complete program runs in 463 Β΅s on Apple M1, 2.61 ms on Pi 4. See comments at the top of the source file for how I measured. My comparison function:
- -π- 2022 Day 12 Solutions -π-
-
[2022 day 11][C] Benching Monkeys
Not 100% sure this is Upping-The-Ante, maybe just Other. I wanted to share some benchmark results of my solution for today, day 11 with the 10,000 monkeys, and how I got there. I think the easiest way to compare performance is to use the same hardware, and nowadays fairly common & standardised hardware might be the Raspberry Pi 4. Although, you can't buy any for years now... Best score I got when running my solution on my Pi 4 home server is 15.6 ms.
-
-π- 2022 Day 11 Solutions -π-
I quickly saw that I could do "item = item modulo (product of all div-test numbers)" but the implementation took me a while in C without queues or circular buffers. But that's all part of the fun for me! I didn't look for further clever optimisations because the compiled program runs in 20 ms on a Raspberry Pi 4. That was fast enough for today, I thought. Source code: https://github.com/ednl/aoc2022/blob/main/11.c
-
-π- 2022 Day 10 Solutions -π-
Yay, embedded software engineering!! :) Short, fast & almost no memory needed in C: https://github.com/ednl/aoc2022/blob/main/10.c or the relevant bits:
-
-π- 2022 Day 9 Solutions -π-
That's great, but on what hardware? My solution in C runs in 0.8 ms average (0.6 ms minimum) using hyperfine to measure 1000 runs in a Mac Mini M1. Same on a Pi 4 in performance mode: 3.6 - 3.8 ms.
-
-π- 2022 Day 8 Solutions -π-
Well, it took me a while to realise that in part 1 you always have to check the whole row or column because a higher tree can come at any point ... And except for skipping the borders, I couldn't come up with any sort of clever optimisation that would help reduce the O(N^2) complexity. It still runs in under 1 ms on a Mac Mini M1 according to hyperfine. Full code 52 lines without space/comments: https://github.com/ednl/aoc2022/blob/main/08.c
What are some alternatives?
prolog-to-minizinc - A Prolog-to-MiniZinc translator
rust-mos - Empowering everyone to build reliable and efficient software.
frank - Frank compiler
AdventOfCode2022
langs
AdventOfCode - My solutions to Advent of Code
granule - A statically-typed linear functional language with graded modal types for fine-grained program reasoning
aoc - KlongPy Advent of Code (AoC) solutions
hexagony - A two-dimensional, hexagonal programming language.
AOC2022 - Advent of Code 2022, solved in Haskell
AoC2022
aoc-go - A Golang tool for generating code for Advent of Code