Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
hashmash
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
31.
▲
by
hashmash
3y ago
PRQL is actually a first class functional programming language, with syntax for supporting readable query processing pipelines. The documentation for PQL is a bit light, so I don't know if it's as powerful as PRQL.
32.
▲
by
hashmash
3y ago
It would have had little to no impact. To run it, you need the 512KB upgrade and a disk drive. To get decent looking graphics you'd also need to shell out money for an RGB monitor. It would have been substantially cheaper to get an NES
33.
▲
by
hashmash
3y ago
The fact that the monitor is public rarely causes issues, and in those cases where it's used on internal objects, it's not really public anyhow. There's an additional benefit to using the built in monitors, and that has to do
34.
▲
by
hashmash
3y ago
Unfortunately, the D garbage collector is a simple design that doesn't offer the performance and scalability of a modern collector. Someone switching over to D from Java/C#/Go might be surprised to see GC pauses reminiscent o
35.
▲
by
hashmash
3y ago
My remark regarding "safety" wasn't with respect to the quality or correctness of the implementation. My concern is the case where you've found yourself in a situation where you're relying too much on GC, and the ap
36.
▲
by
hashmash
3y ago
Java's ZGC and Shenandoah collectors suspend threads only briefly -- less than one millisecond regardless of the heap size.
37.
▲
by
hashmash
3y ago
My understanding is that garbage collection in D is performed by a "stop the world" non-generational collector. Although GC is optional in D, without a more competitive implementation, the safest thing is to never depend on it. Wh
38.
▲
by
hashmash
3y ago
Compressed pointers are disabled if the max heap is larger than 32GB.
39.
▲
by
hashmash
3y ago
Where can we read about the responses?
40.
▲
by
hashmash
3y ago
It's undecidable when you consider the possibility that the program won't ever attempt to access an object. A tracing collector plays it safe and assumes such objects might still be accessed at some point. In GC languages you'
41.
▲
by
hashmash
3y ago
If a security sensitive operation was (for whatever reason) calling startsWith (as shown in the blog), then it might return an incorrect result. I'm merely speculating that an exploit is possible, and I'm not aware of any code tha
42.
▲
by
hashmash
3y ago
For locally generated strings, it's not a concern. For String.intern, this is actually a very serious bug that should be treated as a security vulnerability.
43.
▲
by
hashmash
3y ago
What are the expert-programmer aspects you're thinking of?
44.
▲
by
hashmash
3y ago
Not with the Unsafe class. It was never intended to be used by anything except the built-in concurrency support classes, and it was just barely good enough. External libraries which made use of the Unsafe class did so by studying how it was
45.
▲
by
hashmash
3y ago
> Java doesn't have the weaker atomics support that C++ added Yes it does, but it doesn't have first-class keywords to represent these modes. You have to use the VarHandle class, which is a bit kludgy. https://docs.o
46.
▲
by
hashmash
3y ago
The Centennial Light produces very little light and isn't very practical. https://www.urbo.com/content/the-lightbulb-conspiracy-shinin...
47.
▲
by
hashmash
4y ago
The serial and parallel GCs are best used for applications that care more about throughput than latency (pauses). If you only have one CPU core, running multiple threads isn't going to speed up the GC cycle. The parallel collector just
48.
▲
by
hashmash
4y ago
Seems like something wonky with your Windows setup. Too much memory and threads? I've "only" got 20GB and 8 threads.
49.
▲
by
hashmash
4y ago
I just did and it was instantaneous. How many tasks are you running?
50.
▲
by
hashmash
4y ago
I wanted to make sure all code paths were executed, and so I filled the array of ints with 50% negative values.
51.
▲
by
hashmash
4y ago
Different languages have different exception handing optimizations. A Java version of the example can run very slow or very fast, depending on how clever you are. When a new RuntimeException is thrown half the time, the example runs about 6
52.
▲
by
hashmash
4y ago
MyRocks is MySQL backed by an LSM tree, and so it doesn't have fixed sized pages.
53.
▲
by
hashmash
4y ago
> this is true for almost every database. ...that uses fixed sized pages.
54.
▲
by
hashmash
4y ago
The Java language doesn't have a goto statement, and so all code is properly structured. A labeled break statement is almost a goto statement, but it still obeys structuring rules -- i.e., you cannot jump into the middle of a loop. At
55.
▲
by
hashmash
4y ago
Ok. I'm also curious about your comment regarding GOTO. How is it potentially insecure?
56.
▲
by
hashmash
4y ago
In the early days of Java, it was bundled with the browser. But because Sun didn't make their own (popular) browser, they couldn't dictate the terms for what features a browser was expected to include.
57.
▲
by
hashmash
4y ago
Which Java vulnerabilities are you referring to which require breaking bytecode compatibility?
58.
▲
by
hashmash
4y ago
> modern analytical engines What about relational databases? Most are best suited for OLTP workloads.
59.
▲
by
hashmash
4y ago
Can you provide an explicitly named "modern" database that doesn't use B+tree indexes, and what specifically does it use instead?
60.
▲
by
hashmash
4y ago
What kinds of indexing structures are used instead, and how do they differ from B+trees? Do you have examples of which relational databases have replaced B+tree indexes?
More ›