diazrenata / upgraded-pancake Goto Github PK

The distribution of hill nbs for draws from a feasible set of given s,n is a knowable thing. In moving towards making comparisons to the feasible set using sim models, it's a reasonable expectation that there will be be repeated s,n combinations and that we will want to make a lot of comparisons.

Thinking to start populating a centralized database, essentially a massive table of s, n, hill1, hill2 and then 1000-5000 records for each combination (or the number possible). I could store this as a targets thing but I'd prefer not to...seems like an opportunity to practice databases, overkill for this but good practice.

I just did a pilot attempt with iter functions. I jumped in in the deep end using J, which looks like it's not implemented yet (probably because that will involve some guardrails/extra considerations 😄).