HackerTrans
TopNewTrendsCommentsPastAskShowJobs

chipaca

no profile record

comments

chipaca
·3 माह पहले·discuss
I went to https://www.keyboardco.com/ and searched for left-handed and the keyboard in the photo popped up, as well as a bunch of weirder and wonderfuler ones.
chipaca
·पिछला वर्ष·discuss
[flagged]
chipaca
·पिछला वर्ष·discuss
Thank you for the comment. I would not have understood "can be navigated using mouse" to mean "dragging".

Also I hate that I can't select text on this. Probably because "dragging".
chipaca
·2 वर्ष पहले·discuss
I seem to remember non-blocking io with named pipes was unreliable, in the sense that the test suite of whatever-it-was (memory is reeealy sketchy, this was tens of years ago) would fail randomly often enough that we had to throw the easy solution away and do actual networking.

A bit like the .signature named pipe from fortune thing, where sometimes you got two signatures and sometimes none? Anybody remember that?
chipaca
·2 वर्ष पहले·discuss
Step 1, create a named pipe, and open it in non-blocking mode.

...

Unless things have changed a lot in this domain in the last few years, that won't work reliably _anywhere_.
chipaca
·3 वर्ष पहले·discuss
From the looks of it that's been generated by `circo`, which is part of GraphViz and describes itself as a “filter for circular layout of graphs” and

       circo  draws graphs using a circular layout (see Six and Tollis, GD '99
       and ALENEX '99, and Kaufmann and Wiese, GD '02.)  The  tool  identifies
       biconnected  components  and draws the nodes of the component on a cir‐
       cle. The block‐cutpoint tree is then laid out using a recursive  radial
       algorithm.  Edge  crossings within a circle are minimized by placing as
       many edges on the circle's perimeter as possible.   In  particular,  if
       the  component is outerplanar, the component will have a planar layout.
       If a node belongs to multiple non‐trivial biconnected  components,  the
       layout puts the node in one of them. By default, this is the first non‐
       trivial component found in the search from the root component.