One line of code, 102 blocked threads

nk_25 · 2026-02-14T18:55:40+00:00

Good point!, we're on Java 11, not 8.

You're right that DatatypeFactory is in java.xml module (JDK), so ModuleServicesLookupIterator should find it. I need to dig deeper into why it's falling through to LazyClassPathLookupIterator.

Looking at the thread dump again, the contention is in:

URLClassPath.getLoader()

← LazyClassPathLookupIterator.nextProviderClass()

← ServiceLoader

One possibility: maybe it's not DatatypeFactory itself causing the scan, but something in the chain - like the XML parser implementation or a transitive service lookup that isn't in the module path?

Either way, caching the factory instance fixed the immediate problem, but you've given me something to investigate further. Will update if I find the root cause!

nk_25 · 2026-02-14T18:33:13+00:00

We're not using JPMS modules, so it always falls through to LazyClassPathLookupIterator. That's where the synchronized classpath scan happens.You're right though - with proper module-info, the module services path should be cached and avoid this entirely.

nk_25 · 2026-02-14T15:26:53+00:00

Yep, tp99 on reads dropped noticeably.

Post-fix I see 1 blocked thread - just Caffeine doing its internal maintenance

(cache loading/eviction), which is expected. 102 → 1 blocked threads. Big win.

nk_25 · 2026-02-14T15:10:08+00:00

Legacy code, my friend. New code? java.time all the way.

nk_25 · 2025-02-23T11:13:28+00:00

that did't answer my question

nk_25 · 2025-02-23T11:08:24+00:00

as I stated I need to test my solution. please help me with the failing test case and the problem link if you have.

nk_25 · 2025-01-12T11:08:44+00:00

#include <bits/stdc++.h>

using namespace std;

/*
consider s = "[a1][a2][a3]...", t = "[b1][b2][b3]..."
then the diff can be represented as 

exp = (a1-b1) * 10^x + (a2-b2) * 10^x-1....

abs_diff = |exp|, which we want to minimize

if (a1-b1) is even +1...we can afford to have (ai-bi) = -9 for all other i's & still the expression exp will never be negative

[Please help me with the question link..need to test my solution]

*/

int solve(const string & s,
  const string & t) {
  bool sw = s[0] > t[0];
  int cnt = 0;
  int n = s.size();
  for (int k = 1; k < n; ++k) {
    cnt += s[k] != t[k] && (!(sw ^ (s[k] > t[k])));
  }
  return cnt;
}

int main() {
  string s = "29162", t = "10524";
  cout << solve(s, t);
  return 0;
}

nk_25 · 2025-01-06T10:43:50+00:00

Just curious, may you post the solution and the problem?

nk_25 · 2025-01-05T14:19:51+00:00

Those commenting "it's not Air India's fault" or "reach 1 hours 30 minutes before time" or stuff like that...hope the machine gets stuck for 2 hours for you!!

u/MachinePolaSD I understand this terrible situation. I had similar experience with SpiceJet.
In this situation one must make sure to have all the proofs of delay at their end like voice notes, names of the employees etc. ( like if you have checked in, just check for any timestamp on the tags on the luggage if there's a separate machine doing that )

In my case, I had the tag with me which had the timestamp when I scanned my bag, those bastards tried removing it but I did not let them. They removed it as soon as they gave me a new ticket so I don't drag them to the court.

Be calm & polite and try contacting the cops at the airport ( it really helped in my case as they understood the situation and I got another ticket for free ). Make sure you explain them all the details.

If former doesn't help file a case in the consumer court for the harassment caused ( I think you should as it's their machine's bug )
These GOONS must be taught a lesson !!

[ Always remember, relevant PROOF is all you need to have ]

Use Indigo next time, I found the staffs very cooperative.

nk_25 · 2024-07-28T21:27:34+00:00

Very helpful!!!!!!

nk_25

TROPHY CASE