Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
pshc
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
54 ms
·
571.
▲
by
pshc
13y ago
No, but Rust is a contender.
572.
▲
by
pshc
13y ago
He's likely talking about the Oculus Latency Tester (it covers up one of the eyes), it's unrelated.
573.
▲
by
pshc
13y ago
You could use two different eyecups (containing different lenses) for each eye in the Rift. Could work if they happen to provide just the right kind of lens. Maybe differing focal depth could be dealt with in software? When you use the Rift
574.
▲
by
pshc
13y ago
Re: Tor deterministic builds link That writeup is really fucking cool. You should submit it as its own story!
575.
▲
by
pshc
13y ago
Thanks for the heads-up all! Looking forward to actually being able to distinguish Authenticator accounts on iOS 7.
576.
▲
by
pshc
13y ago
I get the joke :) Although, taken literally, this is not the case. The existence of a variable in Lisp is not decoupled from its human-string-name, as Lisp source is textual. If you were to rename a variable, anything that referred to it (b
577.
▲
by
pshc
13y ago
An ambition of mine is a programming language where the program structure is decoupled from its visual/textual appearance (model-view separation). One nice result of this scheme is, for example, you could work on a program in English a
578.
▲
by
pshc
13y ago
The "stroking" term comes from Games People Play , FWIW. Really interesting read.
579.
▲
by
pshc
13y ago
Here's a script I whipped up to dump Bugsnag exceptions endlessly for easy grepping: https://gist.github.com/pshc/6289579
580.
▲
by
pshc
13y ago
Excerpt from Graydon's (BDFL) reply: > Despite all these caveats I have a very strong sense that writing the > runtime in Rust will go a long way to validate Rust in the domains it's > aiming for: concurrent and s
581.
▲
by
pshc
13y ago
Behold: https://www.hnsearch.com/search#request/submissions&sortby=p...
582.
▲
by
pshc
13y ago
Some ideas: http://en.wikipedia.org/wiki/List_of_calendars#Proposed
583.
▲
by
pshc
13y ago
The future is hybrid. Source code will become non-textual in storage and VCS, but our editors (code lenses) will remain looking and feeling like text editors. (The danger in trying to invent a next-gen non-plaintext programming environment
584.
▲
by
pshc
13y ago
I think it's really nice! Usually these flow-chart languages have difficult UI, but this one is pretty easy to mess around in. It would be good if, while clicking and dragging a new connection line that will replace an old one, the lat
585.
▲
by
pshc
13y ago
>By making names irrelevant, using UUIDs instead, I no longer had to think about shadowing or namespacing. I've been trying to do something similar with a pet language :) Human names should never touch the compiler, they are annot
586.
▲
by
pshc
13y ago
Wow. This post is a journey. I haven't digested it enough yet, but I'm loving the trip! EDIT: found http://www.ribbonfarm.com/for-new-readers/ . Onto the Kindle you go.
587.
▲
by
pshc
13y ago
The great thing about indirection is you can change what it points at. In the future we'll be running out of fossil fuels and generating electricity with same will be uneconomical compared to alternatives. It will be nice to have a mat
588.
▲
by
pshc
13y ago
Rust is the anti-JVM. - Proper task isolation with pointer ownership. - No global GC. Task-local GC when needed, and explicit ownership otherwise. - Mozilla. - No NullPointerExceptions. Unsafe code is convenient when you need it.
589.
▲
by
pshc
13y ago
FWIW I'm using the iOS 7 beta, and this behavior is inconsistently present. It works in nested lists, but other screens e.g. the music Now Playing screen don't do it at all. Hopefully it gets OS-wide integration. But hey, it'
590.
▲
by
pshc
13y ago
Really happy to see a tagging file system. Messing around with a hierarchical taxonomy has always been a waste of my time. EDIT: oh crap flat UI
591.
▲
by
pshc
13y ago
Too bad mesh networking hasn't got off the ground in a big way (?). Couldn't individuals hoist weather balloons with mesh transmitters and build these sorts of networks bottom-up?
592.
▲
by
pshc
13y ago
The same amount of information exists, but is normalized. The variable _definition_ absolutely will have a "name" annotation, but copying that name to each binding site is brittle. To render a binding, just dereference the pointer to the or
593.
▲
by
pshc
13y ago
It's what we need. This became clear shortly after learning git--it's the right data structure for the problem. The hurdle is that hashes aren't user-friendly in a text-based code editor. We need an editor that lets us view and work at the
594.
▲
by
pshc
13y ago
I've actually been trying to make 3) happen with a long-standing project of mine, because serializing AST to text discards information. In a (proper) AST, human-readable names are never used as pointer values. When you bind something (refer
595.
▲
by
pshc
13y ago
Oh hey! This is exactly what Edward Tufte taught us at his course the other week. Now I'm curious as to who originated this practice...?
596.
▲
by
pshc
14y ago
Really nice to be able to get at the full-sized (albeit watermarked) versions. http://lusika33.livejournal.com/ has all of the lava albums and much more!
597.
▲
by
pshc
14y ago
Some feedback about the page design: When I first looked at the article, I breezed right past those six section links. They look way too much like generic fat-footer site nav or post-article outbound links or something, my brain must have f
598.
▲
by
pshc
14y ago
Will there be any possibility of running dev instances in OS X? Perhaps we'll be able to do brew install docker-compat at some point in the future and get a best-effort emulation layer even though the Linux APIs are missing. I hate messin
599.
▲
by
pshc
14y ago
That's pretty much what I gleaned too. The paper specifies how an acceptable ("low-stretch") spanning tree is shaped, and bounds [something, error criterion?] as part of its complexity proof.
600.
▲
by
pshc
14y ago
I would love to see a visualization of their algorithm iterating its loop rebalancing thing on a simple 2D graph. Maybe a weekend project... [removed: I was curious about the SDD requirement, but that's always the case for a graph Laplacian
More ›