advent-of-code-2022
By erikcorry
jdk8u-jdk
By frohoff
| advent-of-code-2022 | jdk8u-jdk | |
|---|---|---|
| 1 | 6 | |
| 3 | 158 | |
| - | - | |
| 10.0 | 10.0 | |
| over 1 year ago | about 9 years ago | |
| Java | ||
| MIT License | GNU General Public License v3.0 only |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
advent-of-code-2022
Posts with mentions or reviews of advent-of-code-2022.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-13.
-
A Neat XOR Trick
https://github.com/erikcorry/advent-of-code-2022/blob/main/d...
Then a friend solved it with regular expressions, but I found a sicker regex. After all, that's what regexes are about.
https://mobile.twitter.com/erikcorry/status/1600524753596456...
jdk8u-jdk
Posts with mentions or reviews of jdk8u-jdk.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-13.
- Hi folks, Is there anywhere I can see Java programmes broken down with each method explained ?
-
A Neat XOR Trick
Note that for enumerable domains of less than 64, using a long plus bit ops has been a standard Set implementation for quite a while. For example, Java's EnumSet uses a long if the enum has less than 64 values:
https://github.com/frohoff/jdk8u-jdk/blob/master/src/share/c...
Where add() uses `|= bitmask`, remove() uses `&= ~bitmask`, and size() uses a count of the 1's in the long.
Adding XOR as an efficient toggle would be interesting, but unnecessary to keep this O(n), if I understand correctly. It's just toggling the value, so (albeit with an extra branch), you could implement it as:
if (!set.contains(val)) { - Java program no longer works ( .class )
-
A refresher on modern low-level Java file I/O
It can be fast but its implementation depends on a graceful degredation strategy, though I've found it to be fast on Linux in the past:
- Java 17 depends on DNS lookups for hashing a web URL
-
Why does Gauva cache doesn't implement Concurrent hash map using red black tree in the worst case collsion?
Jdk ConcurrentHashMap : https://github.com/frohoff/jdk8u-jdk/blob/master/src/share/classes/java/util/concurrent/ConcurrentHashMap.java
What are some alternatives?
When comparing advent-of-code-2022 and jdk8u-jdk you can also consider the following projects:
riscv-bitmanip - Working draft of the proposed RISC-V Bitmanipulation extension
adventofcode2022_day06