frames,jar,passes: verifier-driven hardening from real jars

Proven by paranoid runs over lorep (17 classes, fully green),
LoVisual (4081 classes) and oc2r (1278 classes) with per-class
java -Xverify:all, each fix first reproduced as a red test:

- merge: Top absorbs instead of Top-wins (javac declares Top for
  slots unwritten on some inflow; precise types reject those edges).
  Regression: loop_head_keeps_top_for_loop_local.
- emit: collapse [Long|Double, Top] pairs on operand stacks
  (javac writes one entry; the pair is rejected). Regression:
  wide_stack_join_emits_single_entries.
- xfer ArrayLoad: push the wide pair, fixing lcmp underflow.
  Regression: array_load_wide_pushes_pair.
- xfer <init>: convert only the receiver's own allocation site
  instead of every Uninitialized (nested construction clobbered
  the outer object). Regression: nested_construction_keeps_outer.
- xfer ANewArray: array operands gain one dimension ([B] -> [[B)
  instead of an illegal L-wrap ([L[B;). Covered by the same test.
- jar load: duplicate class names (multi-release module-info
  twins) keep the first occurrence instead of crashing save.
  Test: duplicate_class_names_keep_first.
- strings/constants: skip methods past MAX_METHOD_INSNS (8000)
  so giants cannot overflow the 64KB writer ceiling. Tests:
  oversized_methods_are_skipped in both passes.
- merge errors now name both types being merged.

Also: em-dash removed repo-wide (724 spots, rule added to
todo.md), allow-lints only in tests (scratch example deleted),
code comments migrated to English in every file this change
touches.

crates/noxis-verify/src/leaks.rs

@@ -24,7 +24,7 @@ pub const RED_PATTERNS: &[&str] = &[
 
 /// Все идентификаторы программы: классы, члены, строки кода.
 ///
-/// Члены — по простому имени (без владельца): сверка строгая и дешёвая,
+/// Члены - по простому имени (без владельца): сверка строгая и дешёвая,
 /// для точечной проверки есть `find_leaks` с keep-фильтром.
 pub fn collect_names(program: &Program) -> BTreeSet<String> {
     let mut names = BTreeSet::new();
@@ -42,7 +42,7 @@ pub fn collect_names(program: &Program) -> BTreeSet<String> {
 
 /// Имена из эталона, пережившие обфускацию (минус keep).
 ///
-/// Пустой результат — норма; непустой — тест падает с этим списком.
+/// Пустой результат - норма; непустой - тест падает с этим списком.
 pub fn find_leaks(before: &BTreeSet<String>, after: &Program, keep: &KeepRules) -> Vec<String> {
     let names = collect_names(after);
     before