openjdk-mirror

jdk7u-jdk

Java2017–2024

openjdk-mirror / jdk7u-jdk

jdk7u-jdk

Discover this repository through its Hacker News conversations.

Languages & Compilers

Explore on GitHub Read Hacker News discussions

8Distinct people

8Mentions

0Explicit recommenders

542GitHub stars

REPOSITORY AT A GLANCE

What to know before exploring

What it is

A public description has not been verified.

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 5:04:57 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by year8 dated mentions

Observed mentions: 2017-08-23 18:23:14 UTC to 2024-10-02 23:01:26 UTC.

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges

UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
Period	Start (UTC)	End (exclusive, UTC)	Mentions	Comments
2017	2017-01-01 00:00:00 UTC	2018-01-01 00:00:00 UTC	2	2
2018	2018-01-01 00:00:00 UTC	2019-01-01 00:00:00 UTC	0	0
2019	2019-01-01 00:00:00 UTC	2020-01-01 00:00:00 UTC	0	0
2020	2020-01-01 00:00:00 UTC	2021-01-01 00:00:00 UTC	0	0
2021	2021-01-01 00:00:00 UTC	2022-01-01 00:00:00 UTC	1	1
2022	2022-01-01 00:00:00 UTC	2023-01-01 00:00:00 UTC	1	1
2023	2023-01-01 00:00:00 UTC	2024-01-01 00:00:00 UTC	2	2
2024	2024-01-01 00:00:00 UTC	2025-01-01 00:00:00 UTC	2	2

What Hacker News says

8 sources

quelltext·Oct 2, 2024

> and I can't explain exactly how their ordered dicts work Traditionally you simply use a doubly linked list approach on the entries (each entry maintains two additional references to the previous and next entry) for that like LinkedHashMap: https://docs.oracle.com/javase//8/docs/api/java/util/LinkedH... https://github.com/openjdk-mirror/jdk7u-jdk/blob/master/src/... Which is also what Python seems to be doing: https://stackoverflow.com/a/34496644 It's fairly intuitive. Do their new default (now also ordered?) dics do this differently?

In Hash Ordering and Hyrum's Law

senderista·Mar 10, 2024

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/...

In What Cannot be Skipped About the Skiplist

hyperpape·Oct 19, 2023

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.

In Requiem for a stringref

marginalia_nu·Mar 12, 2023

"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/...

In Don't Share Java FileChannels

waynesonfire·Nov 4, 2022

is Erlang and JDK general enough for you? Oh, both use linked lists, https://github.com/erlang/otp/blob/master/lib/stdlib/src/que... https://github.com/openjdk-mirror/jdk7u-jdk/blob/master/src/...

In In defense of linked lists

rzzzt·Jul 20, 2021

HashSets are using a HashMap behind the scenes, they put a "present" placeholder value in the map when adding an element to the set: https://github.com/openjdk-mirror/jdk7u-jdk/blob/f4d80957e89...

In JVM Anatomy Quark #26: Identity Hash Code

git-pull·Dec 11, 2017

You likely won't be writing many algorithms or data structures from scratch. You'll be implementing them, though! In practice, you'll be so busy seeing the forest for the trees, tackling the business case at hand, you'll rarely be fussing over textbook definitions. Often, when I see someone focusing too much on book smarts and interviewing in itself it's a sign they may need to put their reading and memorization into practice more. This is why I'm skeptical of job interviews - these things cater toward those who memorize them (likely fresh out of college), not devs on the field of battle shipping stuff for a few years. Memorizing arbitrary stuff out of a text book when you have libraries already there and deadlines? Come on. In the rare event you need to write your own thing, you'll ask the manager for time to clear up airspace and study

Read the rest

not from the textbook, but other's successful implementations, at a time when it actually matters. Here's how I'd improve it: find implementations of linked lists, queues, stacks, graphs, and whatever in programming languages, their standard libraries, and community frameworks. Show people the utility, have them conceptualize it internally, rather than memorize it. Here are some off the top of my head: Something broad and standardized, templated containers of data structures, like C++'s stdlib and its vector, map, and so on. Last time I checked chromium's source tree, std:: was everywhere: https://cs.chromium.org/search/?q=std::+package:chromium&sq=... Something low-level and cool, like Python's timsort: https://svn.python.org/projects/python/trunk/Objects/listsor.... (Java actually ended up borrowing that: https://github.com/openjdk-mirror/jdk7u-jdk/blob/master/src/...) Something high-level, for instance, django-treebeard's approaches toward handling hierarchies in Django. In this package, adjacency lists (https://en.wikipedia.org/wiki/Adjacency_list) are carried over not just to relational databases, but an ORM system. (https://django-treebeard.readthedocs.io)

In A computer science study plan

e12e·Aug 23, 2017

boolean hasName(String storedName) { return getLoadNames().\ contains(storedName); } > That’s it. No more looping, just a simple check. And how is set.contains implemented? https://github.com/openjdk-mirror/jdk7u-jdk/blob/master/src/... wraps https://github.com/openjdk-mirror/jdk7u-jdk/blob/master/src/... public boolean contains(Object o) { return map.containsKey(o); // map is HashMap } public boolean containsKey(Object key) { return getEntry(key) != null; } And finally: final Entry<K,V> getEntry(Object key) { int hash = (key == null) ? 0: \ hash(key.hashCode()); for (Entry<K,V> e = \ table[indexFor(hash, \ table.length)]; e != null; e = e.next) { Object k; if (e.hash == hash && ((k = e.key)

Read the rest

== key \ || (key != null \ && key.equals(k)))) return e; } return null; } TL;DR how did they imagine a general setContains would be implemented without a loop? [ed: obviously it makes sense to use a datastructure that more closely match your intent, but the wording here struck me as a bit odd...]

In Code Smells: Iteration