With JavaScript, how would you compute all sorted permutations of 1 to n elements from a given array?
For example, with this source [1, 2, 3] and n=2
How would you get this?
[[1], [2], [3], [1, 2], [1, 3], [2, 3]];
My double standards about JS framework compilers
I probably need to unpack some emotional baggage from past decades of work doing ObjC,.Net, and Java client work. Those were not my favorite projects…
3 Methods for Scoped Styles in Web Components That Work Everywhere
WebC allows folks to broaden access to things built with web components without the drawbacks of other methods I really have to try WebC more seriously,…
TIL there are nullish coalescing operator (??) and assignment (??=) in many programming languages, including JavaScript.
Never used them, always either using || or initialising variables with undefined.
Should I refactor? 🤔
TIL IntersectionObserver's rootMargin only works if the observer is in the same origin, because of privacy concerns:
There is a risk that the API may be used to probe for information about the geometry of the global viewport itself, which may be used to deduce the user’s hardware configuration.
That's why this demo of a sticky navigation doesn't work in CodePen's default view… 😞
I want to be a web developer, not a JavaScript developer. Same. (Read the whole post, of course.)
Zach Leatherman