jdk7u-jdk
multichase
| jdk7u-jdk | multichase | |
|---|---|---|
| 15 | 2 | |
| 519 | 90 | |
| 0.6% | - | |
| 0.0 | 4.4 | |
| 4 months ago | 29 days ago | |
| Java | C | |
| GNU General Public License v3.0 only | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
jdk7u-jdk
-
What Cannot Be Skipped About the Skiplist: A Survey of Skiplists and Their Appl
Skip lists are relatively simple to make lock-free, while lock-free (even unbalanced) binary search trees are an absolute nightmare.
https://github.com/openjdk-mirror/jdk7u-jdk/blob/master/src/...
-
Requiem for a Stringref
Here is the JDK 7 String#hashCode(), which operates on characters: https://github.com/openjdk-mirror/jdk7u-jdk/blob/f4d80957e89....
That's changed in the newer versions, because String has a `byte[]` not a `char[]`, but it was just fine. A hash algorithm can take in bytes, characters, ints, it doesn't matter.
In Java, you don't get access to the bytes that make up a string, to preserve the string's immutability. So for many operations where you might operate on bytes in a lower level language, you end up using characters (unless you're the standard library, and you can finagle access to the bytes), or alternately doing a byte copy of the entire string.
I admit, checksums using characters are a bit weird sounding, but they should also be perfectly well-defined.
-
Don't Share Java FileChannels
"AbstractInterruptibleChannel" seems to be doing this, and the comments/javadocs offer some hint. As to why they're designed this way, that's a good question.
https://github.com/openjdk-mirror/jdk7u-jdk/blob/master/src/...
-
Computer sucks at math
In Java, you could use BigDecimal. I linked to the source code, because it highlights the amount of complexity you get.
- In Defense of Linked Lists
- System.in and System.out
-
Default editor launched from AWT toolkit?
The windows implementation of AWT Desktop just calls the Win32 API ShellExcute function. This then quickly descends into questions such as "what version of windows do you have"; "does it correctly understand the difference between open vs. edit"; what does your registry currently contain"; etc.
- Why do we need Scanner class in order to input something?
-
Help with StringArray-changing function
ArrayList is a class, it is not an array. It stores two values. An array and its size. You can see this if you read the source code for ArrayList.
-
How does StringBuilder build the string?
The source code for the Java SDK is available on github.
multichase
-
In Defense of Linked Lists
I have some experience writing/modifying linked-list benchmarks (https://github.com/google/multichase) specifically to test memory latency.
It is extremely difficult, maybe impossible, to design a prefetcher that can predict the next cacheline(s) to prefetch in a linked-list. I am not aware of a single CPU that can do this consistently.
- Measuring core-to-core latency (in Rust)
What are some alternatives?
jmh - https://openjdk.org/projects/code-tools/jmh
core-to-core-latency - Measures the latency between CPU cores
re2j - linear time regular expression matching in Java
c2clat - A tool to measure CPU core to core latency
libcxx - Project moved to: https://github.com/llvm/llvm-project
Taren - Useful C++ templates
rust - Empowering everyone to build reliable and efficient software.
btree - a simple python btree
OpenVDB - OpenVDB - Sparse volume data structure and tools
vmcontainer - Virtual memory based containers