mirror of
https://github.com/morluto/rea.git
synced 2026-11-15 11:13:21 +00:00
* refactor(analysis): centralize resource budgets and recovery facts * feat(analysis): expose ASAR and Ghidra runtime admission controls * feat(artifacts): expose reader admission and preserve limited recognition * feat(javascript): expose recoverable semantic precision budgets * feat(web): add recoverable source-map budgets and compact retained views * feat(web): make historical capture decoding budgets recoverable * fix(desktop): enforce selected view policies across capture and export * feat(runtime): make Frida and LLDB retention budgets selectable * feat(native): expose diagnostic budgets and preserve exhaustion causes * feat(managed): expose recoverable snapshot and representation budgets * feat(metadata): make Go and Rust inspection budgets recoverable * feat(wasm): expose representation and producer admissions * feat(evm): expose per-call worker resource budgets * feat(android): make resource and string-pool omissions recoverable * feat(producers): expose command and recorded-capture budgets * docs(analysis): record recovery contracts and integrated validation * fix(docs): link calibration oracle from published verification pages * fix(docs): restore desktop task anchors and receipt links * test(analysis): align fixtures with selectable budget contracts * fix(analysis): remove source-location projector dependency cycle * test(analysis): refresh budget recovery and verifier regressions * test(analysis): preserve format and publication recovery expectations * test(windows): align conformance with owned runtime admission * fix(desktop): preserve selected alias kinds in exported state * test(analysis): align provider fixtures with recoverable budgets * test(desktop): validate emitted alias metadata structurally * fix(ghidra): classify bounded Windows endpoint refusals * test(cli): assert selectable artifact admission recovery * fix(cli): preserve capture provenance in environment builds
74 lines
2.9 KiB
TypeScript
74 lines
2.9 KiB
TypeScript
import {
|
|
JAVASCRIPT_SEMANTIC_PRECISION_DEFAULTS,
|
|
type JavaScriptSemanticPrecision,
|
|
} from "./javascriptSemanticPrecision.js";
|
|
import type {
|
|
JavaScriptSemanticPrimitive,
|
|
JavaScriptSemanticValue,
|
|
} from "./javascriptSemanticValueTypes.js";
|
|
import { compareUnicodeCodePoints } from "../unicodeCodePointOrder.js";
|
|
import { semanticPrimitiveKey } from "./javascriptSemanticProvenance.js";
|
|
import {
|
|
exceedsSemanticPrimitiveStringByteBudget,
|
|
semanticResourceLimitUnknown,
|
|
} from "./javascriptSemanticResourceLimits.js";
|
|
|
|
/** Normalize one bounded collection of possible primitive values. */
|
|
export const semanticPrimitiveSet = (
|
|
values: readonly JavaScriptSemanticPrimitive[],
|
|
precision: JavaScriptSemanticPrecision = JAVASCRIPT_SEMANTIC_PRECISION_DEFAULTS,
|
|
): JavaScriptSemanticValue => {
|
|
let uniqueValues: Set<JavaScriptSemanticPrimitive> | undefined;
|
|
for (const value of values) {
|
|
if (typeof value === "number" && !Number.isFinite(value))
|
|
return {
|
|
status: "unknown",
|
|
reason: "Nonfinite numbers are outside the JSON primitive lattice.",
|
|
};
|
|
if (typeof value === "number" && Object.is(value, -0))
|
|
return {
|
|
status: "unknown",
|
|
reason: "Negative zero cannot be preserved by JSON primitive evidence.",
|
|
};
|
|
// The common literal path needs validation, but no deduplication, sorting
|
|
// or canonical-key allocation. Check strings before retaining the value.
|
|
if (values.length === 1)
|
|
return typeof value === "string" &&
|
|
exceedsSemanticPrimitiveStringByteBudget([value], precision)
|
|
? semanticResourceLimitUnknown("primitive-bytes", precision)
|
|
: { status: "literal", value };
|
|
uniqueValues ??= new Set<JavaScriptSemanticPrimitive>();
|
|
uniqueValues.add(value);
|
|
if (uniqueValues.size > precision.primitive_candidates)
|
|
return semanticResourceLimitUnknown("primitive-candidates", precision);
|
|
}
|
|
if (uniqueValues === undefined) return { status: "union", values: [] };
|
|
if (
|
|
exceedsSemanticPrimitiveStringByteBudget(
|
|
[...uniqueValues].flatMap((value) =>
|
|
typeof value === "string" ? [value] : [],
|
|
),
|
|
precision,
|
|
)
|
|
)
|
|
return semanticResourceLimitUnknown("primitive-bytes", precision);
|
|
const unique = [...uniqueValues]
|
|
.map((value) => ({ key: semanticPrimitiveKey(value), value }))
|
|
.sort((left, right) => compareUnicodeCodePoints(left.key, right.key))
|
|
.map(({ value }) => value);
|
|
const only = unique[0];
|
|
return unique.length === 1 && only !== undefined
|
|
? { status: "literal", value: only }
|
|
: { status: "union", values: unique };
|
|
};
|
|
|
|
/** Read the primitive candidates retained in one lattice value. */
|
|
export const semanticPrimitiveCandidates = (
|
|
value: JavaScriptSemanticValue,
|
|
): readonly JavaScriptSemanticPrimitive[] | null =>
|
|
value.status === "literal"
|
|
? [value.value]
|
|
: value.status === "union"
|
|
? value.values
|
|
: null;
|