@lapxo/obligations 0.3.0 → 0.3.3

package/README.md

@@ -2,7 +2,7 @@
 
 # @lapxo/obligations
 
-![version 0.3.0](https://img.shields.io/badge/version-0.3.0-8c959f) ![license MIT](https://img.shields.io/badge/license-MIT-8c959f) ![node >=22.12](https://img.shields.io/badge/node-%3E%3D22.12-8c959f) ![dependencies 0](https://img.shields.io/badge/dependencies-0-2da44e) ![cases 203 hold](https://img.shields.io/badge/cases-203_hold-2da44e) ![verify agrees](https://img.shields.io/badge/verify-agrees-8c959f) [![DOI 10.5281/zenodo.21858428](https://img.shields.io/badge/DOI-10.5281%2Fzenodo.21858428-8c959f)](https://doi.org/10.5281/zenodo.21858428)
+![version 0.3.3](https://img.shields.io/badge/version-0.3.3-8c959f) ![license MIT](https://img.shields.io/badge/license-MIT-8c959f) ![node >=22.12](https://img.shields.io/badge/node-%3E%3D22.12-8c959f) ![dependencies 0](https://img.shields.io/badge/dependencies-0-2da44e) ![cases 211 hold](https://img.shields.io/badge/cases-211_hold-2da44e) ![verify agrees](https://img.shields.io/badge/verify-agrees-8c959f) [![DOI 10.5281/zenodo.21858428](https://img.shields.io/badge/DOI-10.5281%2Fzenodo.21858428-8c959f)](https://doi.org/10.5281/zenodo.21858428)
 
 The algebra of a cell: two poles, origins with phase, eight acts.
 
@@ -44,7 +44,7 @@ The theory of this package is ten axioms and what follows from them. Three of th
 
 A claim from one origin is potential; a cell is information only where two independent origins touch it and their intervals meet. That is encounter, and 28 lines of the lock rest on it.
 
-Two bounds on one cell fold by the meet of their form; the order they arrive in never decides. That is meet, and 19 lines of the lock rest on it.
+Two bounds on one cell fold by the meet of their form; the order they arrive in never decides. That is meet, and 20 lines of the lock rest on it.
 
 Every quantity has two poles, a floor that is required and a ceiling that is permitted, and a cell is the pair. That is carrier, and 17 lines of the lock rest on it.
 
@@ -164,4 +164,4 @@ The obligatory is maximal: take away any one of its seven parts and what is left
 
 ## Check
 
-● 203 cases hold
+● 211 cases hold

package/dist/debit/graph.js

@@ -32,9 +32,6 @@ export function buildGraph(edges) {
         tails,
     };
 }
-function owed(carrier, name) {
-    return carrier.size === 0 || carrier.has(name);
-}
 export function reachIds(g, from, scratch) {
     const seen = scratch ?? new Uint8Array(g.size);
     if (scratch)

package/dist/debit/vector-move.js

@@ -1,11 +1,4 @@
 const STATES = ['REQUIRED', 'FREE', 'FORBIDDEN', 'CONFLICT'];
-function findWithin(runs, s) {
-    let n = 0;
-    for (const r of runs)
-        if (r.within)
-            n += r.within[s];
-    return n;
-}
 export const DANGEROUS = STATES.filter((s) => s !== 'CONFLICT').map((s) => [s, 'CONFLICT']);
 const zero = () => {
     const m = {};

package/dist/debit/vector.d.ts

@@ -8,7 +8,6 @@ export interface Quadrants {
     readonly CONFLICT: WideMask;
 }
 export declare function quadrants(demanded: WideMask, permitted: WideMask, extent: WideMask): Quadrants;
-export declare function sizes(q: Quadrants): Readonly<Record<State, number>>;
 export declare function stateAt(q: Quadrants, bit: number): State | null;
 export interface Run {
     readonly lo: number;

package/dist/debit/vector.js

@@ -10,14 +10,6 @@ export function quadrants(demanded, permitted, extent) {
         CONFLICT: d.difference(p),
     };
 }
-export function sizes(q) {
-    return {
-        REQUIRED: q.REQUIRED.size(),
-        FREE: q.FREE.size(),
-        FORBIDDEN: q.FORBIDDEN.size(),
-        CONFLICT: q.CONFLICT.size(),
-    };
-}
 export function stateAt(q, bit) {
     for (const s of STATES)
         if (q[s].has(bit))

package/dist/field/fragility.d.ts

@@ -0,0 +1,3 @@
+import type { Lattice } from '../lattice/lattice.ts';
+import type { Obligatory, World } from '../lattice/obligatory.ts';
+export declare function fragility<T>(L: Lattice<T>, c: Obligatory<T>, world?: World<T>): number;

package/dist/field/fragility.js

@@ -0,0 +1,19 @@
+import { eq } from "../lattice/lattice.js";
+import { live, parts } from "../lattice/obligatory.js";
+function takes(names, size) {
+    if (size === 0)
+        return [[]];
+    return names.flatMap((name, i) => takes(names.slice(i + 1), size - 1).map((rest) => [name, ...rest]));
+}
+export function fragility(L, c, world = new Map()) {
+    const was = parts(L, c, world);
+    const names = [...new Set(live(c.seen).map((claim) => claim.origin))];
+    for (let size = 1; size <= names.length; size += 1) {
+        for (const out of takes(names, size)) {
+            const now = parts(L, { ...c, seen: c.seen.filter((claim) => !out.includes(claim.origin)) }, world);
+            if (!eq(L, now.floor, was.floor) || !eq(L, now.ceiling, was.ceiling))
+                return size;
+        }
+    }
+    return 0;
+}

package/dist/lattice/axioms.d.ts

@@ -5,7 +5,6 @@ export declare const POSET_LAW_NAMES: readonly ["transitivity", "antisymmetry"];
 export declare const MEET_LAW_NAMES: readonly ["idempotence.meet", "unit.top", "top.greatest", "commutativity.meet", "consistency.meet", "associativity.meet"];
 export declare const JOIN_LAW_NAMES: readonly ["idempotence.join", "unit.bottom", "bottom.least", "commutativity.join", "consistency.join", "associativity.join"];
 export declare const BOTH_LAW_NAMES: readonly ["absorption.meet", "absorption.join"];
-export declare const CLOSURE_LAW_NAMES: readonly ["closure.demand", "closure.permit", "closure.meet", "closure.join"];
 export declare const LATTICE_LAW_NAMES: readonly ["transitivity", "antisymmetry", "idempotence.meet", "unit.top", "top.greatest", "commutativity.meet", "consistency.meet", "associativity.meet", "idempotence.join", "unit.bottom", "bottom.least", "commutativity.join", "consistency.join", "associativity.join", "absorption.meet", "absorption.join"];
 export type LatticeLawName = (typeof LATTICE_LAW_NAMES)[number];
 export declare function posetViolationsIn<T>(L: Poset<T>, xs: readonly T[]): readonly string[];

package/dist/lattice/axioms.js

@@ -24,12 +24,6 @@ export const BOTH_LAW_NAMES = [
     'absorption.meet',
     'absorption.join',
 ];
-export const CLOSURE_LAW_NAMES = [
-    'closure.demand',
-    'closure.permit',
-    'closure.meet',
-    'closure.join',
-];
 export const LATTICE_LAW_NAMES = [
     ...POSET_LAW_NAMES,
     ...MEET_LAW_NAMES,

package/dist/lattice/index.d.ts

@@ -1,13 +1,13 @@
 export { UnitError } from './errors.ts';
 export type { UnitErrorCode } from './errors.ts';
-export { BOOLEAN, chain, height, isDistributive, order } from './order.ts';
+export { chain, height, isDistributive, order } from './order.ts';
 export { asBoolean, bitLoss, compose, composeState, fuse, widen, conflictDebits, anyOf, missing, entails, permitAll, state, statesPerDebit, table, unit } from '../debit/unit.ts';
 export { WIDTH, and, or, canonical } from '../debit/packed.ts';
 export type { Packed, Packer } from '../debit/packed.ts';
 export { WideMask, chunkCount } from '../debit/masks.ts';
 export { rebuild, register } from '../debit/register.ts';
 export type { Register } from '../debit/register.ts';
-export { DANGEROUS, STATES, dangerous, moved, quadrants, runQuadrants, sizes, stateAt, transitions } from '../debit/vector.ts';
+export { DANGEROUS, STATES, dangerous, moved, quadrants, runQuadrants, stateAt, transitions } from '../debit/vector.ts';
 export type { Matrix, Quadrants, Run, Span } from '../debit/vector.ts';
 export { METHODS, weakest } from '../debit/provenance.ts';
 export { touches, holds } from '../debit/standing.ts';
@@ -26,7 +26,7 @@ export type { Act, Yield } from '../field/yield.ts';
 export { frontier } from '../field/frontier.ts';
 export type { Asked, Open } from '../field/frontier.ts';
 export { declarationOf, unitOf, stateOf, registerOf, premiumOf, degenerate, withdrawsExactly, movesOf } from '../field/motion.ts';
-export { violationsIn, meetViolationsIn, posetViolationsIn, closureViolationsIn, LATTICE_LAW_NAMES, POSET_LAW_NAMES, MEET_LAW_NAMES, JOIN_LAW_NAMES, BOTH_LAW_NAMES, CLOSURE_LAW_NAMES, } from './axioms.ts';
+export { violationsIn, meetViolationsIn, posetViolationsIn, closureViolationsIn, LATTICE_LAW_NAMES, POSET_LAW_NAMES, MEET_LAW_NAMES, JOIN_LAW_NAMES, BOTH_LAW_NAMES, } from './axioms.ts';
 export type { LatticeLawName } from './axioms.ts';
 export { fromScale, subsets } from './scale-lattice.ts';
 export { downset, freedom, fromIdeals, idealComplexity, idealDebit, idealEntails, idealJoin, idealMeet, isDownset, isIdealPair, isUpset, unitToIdeal, upset } from '../debit/ideal.ts';

package/dist/lattice/index.js

@@ -1,10 +1,10 @@
 export { UnitError } from "./errors.js";
-export { BOOLEAN, chain, height, isDistributive, order } from "./order.js";
+export { chain, height, isDistributive, order } from "./order.js";
 export { asBoolean, bitLoss, compose, composeState, fuse, widen, conflictDebits, anyOf, missing, entails, permitAll, state, statesPerDebit, table, unit } from "../debit/unit.js";
 export { WIDTH, and, or, canonical } from "../debit/packed.js";
 export { WideMask, chunkCount } from "../debit/masks.js";
 export { rebuild, register } from "../debit/register.js";
-export { DANGEROUS, STATES, dangerous, moved, quadrants, runQuadrants, sizes, stateAt, transitions } from "../debit/vector.js";
+export { DANGEROUS, STATES, dangerous, moved, quadrants, runQuadrants, stateAt, transitions } from "../debit/vector.js";
 export { METHODS, weakest } from "../debit/provenance.js";
 export { touches, holds } from "../debit/standing.js";
 export { declaration, asUnit, conj, disj } from "./declaration.js";
@@ -17,7 +17,7 @@ export { present, converge, endsBeforeNow } from "../field/present.js";
 export { yieldOf } from "../field/yield.js";
 export { frontier } from "../field/frontier.js";
 export { declarationOf, unitOf, stateOf, registerOf, premiumOf, degenerate, withdrawsExactly, movesOf } from "../field/motion.js";
-export { violationsIn, meetViolationsIn, posetViolationsIn, closureViolationsIn, LATTICE_LAW_NAMES, POSET_LAW_NAMES, MEET_LAW_NAMES, JOIN_LAW_NAMES, BOTH_LAW_NAMES, CLOSURE_LAW_NAMES, } from "./axioms.js";
+export { violationsIn, meetViolationsIn, posetViolationsIn, closureViolationsIn, LATTICE_LAW_NAMES, POSET_LAW_NAMES, MEET_LAW_NAMES, JOIN_LAW_NAMES, BOTH_LAW_NAMES, } from "./axioms.js";
 export { fromScale, subsets } from "./scale-lattice.js";
 export { downset, freedom, fromIdeals, idealComplexity, idealDebit, idealEntails, idealJoin, idealMeet, isDownset, isIdealPair, isUpset, unitToIdeal, upset } from "../debit/ideal.js";
 export { FORM_IMPLEMENTATIONS, FORMS, ladderForm, alphabetForm, continuousForm, latticeForm } from "./forms.js";

package/dist/lattice/order.d.ts

@@ -3,4 +3,3 @@ export declare function chain(levels: readonly string[]): Scale;
 export declare function height(c: Scale, level: Level): number;
 export declare function isDistributive(c: Scale): boolean;
 export declare function order(levels: readonly string[], leq: readonly boolean[][]): Scale;
-export declare const BOOLEAN: () => Scale;

package/dist/lattice/order.js

@@ -147,4 +147,3 @@ export function order(levels, leq) {
     const grid = (up) => [...Array(n)].map((_, i) => [...Array(n)].map((__, j) => bound(i, j, up)));
     return build(levels, grid(true), grid(false));
 }
-export const BOOLEAN = () => chain(['no', 'yes']);

package/dist/views/field.d.ts

@@ -11,6 +11,7 @@ export { converge, endsBeforeNow, present } from '../field/present.ts';
 export { amplitude, coherence, fringes, interfere, phase, seenAs } from './field/wave.ts';
 export type { Claim } from './field/wave.ts';
 export { cell, mark, parts, restOf, state } from '../lattice/obligatory.ts';
+export { fragility } from '../field/fragility.ts';
 export type { Act, Cell, Mark, Obligatory, Origin, World } from '../lattice/obligatory.ts';
 export { looksLeft, pay, price } from '../debit/observer.ts';
 export { budget, decohere, disturbance, distinct, evolve, sameObject } from './field/physics.ts';

package/dist/views/field.js

@@ -10,6 +10,7 @@ export { bites, restingOn, sign } from "../field/sign.js";
 export { converge, endsBeforeNow, present } from "../field/present.js";
 export { amplitude, coherence, fringes, interfere, phase, seenAs } from "./field/wave.js";
 export { cell, mark, parts, restOf, state } from "../lattice/obligatory.js";
+export { fragility } from "../field/fragility.js";
 export { looksLeft, pay, price } from "../debit/observer.js";
 export { budget, decohere, disturbance, distinct, evolve, sameObject } from "./field/physics.js";
 export { choose, play } from "./field/policy.js";

package/package.json

@@ -1,13 +1,13 @@
 {
   "name": "@lapxo/obligations",
-  "version": "0.3.0",
+  "version": "0.3.3",
   "description": "The algebra of a cell: two poles, origins with phase, eight acts.",
   "type": "module",
   "license": "MIT",
   "author": "Lapxo",
   "repository": {
     "type": "git",
-    "url": "git+https://github.com/lapxo/obligations.git"
+    "url": "git+https://github.com/Lapxo/obligations.git"
   },
   "keywords": [
     "obligations",