@Downgoat How difficult do you think it would be to compile JavaScript to VSL? I have a brownfield JavaScript application that uses JS almost like it's C. I'm thinking of rewriting the actual hot computations in highly optimized VSL
Because if the blurb on the README is true, VSL sounds very very cool
@noɥʇʎԀʎzɐɹƆ hmm biggest issue would be typing, but there is already in fact a bindgen that (if oyu specify types of methods with a WebIDL document) you can use JS with VSL
I actually will contribute to VSL and use it if what it says is true is true
@Downgoat Hmm, explain? What would the steps be to compile JS to VSL?
I can definitely specify most types for it, but I want to retain the flexibility (other developers on the project who don't know javascript may not be able to type their code right)
What if I plugged the VSL backend into GraalVM I can run VSL with a JIT that interoperates with JS?? (That's a crazy idea, I would prefer to just get a reliable ECMAScript3->VSL compiler)
(Also where are the download binaries? The DNS doesn't seem to work for 'em)
Btw, my git tip for you is: Use GitUp and commit every time you have a meaningful change, branch locally to experiment, cherry pick to get commits from one branch onto another, rebase to make git think the commit was always part of the history, and rewrite and split to clean your commit history
But very, very cool, sir
I'm part of a community that builds the game Arras.io. I can... look into mobilizing some developer resources to help with VSL stuff if you gave a bucket list of things we could do to help.
@noɥʇʎԀʎzɐɹƆ thats a good idea :P VSL commit history is a mess since I get so many features stuck in one branch and don't want to smush them all together
push to release a random playtesting update (ssh pubkeys for access control); restarting the game server every time, pull from central master to update, updates on automatic arena close
@Downgoat Hmm, what's on the todo list for web idl?
I wonder what WASM's performance is on the serverside
In GraalVM, the C<-->JS interop is fast enough that if I reimplement a JS class in C, I increase the application's peak throughput by 50%. (eq. to a 33% cpu usage reduction)
@noɥʇʎԀʎzɐɹƆ VSL has a binary format (.vslc files) which stores build information which means if you make a change pretty much only the file you change will be recompiled we can load everything else from the .vslc files
but as always -O0 results in faster comp speeds
@noɥʇʎԀʎzɐɹƆ hmm cant do binary because bundling LLVM would be complex, maybe somewhere down the line
Group Integer by Originality
code-golfnumberintegerarray-manipulation
Introduction:
I collect twisty puzzles. Most twisty puzzles are produced and sold by Chinese companies. Most well-known companies ask permission from puzzle designers to produce their designs and work together towards a prod...
According to http://en.cppreference.com/w/cpp/language/integer_literal, integer literals consist of a decimal/hex/octal/binary literal and a optional integer suffix, that is obviously completely unnecessary, wastes precious bytes and is not used in this challenge.
A decimal literal is a non-zero...
Well that was annoying. Finally figured out why my laptop's fans kept spinning up despite doing nothing. Audio driver stayed at like 20% CPU usage when having a USB headset and docked
@Downgoat How does one run VSL? Does the current master build?
Universal kolmogorov complexity: The first two bytes indicate which of the 65536 most popular languages on PPCG. The rest are the source for that language.
We should rename ourselves to be the "programming problems and code genies" stack exchange. People can come to us with their problems, and we work to fix their problems for them.
Like most challenges, score is in bytes, least wins.
"Bracket" numerals are a type of numerals I made up (not for this challenge), they aren't really numerals. Basically you convert the number into base 6 then replace a 0 with (, a 1 with ), 2 for [, 3 for ], 4 for {, and 5 for }.
Your score ge...
Website of the day: applesnail.net A 21-year-old website all about a particular type of aquatic snail. I miss the good ol' days when the internet was filled with honest sites that were just trying to spread knowledge.
@Mego I am trying to use this Fibonacci heap to beat the standard queue implementation but I can't, can you provide any insights. I'm using it in Dijkstra on a matrix godbolt.org/z/U1Q3ec
code-golfnumber
To exponential digit growth and beyond!
Challenge
Given a base (which is less than 10) and a term, your mission (should you choose to accept it) is to:
Make a number in base-10 which will be the base + 1. We will call this "the current number"
Do the following the term number...
The gambler's fallacy is a cognitive bias where we mistakenly expect things that have occurred often to be less likely to occur in the future and things that have not occurred in a while to be more likely to happen soon. Your task is to implement a specific version of this.
Challenge Explanation...
code-golfnumber
To exponential digit growth and beyond!
Challenge
Given a base (which is less than 10) and a term, your mission (should you choose to accept it) is to:
Make a number in base-10 which will be the base + 1. We will call this "the current number"
Do the following the term number...
@dzaima Have you gotten around to neighborhoods > radius 2 for your cellular automation yet? Sorry, I can't help with this because I don't really understand advanced Processing.
my personal view is twofold a) there is a fair point that if you want to set strictly objective criteria you can't just say "30 minutes on a standard desktop machine" as that isn't properly specified
the criticism I got was along the lines of "It's stupid to ask a question that is hard to answer at all and then to require it to be golfed. The golfing part is just irrelevant"
Here is a theoretical question - one that doesn't afford an easy answer in any case, not even the trivial one.
In Conway's Game of Life, there exist constructs such as the metapixel which allow the Game of Life to simulate any other Game-of-Life rule system as well. In addition, it is known that...
@MilkyWay90 the question was posted 6 years ago, plus QFT started a long time before it got finished. if anything like it would be posted today i wouldn't think it'd be received well
I don't think PPCG is any different than it was when QFT was revealed, and frankly if it is and things like QFT are frowned upon now, I'm not sure I really wanna be part of the community anymore
@Skidsdev i mean, you can't really build a site around the concept of "spend a couple years solving one challenge". I feel something like it is a one-time opportunity. It is a good question and an interesting challenge, we just can't have 10 like it posted a day.
@Anush That question seemed okay in terms of difficulty, but You may not use any libraries or builtin functions that perform modulo arithmetic (or this inverse operation). This means you can't even do a % b without implementing % yourself. You can use all other non-modulo arithmetic builtin functions however. seems too unclear
@Anush i can't really put my finger on why, but that question (except that stupid restriction of no modulo built-ins (would a C compiler optimizing to modulo anyway count?)) by some reason feels more "possible"/"approachable" than your powers question
@Anush now that i actually read the question, i see that it's about modular inversing which is a widely known, solved problem, whereas your question required quite some new proofs (which are not code, on a coding site) to even have an algorithm
@MilkyWay90 alone it isn't bad, but it'd be more suited as a question somewhere else as it's really asking for proofs/math while it shows itself here as a code-golf question
@Anush doesn't that effectively come down to "try to find as simple as possible of an algorithm"? simple tends to very often be proportional to golfiness
my app is multiple choice test, where for each question the response results in a 4 letter string "eg" GTAC or ATGC or CATG, etc. There are always just 24 questions. so the final result is something like
GTAC CATG TACG GACT GTAC CATG TACG GACT GTAC CATG TACG GACT GTAC CATG TACG GACT GTAC CATG TA...
Or, "Swap the first and last letters of each word"
Your challenge is to, given a string of alphabetical ASCII characters as well as one other character to use as a delimiter (to separate each word), swap the first and last letters of each word. If there is a one-character word, leave it alone.
...
@Anush if you overlap them, it's okay. But if you join the two together with glue by slapping code-golf on a theoretically interesting & difficult question, is where i start having problems.
@Rick what I like in fastest-code is that it isn't necessarily the fastest, that there's often room for improvement not necessarily by getting better theoretical speed
Everyone now hates on linked lists because CPUs now use a lot of local caching. However, I don't like that bandwagon mentality. It's not productive and lopsided, it's problematic.
I have so many secrets and nowhere to keep them!
The goal is simple: write a program that lets you save a string and have it be protected by a password.
The program will take an alias, password and (optional) secret as parameters.
If this is the first time the program is called with a given al...
code-golfnumber
To exponential digit growth and beyond!
Challenge
Given a base (which is less than 10) and a term, your mission (should you choose to accept it) is to:
Make a number which will be the base added by 1. We will call this "the current number"
Do the following the term number of ...