runmat 0.4.9-dev.2 → 0.4.10-dev.0

package/dist/generated/builtins/fminbnd.js

@@ -0,0 +1,104 @@
+// @generated by scripts/generate-builtins.cjs
+// Do not edit by hand.
+const builtinDoc = {
+    "title": "fminbnd",
+    "category": "math/optim",
+    "keywords": [
+        "fminbnd",
+        "bounded minimization",
+        "brent",
+        "golden section",
+        "parabolic interpolation",
+        "optimization"
+    ],
+    "summary": "Find a local minimum of a scalar function on a bounded interval using Brent's method.",
+    "references": [
+        "https://www.mathworks.com/help/matlab/ref/fminbnd.html"
+    ],
+    "gpu_support": {
+        "elementwise": false,
+        "reduction": false,
+        "precisions": [],
+        "broadcasting": "none",
+        "notes": "The solver runs on the host. Callback functions may still call GPU-aware builtins."
+    },
+    "fusion": {
+        "elementwise": false,
+        "reduction": false,
+        "max_inputs": 4,
+        "constants": "inline"
+    },
+    "requires_feature": null,
+    "tested": {
+        "unit": "builtins::math::optim::fminbnd::tests",
+        "integration": "runmat-vm/tests/closures.rs::fminbnd_accepts_anonymous_function"
+    },
+    "description": "`x = fminbnd(fun, x1, x2)` searches the closed interval `[x1, x2]` for a local minimum of the scalar function `fun` using Brent's method (golden-section search combined with parabolic interpolation). Additional output arities expose the function value at the minimum, an exit flag, and a diagnostic struct.",
+    "behaviors": [
+        "The function handle must return a finite real scalar for every sampled point in the interval.",
+        "If `x1 > x2`, the bounds are inconsistent and `exitflag = -2`.",
+        "If `x1 == x2`, that point is returned with `exitflag = 1`.",
+        "Options are supplied as a struct, usually built with `optimset`. `TolX`, `MaxIter`, `MaxFunEvals`, and `Display` are accepted.",
+        "`Display` may be `'off'`, `'iter'`, `'notify'` (default; only prints when the solver fails to converge), or `'final'`.",
+        "`exitflag` is `1` on convergence within `TolX`, `0` when the iteration or evaluation budget is exhausted.",
+        "The fourth output is a struct with `iterations`, `funcCount`, `algorithm`, and `message` fields."
+    ],
+    "examples": [
+        {
+            "description": "Minimize a quadratic",
+            "input": "x = fminbnd(@(x) (x-2).^2, 0, 5)",
+            "output": "x =\n    2.0000"
+        },
+        {
+            "description": "Capture the function value too",
+            "input": "[x, fval] = fminbnd(@(x) (x-3).^2 + 1, 0, 5)",
+            "output": "x =\n    3.0000\nfval =\n    1.0000"
+        },
+        {
+            "description": "Tighten tolerances",
+            "input": "opts = optimset('TolX', 1e-10, 'Display', 'off');\n[x, fval, exitflag] = fminbnd(@cos, 0, pi, opts)",
+            "output": "x =\n    3.1416\nfval =\n   -1.0000\nexitflag =\n     1"
+        }
+    ],
+    "faqs": [
+        {
+            "question": "Does fminbnd support unbounded minimization?",
+            "answer": "No. `fminbnd` requires finite scalar bounds. Use `fminunc` or `fminsearch` for unconstrained problems."
+        },
+        {
+            "question": "Can I retrieve the iteration history?",
+            "answer": "Yes — request the four-output form `[x, fval, exitflag, output] = fminbnd(...)` to receive a struct with `iterations`, `funcCount`, `algorithm`, and `message`."
+        },
+        {
+            "question": "Does fminbnd guarantee a global minimum?",
+            "answer": "No. Brent's method converges to a local minimum on `[x1, x2]`. For multi-modal functions, narrow the interval to bracket the desired minimum."
+        }
+    ],
+    "links": [
+        {
+            "label": "fzero",
+            "url": "./fzero"
+        },
+        {
+            "label": "fsolve",
+            "url": "./fsolve"
+        },
+        {
+            "label": "optimset",
+            "url": "./optimset"
+        }
+    ],
+    "source": {
+        "label": "`crates/runmat-runtime/src/builtins/math/optim/fminbnd.rs`",
+        "url": "https://github.com/runmat-org/runmat/blob/main/crates/runmat-runtime/src/builtins/math/optim/fminbnd.rs"
+    },
+    "key": "fminbnd",
+    "slug": "fminbnd",
+    "aliases": [],
+    "categoryPath": [
+        "math",
+        "optim"
+    ]
+};
+export default builtinDoc;
+//# sourceMappingURL=fminbnd.js.map

package/dist/generated/builtins/fminbnd.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fminbnd.js","sourceRoot":"","sources":["../../../src/generated/builtins/fminbnd.ts"],"names":[],"mappings":"AAAA,8CAA8C;AAC9C,uBAAuB;AAIvB,MAAM,UAAU,GAAe;IAC7B,OAAO,EAAE,SAAS;IAClB,UAAU,EAAE,YAAY;IACxB,UAAU,EAAE;QACV,SAAS;QACT,sBAAsB;QACtB,OAAO;QACP,gBAAgB;QAChB,yBAAyB;QACzB,cAAc;KACf;IACD,SAAS,EAAE,uFAAuF;IAClG,YAAY,EAAE;QACZ,wDAAwD;KACzD;IACD,aAAa,EAAE;QACb,aAAa,EAAE,KAAK;QACpB,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE,EAAE;QAChB,cAAc,EAAE,MAAM;QACtB,OAAO,EAAE,oFAAoF;KAC9F;IACD,QAAQ,EAAE;QACR,aAAa,EAAE,KAAK;QACpB,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE,CAAC;QACf,WAAW,EAAE,QAAQ;KACtB;IACD,kBAAkB,EAAE,IAAI;IACxB,QAAQ,EAAE;QACR,MAAM,EAAE,uCAAuC;QAC/C,aAAa,EAAE,iEAAiE;KACjF;IACD,aAAa,EAAE,oTAAoT;IACnU,WAAW,EAAE;QACX,+FAA+F;QAC/F,gEAAgE;QAChE,4DAA4D;QAC5D,gIAAgI;QAChI,wHAAwH;QACxH,2GAA2G;QAC3G,kGAAkG;KACnG;IACD,UAAU,EAAE;QACV;YACE,aAAa,EAAE,sBAAsB;YACrC,OAAO,EAAE,kCAAkC;YAC3C,QAAQ,EAAE,iBAAiB;SAC5B;QACD;YACE,aAAa,EAAE,gCAAgC;YAC/C,OAAO,EAAE,8CAA8C;YACvD,QAAQ,EAAE,qCAAqC;SAChD;QACD;YACE,aAAa,EAAE,oBAAoB;YACnC,OAAO,EAAE,qGAAqG;YAC9G,QAAQ,EAAE,yDAAyD;SACpE;KACF;IACD,MAAM,EAAE;QACN;YACE,UAAU,EAAE,8CAA8C;YAC1D,QAAQ,EAAE,wGAAwG;SACnH;QACD;YACE,UAAU,EAAE,uCAAuC;YACnD,QAAQ,EAAE,iKAAiK;SAC5K;QACD;YACE,UAAU,EAAE,0CAA0C;YACtD,QAAQ,EAAE,+IAA+I;SAC1J;KACF;IACD,OAAO,EAAE;QACP;YACE,OAAO,EAAE,OAAO;YAChB,KAAK,EAAE,SAAS;SACjB;QACD;YACE,OAAO,EAAE,QAAQ;YACjB,KAAK,EAAE,UAAU;SAClB;QACD;YACE,OAAO,EAAE,UAAU;YACnB,KAAK,EAAE,YAAY;SACpB;KACF;IACD,QAAQ,EAAE;QACR,OAAO,EAAE,4DAA4D;QACrE,KAAK,EAAE,yGAAyG;KACjH;IACD,KAAK,EAAE,SAAS;IAChB,MAAM,EAAE,SAAS;IACjB,SAAS,EAAE,EAAE;IACb,cAAc,EAAE;QACd,MAAM;QACN,OAAO;KACR;CACF,CAAC;AAEF,eAAe,UAAU,CAAC"}

package/dist/generated/builtins/integral.d.ts

@@ -0,0 +1,4 @@
+import type { BuiltinDoc } from "../../builtins.js";
+declare const builtinDoc: BuiltinDoc;
+export default builtinDoc;
+//# sourceMappingURL=integral.d.ts.map

package/dist/generated/builtins/integral.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"integral.d.ts","sourceRoot":"","sources":["../../../src/generated/builtins/integral.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEpD,QAAA,MAAM,UAAU,EAAE,UAgGjB,CAAC;AAEF,eAAe,UAAU,CAAC"}

package/dist/generated/builtins/integral.js

@@ -0,0 +1,101 @@
+// @generated by scripts/generate-builtins.cjs
+// Do not edit by hand.
+const builtinDoc = {
+    "title": "integral",
+    "category": "math/optim",
+    "keywords": [
+        "integral",
+        "numerical integration",
+        "adaptive quadrature",
+        "quadrature",
+        "function handle"
+    ],
+    "summary": "Approximate a finite scalar definite integral using adaptive quadrature.",
+    "references": [
+        "https://www.mathworks.com/help/matlab/ref/integral.html"
+    ],
+    "gpu_support": {
+        "elementwise": false,
+        "reduction": false,
+        "precisions": [],
+        "broadcasting": "none",
+        "notes": "The adaptive solver runs on the host. Callback functions may still call GPU-aware builtins."
+    },
+    "fusion": {
+        "elementwise": false,
+        "reduction": false,
+        "max_inputs": 3,
+        "constants": "inline"
+    },
+    "requires_feature": null,
+    "tested": {
+        "unit": "builtins::math::optim::integral::tests",
+        "integration": "runmat-vm/tests/closures.rs::integral_accepts_anonymous_function"
+    },
+    "description": "`q = integral(fun, a, b)` approximates the definite integral of `fun` from `a` to `b`. The first implementation supports scalar-valued integrands over finite real bounds.",
+    "behaviors": [
+        "The function may be a named function handle such as `@sin`, an anonymous function such as `@(x) x.^2`, or a function-handle string.",
+        "The integration loop evaluates the integrand at scalar sample points and adapts subintervals using Simpson error estimates.",
+        "The integrand must return a finite real scalar. Array-valued and complex-valued integrands are not supported yet.",
+        "Finite reversed bounds are accepted and negate the result. Equal bounds return zero.",
+        "`AbsTol`, `RelTol`, and `MaxFunEvals` name/value options are accepted for the initial scalar implementation."
+    ],
+    "examples": [
+        {
+            "description": "Integrate a polynomial anonymous function",
+            "input": "q = integral(@(x) x.^2, 0, 1)",
+            "output": "q =\n    0.3333"
+        },
+        {
+            "description": "Integrate sine over one half-period",
+            "input": "q = integral(@sin, 0, pi)",
+            "output": "q =\n    2.0000"
+        },
+        {
+            "description": "Set tighter tolerances",
+            "input": "q = integral(@sin, 0, pi, 'AbsTol', 1e-12, 'RelTol', 1e-8)",
+            "output": "q =\n    2.0000"
+        }
+    ],
+    "faqs": [
+        {
+            "question": "Is this the same as trapz?",
+            "answer": "No. `integral` evaluates a function handle adaptively over continuous bounds. `trapz` integrates already-sampled discrete data."
+        },
+        {
+            "question": "Does integral support vector-valued functions?",
+            "answer": "Not yet. The initial implementation supports finite real scalar-valued integrands."
+        },
+        {
+            "question": "Does integral run on the GPU?",
+            "answer": "The adaptive solver runs on the host because it repeatedly invokes user code through function-handle dispatch. The callback itself may call GPU-aware builtins."
+        }
+    ],
+    "links": [
+        {
+            "label": "trapz",
+            "url": "./trapz"
+        },
+        {
+            "label": "cumtrapz",
+            "url": "./cumtrapz"
+        },
+        {
+            "label": "fzero",
+            "url": "./fzero"
+        }
+    ],
+    "source": {
+        "label": "`crates/runmat-runtime/src/builtins/math/optim/integral.rs`",
+        "url": "https://github.com/runmat-org/runmat/blob/main/crates/runmat-runtime/src/builtins/math/optim/integral.rs"
+    },
+    "key": "integral",
+    "slug": "integral",
+    "aliases": [],
+    "categoryPath": [
+        "math",
+        "optim"
+    ]
+};
+export default builtinDoc;
+//# sourceMappingURL=integral.js.map

package/dist/generated/builtins/integral.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"integral.js","sourceRoot":"","sources":["../../../src/generated/builtins/integral.ts"],"names":[],"mappings":"AAAA,8CAA8C;AAC9C,uBAAuB;AAIvB,MAAM,UAAU,GAAe;IAC7B,OAAO,EAAE,UAAU;IACnB,UAAU,EAAE,YAAY;IACxB,UAAU,EAAE;QACV,UAAU;QACV,uBAAuB;QACvB,qBAAqB;QACrB,YAAY;QACZ,iBAAiB;KAClB;IACD,SAAS,EAAE,0EAA0E;IACrF,YAAY,EAAE;QACZ,yDAAyD;KAC1D;IACD,aAAa,EAAE;QACb,aAAa,EAAE,KAAK;QACpB,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE,EAAE;QAChB,cAAc,EAAE,MAAM;QACtB,OAAO,EAAE,6FAA6F;KACvG;IACD,QAAQ,EAAE;QACR,aAAa,EAAE,KAAK;QACpB,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE,CAAC;QACf,WAAW,EAAE,QAAQ;KACtB;IACD,kBAAkB,EAAE,IAAI;IACxB,QAAQ,EAAE;QACR,MAAM,EAAE,wCAAwC;QAChD,aAAa,EAAE,kEAAkE;KAClF;IACD,aAAa,EAAE,4KAA4K;IAC3L,WAAW,EAAE;QACX,qIAAqI;QACrI,6HAA6H;QAC7H,mHAAmH;QACnH,sFAAsF;QACtF,8GAA8G;KAC/G;IACD,UAAU,EAAE;QACV;YACE,aAAa,EAAE,2CAA2C;YAC1D,OAAO,EAAE,+BAA+B;YACxC,QAAQ,EAAE,iBAAiB;SAC5B;QACD;YACE,aAAa,EAAE,qCAAqC;YACpD,OAAO,EAAE,2BAA2B;YACpC,QAAQ,EAAE,iBAAiB;SAC5B;QACD;YACE,aAAa,EAAE,wBAAwB;YACvC,OAAO,EAAE,4DAA4D;YACrE,QAAQ,EAAE,iBAAiB;SAC5B;KACF;IACD,MAAM,EAAE;QACN;YACE,UAAU,EAAE,4BAA4B;YACxC,QAAQ,EAAE,iIAAiI;SAC5I;QACD;YACE,UAAU,EAAE,gDAAgD;YAC5D,QAAQ,EAAE,oFAAoF;SAC/F;QACD;YACE,UAAU,EAAE,+BAA+B;YAC3C,QAAQ,EAAE,iKAAiK;SAC5K;KACF;IACD,OAAO,EAAE;QACP;YACE,OAAO,EAAE,OAAO;YAChB,KAAK,EAAE,SAAS;SACjB;QACD;YACE,OAAO,EAAE,UAAU;YACnB,KAAK,EAAE,YAAY;SACpB;QACD;YACE,OAAO,EAAE,OAAO;YAChB,KAAK,EAAE,SAAS;SACjB;KACF;IACD,QAAQ,EAAE;QACR,OAAO,EAAE,6DAA6D;QACtE,KAAK,EAAE,0GAA0G;KAClH;IACD,KAAK,EAAE,UAAU;IACjB,MAAM,EAAE,UAAU;IAClB,SAAS,EAAE,EAAE;IACb,cAAc,EAAE;QACd,MAAM;QACN,OAAO;KACR;CACF,CAAC;AAEF,eAAe,UAAU,CAAC"}

package/dist/generated/builtins/mode.d.ts

@@ -0,0 +1,4 @@
+import type { BuiltinDoc } from "../../builtins.js";
+declare const builtinDoc: BuiltinDoc;
+export default builtinDoc;
+//# sourceMappingURL=mode.d.ts.map

package/dist/generated/builtins/mode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mode.d.ts","sourceRoot":"","sources":["../../../src/generated/builtins/mode.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEpD,QAAA,MAAM,UAAU,EAAE,UA6IjB,CAAC;AAEF,eAAe,UAAU,CAAC"}

package/dist/generated/builtins/mode.js

@@ -0,0 +1,146 @@
+// @generated by scripts/generate-builtins.cjs
+// Do not edit by hand.
+const builtinDoc = {
+    "title": "mode",
+    "category": "stats/summary",
+    "keywords": [
+        "mode",
+        "frequency",
+        "statistics",
+        "reduction",
+        "ties"
+    ],
+    "summary": "Most frequent value along a dimension with MATLAB-compatible tie semantics.",
+    "references": [],
+    "gpu_support": {
+        "elementwise": false,
+        "reduction": false,
+        "precisions": [
+            "f64"
+        ],
+        "broadcasting": "none",
+        "notes": "Mode currently executes on the host; GPU tensors are gathered to the CPU before computing the result."
+    },
+    "fusion": {
+        "elementwise": false,
+        "reduction": false,
+        "max_inputs": 1,
+        "constants": "inline"
+    },
+    "requires_feature": null,
+    "tested": {
+        "unit": "builtins::stats::summary::mode::tests"
+    },
+    "description": "`mode(A)` returns the value that appears most frequently in `A`. When multiple values share the same maximum frequency, the smallest tied value is returned in `M`, matching MATLAB. Requesting `[M, F, C] = mode(A)` additionally yields the frequency of the mode and a cell array `C` whose entries are sorted column vectors of the tied values for each slice.",
+    "behaviors": [
+        "`mode(A)` reduces along the first non-singleton dimension of `A`.",
+        "`mode(A, dim)` reduces along the specified dimension (1-based, `>= 1`).",
+        "`mode(A, 'all')` collapses every element of `A` into a single scalar mode.",
+        "`[M, F, C] = mode(A, ...)` additionally returns the frequency `F` of the mode (as a double) and a cell array `C` of sorted tied values per slice.",
+        "Ties resolve to the smallest tied value in `M`, while `C` contains the full tied set sorted in ascending order.",
+        "NaN entries are ignored. If a slice is entirely `NaN` (or empty), the corresponding `M` value is `NaN`, `F` is `0`, and the cell entry is an empty `0 × 1` column.",
+        "Logical, integer, and boolean inputs are promoted to double precision before counting frequencies.",
+        "Dimensions larger than `ndims(A)` treat the input as having trailing singleton dimensions, so each slice contains a single element."
+    ],
+    "examples": [
+        {
+            "description": "Mode of a vector with a clear majority",
+            "input": "x = [1 2 2 3 3 3 4];\nm = mode(x)",
+            "output": "m = 3"
+        },
+        {
+            "description": "Ties return the smallest value with the full sorted set",
+            "input": "x = [1 1 2 2];\n[m, f, c] = mode(x)",
+            "output": "m = 1\nf = 2\nc = {[1; 2]}"
+        },
+        {
+            "description": "Column-wise mode of a matrix",
+            "input": "A = [1 2 1; 2 2 3; 2 4 3];\nm = mode(A)",
+            "output": "m = [2 2 3]"
+        },
+        {
+            "description": "Mode along the second dimension",
+            "input": "A = [1 2 1; 2 2 3; 2 4 3];\nm = mode(A, 2)",
+            "output": "m = [1; 2; 2]"
+        },
+        {
+            "description": "Mode across every element",
+            "input": "A = [1 2 3; 2 3 2];\nm = mode(A, 'all')",
+            "output": "m = 2"
+        },
+        {
+            "description": "NaN values are ignored unless every element is NaN",
+            "input": "x = [1 NaN 2 2 NaN];\n[m, f] = mode(x)",
+            "output": "m = 2\nf = 2"
+        }
+    ],
+    "faqs": [
+        {
+            "question": "How are ties resolved?",
+            "answer": "`M` returns the smallest value among the tied set. The third output `C` contains every tied value sorted in ascending order as a column vector."
+        },
+        {
+            "question": "What happens with NaN values?",
+            "answer": "NaN entries are skipped while counting frequencies. If a slice is entirely NaN, RunMat returns `NaN` for the mode, `0` for the frequency, and an empty `0 × 1` column in the cell array."
+        },
+        {
+            "question": "Does mode support logical or integer inputs?",
+            "answer": "Yes. Logical and integer arrays are promoted to double precision before counting, matching MATLAB."
+        },
+        {
+            "question": "Can I reduce across all elements of an array?",
+            "answer": "Use `mode(A, 'all')` to collapse every element of `A` into a single scalar."
+        },
+        {
+            "question": "Does mode execute on the GPU?",
+            "answer": "Not today. GPU tensors are gathered to the host so the result remains bit-for-bit MATLAB compatible; future providers may expose dedicated mode kernels."
+        }
+    ],
+    "links": [
+        {
+            "label": "mean",
+            "url": "./mean"
+        },
+        {
+            "label": "median",
+            "url": "./median"
+        },
+        {
+            "label": "max",
+            "url": "./max"
+        },
+        {
+            "label": "min",
+            "url": "./min"
+        },
+        {
+            "label": "std",
+            "url": "./std"
+        },
+        {
+            "label": "var",
+            "url": "./var"
+        },
+        {
+            "label": "histcounts",
+            "url": "./histcounts"
+        },
+        {
+            "label": "unique",
+            "url": "./unique"
+        }
+    ],
+    "source": {
+        "label": "`crates/runmat-runtime/src/builtins/stats/summary/mode.rs`",
+        "url": "https://github.com/runmat-org/runmat/blob/main/crates/runmat-runtime/src/builtins/stats/summary/mode.rs"
+    },
+    "key": "mode",
+    "slug": "mode",
+    "aliases": [],
+    "categoryPath": [
+        "stats",
+        "summary"
+    ]
+};
+export default builtinDoc;
+//# sourceMappingURL=mode.js.map

package/dist/generated/builtins/mode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mode.js","sourceRoot":"","sources":["../../../src/generated/builtins/mode.ts"],"names":[],"mappings":"AAAA,8CAA8C;AAC9C,uBAAuB;AAIvB,MAAM,UAAU,GAAe;IAC7B,OAAO,EAAE,MAAM;IACf,UAAU,EAAE,eAAe;IAC3B,UAAU,EAAE;QACV,MAAM;QACN,WAAW;QACX,YAAY;QACZ,WAAW;QACX,MAAM;KACP;IACD,SAAS,EAAE,6EAA6E;IACxF,YAAY,EAAE,EAAE;IAChB,aAAa,EAAE;QACb,aAAa,EAAE,KAAK;QACpB,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE;YACZ,KAAK;SACN;QACD,cAAc,EAAE,MAAM;QACtB,OAAO,EAAE,uGAAuG;KACjH;IACD,QAAQ,EAAE;QACR,aAAa,EAAE,KAAK;QACpB,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE,CAAC;QACf,WAAW,EAAE,QAAQ;KACtB;IACD,kBAAkB,EAAE,IAAI;IACxB,QAAQ,EAAE;QACR,MAAM,EAAE,uCAAuC;KAChD;IACD,aAAa,EAAE,qWAAqW;IACpX,WAAW,EAAE;QACX,mEAAmE;QACnE,yEAAyE;QACzE,4EAA4E;QAC5E,mJAAmJ;QACnJ,iHAAiH;QACjH,oKAAoK;QACpK,oGAAoG;QACpG,qIAAqI;KACtI;IACD,UAAU,EAAE;QACV;YACE,aAAa,EAAE,wCAAwC;YACvD,OAAO,EAAE,mCAAmC;YAC5C,QAAQ,EAAE,OAAO;SAClB;QACD;YACE,aAAa,EAAE,yDAAyD;YACxE,OAAO,EAAE,qCAAqC;YAC9C,QAAQ,EAAE,4BAA4B;SACvC;QACD;YACE,aAAa,EAAE,8BAA8B;YAC7C,OAAO,EAAE,yCAAyC;YAClD,QAAQ,EAAE,aAAa;SACxB;QACD;YACE,aAAa,EAAE,iCAAiC;YAChD,OAAO,EAAE,4CAA4C;YACrD,QAAQ,EAAE,eAAe;SAC1B;QACD;YACE,aAAa,EAAE,2BAA2B;YAC1C,OAAO,EAAE,yCAAyC;YAClD,QAAQ,EAAE,OAAO;SAClB;QACD;YACE,aAAa,EAAE,oDAAoD;YACnE,OAAO,EAAE,wCAAwC;YACjD,QAAQ,EAAE,cAAc;SACzB;KACF;IACD,MAAM,EAAE;QACN;YACE,UAAU,EAAE,wBAAwB;YACpC,QAAQ,EAAE,iJAAiJ;SAC5J;QACD;YACE,UAAU,EAAE,+BAA+B;YAC3C,QAAQ,EAAE,0LAA0L;SACrM;QACD;YACE,UAAU,EAAE,8CAA8C;YAC1D,QAAQ,EAAE,oGAAoG;SAC/G;QACD;YACE,UAAU,EAAE,+CAA+C;YAC3D,QAAQ,EAAE,6EAA6E;SACxF;QACD;YACE,UAAU,EAAE,+BAA+B;YAC3C,QAAQ,EAAE,0JAA0J;SACrK;KACF;IACD,OAAO,EAAE;QACP;YACE,OAAO,EAAE,MAAM;YACf,KAAK,EAAE,QAAQ;SAChB;QACD;YACE,OAAO,EAAE,QAAQ;YACjB,KAAK,EAAE,UAAU;SAClB;QACD;YACE,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,OAAO;SACf;QACD;YACE,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,OAAO;SACf;QACD;YACE,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,OAAO;SACf;QACD;YACE,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,OAAO;SACf;QACD;YACE,OAAO,EAAE,YAAY;YACrB,KAAK,EAAE,cAAc;SACtB;QACD;YACE,OAAO,EAAE,QAAQ;YACjB,KAAK,EAAE,UAAU;SAClB;KACF;IACD,QAAQ,EAAE;QACR,OAAO,EAAE,4DAA4D;QACrE,KAAK,EAAE,yGAAyG;KACjH;IACD,KAAK,EAAE,MAAM;IACb,MAAM,EAAE,MAAM;IACd,SAAS,EAAE,EAAE;IACb,cAAc,EAAE;QACd,OAAO;QACP,SAAS;KACV;CACF,CAAC;AAEF,eAAe,UAAU,CAAC"}

package/dist/generated/builtins/optimset.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"optimset.d.ts","sourceRoot":"","sources":["../../../src/generated/builtins/optimset.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEpD,QAAA,MAAM,UAAU,EAAE,UAkEjB,CAAC;AAEF,eAAe,UAAU,CAAC"}
+{"version":3,"file":"optimset.d.ts","sourceRoot":"","sources":["../../../src/generated/builtins/optimset.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEpD,QAAA,MAAM,UAAU,EAAE,UAsEjB,CAAC;AAEF,eAAe,UAAU,CAAC"}

package/dist/generated/builtins/optimset.js

@@ -11,7 +11,7 @@ const builtinDoc = {
         "MaxIter",
         "Display"
     ],
-    "summary": "Create or update an optimization options structure for fzero and fsolve.",
+    "summary": "Create or update an optimization options structure for fminbnd, fzero, and fsolve.",
     "references": [
         "https://www.mathworks.com/help/matlab/ref/optimset.html"
     ],
@@ -32,7 +32,7 @@ const builtinDoc = {
     "tested": {
         "unit": "builtins::math::optim::optimset::tests"
     },
-    "description": "`opts = optimset(name, value, ...)` creates a struct of optimization options. `opts = optimset(old, name, value, ...)` copies an existing options struct and applies overrides.",
+    "description": "`opts = optimset(name, value, ...)` creates a struct of optimization options. `opts = optimset(old, name, value, ...)` copies an existing options struct and applies overrides. The resulting struct can be passed to optimization builtins such as `fminbnd`, `fzero`, and `fsolve`.",
     "behaviors": [
         "Option names are case-insensitive for the builtins that consume them.",
         "`TolX`, `TolFun`, `MaxIter`, `MaxFunEvals`, and `Display` are canonicalized when constructed with `optimset`.",
@@ -40,12 +40,16 @@ const builtinDoc = {
     ],
     "examples": [
         {
-            "description": "Create options for fzero",
-            "input": "opts = optimset('TolX', 1e-10, 'Display', 'off');\nx = fzero(@sin, [3 4], opts)",
+            "description": "Create options for fminbnd",
+            "input": "opts = optimset('TolX', 1e-10, 'Display', 'off');\nx = fminbnd(@cos, 0, pi, opts)",
             "output": "x =\n    3.1416"
         }
     ],
     "links": [
+        {
+            "label": "fminbnd",
+            "url": "./fminbnd"
+        },
         {
             "label": "fzero",
             "url": "./fzero"

package/dist/generated/builtins/optimset.js.map

@@ -1 +1 @@
-{"version":3,"file":"optimset.js","sourceRoot":"","sources":["../../../src/generated/builtins/optimset.ts"],"names":[],"mappings":"AAAA,8CAA8C;AAC9C,uBAAuB;AAIvB,MAAM,UAAU,GAAe;IAC7B,OAAO,EAAE,UAAU;IACnB,UAAU,EAAE,YAAY;IACxB,UAAU,EAAE;QACV,UAAU;QACV,SAAS;QACT,MAAM;QACN,QAAQ;QACR,SAAS;QACT,SAAS;KACV;IACD,SAAS,EAAE,0EAA0E;IACrF,YAAY,EAAE;QACZ,yDAAyD;KAC1D;IACD,aAAa,EAAE;QACb,aAAa,EAAE,KAAK;QACpB,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE,EAAE;QAChB,cAAc,EAAE,MAAM;QACtB,OAAO,EAAE,4BAA4B;KACtC;IACD,QAAQ,EAAE;QACR,aAAa,EAAE,KAAK;QACpB,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE,CAAC;QACf,WAAW,EAAE,QAAQ;KACtB;IACD,kBAAkB,EAAE,IAAI;IACxB,QAAQ,EAAE;QACR,MAAM,EAAE,wCAAwC;KACjD;IACD,aAAa,EAAE,iLAAiL;IAChM,WAAW,EAAE;QACX,uEAAuE;QACvE,+GAA+G;QAC/G,qEAAqE;KACtE;IACD,UAAU,EAAE;QACV;YACE,aAAa,EAAE,0BAA0B;YACzC,OAAO,EAAE,iFAAiF;YAC1F,QAAQ,EAAE,iBAAiB;SAC5B;KACF;IACD,OAAO,EAAE;QACP;YACE,OAAO,EAAE,OAAO;YAChB,KAAK,EAAE,SAAS;SACjB;QACD;YACE,OAAO,EAAE,QAAQ;YACjB,KAAK,EAAE,UAAU;SAClB;KACF;IACD,QAAQ,EAAE;QACR,OAAO,EAAE,6DAA6D;QACtE,KAAK,EAAE,0GAA0G;KAClH;IACD,KAAK,EAAE,UAAU;IACjB,MAAM,EAAE,UAAU;IAClB,SAAS,EAAE,EAAE;IACb,cAAc,EAAE;QACd,MAAM;QACN,OAAO;KACR;CACF,CAAC;AAEF,eAAe,UAAU,CAAC"}
+{"version":3,"file":"optimset.js","sourceRoot":"","sources":["../../../src/generated/builtins/optimset.ts"],"names":[],"mappings":"AAAA,8CAA8C;AAC9C,uBAAuB;AAIvB,MAAM,UAAU,GAAe;IAC7B,OAAO,EAAE,UAAU;IACnB,UAAU,EAAE,YAAY;IACxB,UAAU,EAAE;QACV,UAAU;QACV,SAAS;QACT,MAAM;QACN,QAAQ;QACR,SAAS;QACT,SAAS;KACV;IACD,SAAS,EAAE,oFAAoF;IAC/F,YAAY,EAAE;QACZ,yDAAyD;KAC1D;IACD,aAAa,EAAE;QACb,aAAa,EAAE,KAAK;QACpB,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE,EAAE;QAChB,cAAc,EAAE,MAAM;QACtB,OAAO,EAAE,4BAA4B;KACtC;IACD,QAAQ,EAAE;QACR,aAAa,EAAE,KAAK;QACpB,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE,CAAC;QACf,WAAW,EAAE,QAAQ;KACtB;IACD,kBAAkB,EAAE,IAAI;IACxB,QAAQ,EAAE;QACR,MAAM,EAAE,wCAAwC;KACjD;IACD,aAAa,EAAE,uRAAuR;IACtS,WAAW,EAAE;QACX,uEAAuE;QACvE,+GAA+G;QAC/G,qEAAqE;KACtE;IACD,UAAU,EAAE;QACV;YACE,aAAa,EAAE,4BAA4B;YAC3C,OAAO,EAAE,mFAAmF;YAC5F,QAAQ,EAAE,iBAAiB;SAC5B;KACF;IACD,OAAO,EAAE;QACP;YACE,OAAO,EAAE,SAAS;YAClB,KAAK,EAAE,WAAW;SACnB;QACD;YACE,OAAO,EAAE,OAAO;YAChB,KAAK,EAAE,SAAS;SACjB;QACD;YACE,OAAO,EAAE,QAAQ;YACjB,KAAK,EAAE,UAAU;SAClB;KACF;IACD,QAAQ,EAAE;QACR,OAAO,EAAE,6DAA6D;QACtE,KAAK,EAAE,0GAA0G;KAClH;IACD,KAAK,EAAE,UAAU;IACjB,MAAM,EAAE,UAAU;IAClB,SAAS,EAAE,EAAE;IACb,cAAc,EAAE;QACd,MAAM;QACN,OAAO;KACR;CACF,CAAC;AAEF,eAAe,UAAU,CAAC"}

package/dist/generated/builtins/patch.d.ts

@@ -0,0 +1,4 @@
+import type { BuiltinDoc } from "../../builtins.js";
+declare const builtinDoc: BuiltinDoc;
+export default builtinDoc;
+//# sourceMappingURL=patch.d.ts.map

package/dist/generated/builtins/patch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"patch.d.ts","sourceRoot":"","sources":["../../../src/generated/builtins/patch.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEpD,QAAA,MAAM,UAAU,EAAE,UAkIjB,CAAC;AAEF,eAAe,UAAU,CAAC"}

package/dist/generated/builtins/patch.js

@@ -0,0 +1,135 @@
+// @generated by scripts/generate-builtins.cjs
+// Do not edit by hand.
+const builtinDoc = {
+    "title": "patch",
+    "category": "plotting",
+    "keywords": [
+        "patch",
+        "polygon",
+        "filled polygon",
+        "faces",
+        "vertices",
+        "matlab patch",
+        "graphics primitive"
+    ],
+    "summary": "Create MATLAB-compatible colored polygon patch objects from coordinate data or Faces/Vertices definitions.",
+    "gpu_support": {
+        "elementwise": false,
+        "reduction": false,
+        "precisions": [
+            "single",
+            "double"
+        ],
+        "broadcasting": "none",
+        "notes": "`patch` is a plotting sink. The initial implementation gathers GPU-resident coordinate inputs, triangulates polygon faces on the host, then renders through RunMat's shared GPU plotting renderer."
+    },
+    "fusion": {
+        "elementwise": false,
+        "reduction": false,
+        "max_inputs": 4,
+        "constants": "inline"
+    },
+    "requires_feature": null,
+    "tested": {
+        "unit": "builtins::plotting::patch::tests",
+        "integration": "runmat-plot/src/plots/patch.rs"
+    },
+    "description": "`patch` creates filled polygon graphics objects. RunMat supports practical MATLAB forms including `patch(X,Y,C)`, `patch(X,Y,Z,C)`, name-value `XData`/`YData`/`ZData`, `Faces`/`Vertices`, struct input, explicit axes handles, and common face, edge, alpha, line-width, display-name, and visibility properties.",
+    "behaviors": [
+        "Vector coordinate inputs create one polygon.",
+        "Matrix coordinate inputs create one polygon per column.",
+        "Patch edges close automatically, matching MATLAB's open-polygon behavior.",
+        "`Faces` values are interpreted as MATLAB-style one-based vertex indices.",
+        "2-D vertices are accepted as N-by-2; 3-D vertices are accepted as N-by-3.",
+        "The returned value is a patch graphics handle that works with `get`, `set`, `ishandle`, and `isgraphics`.",
+        "Per-vertex or per-face `CData` colormap interpolation is not yet implemented; non-scalar color data is accepted only as compatibility input and currently falls back to the default face color unless `FaceColor` supplies a concrete RGB/color-name value."
+    ],
+    "options": [
+        "`FaceColor` accepts color names, RGB triples, `flat`, or `none`.",
+        "`EdgeColor` accepts color names, RGB triples, or `none`.",
+        "`FaceAlpha` and `EdgeAlpha` accept numeric values from 0 to 1.",
+        "`LineWidth`, `DisplayName`, and `Visible` use the shared plotting property model.",
+        "`FaceColor`, `EdgeColor`, alpha, line width, display name, visibility, `Faces`, `Vertices`, `XData`, `YData`, and `ZData` are the first supported patch property set. Lighting, normals, texture coordinates, and callback properties are deferred."
+    ],
+    "examples": [
+        {
+            "description": "Create a triangle patch",
+            "input": "x = [0 1 0];\ny = [0 0 1];\npatch(x, y, 'red');"
+        },
+        {
+            "description": "Create two rectangle patches from matrix columns",
+            "input": "X = [0 2; 1 3; 1 3; 0 2];\nY = [0 0; 0 0; 1 1; 1 1];\npatch(X, Y, 'cyan', 'EdgeColor', 'black');"
+        },
+        {
+            "description": "Create a patch from Faces and Vertices",
+            "input": "V = [0 0; 1 0; 1 1; 0 1];\nF = [1 2 3 4];\nh = patch('Faces', F, 'Vertices', V, 'FaceColor', [0.2 0.6 0.9]);\nget(h, 'Type')",
+            "output": "ans =\n    'patch'"
+        },
+        {
+            "description": "Create a 3-D patch",
+            "input": "V = [0 0 0; 1 0 0; 0.5 1 0.5];\nF = [1 2 3];\npatch('Faces', F, 'Vertices', V, 'FaceAlpha', 0.6);\nview(3);"
+        }
+    ],
+    "faqs": [
+        {
+            "question": "Does patch close polygons automatically?",
+            "answer": "Yes. You can provide open polygon coordinate lists; RunMat closes the edge loop when rendering the patch."
+        },
+        {
+            "question": "Are Faces indices zero-based or one-based?",
+            "answer": "They are one-based to match MATLAB. `Faces = [1 2 3]` references the first, second, and third rows of `Vertices`."
+        },
+        {
+            "question": "Does patch have a direct GPU-resident geometry path?",
+            "answer": "Not yet. RunMat gathers GPU-resident patch inputs for validation and triangulation, then submits the resulting geometry to the shared GPU renderer. A direct GPU triangulation/packing path can be added later for very large patch meshes."
+        }
+    ],
+    "links": [
+        {
+            "label": "surf",
+            "url": "./surf"
+        },
+        {
+            "label": "plot3",
+            "url": "./plot3"
+        },
+        {
+            "label": "fill",
+            "url": "./fill"
+        },
+        {
+            "label": "get",
+            "url": "./get"
+        },
+        {
+            "label": "set",
+            "url": "./set"
+        },
+        {
+            "label": "Graphics Handles",
+            "url": "/docs/plotting/graphics-handles"
+        },
+        {
+            "label": "Plot replay and export",
+            "url": "/docs/plotting/plot-replay-and-export"
+        }
+    ],
+    "source": {
+        "label": "`crates/runmat-runtime/src/builtins/plotting/ops/patch.rs`",
+        "url": "https://github.com/runmat-org/runmat/blob/main/crates/runmat-runtime/src/builtins/plotting/ops/patch.rs"
+    },
+    "gpu_residency": "`patch` gathers GPU-resident coordinate inputs in the first implementation because MATLAB-compatible patch parsing requires shape validation, one-based Faces handling, NaN padding, and polygon triangulation. The rendered geometry still flows through the shared GPU plotting renderer.",
+    "gpu_behavior": [
+        "Patch rendering is a plotting sink and fusion barrier.",
+        "Host and gathered-GPU inputs produce the same graphics object and handle behavior.",
+        "A future direct GPU path should preserve the same Faces/Vertices semantics and only replace the triangulation/packing step."
+    ],
+    "key": "patch",
+    "slug": "patch",
+    "aliases": [],
+    "categoryPath": [
+        "plotting"
+    ]
+};
+export default builtinDoc;
+//# sourceMappingURL=patch.js.map

package/dist/generated/builtins/patch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"patch.js","sourceRoot":"","sources":["../../../src/generated/builtins/patch.ts"],"names":[],"mappings":"AAAA,8CAA8C;AAC9C,uBAAuB;AAIvB,MAAM,UAAU,GAAe;IAC7B,OAAO,EAAE,OAAO;IAChB,UAAU,EAAE,UAAU;IACtB,UAAU,EAAE;QACV,OAAO;QACP,SAAS;QACT,gBAAgB;QAChB,OAAO;QACP,UAAU;QACV,cAAc;QACd,oBAAoB;KACrB;IACD,SAAS,EAAE,4GAA4G;IACvH,aAAa,EAAE;QACb,aAAa,EAAE,KAAK;QACpB,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE;YACZ,QAAQ;YACR,QAAQ;SACT;QACD,cAAc,EAAE,MAAM;QACtB,OAAO,EAAE,oMAAoM;KAC9M;IACD,QAAQ,EAAE;QACR,aAAa,EAAE,KAAK;QACpB,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE,CAAC;QACf,WAAW,EAAE,QAAQ;KACtB;IACD,kBAAkB,EAAE,IAAI;IACxB,QAAQ,EAAE;QACR,MAAM,EAAE,kCAAkC;QAC1C,aAAa,EAAE,gCAAgC;KAChD;IACD,aAAa,EAAE,qTAAqT;IACpU,WAAW,EAAE;QACX,8CAA8C;QAC9C,yDAAyD;QACzD,2EAA2E;QAC3E,0EAA0E;QAC1E,2EAA2E;QAC3E,2GAA2G;QAC3G,6PAA6P;KAC9P;IACD,SAAS,EAAE;QACT,kEAAkE;QAClE,0DAA0D;QAC1D,gEAAgE;QAChE,mFAAmF;QACnF,qPAAqP;KACtP;IACD,UAAU,EAAE;QACV;YACE,aAAa,EAAE,yBAAyB;YACxC,OAAO,EAAE,iDAAiD;SAC3D;QACD;YACE,aAAa,EAAE,kDAAkD;YACjE,OAAO,EAAE,kGAAkG;SAC5G;QACD;YACE,aAAa,EAAE,wCAAwC;YACvD,OAAO,EAAE,8HAA8H;YACvI,QAAQ,EAAE,oBAAoB;SAC/B;QACD;YACE,aAAa,EAAE,oBAAoB;YACnC,OAAO,EAAE,6GAA6G;SACvH;KACF;IACD,MAAM,EAAE;QACN;YACE,UAAU,EAAE,0CAA0C;YACtD,QAAQ,EAAE,2GAA2G;SACtH;QACD;YACE,UAAU,EAAE,4CAA4C;YACxD,QAAQ,EAAE,mHAAmH;SAC9H;QACD;YACE,UAAU,EAAE,sDAAsD;YAClE,QAAQ,EAAE,6OAA6O;SACxP;KACF;IACD,OAAO,EAAE;QACP;YACE,OAAO,EAAE,MAAM;YACf,KAAK,EAAE,QAAQ;SAChB;QACD;YACE,OAAO,EAAE,OAAO;YAChB,KAAK,EAAE,SAAS;SACjB;QACD;YACE,OAAO,EAAE,MAAM;YACf,KAAK,EAAE,QAAQ;SAChB;QACD;YACE,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,OAAO;SACf;QACD;YACE,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,OAAO;SACf;QACD;YACE,OAAO,EAAE,kBAAkB;YAC3B,KAAK,EAAE,iCAAiC;SACzC;QACD;YACE,OAAO,EAAE,wBAAwB;YACjC,KAAK,EAAE,uCAAuC;SAC/C;KACF;IACD,QAAQ,EAAE;QACR,OAAO,EAAE,4DAA4D;QACrE,KAAK,EAAE,yGAAyG;KACjH;IACD,eAAe,EAAE,6RAA6R;IAC9S,cAAc,EAAE;QACd,wDAAwD;QACxD,oFAAoF;QACpF,6HAA6H;KAC9H;IACD,KAAK,EAAE,OAAO;IACd,MAAM,EAAE,OAAO;IACf,SAAS,EAAE,EAAE;IACb,cAAc,EAAE;QACd,UAAU;KACX;CACF,CAAC;AAEF,eAAe,UAAU,CAAC"}

package/dist/generated/builtins/repelem.d.ts

@@ -0,0 +1,4 @@
+import type { BuiltinDoc } from "../../builtins.js";
+declare const builtinDoc: BuiltinDoc;
+export default builtinDoc;
+//# sourceMappingURL=repelem.d.ts.map

package/dist/generated/builtins/repelem.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"repelem.d.ts","sourceRoot":"","sources":["../../../src/generated/builtins/repelem.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEpD,QAAA,MAAM,UAAU,EAAE,UAkIjB,CAAC;AAEF,eAAe,UAAU,CAAC"}