Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
iTokio
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
18 ms
·
91.
▲
by
iTokio
5y ago
interesting design document: https://raw.githubusercontent.com/bup/bup/master/DESIGN
92.
▲
by
iTokio
5y ago
By the author of the excellent https://c9x.me/compile/ A lightweight alternative to llvm https://c9x.me/compile/doc/llvm.html
93.
▲
by
iTokio
6y ago
It’s probable that they are mostly measuring implementations efficiency or GCC vs LLVM for these languages.
94.
▲
by
iTokio
6y ago
Is there a serious source ranking all global CO2 emissions? Where percentages add up to 100%?
95.
▲
by
iTokio
6y ago
It reminds me of https://github.com/sustrik/libdill
96.
▲
by
iTokio
7y ago
What are the advantages of using your custom engine instead of unity, unreal engine?
97.
▲
by
iTokio
7y ago
> enabling an unprecedented leap in battery life to easily get through the day Sic.. they don’t even really try to sell a longer battery life, they just are content of getting through the day
98.
▲
by
iTokio
7y ago
> an offline compiler like Clang can spend considerably more time to generate better code, whereas WebAssembly compilers must be fast enough to run online > [security] checks are necessary for WebAssembly’s safety > current JavaScr
99.
▲
by
iTokio
7y ago
Is there still a need to cache results in a texture or is it practical to render from scratch each frame?
100.
▲
Never use the word “User” in your code
(codewithoutrules.com)
3 points
by
iTokio
7y ago
|
5 comments
101.
▲
by
iTokio
8y ago
What are Nim’s main weaknesses?
102.
▲
by
iTokio
8y ago
It daunts me how much software is getting unreliable, but trying to shame people to hold them accountable is naive. The root of the problem is the uncontrolled complexity of modern software products. Because of this complexity responsibilit
103.
▲
by
iTokio
8y ago
Doesn’t it rely on llvm internally? That means that the jit path is slow to start and that your have a huge dependency.
104.
▲
by
iTokio
8y ago
Can it be used with Blocks?
105.
▲
by
iTokio
9y ago
The trick is not so much about compression, but rather about image generation. The trade off is completely different from usual lossy algorithms. A highly compressed image might still retain high visual quality but with completely different
106.
▲
by
iTokio
9y ago
What would be awesome is a way to easily visualize the code size.
107.
▲
by
iTokio
9y ago
Big Blues, about IBM/Microsoft is an interesting read.
108.
▲
by
iTokio
9y ago
I thought that without runtime rust would be easy to compile to bare webassembly (no emscripten). But you lose stdout, backtraces. lto doesn’t seem to be working. Which is okay except that there is no easy way to override/replace what’
109.
▲
by
iTokio
9y ago
Because Go has built in primitives to make micro services. The cleanest asynchronous io model that I have ever seen. Simple serialization by default. Did I mention the blazing fast compile times? Just that would make it way more “faster” to
110.
▲
by
iTokio
9y ago
The simple bissection can over fit quite easily. Thank you these are great resources!
111.
▲
by
iTokio
9y ago
It’s a lossy compression issue: How to approximate a curve within a given error threshold with the minimum number of control points.
112.
▲
by
iTokio
9y ago
Sorry I meant cubic, control points can just be points of the original curve with a catmull rom spline. So an easy method is just to remove the point with the minimal error contribution and iterate until a given threshold. But the cost is t
113.
▲
by
iTokio
9y ago
Is there a simple, elegant method to approximate a curve with a cubic spline? I brute forced it with the least squares :( *Edit: a cubic curve is also acceptable
114.
▲
by
iTokio
9y ago
P-hacking or how to sell your scientist soul.