@typed/fx 1.32.0 → 2.0.0-beta.0

package/dist/RefSubject/RefDuration.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RefDuration.d.ts","sourceRoot":"","sources":["../../src/RefSubject/RefDuration.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,QAAQ,MAAM,iBAAiB,CAAC;AAC5C,OAAO,KAAK,KAAK,MAAM,MAAM,eAAe,CAAC;AAE7C,OAAO,KAAK,KAAK,KAAK,MAAM,cAAc,CAAC;AAC3C,OAAO,KAAK,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAC;AAE9C;;;;GAIG;AACH,MAAM,WAAW,WAAW,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAE,SAAQ,UAAU,CAAC,UAAU,CACzF,QAAQ,CAAC,QAAQ,EACjB,CAAC,EACD,CAAC,CACF;CAAG;AAEJ;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,IAAI,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EACvC,OAAO,EACH,QAAQ,CAAC,QAAQ,GACjB,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,GACtC,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,GACjC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAEvD;AAMD;;;;GAIG;AACH,eAAO,MAAM,GAAG,EAAE;IAChB,CACE,IAAI,EAAE,QAAQ,CAAC,QAAQ,GACtB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClF,CAAC,CAAC,EAAE,CAAC,EACH,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,IAAI,EAAE,QAAQ,CAAC,QAAQ,GACtB,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAGhD,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,QAAQ,EAAE;IACrB,CACE,IAAI,EAAE,QAAQ,CAAC,QAAQ,GACtB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClF,CAAC,CAAC,EAAE,CAAC,EACH,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,IAAI,EAAE,QAAQ,CAAC,QAAQ,GACtB,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAGhD,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,QAAQ,EAAE;IACrB,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/F,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAG3F,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,MAAM,EAAE;IACnB,CACE,IAAI,EAAE,MAAM,GACX,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,GAAG,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9F,CAAC,CAAC,EAAE,CAAC,EACH,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,IAAI,EAAE,MAAM,GACX,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,GAAG,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAG5D,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,MAAM,GAAI,CAAC,EAAE,CAAC,EAAE,KAAK,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CACjD,CAAC;AAEvC;;;;GAIG;AACH,eAAO,MAAM,UAAU,EAAE;IACvB,CAAC,IAAI,EAAE,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAChG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,QAAQ,GAAG,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAG5F,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,aAAa,EAAE;IAC1B,CAAC,IAAI,EAAE,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAChG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,QAAQ,GAAG,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAG5F,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,MAAM,GAAI,CAAC,EAAE,CAAC,EAAE,KAAK,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAC9C,CAAC;AAEzC;;;;GAIG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,EAAE,CAAC,EAAE,KAAK,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAC9C,CAAC;AAE1C;;;;GAIG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,EAAE,CAAC,EAAE,KAAK,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAC9C,CAAC;AAE1C;;;;GAIG;AACH,eAAO,MAAM,KAAK,GAAI,CAAC,EAAE,CAAC,EAAE,KAAK,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAC9C,CAAC;AAExC;;;;GAIG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,EAAE,CAAC,EAAE,KAAK,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAC9C,CAAC"}

package/dist/RefSubject/RefDuration.js

@@ -0,0 +1,115 @@
+/**
+ * Extensions to RefSubject for working with Duration values
+ * @since 1.18.0
+ */
+import * as Duration from "effect/Duration";
+import { dual } from "effect/Function";
+import * as RefSubject from "./RefSubject.js";
+/**
+ * Creates a new `RefDuration` from a Duration, `Effect`, or `Fx`.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Duration } from "effect"
+ * import * as RefDuration from "effect/typed/fx/RefSubject/RefDuration"
+ *
+ * const program = Effect.gen(function* () {
+ *   const value = yield* RefDuration.make(Duration.seconds(5))
+ *   const current = yield* value
+ *   console.log(current) // Duration(...)
+ * })
+ * ```
+ *
+ * @since 1.18.0
+ * @category constructors
+ */
+export function make(initial) {
+    return RefSubject.make(initial, { eq: Duration.Equivalence });
+}
+// ========================================
+// Computed
+// ========================================
+/**
+ * Add a Duration to the current state of a RefDuration.
+ * @since 1.18.0
+ * @category computed
+ */
+export const add = dual(2, function add(ref, that) {
+    return RefSubject.map(ref, (self) => Duration.sum(self, that));
+});
+/**
+ * Subtract a Duration from the current state of a RefDuration.
+ * @since 1.18.0
+ * @category computed
+ */
+export const subtract = dual(2, function subtract(ref, that) {
+    return RefSubject.map(ref, (self) => Duration.subtract(self, that));
+});
+/**
+ * Multiply the current state of a RefDuration by a number.
+ * @since 1.18.0
+ * @category computed
+ */
+export const multiply = dual(2, function multiply(ref, that) {
+    return RefSubject.map(ref, (self) => Duration.times(self, that));
+});
+/**
+ * Divide the current state of a RefDuration by a number.
+ * @since 1.18.0
+ * @category computed
+ */
+export const divide = dual(2, function divide(ref, that) {
+    return RefSubject.map(ref, (self) => Duration.divide(self, that));
+});
+/**
+ * Check if the current state of a RefDuration is zero.
+ * @since 1.18.0
+ * @category computed
+ */
+export const isZero = (ref) => RefSubject.map(ref, Duration.isZero);
+/**
+ * Check if the current state of a RefDuration is less than a Duration.
+ * @since 1.18.0
+ * @category computed
+ */
+export const isLessThan = dual(2, function isLessThan(ref, that) {
+    return RefSubject.map(ref, (self) => Duration.isLessThan(self, that));
+});
+/**
+ * Check if the current state of a RefDuration is greater than a Duration.
+ * @since 1.18.0
+ * @category computed
+ */
+export const isGreaterThan = dual(2, function isGreaterThan(ref, that) {
+    return RefSubject.map(ref, (self) => Duration.isGreaterThan(self, that));
+});
+/**
+ * Get the milliseconds value of the current state of a RefDuration.
+ * @since 1.18.0
+ * @category computed
+ */
+export const millis = (ref) => RefSubject.map(ref, Duration.toMillis);
+/**
+ * Get the seconds value of the current state of a RefDuration.
+ * @since 1.18.0
+ * @category computed
+ */
+export const seconds = (ref) => RefSubject.map(ref, Duration.toSeconds);
+/**
+ * Get the minutes value of the current state of a RefDuration.
+ * @since 1.18.0
+ * @category computed
+ */
+export const minutes = (ref) => RefSubject.map(ref, Duration.toMinutes);
+/**
+ * Get the hours value of the current state of a RefDuration.
+ * @since 1.18.0
+ * @category computed
+ */
+export const hours = (ref) => RefSubject.map(ref, Duration.toHours);
+/**
+ * Get the days value of the current state of a RefDuration.
+ * @since 1.18.0
+ * @category computed
+ */
+export const days = (ref) => RefSubject.map(ref, Duration.toDays);

package/dist/RefSubject/RefGraph.d.ts

@@ -0,0 +1,239 @@
+/**
+ * Extensions to RefSubject for working with Graph values
+ * @since 1.18.0
+ */
+import type * as Effect from "effect/Effect";
+import * as Graph from "effect/Graph";
+import type * as Scope from "effect/Scope";
+import type * as Fx from "../Fx/index.js";
+import * as RefSubject from "./RefSubject.js";
+/**
+ * A RefGraph is a RefSubject specialized over a Graph.
+ * @since 1.18.0
+ * @category models
+ */
+export interface RefGraph<in out N, in out E, T extends Graph.Kind = "directed", in out Err = never, out R = never> extends RefSubject.RefSubject<Graph.Graph<N, E, T>, Err, R> {
+}
+/**
+ * Creates a new `RefGraph` from a Graph, `Effect`, or `Fx`.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare function make<N, E, T extends Graph.Kind, Err, R>(initial: Graph.Graph<N, E, T> | Effect.Effect<Graph.Graph<N, E, T>, Err, R> | Fx.Fx<Graph.Graph<N, E, T>, Err, R>): Effect.Effect<RefGraph<N, E, T, Err>, never, R | Scope.Scope>;
+/**
+ * Creates a new empty directed RefGraph.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare function directed<N, E, Err, R>(): Effect.Effect<RefGraph<N, E, "directed", Err>, never, R | Scope.Scope>;
+/**
+ * Creates a new empty undirected RefGraph.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare function undirected<N, E, Err, R>(): Effect.Effect<RefGraph<N, E, "undirected", Err>, never, R | Scope.Scope>;
+/**
+ * Add a node to the graph.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const addNode: {
+    <N>(data: N): <E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, data: N): Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+};
+/**
+ * Remove a node from the graph.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const removeNode: {
+    (nodeIndex: Graph.NodeIndex): <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, nodeIndex: Graph.NodeIndex): Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+};
+/**
+ * Update a node's data.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const updateNode: {
+    <N>(nodeIndex: Graph.NodeIndex, f: (data: N) => N): <E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, nodeIndex: Graph.NodeIndex, f: (data: N) => N): Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+};
+/**
+ * Add an edge to the graph.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const addEdge: {
+    <E>(source: Graph.NodeIndex, target: Graph.NodeIndex, data: E): <N, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, source: Graph.NodeIndex, target: Graph.NodeIndex, data: E): Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+};
+/**
+ * Remove an edge from the graph.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const removeEdge: {
+    (edgeIndex: Graph.EdgeIndex): <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, edgeIndex: Graph.EdgeIndex): Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+};
+/**
+ * Update an edge's data.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const updateEdge: {
+    <E>(edgeIndex: Graph.EdgeIndex, f: (data: E) => E): <N, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, edgeIndex: Graph.EdgeIndex, f: (data: E) => E): Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+};
+/**
+ * Map all node data.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const mapNodes: {
+    <N>(f: (data: N) => N): <E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, f: (data: N) => N): Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+};
+/**
+ * Map all edge data.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const mapEdges: {
+    <E>(f: (data: E) => E): <N, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, f: (data: E) => E): Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+};
+/**
+ * Filter nodes.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const filterNodes: {
+    <N>(predicate: (data: N) => boolean): <E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, predicate: (data: N) => boolean): Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+};
+/**
+ * Filter edges.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const filterEdges: {
+    <E>(predicate: (data: E) => boolean): <N, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, predicate: (data: E) => boolean): Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+};
+/**
+ * Reverse all edge directions.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const reverse: <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => Effect.Effect<Graph.Graph<N, E, T>, Err, R>;
+/**
+ * Get the node count.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const nodeCount: <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => RefSubject.Computed<number, Err, R>;
+/**
+ * Get the edge count.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const edgeCount: <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => RefSubject.Computed<number, Err, R>;
+/**
+ * Check if a node exists.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const hasNode: {
+    (nodeIndex: Graph.NodeIndex): <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => RefSubject.Computed<boolean, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, nodeIndex: Graph.NodeIndex): RefSubject.Computed<boolean, Err, R>;
+};
+/**
+ * Check if an edge exists.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const hasEdge: {
+    (source: Graph.NodeIndex, target: Graph.NodeIndex): <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => RefSubject.Computed<boolean, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, source: Graph.NodeIndex, target: Graph.NodeIndex): RefSubject.Computed<boolean, Err, R>;
+};
+/**
+ * Get neighbors of a node.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const neighbors: {
+    (nodeIndex: Graph.NodeIndex): <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => RefSubject.Computed<Array<Graph.NodeIndex>, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, nodeIndex: Graph.NodeIndex): RefSubject.Computed<Array<Graph.NodeIndex>, Err, R>;
+};
+/**
+ * Get directed neighbors of a node.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const neighborsDirected: {
+    (nodeIndex: Graph.NodeIndex, direction: Graph.Direction): <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => RefSubject.Computed<Array<Graph.NodeIndex>, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, nodeIndex: Graph.NodeIndex, direction: Graph.Direction): RefSubject.Computed<Array<Graph.NodeIndex>, Err, R>;
+};
+/**
+ * Check if the graph is acyclic.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const isAcyclic: <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => RefSubject.Computed<boolean, Err, R>;
+/**
+ * Check if the graph is bipartite (undirected only).
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const isBipartite: <N, E, Err, R>(ref: RefGraph<N, E, "undirected", Err, R>) => RefSubject.Computed<boolean, Err, R>;
+/**
+ * Get connected components (undirected only).
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const connectedComponents: <N, E, Err, R>(ref: RefGraph<N, E, "undirected", Err, R>) => RefSubject.Computed<Array<Array<Graph.NodeIndex>>, Err, R>;
+/**
+ * Get strongly connected components.
+ * @since 1.18.0
+ * @category computed
+ */
+export declare const stronglyConnectedComponents: <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => RefSubject.Computed<Array<Array<Graph.NodeIndex>>, Err, R>;
+/**
+ * Get a node's data.
+ * @since 1.18.0
+ * @category filtered
+ */
+export declare const getNode: {
+    (nodeIndex: Graph.NodeIndex): <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => RefSubject.Filtered<N, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, nodeIndex: Graph.NodeIndex): RefSubject.Filtered<N, Err, R>;
+};
+/**
+ * Get an edge's data.
+ * @since 1.18.0
+ * @category filtered
+ */
+export declare const getEdge: {
+    (edgeIndex: Graph.EdgeIndex): <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => RefSubject.Filtered<Graph.Edge<E>, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, edgeIndex: Graph.EdgeIndex): RefSubject.Filtered<Graph.Edge<E>, Err, R>;
+};
+/**
+ * Find a node matching a predicate.
+ * @since 1.18.0
+ * @category filtered
+ */
+export declare const findNode: {
+    <N>(predicate: (data: N) => boolean): <E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => RefSubject.Filtered<Graph.NodeIndex, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, predicate: (data: N) => boolean): RefSubject.Filtered<Graph.NodeIndex, Err, R>;
+};
+/**
+ * Find an edge matching a predicate.
+ * @since 1.18.0
+ * @category filtered
+ */
+export declare const findEdge: {
+    <E>(predicate: (edge: E) => boolean): <N, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>) => RefSubject.Filtered<Graph.EdgeIndex, Err, R>;
+    <N, E, T extends Graph.Kind, Err, R>(ref: RefGraph<N, E, T, Err, R>, predicate: (edge: E) => boolean): RefSubject.Filtered<Graph.EdgeIndex, Err, R>;
+};
+//# sourceMappingURL=RefGraph.d.ts.map

package/dist/RefSubject/RefGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RefGraph.d.ts","sourceRoot":"","sources":["../../src/RefSubject/RefGraph.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,KAAK,MAAM,MAAM,eAAe,CAAC;AAG7C,OAAO,KAAK,KAAK,MAAM,cAAc,CAAC;AAEtC,OAAO,KAAK,KAAK,KAAK,MAAM,cAAc,CAAC;AAC3C,OAAO,KAAK,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAC;AAE9C;;;;GAIG;AACH,MAAM,WAAW,QAAQ,CACvB,EAAE,CAAC,GAAG,CAAC,CAAC,EACR,EAAE,CAAC,GAAG,CAAC,CAAC,EACR,CAAC,SAAS,KAAK,CAAC,IAAI,GAAG,UAAU,EACjC,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,EAClB,GAAG,CAAC,CAAC,GAAG,KAAK,CACb,SAAQ,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;CAAG;AAEhE;;;;GAIG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACrD,OAAO,EACH,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GACpB,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAC3C,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GACtC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAE/D;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,CACrD,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,EAC/B,KAAK,EACL,CAAC,GAAG,KAAK,CAAC,KAAK,CAChB,CAEA;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,CACvD,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,EAAE,GAAG,CAAC,EACjC,KAAK,EACL,CAAC,GAAG,KAAK,CAAC,KAAK,CAChB,CAEA;AAMD;;;;GAIG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB,CAAC,CAAC,EACA,IAAI,EAAE,CAAC,GACN,CAAC,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,IAAI,EAAE,CAAC,GACN,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CAa/C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,UAAU,EAAE;IACvB,CACE,SAAS,EAAE,KAAK,CAAC,SAAS,GACzB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACpC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,SAAS,EAAE,KAAK,CAAC,SAAS,GACzB,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CAa/C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,UAAU,EAAE;IACvB,CAAC,CAAC,EACA,SAAS,EAAE,KAAK,CAAC,SAAS,EAC1B,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAChB,CAAC,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,SAAS,EAAE,KAAK,CAAC,SAAS,EAC1B,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAChB,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CAa/C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB,CAAC,CAAC,EACA,MAAM,EAAE,KAAK,CAAC,SAAS,EACvB,MAAM,EAAE,KAAK,CAAC,SAAS,EACvB,IAAI,EAAE,CAAC,GACN,CAAC,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,MAAM,EAAE,KAAK,CAAC,SAAS,EACvB,MAAM,EAAE,KAAK,CAAC,SAAS,EACvB,IAAI,EAAE,CAAC,GACN,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CAa/C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,UAAU,EAAE;IACvB,CACE,SAAS,EAAE,KAAK,CAAC,SAAS,GACzB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACpC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,SAAS,EAAE,KAAK,CAAC,SAAS,GACzB,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CAa/C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,UAAU,EAAE;IACvB,CAAC,CAAC,EACA,SAAS,EAAE,KAAK,CAAC,SAAS,EAC1B,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAChB,CAAC,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,SAAS,EAAE,KAAK,CAAC,SAAS,EAC1B,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAChB,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CAa/C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,QAAQ,EAAE;IACrB,CAAC,CAAC,EACA,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAChB,CAAC,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAChB,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CAa/C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,QAAQ,EAAE;IACrB,CAAC,CAAC,EACA,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAChB,CAAC,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAChB,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CAa/C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,WAAW,EAAE;IACxB,CAAC,CAAC,EACA,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAC9B,CAAC,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAC9B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CAa/C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,WAAW,EAAE;IACxB,CAAC,CAAC,EACA,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAC9B,CAAC,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAC9B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CAa/C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACxD,KAAK,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC7B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAKzC,CAAC;AAML;;;;GAIG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EAC1D,KAAK,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC7B,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAyC,CAAC;AAE/E;;;;GAIG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EAC1D,KAAK,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC7B,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAyC,CAAC;AAE/E;;;;GAIG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB,CACE,SAAS,EAAE,KAAK,CAAC,SAAS,GACzB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACpC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,SAAS,EAAE,KAAK,CAAC,SAAS,GACzB,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CASxC,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB,CACE,MAAM,EAAE,KAAK,CAAC,SAAS,EACvB,MAAM,EAAE,KAAK,CAAC,SAAS,GACtB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACpC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,MAAM,EAAE,KAAK,CAAC,SAAS,EACvB,MAAM,EAAE,KAAK,CAAC,SAAS,GACtB,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CASxC,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,SAAS,EAAE;IACtB,CACE,SAAS,EAAE,KAAK,CAAC,SAAS,GACzB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACpC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,SAAS,EAAE,KAAK,CAAC,SAAS,GACzB,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CASvD,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,EAAE;IAC9B,CACE,SAAS,EAAE,KAAK,CAAC,SAAS,EAC1B,SAAS,EAAE,KAAK,CAAC,SAAS,GACzB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACpC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,SAAS,EAAE,KAAK,CAAC,SAAS,EAC1B,SAAS,EAAE,KAAK,CAAC,SAAS,GACzB,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CASvD,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EAC1D,KAAK,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC7B,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAyC,CAAC;AAEhF;;;;GAIG;AACH,eAAO,MAAM,WAAW,GAAI,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EACtC,KAAK,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC,KACxC,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,CAA2C,CAAC;AAElF;;;;GAIG;AACH,eAAO,MAAM,mBAAmB,GAAI,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAC9C,KAAK,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC,KACxC,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CACZ,CAAC;AAEjD;;;;GAIG;AACH,eAAO,MAAM,2BAA2B,GAAI,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EAC5E,KAAK,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC7B,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CACJ,CAAC;AAMzD;;;;GAIG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB,CACE,SAAS,EAAE,KAAK,CAAC,SAAS,GACzB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACpC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,UAAU,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,SAAS,EAAE,KAAK,CAAC,SAAS,GACzB,UAAU,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CASlC,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB,CACE,SAAS,EAAE,KAAK,CAAC,SAAS,GACzB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACpC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,SAAS,EAAE,KAAK,CAAC,SAAS,GACzB,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CAS9C,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,QAAQ,EAAE;IACrB,CAAC,CAAC,EACA,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAC9B,CAAC,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAC9B,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CAShD,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,QAAQ,EAAE;IACrB,CAAC,CAAC,EACA,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAC9B,CAAC,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAC3B,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EACjC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC9B,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAC9B,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CAShD,CAAC"}

package/dist/RefSubject/RefGraph.js

@@ -0,0 +1,272 @@
+/**
+ * Extensions to RefSubject for working with Graph values
+ * @since 1.18.0
+ */
+import { equals } from "effect/Equal";
+import { dual } from "effect/Function";
+import * as Graph from "effect/Graph";
+import * as Option from "effect/Option";
+import * as RefSubject from "./RefSubject.js";
+/**
+ * Creates a new `RefGraph` from a Graph, `Effect`, or `Fx`.
+ * @since 1.18.0
+ * @category constructors
+ */
+export function make(initial) {
+    return RefSubject.make(initial, { eq: equals });
+}
+/**
+ * Creates a new empty directed RefGraph.
+ * @since 1.18.0
+ * @category constructors
+ */
+export function directed() {
+    return RefSubject.make(Graph.directed(), { eq: equals });
+}
+/**
+ * Creates a new empty undirected RefGraph.
+ * @since 1.18.0
+ * @category constructors
+ */
+export function undirected() {
+    return RefSubject.make(Graph.undirected(), { eq: equals });
+}
+// ========================================
+// Combinators
+// ========================================
+/**
+ * Add a node to the graph.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const addNode = dual(2, function addNode(ref, data) {
+    return RefSubject.update(ref, (g) => {
+        const mutable = Graph.beginMutation(g);
+        Graph.addNode(mutable, data);
+        return Graph.endMutation(mutable);
+    });
+});
+/**
+ * Remove a node from the graph.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const removeNode = dual(2, function removeNode(ref, nodeIndex) {
+    return RefSubject.update(ref, (g) => {
+        const mutable = Graph.beginMutation(g);
+        Graph.removeNode(mutable, nodeIndex);
+        return Graph.endMutation(mutable);
+    });
+});
+/**
+ * Update a node's data.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const updateNode = dual(3, function updateNode(ref, nodeIndex, f) {
+    return RefSubject.update(ref, (g) => {
+        const mutable = Graph.beginMutation(g);
+        Graph.updateNode(mutable, nodeIndex, f);
+        return Graph.endMutation(mutable);
+    });
+});
+/**
+ * Add an edge to the graph.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const addEdge = dual(4, function addEdge(ref, source, target, data) {
+    return RefSubject.update(ref, (g) => {
+        const mutable = Graph.beginMutation(g);
+        Graph.addEdge(mutable, source, target, data);
+        return Graph.endMutation(mutable);
+    });
+});
+/**
+ * Remove an edge from the graph.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const removeEdge = dual(2, function removeEdge(ref, edgeIndex) {
+    return RefSubject.update(ref, (g) => {
+        const mutable = Graph.beginMutation(g);
+        Graph.removeEdge(mutable, edgeIndex);
+        return Graph.endMutation(mutable);
+    });
+});
+/**
+ * Update an edge's data.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const updateEdge = dual(3, function updateEdge(ref, edgeIndex, f) {
+    return RefSubject.update(ref, (g) => {
+        const mutable = Graph.beginMutation(g);
+        Graph.updateEdge(mutable, edgeIndex, f);
+        return Graph.endMutation(mutable);
+    });
+});
+/**
+ * Map all node data.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const mapNodes = dual(2, function mapNodes(ref, f) {
+    return RefSubject.update(ref, (g) => {
+        const mutable = Graph.beginMutation(g);
+        Graph.mapNodes(mutable, f);
+        return Graph.endMutation(mutable);
+    });
+});
+/**
+ * Map all edge data.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const mapEdges = dual(2, function mapEdges(ref, f) {
+    return RefSubject.update(ref, (g) => {
+        const mutable = Graph.beginMutation(g);
+        Graph.mapEdges(mutable, f);
+        return Graph.endMutation(mutable);
+    });
+});
+/**
+ * Filter nodes.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const filterNodes = dual(2, function filterNodes(ref, predicate) {
+    return RefSubject.update(ref, (g) => {
+        const mutable = Graph.beginMutation(g);
+        Graph.filterNodes(mutable, predicate);
+        return Graph.endMutation(mutable);
+    });
+});
+/**
+ * Filter edges.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const filterEdges = dual(2, function filterEdges(ref, predicate) {
+    return RefSubject.update(ref, (g) => {
+        const mutable = Graph.beginMutation(g);
+        Graph.filterEdges(mutable, predicate);
+        return Graph.endMutation(mutable);
+    });
+});
+/**
+ * Reverse all edge directions.
+ * @since 1.18.0
+ * @category combinators
+ */
+export const reverse = (ref) => RefSubject.update(ref, (g) => {
+    const mutable = Graph.beginMutation(g);
+    Graph.reverse(mutable);
+    return Graph.endMutation(mutable);
+});
+// ========================================
+// Computed
+// ========================================
+/**
+ * Get the node count.
+ * @since 1.18.0
+ * @category computed
+ */
+export const nodeCount = (ref) => RefSubject.map(ref, Graph.nodeCount);
+/**
+ * Get the edge count.
+ * @since 1.18.0
+ * @category computed
+ */
+export const edgeCount = (ref) => RefSubject.map(ref, Graph.edgeCount);
+/**
+ * Check if a node exists.
+ * @since 1.18.0
+ * @category computed
+ */
+export const hasNode = dual(2, function hasNode(ref, nodeIndex) {
+    return RefSubject.map(ref, Graph.hasNode(nodeIndex));
+});
+/**
+ * Check if an edge exists.
+ * @since 1.18.0
+ * @category computed
+ */
+export const hasEdge = dual(3, function hasEdge(ref, source, target) {
+    return RefSubject.map(ref, Graph.hasEdge(source, target));
+});
+/**
+ * Get neighbors of a node.
+ * @since 1.18.0
+ * @category computed
+ */
+export const neighbors = dual(2, function neighbors(ref, nodeIndex) {
+    return RefSubject.map(ref, Graph.neighbors(nodeIndex));
+});
+/**
+ * Get directed neighbors of a node.
+ * @since 1.18.0
+ * @category computed
+ */
+export const neighborsDirected = dual(3, function neighborsDirected(ref, nodeIndex, direction) {
+    return RefSubject.map(ref, Graph.neighborsDirected(nodeIndex, direction));
+});
+/**
+ * Check if the graph is acyclic.
+ * @since 1.18.0
+ * @category computed
+ */
+export const isAcyclic = (ref) => RefSubject.map(ref, Graph.isAcyclic);
+/**
+ * Check if the graph is bipartite (undirected only).
+ * @since 1.18.0
+ * @category computed
+ */
+export const isBipartite = (ref) => RefSubject.map(ref, Graph.isBipartite);
+/**
+ * Get connected components (undirected only).
+ * @since 1.18.0
+ * @category computed
+ */
+export const connectedComponents = (ref) => RefSubject.map(ref, Graph.connectedComponents);
+/**
+ * Get strongly connected components.
+ * @since 1.18.0
+ * @category computed
+ */
+export const stronglyConnectedComponents = (ref) => RefSubject.map(ref, Graph.stronglyConnectedComponents);
+// ========================================
+// Filtered
+// ========================================
+/**
+ * Get a node's data.
+ * @since 1.18.0
+ * @category filtered
+ */
+export const getNode = dual(2, function getNode(ref, nodeIndex) {
+    return RefSubject.filterMap(ref, Graph.getNode(nodeIndex));
+});
+/**
+ * Get an edge's data.
+ * @since 1.18.0
+ * @category filtered
+ */
+export const getEdge = dual(2, function getEdge(ref, edgeIndex) {
+    return RefSubject.filterMap(ref, (g) => Option.fromUndefinedOr(Graph.getEdge(g, edgeIndex)));
+});
+/**
+ * Find a node matching a predicate.
+ * @since 1.18.0
+ * @category filtered
+ */
+export const findNode = dual(2, function findNode(ref, predicate) {
+    return RefSubject.filterMap(ref, (g) => Option.fromUndefinedOr(Graph.findNode(g, predicate)));
+});
+/**
+ * Find an edge matching a predicate.
+ * @since 1.18.0
+ * @category filtered
+ */
+export const findEdge = dual(2, function findEdge(ref, predicate) {
+    return RefSubject.filterMap(ref, (g) => Option.fromUndefinedOr(Graph.findEdge(g, predicate)));
+});