xelxebar

20 ms·

151.
by xelxebar 1y ago
Good point! The parent vector rep is what allows arbitrary node order, but chunking the table data off chunks of node IDs is brilliant idea. Cheers!
152.
by xelxebar 1y ago
Well the whole point is to use a breadth first order here. I don't think there's a depth vector analogue for breadth first traversals. Is there? But, indeed, depth vectors are nice and compact. I find them harder to work with most
153.
by xelxebar 1y ago
Nice! Another tantalizing rabbit hole. I go full in on ed sporadically. It requires a bit of a brain rewire, but tye UX is closer to pencil and paper, which is hard to beat for encouraging deeper thought, IMHO. Also, check out edbrowse for
154.
by xelxebar 1y ago
Haha. Me and my friends did this throughout middle school. My experience was similar; the biggest downside is social. These days, dealing with clients scattered across disparate timezones, no matter what, you either gotta deal with calendar
155.
by xelxebar 1y ago
Mind if I ask what stack you use? I've got some acquaintances working with Swedish infrastructure, and they have lots of stories.
156.
by xelxebar 1y ago
Very cool point, and it applies to any tree data in general. I like to represent tree data with parent, type, and data vectors along with a string table, so everything else is just small integers. Sending the string table and type info as u
157.
by xelxebar 1y ago
It's actually an interesting observation. If you know where your keys are, finding them is trivial, but if you don't, then even the refrigerator becomes plausible. Math does feel like that a lot of the time. Once you've tree-
158.
by xelxebar 1y ago
Indeed. Famously, though, figuring out if something is a tautology is undecidable!
159.
by xelxebar 1y ago
It depends a bit on your tastes. The content falls under the broad umbrella of Abstract Algebra, more specifically Ring Theory, or perhaps Field Theory if you squint a bit. Those are your keywords. "Applications of Abstract Algebra wit
160.
by xelxebar 1y ago
Oh, you're the author! I didn't notice and sent you an email, but will repost here: $ for i in 3 4 5; do f=puzzle.$i; echo $f: $(head -1 $f | wc -c); tail -$((i-1)) $f; ./$f; done puzzle.3: 1 futz futz .
161.
Misconceptions about the Unix Philosophy(posixcafe.org)
7 points by xelxebar 1y ago|0 comments
162.
by xelxebar 1y ago
For the author's stated purpose, it sounds like this would work well. However, curl can take a long time to timeout of whatever, depending on server state. I'm curious how people would approach a guaranteeing a maximum time to res
163.
Some Hot JJ Tips(willhbr.net)
4 points by xelxebar 1y ago|1 comments
164.
by xelxebar 1y ago
> here's how you put someone into a box by looking at them Heck yeah. If we're putting people in boxes, then I agree. That said, the author's characterizations sound much less absolute to me, like they're median estim
165.
by xelxebar 1y ago
Studying the BEAM is definitely on my ToDo list. It's task parallelism sounds exemplar, and I really want to understand the architectural ramifications of choosing fine-grained task parallelism vs. a data parallel-friendly approach.
166.
by xelxebar 1y ago
Indeed! But haven't we now hypothesized dillydog here to be "a person who affords everyone a rich and deep inner life"? Or more provocatively, haven't we made a character judgement? In the same way that we perform root c
167.
by xelxebar 1y ago
Funnily enough, this response gives some insight into your personal affect. What kinds of mental states are capable of producing just such a reaction? FWIW, hypothesizing attributes about a person is also just what's required to begin
168.
by xelxebar 1y ago
Does it matter? I'd bet most customers don't ask for "a somewhat formal language" in the first place, but that's what you're calling for. I definitely do have customers that want to find data potentially tainte
169.
by xelxebar 1y ago
Maybe RFC 9759, which is referenced in the article "HTTP offload is a dumb great idea whose time has come"? https://www.ietf.org/rfc/rfc9759.html OP apparently noticed that two weeks is almost 20480 decimal =
170.
by xelxebar 1y ago
Man, you bring up so many good, juicy points. I wish we could sit down and chat about them! First off, just to be clear, I totally understand the friction points you bring up. APL's learning curve is crazy steep, and learning materials
171.
by xelxebar 1y ago
Hey, I know you. > all the operations are O(n) Not true, fortunately! The cat-gets pattern for insertion is clearly just an O(1) append. Similar for the replicate-gets in the deletion. Finding the deletion mask might be O(n) or O(log n),
172.
by xelxebar 1y ago
You're absolutely right that this approach encodes domain complexity in the data, and I agree that's not the magic sauce per se . Honestly, it's just really hard to convey how simple code can be. Imagine a nerual net inferen
173.
by xelxebar 1y ago
Indeed! Another way of putting it is that, in practice, we want the ability to easily iterate and find that perfect DSL, don't you think? IMHO, one big source of technical debt is code relying on some faulty semantics. Maybe initial ab
174.
by xelxebar 1y ago
> Can't really do that as easily in APL. This doesn't match my experience at all. I present you part of a formal language over an AST, no cover functions in sight: p⍪←i ⋄ t k n pos end(⊣⍪I)←⊂i ⍝ node insertion
175.
by xelxebar 1y ago
You stole the words from my mouth! One of the issues DSLs give me is that the process of using them invariably obsoletes their utility. That is, the process of writing an implementation seems to be synonymous with the process of learning wh
176.
by xelxebar 1y ago
> All the stuff that feels difficult and like it's just eating up time is actually me being forced to work out the problem specification in a more condensed manner. Very well put! Your experience aligns with mine as well. In APL, th
177.
by xelxebar 1y ago
> Subordination of detail The paper doesn't really explore this concept well, IMHO. However, after a lot of time reading and writing APL applications, I have found that it points at a way of managing complexity radically different f
178.
by xelxebar 1y ago
My YAML loader[0] is where I first broke through the wall. It's still languishing in a relatively proof-of-concept state but does exhibit the basic design principles. There's also a Metamath verifier that does parallel proof verif
179.
by xelxebar 1y ago
I came to APL slowly, originally motivated by some combination of fascination with the syntax and desire to break into the financial sector. However, what got me to invest in earnest study was hitting today beginner's wall and realizin
180.
by xelxebar 1y ago
Man, I feel like APL has unlocked some latent part of my brain. I'm a few years into seriously using APL and now work in it professionally doing greenfield development work. Starting out, solving puzzles and stuff was fun, but trying t

More ›