Fork me on GitHub
#asami
<
2021-01-09
>
alandipert00:01:00

no optimizations or anything (indexes, query planning)

alandipert00:01:24

came out a little wordier than i'd hoped, not sure i arrived at the highest leverage representation of relations. but any thoughts or ideas for improvement would be most welcome

alandipert00:01:04

the algorithm is basically: map the clauses over the facts to get a set of relations. then join the relations, either cross-join or inner-join depending on whether or not they share variables

quoll00:01:38

It’s always weird when a simple idea ends up taking a lot of space. It makes me feel suspicious of what I’ve done

1
quoll00:01:20

The inner join is clear, but I’m so used to working with large data sets that the m×n algorithm makes me a bit uncomfortable. Your use case shouldn’t have an issue though

noprompt01:01:42

TIL about Proxy 🙂

noprompt01:01:10

That’s pretty neat Alan. Borderline method_missing 🙂

parrot 1
alandipert01:01:54

between template literals and Proxy, ES6+ has job security

alandipert01:01:12

thanks for taking a look. i'll keep going towards the dom mgmt idea i have and post back if i arrive anywhere interesting. hope everyone has a great weekend!

👍 2