Idk, a lot of the features detailed in that post are either equivalent or better than existing Sandbox stuff
The only thing I dislike about it from a Sandbox PoV is
> Questions that are not approved by Reviewers will be auto-published after a defined period of inactivity, except for questions that have received a close vote or flag, or where a Reviewer has asked for major changes that were not made.
@cairdcoinheringaahing yeah i'm not a fan of that cuz it makes it not really practical for us to use sandbox for very WIP things that might take a long time to actually become usable or are purely ideas for a while
gonna make a bot that autoflags everything in the staging ground to prevent auto-posting
there are a lot of things i wish SE let us set per-site that would make the site a lot better catered to small sites / weird sites like us that wouldn't even really require any new features
> F BIT_FLIP: Pops the top of the stack, flips all bits, and pushes the result onto the stack. Only works on numbers. For example, 7 F will return 0 because 7 = 111, 000 = 0. 10 F will return 5 because 10 = 1010, 0101 = 5
i don't believe it is capable of causing harm since it has too few features to have ACE and it has manual memory and operation counting and commits suicide after enough resources are used
anyway in case you hadn't lost all faith in me yet, here's some positron code
CMQ given a bipartite graph I can find a maximum cardinality matching using Hopcroft-Karp. But how can I find two different maximum cardinality matchings?
Given a string, like potatocarrot, break it into the smallest number of substrings possible. These substrings can consist either be a single character, or one of a list of words passed as input. For example, if [carrot, potato] was the input, the optimal way to break the string up would be [potat...