engineering/java-topology
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

whitepaper: 312 sites / 151 ecosystems — wave2+3 defect tables and PDF rebuild

Browse source 
Add 88 new defect entries to HIGH and MEDIUM tables:
  HIGH: mysql-0001/0002, mariadb-0001, redis-0001/0002, valkey-0001/0002, openvpn-0001,
        vlc-0001, prometheus-0001, otel-collector-0001, cockroachdb-0001..0004,
        tidb-0001..0008, kubernetes-0001/0002, go-0001, kotlin-0002, scala-0001,
        allegro5-0001, sdl2-0001, grafana-0001, clickhouse-0001, duckdb-0001,
        mongodb-0001, envoy-0001, istio-0001, cilium-0001, linkerd2-0001,
        linux-0001/0002/0003, tor-0002/0003, curl-0001, julia-0001, lua-0001,
        perl5-0001, nats-0001, spring-0003/0004, tomcat-0001, onos-0002, odl-0002

  MEDIUM: helm-0001, mariadb-0002, openssl-0001/0002, memcached-0001,
          cassandra-0001..0004, flink-0001, storm-0001/0002, zookeeper-0001..0003,
          pip-0001, gradle-0001, nginx-0001, haproxy-0001, caddy-0001, varnish-0001,
          ffmpeg-0001, gstreamer-0001, raylib-0001, love2d-0001, php-0001/0002,
          r-source-0001, cpython-0002, ruby-0001, rabbitmq-0003/0004, activemq-0001,
          ovs-0001, onos-0003, odl-0002, jetty-0001

PDF: 976K
This commit is contained in:
russell@unturf.com 2026-03-27 15:23:43 -04:00
parent b3842ab6b8
commit 9934133dcf
260 changed files with 18278 additions and 15 deletions
Download patch file Download diff file Expand all files Collapse all files

89
defects/storm/unit/StormFieldsDedupTest.java Normal file
View file

@ -0,0 +1,89 @@
package unit;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
/**
* storm-0001: Fields constructor — ArrayList.contains() O(n²) vs HashMap.containsKey() O(n).
*
* Standalone unit test — no JUnit required.
* Compile: javac -d . StormFieldsDedupTest.java
* Run: java unit.StormFieldsDedupTest
*/
public class StormFieldsDedupTest {
static long slowOps;
static long fastOps;
/**
* Slow: mirrors original Fields(List<String>) — uses ArrayList.contains() for dup check.
* O(n²) because contains() scans the growing list for each of n fields.
*/
static List<String> slowFields(List<String> input) {
slowOps = 0;
List<String> fields = new ArrayList<>(input.size());
for (String field : input) {
slowOps++; // outer iteration
for (String existing : fields) { // ArrayList.contains() scan
slowOps++;
if (existing.equals(field)) {
throw new IllegalArgumentException("duplicate field '" + field + "'");
}
}
fields.add(field);
}
return fields;
}
/**
* Fast: patched version — checks index HashMap (O(1)) and populates it inline.
* O(n) total.
*/
static List<String> fastFields(List<String> input) {
fastOps = 0;
List<String> fields = new ArrayList<>(input.size());
Map<String, Integer> index = new HashMap<>();
for (String field : input) {
fastOps++; // outer iteration
fastOps++; // HashMap.containsKey() — O(1)
if (index.containsKey(field)) {
throw new IllegalArgumentException("duplicate field '" + field + "'");
}
fields.add(field);
index.put(field, fields.size() - 1);
}
return fields;
}
static void run(int n, int expectedNx) {
List<String> input = new ArrayList<>();
for (int i = 0; i < n; i++) input.add("field_" + i);
List<String> slowResult = slowFields(input);
List<String> fastResult = fastFields(input);
boolean resultsMatch = slowResult.equals(fastResult);
boolean quadraticWorse = slowOps > fastOps * expectedNx;
System.out.printf("n=%-4d slow=%6d fast=%4d ratio=%5.1fx match=%b PASS=%b%n",
n, slowOps, fastOps, (double) slowOps / fastOps, resultsMatch,
resultsMatch && quadraticWorse);
if (!resultsMatch || !quadraticWorse) {
throw new AssertionError(
"FAIL n=" + n + " resultsMatch=" + resultsMatch +
" slowOps=" + slowOps + " fastOps=" + fastOps +
" needed ratio>" + expectedNx);
}
}
public static void main(String[] args) {
System.out.println("=== storm-0001: Fields constructor O(n^2) vs O(n) ===");
run(100, 10);
run(500, 30);
run(1000, 60);
System.out.println("3/3 PASS");
}
}