diff --git a/wasm/Cargo.lock b/wasm/Cargo.lock index d11a2228..0f9fac10 100644 --- a/wasm/Cargo.lock +++ b/wasm/Cargo.lock @@ -8,6 +8,17 @@ version = "0.2.21" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "683d7910e743518b0e34f1186f92494becacb047c7b6bf616c96772180fef923" +[[package]] +name = "async-trait" +version = "0.1.92" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "82f6aeea286b8eb4dd3431a1be1b59d290ace00f5bfd8e2a159bc2a05e2c1667" +dependencies = [ + "proc-macro2", + "quote", + "syn 3.0.3", +] + [[package]] name = "autocfg" version = "1.5.0" @@ -47,6 +58,12 @@ version = "3.19.1" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "5dd9dc738b7a8311c7ade152424974d8115f2cdad61e8dab8dac9f2362298510" +[[package]] +name = "cast" +version = "0.3.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "37b2a672a2cb129a2e41c10b1224bb368f9f37a2b16b612598138befd7b37eb5" + [[package]] name = "cc" version = "1.2.51" @@ -121,6 +138,30 @@ version = "0.2.0" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "77ce24cb58228fbb8aa041425bb1050850ac19177686ea6e0f41a70416f56fdb" +[[package]] +name = "futures-core" +version = "0.3.34" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "92d699e522242e69e3003b94ecc1f960f3a5e015aa7c5d7486e65ad01dd94f5e" + +[[package]] +name = "futures-task" +version = "0.3.34" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "cd417de3d1d015fc3bfd2b1ea46dfc7bab72ef86f1cc7cc9c78e728b34a6d1fd" + +[[package]] +name = "futures-util" +version = "0.3.34" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "0d50a92467f8ba5dd6e3ee5d4bd04d73ab2e4e1c44474a0674821dfce14b79bc" +dependencies = [ + "futures-core", + "futures-task", + "pin-project-lite", + "slab", +] + [[package]] name = "hashbrown" version = "0.15.5" @@ -178,13 +219,20 @@ dependencies = [ "either", ] +[[package]] +name = "itoa" +version = "1.0.18" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "8f42a60cbdf9a97f5d2305f08a87dc4e09308d1276d28c869c684d7777685682" + [[package]] name = "js-sys" -version = "0.3.77" +version = "0.3.106" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "1cfaf33c695fc6e08064efbc1f72ec937429614f25eef83af942d0e227c3a28f" +checksum = "7883d941dae510fb2d978fc3fe018c71c9e2892fd38854de3e8b92c2e5ad9cc5" dependencies = [ - "once_cell", + "cfg-if", + "futures-util", "wasm-bindgen", ] @@ -195,10 +243,16 @@ source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "bbd2bcb4c963f2ddae06a2efc7e9f3591312473c50c6685e1f298068316e66fe" [[package]] -name = "log" -version = "0.4.29" +name = "libm" +version = "0.2.16" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "5e5032e24019045c762d3c0f28f5b6b8bbf38563a65908389bf7978758920897" +checksum = "b6d2cec3eae94f9f509c767b45932f1ada8350c4bdb85af2fcab4a3c14807981" + +[[package]] +name = "memchr" +version = "2.8.3" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "cf8baf1c55e62ffcace7a9f06f4bd9cd3f0c4beb022d3b367256b91b87513d98" [[package]] name = "minicov" @@ -210,6 +264,15 @@ dependencies = [ "walkdir", ] +[[package]] +name = "nu-ansi-term" +version = "0.50.3" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "7957b9740744892f114936ab4a57b3f487491bbeafaf8083688b16841a4240e5" +dependencies = [ + "windows-sys", +] + [[package]] name = "num-traits" version = "0.2.19" @@ -217,6 +280,7 @@ source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "071dfc062690e90b734c0b2273ce72ad0ffa95f0c74596bc250dcfd960262841" dependencies = [ "autocfg", + "libm", ] [[package]] @@ -225,6 +289,12 @@ version = "1.21.3" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "42f5e15c9953c5e4ccceeb2e7382a716482c34515315f7b03532b8b4e8393d2d" +[[package]] +name = "oorandom" +version = "11.1.5" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "d6790f58c7ff633d8771f42965289203411a5e5c68388703c06e14f24770b41e" + [[package]] name = "petgraph" version = "0.8.3" @@ -237,6 +307,12 @@ dependencies = [ "serde", ] +[[package]] +name = "pin-project-lite" +version = "0.2.17" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "a89322df9ebe1c1578d689c92318e070967d1042b512afbe49518723f4e6d5cd" + [[package]] name = "proc-macro2" version = "1.0.104" @@ -311,12 +387,31 @@ dependencies = [ "syn 3.0.3", ] +[[package]] +name = "serde_json" +version = "1.0.154" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "e7e9cc8b1b85264074fbcc02a88680c4096b1e47df8f739dceb03bf482f04bd6" +dependencies = [ + "itoa", + "memchr", + "serde", + "serde_core", + "zmij", +] + [[package]] name = "shlex" version = "1.3.0" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "0fda2ff0d084019ba4d7c6f371c95d8fd75ce3524c3cb8fb653a3023f6323e64" +[[package]] +name = "slab" +version = "0.4.12" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "0c790de23124f9ab44544d7ac05d60440adc586479ce501c1d6d7da3cd8c9cf5" + [[package]] name = "smallvec" version = "1.16.2" @@ -351,6 +446,15 @@ dependencies = [ "unicode-ident", ] +[[package]] +name = "tokio" +version = "1.53.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "e95f91fcc7a621e8b030f6aa23c71fe9838ae2fb4d8118b75602a328f5144044" +dependencies = [ + "pin-project-lite", +] + [[package]] name = "unicode-ident" version = "1.0.22" @@ -384,48 +488,33 @@ dependencies = [ [[package]] name = "wasm-bindgen" -version = "0.2.100" +version = "0.2.129" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "1edc8929d7499fc4e8f0be2262a241556cfc54a0bea223790e71446f2aab1ef5" +checksum = "9bb54f33acc68fd454578d9820b0bde1a1a3d17aa17bb7b6595806d02886d409" dependencies = [ "cfg-if", "once_cell", "rustversion", "wasm-bindgen-macro", -] - -[[package]] -name = "wasm-bindgen-backend" -version = "0.2.100" -source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "2f0a0651a5c2bc21487bde11ee802ccaf4c51935d0d3d42a6101f98161700bc6" -dependencies = [ - "bumpalo", - "log", - "proc-macro2", - "quote", - "syn 2.0.112", "wasm-bindgen-shared", ] [[package]] name = "wasm-bindgen-futures" -version = "0.4.50" +version = "0.4.79" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "555d470ec0bc3bb57890405e5d4322cc9ea83cebb085523ced7be4144dac1e61" +checksum = "3cbab34de2d982e9b48e18d216d04c4a6f641066ff19ffb699980f591ee3610e" dependencies = [ - "cfg-if", "js-sys", - "once_cell", + "tokio", "wasm-bindgen", - "web-sys", ] [[package]] name = "wasm-bindgen-macro" -version = "0.2.100" +version = "0.2.129" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "7fe63fc6d09ed3792bd0897b314f53de8e16568c2b3f7982f468c0bf9bd0b407" +checksum = "2e29d0c35b16e224a7eeb5cd2d25e3e1968fbd65604117b44d3b789d00ee8535" dependencies = [ "quote", "wasm-bindgen-macro-support", @@ -433,59 +522,64 @@ dependencies = [ [[package]] name = "wasm-bindgen-macro-support" -version = "0.2.100" +version = "0.2.129" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "8ae87ea40c9f689fc23f209965b6fb8a99ad69aeeb0231408be24920604395de" +checksum = "6f501a8bc3719dba86ef8ae4728879c08001bea749eb1333ac5b91e040e2a6b7" dependencies = [ + "bumpalo", "proc-macro2", "quote", - "syn 2.0.112", - "wasm-bindgen-backend", + "syn 3.0.3", "wasm-bindgen-shared", ] [[package]] name = "wasm-bindgen-shared" -version = "0.2.100" +version = "0.2.129" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "1a05d73b933a847d6cccdda8f838a22ff101ad9bf93e33684f39c1f5f0eece3d" +checksum = "23f0c9c52aa7cd7d77769a4cfe2a9adb1b331f489a41d912ce14513d5ab995c6" dependencies = [ "unicode-ident", ] [[package]] name = "wasm-bindgen-test" -version = "0.3.50" +version = "0.3.79" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "66c8d5e33ca3b6d9fa3b4676d774c5778031d27a578c2b007f905acf816152c3" +checksum = "ae7499dfd45780a0a91d7ee6bb9ac51970a4479a41a89da443fdda5a39547d42" dependencies = [ + "async-trait", + "cast", "js-sys", + "libm", "minicov", + "nu-ansi-term", + "num-traits", + "oorandom", + "serde", + "serde_json", "wasm-bindgen", "wasm-bindgen-futures", "wasm-bindgen-test-macro", + "wasm-bindgen-test-shared", ] [[package]] name = "wasm-bindgen-test-macro" -version = "0.3.50" +version = "0.3.79" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "17d5042cc5fa009658f9a7333ef24291b1291a25b6382dd68862a7f3b969f69b" +checksum = "3b84b5ac638bfb168196a1a461fcc8f46a294a18b1b6be52133b4e0db122cc9f" dependencies = [ "proc-macro2", "quote", - "syn 2.0.112", + "syn 3.0.3", ] [[package]] -name = "web-sys" -version = "0.3.77" +name = "wasm-bindgen-test-shared" +version = "0.2.129" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "33b6dd2ef9186f1f2072e409e99cd22a975331a6b3591b12c764e0e55c60d5d2" -dependencies = [ - "js-sys", - "wasm-bindgen", -] +checksum = "4f692aa943ccd88363733b77063f32cfed5bc6cbea8e6e8b251b302f881606fe" [[package]] name = "web-time" @@ -520,3 +614,9 @@ checksum = "ae137229bcbd6cdf0f7b80a31df61766145077ddf49416a728b02cb3921ff3fc" dependencies = [ "windows-link", ] + +[[package]] +name = "zmij" +version = "1.0.23" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "29666d0abbfad1e3dc4dcf6144730dd3a3ab225bbbdac83319345b1b44ccfc1b" diff --git a/wasm/Cargo.toml b/wasm/Cargo.toml index b685a614..73074ddf 100644 --- a/wasm/Cargo.toml +++ b/wasm/Cargo.toml @@ -12,7 +12,7 @@ default = ["console_error_panic_hook"] test = [] [dependencies] -wasm-bindgen = "=0.2.100" +wasm-bindgen = "=0.2.129" # The `console_error_panic_hook` crate provides better debugging of panics by # logging them with `console.error`. This is great for development, but requires diff --git a/wasm/pkg/breadcrumbs_graph_wasm.d.ts b/wasm/pkg/breadcrumbs_graph_wasm.d.ts index 45fe48ee..1c0e02f1 100644 --- a/wasm/pkg/breadcrumbs_graph_wasm.d.ts +++ b/wasm/pkg/breadcrumbs_graph_wasm.d.ts @@ -1,174 +1,203 @@ /* tslint:disable */ /* eslint-disable @typescript-eslint/no-unsafe-function-type, @typescript-eslint/no-misused-new -- wasm-bindgen generates bare `Function` params and a static `new`; the bindings are generated, not hand-written. */ -export function create_graph(): NoteGraph; -export function create_edge_sorter(field: string, reverse: boolean): EdgeSorter; -export function sort_traversal_data(graph: NoteGraph, traversal_data: TraversalData[], sorter: EdgeSorter): TraversalData[]; -export function sort_edges(graph: NoteGraph, edges: EdgeStruct[], sorter: EdgeSorter): EdgeStruct[]; + export class AddEdgeGraphUpdate { - free(): void; - add_to_batch(batch: BatchGraphUpdate): void; - constructor(data: GCEdgeData); + free(): void; + [Symbol.dispose](): void; + add_to_batch(batch: BatchGraphUpdate): void; + constructor(data: GCEdgeData); } + export class AddNoteGraphUpdate { - free(): void; - add_to_batch(batch: BatchGraphUpdate): void; - constructor(data: GCNodeData); + free(): void; + [Symbol.dispose](): void; + add_to_batch(batch: BatchGraphUpdate): void; + constructor(data: GCNodeData); } + export class BatchGraphUpdate { - free(): void; - constructor(); + free(): void; + [Symbol.dispose](): void; + constructor(); } + export class EdgeData { - private constructor(); - free(): void; - toString(): string; - explicit: boolean; - round: number; - readonly edge_type: string; - readonly edge_source: string; + private constructor(); + free(): void; + [Symbol.dispose](): void; + toString(): string; + readonly edge_source: string; + readonly edge_type: string; + explicit: boolean; + round: number; } + export class EdgeList { - private constructor(); - free(): void; - group_by_type(): GroupedEdgeList; - toString(): string; - /** - * Returns a sorted clone of the edges. - */ - get_sorted_edges(graph: NoteGraph, sorter: EdgeSorter): EdgeStruct[]; - last(): EdgeStruct | undefined; - first(): EdgeStruct | undefined; - /** - * Consumes the [EdgeList] and returns the edges as a Vec (or array for - * JS). - */ - to_array(): EdgeStruct[]; - /** - * Returns a clone of the edges. - */ - get_edges(): EdgeStruct[]; + private constructor(); + free(): void; + [Symbol.dispose](): void; + first(): EdgeStruct | undefined; + /** + * Returns a clone of the edges. + */ + get_edges(): EdgeStruct[]; + /** + * Returns a sorted clone of the edges. + */ + get_sorted_edges(graph: NoteGraph, sorter: EdgeSorter): EdgeStruct[]; + group_by_type(): GroupedEdgeList; + last(): EdgeStruct | undefined; + toString(): string; + /** + * Consumes the [EdgeList] and returns the edges as a Vec (or array for + * JS). + */ + to_array(): EdgeStruct[]; } + export class EdgeSorter { - private constructor(); - free(): void; + private constructor(); + free(): void; + [Symbol.dispose](): void; } + export class EdgeStruct { - private constructor(); - free(): void; - edge_source(graph: NoteGraph): string; - source_data(graph: NoteGraph): NodeData; - source_path(graph: NoteGraph): string; - target_data(graph: NoteGraph): NodeData; - target_path(graph: NoteGraph): string; - is_self_loop(): boolean; - source_resolved(graph: NoteGraph): boolean; - target_resolved(graph: NoteGraph): boolean; - toString(): string; - stringify_source(graph: NoteGraph, options: NodeStringifyOptions): string; - stringify_target(graph: NoteGraph, options: NodeStringifyOptions): string; - get_attribute_label(graph: NoteGraph, attributes: string[]): string; - matches_edge_filter(graph: NoteGraph, edge_types?: string[] | null): boolean; - round(graph: NoteGraph): number; - explicit(graph: NoteGraph): boolean; - edge_data(graph: NoteGraph): EdgeData; - readonly edge_type: string; + private constructor(); + free(): void; + [Symbol.dispose](): void; + edge_data(graph: NoteGraph): EdgeData; + edge_source(graph: NoteGraph): string; + explicit(graph: NoteGraph): boolean; + get_attribute_label(graph: NoteGraph, attributes: string[]): string; + is_self_loop(): boolean; + matches_edge_filter(graph: NoteGraph, edge_types?: string[] | null): boolean; + round(graph: NoteGraph): number; + source_data(graph: NoteGraph): NodeData; + source_path(graph: NoteGraph): string; + source_resolved(graph: NoteGraph): boolean; + stringify_source(graph: NoteGraph, options: NodeStringifyOptions): string; + stringify_target(graph: NoteGraph, options: NodeStringifyOptions): string; + target_data(graph: NoteGraph): NodeData; + target_path(graph: NoteGraph): string; + target_resolved(graph: NoteGraph): boolean; + toString(): string; + readonly edge_type: string; } + export class FlatTraversalData { - private constructor(); - free(): void; - get_attribute_label(graph: NoteGraph, attributes: string[]): string; - to_js_rendering_obj(graph: NoteGraph, str_opt: NodeStringifyOptions, attributes: string[]): unknown; - /** - * the edge struct that was traversed - */ - edge: EdgeStruct; - /** - * the depth of the node in the traversal - */ - depth: number; - /** - * the number of total children of the node, so also children of children - */ - number_of_children: number; - /** - * the children of the node - */ - children: Uint32Array; - has_cut_of_children: boolean; + private constructor(); + free(): void; + [Symbol.dispose](): void; + get_attribute_label(graph: NoteGraph, attributes: string[]): string; + to_js_rendering_obj(graph: NoteGraph, str_opt: NodeStringifyOptions, attributes: string[]): unknown; + /** + * the children of the node + */ + children: Uint32Array; + /** + * the depth of the node in the traversal + */ + depth: number; + /** + * the edge struct that was traversed + */ + edge: EdgeStruct; + has_cut_of_children: boolean; + /** + * the number of total children of the node, so also children of children + */ + number_of_children: number; } + export class FlatTraversalResult { - private constructor(); - free(): void; - data_at_index(index: number): FlatTraversalData | undefined; - toString(): string; - children_at_index(index: number): Uint32Array | undefined; - rendering_obj_at_index(index: number, graph: NoteGraph, str_opt: NodeStringifyOptions, attributes: string[]): unknown; - /** - * Sorts the flat traversal data with a given edge sorter. - * This is not as efficient as sorting the traversal data before flattening - * it, but it's still a lot better than sorting then re-flatten. - */ - sort(graph: NoteGraph, sorter: EdgeSorter): void; - is_empty(): boolean; - data: FlatTraversalData[]; - node_count: number; - max_depth: number; - hit_depth_limit: boolean; - traversal_time: bigint; - entry_nodes: Uint32Array; + private constructor(); + free(): void; + [Symbol.dispose](): void; + children_at_index(index: number): Uint32Array | undefined; + data_at_index(index: number): FlatTraversalData | undefined; + is_empty(): boolean; + rendering_obj_at_index(index: number, graph: NoteGraph, str_opt: NodeStringifyOptions, attributes: string[]): unknown; + /** + * Sorts the flat traversal data with a given edge sorter. + * This is not as efficient as sorting the traversal data before flattening + * it, but it's still a lot better than sorting then re-flatten. + */ + sort(graph: NoteGraph, sorter: EdgeSorter): void; + toString(): string; + data: FlatTraversalData[]; + entry_nodes: Uint32Array; + hit_depth_limit: boolean; + max_depth: number; + node_count: number; + traversal_time: bigint; } + export class GCEdgeData { - free(): void; - toString(): string; - constructor(source: string, target: string, edge_type: string, edge_source: string); - readonly edge_source: string; - readonly source: string; - readonly target: string; - readonly edge_type: string; + free(): void; + [Symbol.dispose](): void; + constructor(source: string, target: string, edge_type: string, edge_source: string); + toString(): string; + readonly edge_source: string; + readonly edge_type: string; + readonly source: string; + readonly target: string; } + export class GCNodeData { - free(): void; - toString(): string; - constructor(path: string, aliases: string[], resolved: boolean, ignore_in_edges: boolean, ignore_out_edges: boolean); + free(): void; + [Symbol.dispose](): void; + constructor(path: string, aliases: string[], resolved: boolean, ignore_in_edges: boolean, ignore_out_edges: boolean); + toString(): string; } + /** * A edge list that is grouped by edge type. */ export class GroupedEdgeList { - private constructor(); - free(): void; - toString(): string; - get_sorted_edges(edge_type: string, graph: NoteGraph, sorter: EdgeSorter): EdgeStruct[] | undefined; - get_edges(edge_type: string): EdgeStruct[] | undefined; + private constructor(); + free(): void; + [Symbol.dispose](): void; + get_edges(edge_type: string): EdgeStruct[] | undefined; + get_sorted_edges(edge_type: string, graph: NoteGraph, sorter: EdgeSorter): EdgeStruct[] | undefined; + toString(): string; } + export class MermaidGraphData { - private constructor(); - free(): void; - toString(): string; - mermaid: string; - traversal_time: bigint; - total_time: bigint; + private constructor(); + free(): void; + [Symbol.dispose](): void; + toString(): string; + mermaid: string; + total_time: bigint; + traversal_time: bigint; } + export class MermaidGraphOptions { - free(): void; - toString(): string; - constructor(active_node: string | null | undefined, init_line: string, chart_type: string, direction: string, collapse_opposing_edges: boolean, edge_label_attributes: string[], edge_sorter: EdgeSorter | null | undefined, node_label_fn: Function | null | undefined, link_nodes: boolean, show_arrow_points: boolean, field_arrow_keys: string[], field_arrow_values: string[]); + free(): void; + [Symbol.dispose](): void; + constructor(active_node: string | null | undefined, init_line: string, chart_type: string, direction: string, collapse_opposing_edges: boolean, edge_label_attributes: string[], edge_sorter: EdgeSorter | null | undefined, node_label_fn: Function | null | undefined, link_nodes: boolean, show_arrow_points: boolean, field_arrow_keys: string[], field_arrow_values: string[]); + toString(): string; } + export class NodeData { - free(): void; - toString(): string; - constructor(path: string, aliases: string[], resolved: boolean, ignore_in_edges: boolean, ignore_out_edges: boolean); - path: string; - aliases: string[]; - resolved: boolean; - ignore_in_edges: boolean; - ignore_out_edges: boolean; + free(): void; + [Symbol.dispose](): void; + constructor(path: string, aliases: string[], resolved: boolean, ignore_in_edges: boolean, ignore_out_edges: boolean); + toString(): string; + aliases: string[]; + ignore_in_edges: boolean; + ignore_out_edges: boolean; + path: string; + resolved: boolean; } + export class NodeStringifyOptions { - free(): void; - constructor(extension: boolean, folder: boolean, alias: boolean, trim_basename_delimiter?: string | null); - stringify_node(node: NodeData): string; + free(): void; + [Symbol.dispose](): void; + constructor(extension: boolean, folder: boolean, alias: boolean, trim_basename_delimiter?: string | null); + stringify_node(node: NodeData): string; } + /** * A graph that stores notes and their relationships. * @@ -179,481 +208,515 @@ export class NodeStringifyOptions { * present in the graph. */ export class NoteGraph { - private constructor(); - free(): void; - /** - * Runs a recursive traversal of the graph. - */ - rec_traverse(options: TraversalOptions): TraversalResult; - /** - * Runs a recursive traversal of the graph and post-processes the result. - * The post-processed result is more efficient to work with from - * JavaScript. - */ - rec_traverse_and_process(options: TraversalOptions, postprocess_options: TraversalPostprocessOptions): FlatTraversalResult; - /** - * Returns all edge types that are present in the graph. - */ - edge_types(): string[]; - /** - * Builds the graph from a list of nodes, edges, and transitive rules. - * All existing data in the graph is removed. - */ - build_graph(nodes: GCNodeData[], edges: GCEdgeData[], transitive_rules: TransitiveGraphRule[]): void; - /** - * Applies a batch update to the graph. - * Throws an error if the update fails, and leave the graph in an - * inconsistent state. - * - * TODO: some security against errors leaving the graph in an inconsistent - * state. Maybe safely clear the entire graph. - */ - apply_update(update: BatchGraphUpdate): void; - /** - * Iterate all edges in the graph and call the provided function with each - * [EdgeData]. - */ - iterate_edges(f: Function): void; - /** - * Iterate all nodes in the graph and call the provided function with each - * [NodeData]. - */ - iterate_nodes(f: Function): void; - /** - * Notify the JS side that the graph has been updated. - */ - notify_update(): void; - /** - * Checks if a node is resolved. - * Returns false if the node is not found. - */ - is_node_resolved(node: string): boolean; - /** - * Get all incoming edges to a node. - */ - get_incoming_edges(node: string): EdgeList; - /** - * Get all outgoing edges from a node. - */ - get_outgoing_edges(node: string): EdgeList; - /** - * Set the update callback. - * This will be called after every update to the graph. - */ - set_update_callback(callback: Function): void; - /** - * Get all outgoing edges from a node, filtered by edge type. - */ - get_filtered_outgoing_edges(node: string, edge_types?: string[] | null): EdgeList; - /** - * Get all outgoing edges from a node, filtered and grouped by edge type. - */ - get_filtered_grouped_outgoing_edges(node: string, edge_types?: string[] | null): GroupedEdgeList; - log(): void; - static new(): NoteGraph; - get_node(node: string): NodeData | undefined; - /** - * Checks if a node exists in the graph. - */ - has_node(node: string): boolean; - generate_mermaid_graph(traversal_options: TraversalOptions, diagram_options: MermaidGraphOptions): MermaidGraphData; + private constructor(); + free(): void; + [Symbol.dispose](): void; + /** + * Applies a batch update to the graph. + * Throws an error if the update fails, and leave the graph in an + * inconsistent state. + * + * TODO: some security against errors leaving the graph in an inconsistent + * state. Maybe safely clear the entire graph. + */ + apply_update(update: BatchGraphUpdate): void; + /** + * Builds the graph from a list of nodes, edges, and transitive rules. + * All existing data in the graph is removed. + */ + build_graph(nodes: GCNodeData[], edges: GCEdgeData[], transitive_rules: TransitiveGraphRule[]): void; + /** + * Returns all edge types that are present in the graph. + */ + edge_types(): string[]; + generate_mermaid_graph(traversal_options: TraversalOptions, diagram_options: MermaidGraphOptions): MermaidGraphData; + /** + * Get all outgoing edges from a node, filtered and grouped by edge type. + */ + get_filtered_grouped_outgoing_edges(node: string, edge_types?: string[] | null): GroupedEdgeList; + /** + * Get all outgoing edges from a node, filtered by edge type. + */ + get_filtered_outgoing_edges(node: string, edge_types?: string[] | null): EdgeList; + /** + * Get all incoming edges to a node. + */ + get_incoming_edges(node: string): EdgeList; + get_node(node: string): NodeData | undefined; + /** + * Get all outgoing edges from a node. + */ + get_outgoing_edges(node: string): EdgeList; + /** + * Checks if a node exists in the graph. + */ + has_node(node: string): boolean; + /** + * Checks if a node is resolved. + * Returns false if the node is not found. + */ + is_node_resolved(node: string): boolean; + /** + * Iterate all edges in the graph and call the provided function with each + * [EdgeData]. + */ + iterate_edges(f: Function): void; + /** + * Iterate all nodes in the graph and call the provided function with each + * [NodeData]. + */ + iterate_nodes(f: Function): void; + log(): void; + static new(): NoteGraph; + /** + * Notify the JS side that the graph has been updated. + */ + notify_update(): void; + /** + * Runs a recursive traversal of the graph. + */ + rec_traverse(options: TraversalOptions): TraversalResult; + /** + * Runs a recursive traversal of the graph and post-processes the result. + * The post-processed result is more efficient to work with from + * JavaScript. + */ + rec_traverse_and_process(options: TraversalOptions, postprocess_options: TraversalPostprocessOptions): FlatTraversalResult; + /** + * Set the update callback. + * This will be called after every update to the graph. + */ + set_update_callback(callback: Function): void; } + export class NoteGraphError { - free(): void; - toString(): string; - constructor(message: string); - readonly message: string; + free(): void; + [Symbol.dispose](): void; + constructor(message: string); + toString(): string; + readonly message: string; } + export class Path { - private constructor(); - free(): void; - toString(): string; - get_first_target(graph: NoteGraph): string | undefined; - equals(other: Path): boolean; - length(): number; - truncate(limit: number): Path; - edges: EdgeStruct[]; - readonly reverse_edges: EdgeStruct[]; + private constructor(); + free(): void; + [Symbol.dispose](): void; + equals(other: Path): boolean; + get_first_target(graph: NoteGraph): string | undefined; + length(): number; + toString(): string; + truncate(limit: number): Path; + edges: EdgeStruct[]; + readonly reverse_edges: EdgeStruct[]; } + export class PathList { - private constructor(); - free(): void; - toString(): string; - select(selection: string): PathList; - /** - * Cuts off all paths at a given depth, then sorts and deduplicates them. - */ - process(graph: NoteGraph, depth: number): Path[]; - to_paths(): Path[]; - max_depth(): number; + private constructor(); + free(): void; + [Symbol.dispose](): void; + max_depth(): number; + /** + * Cuts off all paths at a given depth, then sorts and deduplicates them. + */ + process(graph: NoteGraph, depth: number): Path[]; + select(selection: string): PathList; + toString(): string; + to_paths(): Path[]; } + export class RemoveEdgeGraphUpdate { - free(): void; - add_to_batch(batch: BatchGraphUpdate): void; - constructor(from: string, to: string, edge_type: string); + free(): void; + [Symbol.dispose](): void; + add_to_batch(batch: BatchGraphUpdate): void; + constructor(from: string, to: string, edge_type: string); } + export class RemoveNoteGraphUpdate { - free(): void; - add_to_batch(batch: BatchGraphUpdate): void; - constructor(data: string); + free(): void; + [Symbol.dispose](): void; + add_to_batch(batch: BatchGraphUpdate): void; + constructor(data: string); } + export class RenameNoteGraphUpdate { - free(): void; - add_to_batch(batch: BatchGraphUpdate): void; - constructor(old_name: string, new_name: string); + free(): void; + [Symbol.dispose](): void; + add_to_batch(batch: BatchGraphUpdate): void; + constructor(old_name: string, new_name: string); } + export class TransitiveGraphRule { - free(): void; - toString(): string; - create_example_graph(): NoteGraph; - constructor(name: string, path: string[], edge_type: string, rounds: number, can_loop: boolean, close_reversed: boolean); + free(): void; + [Symbol.dispose](): void; + create_example_graph(): NoteGraph; + constructor(name: string, path: string[], edge_type: string, rounds: number, can_loop: boolean, close_reversed: boolean); + toString(): string; } + export class TransitiveRulesGraphUpdate { - free(): void; - add_to_batch(batch: BatchGraphUpdate): void; - constructor(new_rules: TransitiveGraphRule[]); + free(): void; + [Symbol.dispose](): void; + add_to_batch(batch: BatchGraphUpdate): void; + constructor(new_rules: TransitiveGraphRule[]); } + export class TraversalData { - free(): void; - toString(): string; - rec_sort_children(graph: NoteGraph, sorter: EdgeSorter): void; - constructor(edge: EdgeStruct, depth: number, number_of_children: number, children: TraversalData[], has_cut_of_children: boolean); - /** - * the edge struct that was traversed - */ - edge: EdgeStruct; - /** - * the depth of the node in the traversal - */ - depth: number; - /** - * the number of total children of the node, so also children of children - */ - number_of_children: number; - /** - * the children of the node - */ - children: TraversalData[]; - /** - * whether the node has a cut of children due to being at the depth limit - * of a traversal, or similar - */ - has_cut_of_children: boolean; + free(): void; + [Symbol.dispose](): void; + constructor(edge: EdgeStruct, depth: number, number_of_children: number, children: TraversalData[], has_cut_of_children: boolean); + rec_sort_children(graph: NoteGraph, sorter: EdgeSorter): void; + toString(): string; + /** + * the children of the node + */ + children: TraversalData[]; + /** + * the depth of the node in the traversal + */ + depth: number; + /** + * the edge struct that was traversed + */ + edge: EdgeStruct; + /** + * whether the node has a cut of children due to being at the depth limit + * of a traversal, or similar + */ + has_cut_of_children: boolean; + /** + * the number of total children of the node, so also children of children + */ + number_of_children: number; } + export class TraversalOptions { - free(): void; - toString(): string; - constructor(entry_nodes: string[], edge_types: string[] | null | undefined, max_depth: number, max_traversal_count: number, separate_edges: boolean, dataview_from_paths?: string[] | null); - entry_nodes: string[]; - /** - * if this is None, all edge types will be traversed - */ - get edge_types(): string[] | undefined; - /** - * if this is None, all edge types will be traversed - */ - set edge_types(value: string[] | null | undefined); - max_depth: number; - max_traversal_count: number; - /** - * if true, multiple traversals - one for each edge type - will be - * performed and the results will be combined. if false, one traversal - * over all edge types will be performed - */ - separate_edges: boolean; - /** - * When set, only edges whose target node path is in this set will be - * traversed. Used for the `dataview-from` codeblock filter. - */ - get dataview_from_paths(): string[] | undefined; - /** - * When set, only edges whose target node path is in this set will be - * traversed. Used for the `dataview-from` codeblock filter. - */ - set dataview_from_paths(value: string[] | null | undefined); + free(): void; + [Symbol.dispose](): void; + constructor(entry_nodes: string[], edge_types: string[] | null | undefined, max_depth: number, max_traversal_count: number, separate_edges: boolean, dataview_from_paths?: string[] | null); + toString(): string; + /** + * When set, only edges whose target node path is in this set will be + * traversed. Used for the `dataview-from` codeblock filter. + */ + get dataview_from_paths(): string[] | undefined; + /** + * When set, only edges whose target node path is in this set will be + * traversed. Used for the `dataview-from` codeblock filter. + */ + set dataview_from_paths(value: string[] | null | undefined); + /** + * if this is None, all edge types will be traversed + */ + get edge_types(): string[] | undefined; + /** + * if this is None, all edge types will be traversed + */ + set edge_types(value: string[] | null | undefined); + entry_nodes: string[]; + max_depth: number; + max_traversal_count: number; + /** + * if true, multiple traversals - one for each edge type - will be + * performed and the results will be combined. if false, one traversal + * over all edge types will be performed + */ + separate_edges: boolean; } + export class TraversalPostprocessOptions { - free(): void; - static without_sorter(flatten: boolean): TraversalPostprocessOptions; - toString(): string; - constructor(sorter: EdgeSorter, flatten: boolean); - get sorter(): EdgeSorter | undefined; - set sorter(value: EdgeSorter | null | undefined); - flatten: boolean; + free(): void; + [Symbol.dispose](): void; + constructor(sorter: EdgeSorter, flatten: boolean); + toString(): string; + static without_sorter(flatten: boolean): TraversalPostprocessOptions; + flatten: boolean; + get sorter(): EdgeSorter | undefined; + set sorter(value: EdgeSorter | null | undefined); } + export class TraversalResult { - free(): void; - toString(): string; - constructor(data: TraversalData[], traversal_time: bigint); - is_empty(): boolean; - to_paths(): PathList; - data: TraversalData[]; - node_count: number; - max_depth: number; - hit_depth_limit: boolean; - traversal_time: bigint; + free(): void; + [Symbol.dispose](): void; + is_empty(): boolean; + constructor(data: TraversalData[], traversal_time: bigint); + toString(): string; + to_paths(): PathList; + data: TraversalData[]; + hit_depth_limit: boolean; + max_depth: number; + node_count: number; + traversal_time: bigint; } +export function create_edge_sorter(field: string, reverse: boolean): EdgeSorter; + +export function create_graph(): NoteGraph; + +export function sort_edges(graph: NoteGraph, edges: EdgeStruct[], sorter: EdgeSorter): EdgeStruct[]; + +export function sort_traversal_data(graph: NoteGraph, traversal_data: TraversalData[], sorter: EdgeSorter): TraversalData[]; + export type InitInput = RequestInfo | URL | Response | BufferSource | WebAssembly.Module; export interface InitOutput { - readonly memory: WebAssembly.Memory; - readonly create_graph: () => number; - readonly __wbg_get_path_edges: (a: number) => [number, number]; - readonly __wbg_path_free: (a: number, b: number) => void; - readonly __wbg_pathlist_free: (a: number, b: number) => void; - readonly __wbg_set_path_edges: (a: number, b: number, c: number) => void; - readonly path_equals: (a: number, b: number) => number; - readonly path_get_first_target: (a: number, b: number) => [number, number, number, number]; - readonly path_length: (a: number) => number; - readonly path_reverse_edges: (a: number) => [number, number]; - readonly path_toString: (a: number) => [number, number]; - readonly path_truncate: (a: number, b: number) => number; - readonly pathlist_max_depth: (a: number) => number; - readonly pathlist_process: (a: number, b: number, c: number) => [number, number, number, number]; - readonly pathlist_select: (a: number, b: number, c: number) => number; - readonly pathlist_toString: (a: number) => [number, number]; - readonly pathlist_to_paths: (a: number) => [number, number]; - readonly __wbg_edgestruct_free: (a: number, b: number) => void; - readonly edgestruct_edge_data: (a: number, b: number) => [number, number, number]; - readonly edgestruct_edge_source: (a: number, b: number) => [number, number, number, number]; - readonly edgestruct_edge_type: (a: number) => [number, number]; - readonly edgestruct_explicit: (a: number, b: number) => [number, number, number]; - readonly edgestruct_get_attribute_label: (a: number, b: number, c: number, d: number) => [number, number, number, number]; - readonly edgestruct_is_self_loop: (a: number) => number; - readonly edgestruct_matches_edge_filter: (a: number, b: number, c: number, d: number) => [number, number, number]; - readonly edgestruct_round: (a: number, b: number) => [number, number, number]; - readonly edgestruct_source_data: (a: number, b: number) => [number, number, number]; - readonly edgestruct_source_path: (a: number, b: number) => [number, number, number, number]; - readonly edgestruct_source_resolved: (a: number, b: number) => [number, number, number]; - readonly edgestruct_stringify_source: (a: number, b: number, c: number) => [number, number, number, number]; - readonly edgestruct_stringify_target: (a: number, b: number, c: number) => [number, number, number, number]; - readonly edgestruct_target_data: (a: number, b: number) => [number, number, number]; - readonly edgestruct_target_path: (a: number, b: number) => [number, number, number, number]; - readonly edgestruct_target_resolved: (a: number, b: number) => [number, number, number]; - readonly edgestruct_toString: (a: number) => [number, number]; - readonly notegraph_rec_traverse: (a: number, b: number) => [number, number, number]; - readonly notegraph_rec_traverse_and_process: (a: number, b: number, c: number) => [number, number, number]; - readonly __wbg_nodestringifyoptions_free: (a: number, b: number) => void; - readonly nodestringifyoptions_new: (a: number, b: number, c: number, d: number, e: number) => number; - readonly nodestringifyoptions_stringify_node: (a: number, b: number) => [number, number]; - readonly __wbg_batchgraphupdate_free: (a: number, b: number) => void; - readonly batchgraphupdate_new: () => number; - readonly __wbg_transitivegraphrule_free: (a: number, b: number) => void; - readonly transitivegraphrule_create_example_graph: (a: number) => [number, number, number]; - readonly transitivegraphrule_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number) => number; - readonly transitivegraphrule_toString: (a: number) => [number, number]; - readonly __wbg_gcedgedata_free: (a: number, b: number) => void; - readonly __wbg_gcnodedata_free: (a: number, b: number) => void; - readonly gcedgedata_edge_source: (a: number) => [number, number]; - readonly gcedgedata_edge_type: (a: number) => [number, number]; - readonly gcedgedata_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number) => number; - readonly gcedgedata_source: (a: number) => [number, number]; - readonly gcedgedata_target: (a: number) => [number, number]; - readonly gcedgedata_toString: (a: number) => [number, number]; - readonly gcnodedata_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => number; - readonly gcnodedata_toString: (a: number) => [number, number]; - readonly __wbg_notegraph_free: (a: number, b: number) => void; - readonly notegraph_apply_update: (a: number, b: number) => [number, number]; - readonly notegraph_build_graph: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => [number, number]; - readonly notegraph_edge_types: (a: number) => [number, number]; - readonly notegraph_get_filtered_grouped_outgoing_edges: (a: number, b: number, c: number, d: number, e: number) => number; - readonly notegraph_get_filtered_outgoing_edges: (a: number, b: number, c: number, d: number, e: number) => number; - readonly notegraph_get_incoming_edges: (a: number, b: number, c: number) => number; - readonly notegraph_get_node: (a: number, b: number, c: number) => number; - readonly notegraph_get_outgoing_edges: (a: number, b: number, c: number) => number; - readonly notegraph_has_node: (a: number, b: number, c: number) => number; - readonly notegraph_is_node_resolved: (a: number, b: number, c: number) => number; - readonly notegraph_iterate_edges: (a: number, b: unknown) => void; - readonly notegraph_iterate_nodes: (a: number, b: unknown) => void; - readonly notegraph_log: (a: number) => void; - readonly notegraph_new: () => number; - readonly notegraph_notify_update: (a: number) => void; - readonly notegraph_set_update_callback: (a: number, b: unknown) => void; - readonly __wbg_edgelist_free: (a: number, b: number) => void; - readonly __wbg_groupededgelist_free: (a: number, b: number) => void; - readonly edgelist_first: (a: number) => number; - readonly edgelist_get_edges: (a: number) => [number, number]; - readonly edgelist_get_sorted_edges: (a: number, b: number, c: number) => [number, number, number, number]; - readonly edgelist_group_by_type: (a: number) => number; - readonly edgelist_last: (a: number) => number; - readonly edgelist_toString: (a: number) => [number, number]; - readonly edgelist_to_array: (a: number) => [number, number]; - readonly groupededgelist_get_edges: (a: number, b: number, c: number) => [number, number]; - readonly groupededgelist_get_sorted_edges: (a: number, b: number, c: number, d: number, e: number) => [number, number, number, number]; - readonly groupededgelist_toString: (a: number) => [number, number]; - readonly __wbg_get_mermaidgraphdata_mermaid: (a: number) => [number, number]; - readonly __wbg_get_mermaidgraphdata_total_time: (a: number) => bigint; - readonly __wbg_get_mermaidgraphdata_traversal_time: (a: number) => bigint; - readonly __wbg_mermaidgraphdata_free: (a: number, b: number) => void; - readonly __wbg_mermaidgraphoptions_free: (a: number, b: number) => void; - readonly __wbg_set_mermaidgraphdata_mermaid: (a: number, b: number, c: number) => void; - readonly __wbg_set_mermaidgraphdata_total_time: (a: number, b: bigint) => void; - readonly __wbg_set_mermaidgraphdata_traversal_time: (a: number, b: bigint) => void; - readonly mermaidgraphdata_toString: (a: number) => [number, number]; - readonly mermaidgraphoptions_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number, j: number, k: number, l: number, m: number, n: number, o: number, p: number, q: number, r: number, s: number) => number; - readonly mermaidgraphoptions_toString: (a: number) => [number, number]; - readonly notegraph_generate_mermaid_graph: (a: number, b: number, c: number) => [number, number, number]; - readonly __wbg_notegrapherror_free: (a: number, b: number) => void; - readonly notegrapherror_message: (a: number) => [number, number]; - readonly notegrapherror_new: (a: number, b: number) => number; - readonly notegrapherror_toString: (a: number) => [number, number]; - readonly __wbg_get_nodedata_aliases: (a: number) => [number, number]; - readonly __wbg_get_nodedata_ignore_in_edges: (a: number) => number; - readonly __wbg_get_nodedata_ignore_out_edges: (a: number) => number; - readonly __wbg_get_nodedata_path: (a: number) => [number, number]; - readonly __wbg_get_nodedata_resolved: (a: number) => number; - readonly __wbg_nodedata_free: (a: number, b: number) => void; - readonly __wbg_set_nodedata_aliases: (a: number, b: number, c: number) => void; - readonly __wbg_set_nodedata_ignore_in_edges: (a: number, b: number) => void; - readonly __wbg_set_nodedata_ignore_out_edges: (a: number, b: number) => void; - readonly __wbg_set_nodedata_path: (a: number, b: number, c: number) => void; - readonly __wbg_set_nodedata_resolved: (a: number, b: number) => void; - readonly nodedata_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => number; - readonly nodedata_toString: (a: number) => [number, number]; - readonly __wbg_edgesorter_free: (a: number, b: number) => void; - readonly create_edge_sorter: (a: number, b: number, c: number) => [number, number, number]; - readonly sort_edges: (a: number, b: number, c: number, d: number) => [number, number, number, number]; - readonly sort_traversal_data: (a: number, b: number, c: number, d: number) => [number, number, number, number]; - readonly __wbg_addedgegraphupdate_free: (a: number, b: number) => void; - readonly __wbg_addnotegraphupdate_free: (a: number, b: number) => void; - readonly __wbg_removeedgegraphupdate_free: (a: number, b: number) => void; - readonly __wbg_removenotegraphupdate_free: (a: number, b: number) => void; - readonly __wbg_renamenotegraphupdate_free: (a: number, b: number) => void; - readonly __wbg_transitiverulesgraphupdate_free: (a: number, b: number) => void; - readonly addedgegraphupdate_add_to_batch: (a: number, b: number) => void; - readonly addedgegraphupdate_new: (a: number) => number; - readonly addnotegraphupdate_add_to_batch: (a: number, b: number) => void; - readonly addnotegraphupdate_new: (a: number) => number; - readonly removeedgegraphupdate_add_to_batch: (a: number, b: number) => void; - readonly removeedgegraphupdate_new: (a: number, b: number, c: number, d: number, e: number, f: number) => number; - readonly removenotegraphupdate_add_to_batch: (a: number, b: number) => void; - readonly removenotegraphupdate_new: (a: number, b: number) => number; - readonly renamenotegraphupdate_add_to_batch: (a: number, b: number) => void; - readonly renamenotegraphupdate_new: (a: number, b: number, c: number, d: number) => number; - readonly transitiverulesgraphupdate_add_to_batch: (a: number, b: number) => void; - readonly transitiverulesgraphupdate_new: (a: number, b: number) => number; - readonly __wbg_flattraversaldata_free: (a: number, b: number) => void; - readonly __wbg_flattraversalresult_free: (a: number, b: number) => void; - readonly __wbg_get_flattraversaldata_children: (a: number) => [number, number]; - readonly __wbg_get_flattraversaldata_depth: (a: number) => number; - readonly __wbg_get_flattraversaldata_edge: (a: number) => number; - readonly __wbg_get_flattraversaldata_has_cut_of_children: (a: number) => number; - readonly __wbg_get_flattraversaldata_number_of_children: (a: number) => number; - readonly __wbg_get_flattraversalresult_data: (a: number) => [number, number]; - readonly __wbg_get_flattraversalresult_entry_nodes: (a: number) => [number, number]; - readonly __wbg_get_flattraversalresult_hit_depth_limit: (a: number) => number; - readonly __wbg_get_flattraversalresult_node_count: (a: number) => number; - readonly __wbg_get_flattraversalresult_traversal_time: (a: number) => bigint; - readonly __wbg_get_traversaldata_children: (a: number) => [number, number]; - readonly __wbg_get_traversalresult_data: (a: number) => [number, number]; - readonly __wbg_get_traversalresult_hit_depth_limit: (a: number) => number; - readonly __wbg_get_traversalresult_max_depth: (a: number) => number; - readonly __wbg_get_traversalresult_node_count: (a: number) => number; - readonly __wbg_set_flattraversaldata_children: (a: number, b: number, c: number) => void; - readonly __wbg_set_flattraversaldata_depth: (a: number, b: number) => void; - readonly __wbg_set_flattraversaldata_edge: (a: number, b: number) => void; - readonly __wbg_set_flattraversaldata_has_cut_of_children: (a: number, b: number) => void; - readonly __wbg_set_flattraversaldata_number_of_children: (a: number, b: number) => void; - readonly __wbg_set_flattraversalresult_data: (a: number, b: number, c: number) => void; - readonly __wbg_set_flattraversalresult_entry_nodes: (a: number, b: number, c: number) => void; - readonly __wbg_set_flattraversalresult_hit_depth_limit: (a: number, b: number) => void; - readonly __wbg_set_flattraversalresult_node_count: (a: number, b: number) => void; - readonly __wbg_set_flattraversalresult_traversal_time: (a: number, b: bigint) => void; - readonly __wbg_set_traversaldata_children: (a: number, b: number, c: number) => void; - readonly __wbg_set_traversalresult_data: (a: number, b: number, c: number) => void; - readonly __wbg_set_traversalresult_hit_depth_limit: (a: number, b: number) => void; - readonly __wbg_set_traversalresult_max_depth: (a: number, b: number) => void; - readonly __wbg_set_traversalresult_node_count: (a: number, b: number) => void; - readonly __wbg_traversaldata_free: (a: number, b: number) => void; - readonly __wbg_traversalresult_free: (a: number, b: number) => void; - readonly flattraversaldata_get_attribute_label: (a: number, b: number, c: number, d: number) => [number, number, number, number]; - readonly flattraversaldata_to_js_rendering_obj: (a: number, b: number, c: number, d: number, e: number) => [number, number, number]; - readonly flattraversalresult_children_at_index: (a: number, b: number) => [number, number]; - readonly flattraversalresult_data_at_index: (a: number, b: number) => number; - readonly flattraversalresult_is_empty: (a: number) => number; - readonly flattraversalresult_rendering_obj_at_index: (a: number, b: number, c: number, d: number, e: number, f: number) => [number, number, number]; - readonly flattraversalresult_sort: (a: number, b: number, c: number) => [number, number]; - readonly flattraversalresult_toString: (a: number) => [number, number]; - readonly traversaldata_new: (a: number, b: number, c: number, d: number, e: number, f: number) => number; - readonly traversaldata_rec_sort_children: (a: number, b: number, c: number) => [number, number]; - readonly traversaldata_toString: (a: number) => [number, number]; - readonly traversalresult_new: (a: number, b: number, c: bigint) => number; - readonly traversalresult_toString: (a: number) => [number, number]; - readonly traversalresult_to_paths: (a: number) => number; - readonly __wbg_set_traversaldata_has_cut_of_children: (a: number, b: number) => void; - readonly __wbg_set_flattraversalresult_max_depth: (a: number, b: number) => void; - readonly __wbg_set_traversaldata_depth: (a: number, b: number) => void; - readonly __wbg_set_traversaldata_number_of_children: (a: number, b: number) => void; - readonly __wbg_set_traversalresult_traversal_time: (a: number, b: bigint) => void; - readonly __wbg_get_traversaldata_edge: (a: number) => number; - readonly traversalresult_is_empty: (a: number) => number; - readonly __wbg_set_traversaldata_edge: (a: number, b: number) => void; - readonly __wbg_get_traversaldata_has_cut_of_children: (a: number) => number; - readonly __wbg_get_flattraversalresult_max_depth: (a: number) => number; - readonly __wbg_get_traversaldata_depth: (a: number) => number; - readonly __wbg_get_traversaldata_number_of_children: (a: number) => number; - readonly __wbg_get_traversalresult_traversal_time: (a: number) => bigint; - readonly __wbg_edgedata_free: (a: number, b: number) => void; - readonly __wbg_get_edgedata_explicit: (a: number) => number; - readonly __wbg_get_edgedata_round: (a: number) => number; - readonly __wbg_set_edgedata_explicit: (a: number, b: number) => void; - readonly __wbg_set_edgedata_round: (a: number, b: number) => void; - readonly edgedata_edge_source: (a: number) => [number, number]; - readonly edgedata_edge_type: (a: number) => [number, number]; - readonly edgedata_toString: (a: number) => [number, number]; - readonly __wbg_get_traversaloptions_dataview_from_paths: (a: number) => [number, number]; - readonly __wbg_get_traversaloptions_edge_types: (a: number) => [number, number]; - readonly __wbg_get_traversaloptions_entry_nodes: (a: number) => [number, number]; - readonly __wbg_get_traversaloptions_max_depth: (a: number) => number; - readonly __wbg_get_traversaloptions_max_traversal_count: (a: number) => number; - readonly __wbg_get_traversaloptions_separate_edges: (a: number) => number; - readonly __wbg_get_traversalpostprocessoptions_flatten: (a: number) => number; - readonly __wbg_get_traversalpostprocessoptions_sorter: (a: number) => number; - readonly __wbg_set_traversaloptions_dataview_from_paths: (a: number, b: number, c: number) => void; - readonly __wbg_set_traversaloptions_edge_types: (a: number, b: number, c: number) => void; - readonly __wbg_set_traversaloptions_entry_nodes: (a: number, b: number, c: number) => void; - readonly __wbg_set_traversaloptions_max_depth: (a: number, b: number) => void; - readonly __wbg_set_traversaloptions_max_traversal_count: (a: number, b: number) => void; - readonly __wbg_set_traversaloptions_separate_edges: (a: number, b: number) => void; - readonly __wbg_set_traversalpostprocessoptions_flatten: (a: number, b: number) => void; - readonly __wbg_set_traversalpostprocessoptions_sorter: (a: number, b: number) => void; - readonly __wbg_traversaloptions_free: (a: number, b: number) => void; - readonly __wbg_traversalpostprocessoptions_free: (a: number, b: number) => void; - readonly traversaloptions_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number) => number; - readonly traversaloptions_toString: (a: number) => [number, number]; - readonly traversalpostprocessoptions_new: (a: number, b: number) => number; - readonly traversalpostprocessoptions_toString: (a: number) => [number, number]; - readonly traversalpostprocessoptions_without_sorter: (a: number) => number; - readonly __wbindgen_exn_store: (a: number) => void; - readonly __externref_table_alloc: () => number; - readonly __wbindgen_export_2: WebAssembly.Table; - readonly __wbindgen_free: (a: number, b: number, c: number) => void; - readonly __wbindgen_malloc: (a: number, b: number) => number; - readonly __wbindgen_realloc: (a: number, b: number, c: number, d: number) => number; - readonly __externref_drop_slice: (a: number, b: number) => void; - readonly __externref_table_dealloc: (a: number) => void; - readonly __wbindgen_start: () => void; + readonly memory: WebAssembly.Memory; + readonly __wbg_addedgegraphupdate_free: (a: number, b: number) => void; + readonly __wbg_addnotegraphupdate_free: (a: number, b: number) => void; + readonly __wbg_batchgraphupdate_free: (a: number, b: number) => void; + readonly __wbg_edgedata_free: (a: number, b: number) => void; + readonly __wbg_edgelist_free: (a: number, b: number) => void; + readonly __wbg_edgesorter_free: (a: number, b: number) => void; + readonly __wbg_edgestruct_free: (a: number, b: number) => void; + readonly __wbg_flattraversaldata_free: (a: number, b: number) => void; + readonly __wbg_flattraversalresult_free: (a: number, b: number) => void; + readonly __wbg_gcedgedata_free: (a: number, b: number) => void; + readonly __wbg_gcnodedata_free: (a: number, b: number) => void; + readonly __wbg_get_edgedata_explicit: (a: number) => number; + readonly __wbg_get_edgedata_round: (a: number) => number; + readonly __wbg_get_flattraversaldata_children: (a: number) => [number, number]; + readonly __wbg_get_flattraversaldata_depth: (a: number) => number; + readonly __wbg_get_flattraversaldata_edge: (a: number) => number; + readonly __wbg_get_flattraversaldata_has_cut_of_children: (a: number) => number; + readonly __wbg_get_flattraversaldata_number_of_children: (a: number) => number; + readonly __wbg_get_flattraversalresult_data: (a: number) => [number, number]; + readonly __wbg_get_flattraversalresult_entry_nodes: (a: number) => [number, number]; + readonly __wbg_get_flattraversalresult_hit_depth_limit: (a: number) => number; + readonly __wbg_get_flattraversalresult_max_depth: (a: number) => number; + readonly __wbg_get_flattraversalresult_node_count: (a: number) => number; + readonly __wbg_get_flattraversalresult_traversal_time: (a: number) => bigint; + readonly __wbg_get_mermaidgraphdata_mermaid: (a: number) => [number, number]; + readonly __wbg_get_mermaidgraphdata_total_time: (a: number) => bigint; + readonly __wbg_get_mermaidgraphdata_traversal_time: (a: number) => bigint; + readonly __wbg_get_nodedata_aliases: (a: number) => [number, number]; + readonly __wbg_get_nodedata_ignore_in_edges: (a: number) => number; + readonly __wbg_get_nodedata_ignore_out_edges: (a: number) => number; + readonly __wbg_get_nodedata_path: (a: number) => [number, number]; + readonly __wbg_get_nodedata_resolved: (a: number) => number; + readonly __wbg_get_path_edges: (a: number) => [number, number]; + readonly __wbg_get_traversaldata_children: (a: number) => [number, number]; + readonly __wbg_get_traversaldata_depth: (a: number) => number; + readonly __wbg_get_traversaldata_edge: (a: number) => number; + readonly __wbg_get_traversaldata_has_cut_of_children: (a: number) => number; + readonly __wbg_get_traversaldata_number_of_children: (a: number) => number; + readonly __wbg_get_traversaloptions_dataview_from_paths: (a: number) => [number, number]; + readonly __wbg_get_traversaloptions_edge_types: (a: number) => [number, number]; + readonly __wbg_get_traversaloptions_entry_nodes: (a: number) => [number, number]; + readonly __wbg_get_traversaloptions_max_depth: (a: number) => number; + readonly __wbg_get_traversaloptions_max_traversal_count: (a: number) => number; + readonly __wbg_get_traversaloptions_separate_edges: (a: number) => number; + readonly __wbg_get_traversalpostprocessoptions_flatten: (a: number) => number; + readonly __wbg_get_traversalpostprocessoptions_sorter: (a: number) => number; + readonly __wbg_get_traversalresult_data: (a: number) => [number, number]; + readonly __wbg_get_traversalresult_hit_depth_limit: (a: number) => number; + readonly __wbg_get_traversalresult_max_depth: (a: number) => number; + readonly __wbg_get_traversalresult_node_count: (a: number) => number; + readonly __wbg_get_traversalresult_traversal_time: (a: number) => bigint; + readonly __wbg_groupededgelist_free: (a: number, b: number) => void; + readonly __wbg_mermaidgraphdata_free: (a: number, b: number) => void; + readonly __wbg_mermaidgraphoptions_free: (a: number, b: number) => void; + readonly __wbg_nodedata_free: (a: number, b: number) => void; + readonly __wbg_nodestringifyoptions_free: (a: number, b: number) => void; + readonly __wbg_notegraph_free: (a: number, b: number) => void; + readonly __wbg_notegrapherror_free: (a: number, b: number) => void; + readonly __wbg_path_free: (a: number, b: number) => void; + readonly __wbg_pathlist_free: (a: number, b: number) => void; + readonly __wbg_removeedgegraphupdate_free: (a: number, b: number) => void; + readonly __wbg_removenotegraphupdate_free: (a: number, b: number) => void; + readonly __wbg_renamenotegraphupdate_free: (a: number, b: number) => void; + readonly __wbg_set_edgedata_explicit: (a: number, b: number) => void; + readonly __wbg_set_edgedata_round: (a: number, b: number) => void; + readonly __wbg_set_flattraversaldata_children: (a: number, b: number, c: number) => void; + readonly __wbg_set_flattraversaldata_depth: (a: number, b: number) => void; + readonly __wbg_set_flattraversaldata_edge: (a: number, b: number) => void; + readonly __wbg_set_flattraversaldata_has_cut_of_children: (a: number, b: number) => void; + readonly __wbg_set_flattraversaldata_number_of_children: (a: number, b: number) => void; + readonly __wbg_set_flattraversalresult_data: (a: number, b: number, c: number) => void; + readonly __wbg_set_flattraversalresult_entry_nodes: (a: number, b: number, c: number) => void; + readonly __wbg_set_flattraversalresult_hit_depth_limit: (a: number, b: number) => void; + readonly __wbg_set_flattraversalresult_max_depth: (a: number, b: number) => void; + readonly __wbg_set_flattraversalresult_node_count: (a: number, b: number) => void; + readonly __wbg_set_flattraversalresult_traversal_time: (a: number, b: bigint) => void; + readonly __wbg_set_mermaidgraphdata_mermaid: (a: number, b: number, c: number) => void; + readonly __wbg_set_mermaidgraphdata_total_time: (a: number, b: bigint) => void; + readonly __wbg_set_mermaidgraphdata_traversal_time: (a: number, b: bigint) => void; + readonly __wbg_set_nodedata_aliases: (a: number, b: number, c: number) => void; + readonly __wbg_set_nodedata_ignore_in_edges: (a: number, b: number) => void; + readonly __wbg_set_nodedata_ignore_out_edges: (a: number, b: number) => void; + readonly __wbg_set_nodedata_path: (a: number, b: number, c: number) => void; + readonly __wbg_set_nodedata_resolved: (a: number, b: number) => void; + readonly __wbg_set_path_edges: (a: number, b: number, c: number) => void; + readonly __wbg_set_traversaldata_children: (a: number, b: number, c: number) => void; + readonly __wbg_set_traversaldata_depth: (a: number, b: number) => void; + readonly __wbg_set_traversaldata_edge: (a: number, b: number) => void; + readonly __wbg_set_traversaldata_has_cut_of_children: (a: number, b: number) => void; + readonly __wbg_set_traversaldata_number_of_children: (a: number, b: number) => void; + readonly __wbg_set_traversaloptions_dataview_from_paths: (a: number, b: number, c: number) => void; + readonly __wbg_set_traversaloptions_edge_types: (a: number, b: number, c: number) => void; + readonly __wbg_set_traversaloptions_entry_nodes: (a: number, b: number, c: number) => void; + readonly __wbg_set_traversaloptions_max_depth: (a: number, b: number) => void; + readonly __wbg_set_traversaloptions_max_traversal_count: (a: number, b: number) => void; + readonly __wbg_set_traversaloptions_separate_edges: (a: number, b: number) => void; + readonly __wbg_set_traversalpostprocessoptions_flatten: (a: number, b: number) => void; + readonly __wbg_set_traversalpostprocessoptions_sorter: (a: number, b: number) => void; + readonly __wbg_set_traversalresult_data: (a: number, b: number, c: number) => void; + readonly __wbg_set_traversalresult_hit_depth_limit: (a: number, b: number) => void; + readonly __wbg_set_traversalresult_max_depth: (a: number, b: number) => void; + readonly __wbg_set_traversalresult_node_count: (a: number, b: number) => void; + readonly __wbg_set_traversalresult_traversal_time: (a: number, b: bigint) => void; + readonly __wbg_transitivegraphrule_free: (a: number, b: number) => void; + readonly __wbg_transitiverulesgraphupdate_free: (a: number, b: number) => void; + readonly __wbg_traversaldata_free: (a: number, b: number) => void; + readonly __wbg_traversaloptions_free: (a: number, b: number) => void; + readonly __wbg_traversalpostprocessoptions_free: (a: number, b: number) => void; + readonly __wbg_traversalresult_free: (a: number, b: number) => void; + readonly addedgegraphupdate_add_to_batch: (a: number, b: number) => void; + readonly addedgegraphupdate_new: (a: number) => number; + readonly addnotegraphupdate_add_to_batch: (a: number, b: number) => void; + readonly addnotegraphupdate_new: (a: number) => number; + readonly batchgraphupdate_new: () => number; + readonly create_edge_sorter: (a: number, b: number, c: number) => [number, number, number]; + readonly create_graph: () => number; + readonly edgedata_edge_source: (a: number) => [number, number]; + readonly edgedata_edge_type: (a: number) => [number, number]; + readonly edgedata_toString: (a: number) => [number, number]; + readonly edgelist_first: (a: number) => number; + readonly edgelist_get_edges: (a: number) => [number, number]; + readonly edgelist_get_sorted_edges: (a: number, b: number, c: number) => [number, number, number, number]; + readonly edgelist_group_by_type: (a: number) => number; + readonly edgelist_last: (a: number) => number; + readonly edgelist_toString: (a: number) => [number, number]; + readonly edgelist_to_array: (a: number) => [number, number]; + readonly edgestruct_edge_data: (a: number, b: number) => [number, number, number]; + readonly edgestruct_edge_source: (a: number, b: number) => [number, number, number, number]; + readonly edgestruct_edge_type: (a: number) => [number, number]; + readonly edgestruct_explicit: (a: number, b: number) => [number, number, number]; + readonly edgestruct_get_attribute_label: (a: number, b: number, c: number, d: number) => [number, number, number, number]; + readonly edgestruct_is_self_loop: (a: number) => number; + readonly edgestruct_matches_edge_filter: (a: number, b: number, c: number, d: number) => [number, number, number]; + readonly edgestruct_round: (a: number, b: number) => [number, number, number]; + readonly edgestruct_source_data: (a: number, b: number) => [number, number, number]; + readonly edgestruct_source_path: (a: number, b: number) => [number, number, number, number]; + readonly edgestruct_source_resolved: (a: number, b: number) => [number, number, number]; + readonly edgestruct_stringify_source: (a: number, b: number, c: number) => [number, number, number, number]; + readonly edgestruct_stringify_target: (a: number, b: number, c: number) => [number, number, number, number]; + readonly edgestruct_target_data: (a: number, b: number) => [number, number, number]; + readonly edgestruct_target_path: (a: number, b: number) => [number, number, number, number]; + readonly edgestruct_target_resolved: (a: number, b: number) => [number, number, number]; + readonly edgestruct_toString: (a: number) => [number, number]; + readonly flattraversaldata_get_attribute_label: (a: number, b: number, c: number, d: number) => [number, number, number, number]; + readonly flattraversaldata_to_js_rendering_obj: (a: number, b: number, c: number, d: number, e: number) => [number, number, number]; + readonly flattraversalresult_children_at_index: (a: number, b: number) => [number, number]; + readonly flattraversalresult_data_at_index: (a: number, b: number) => number; + readonly flattraversalresult_is_empty: (a: number) => number; + readonly flattraversalresult_rendering_obj_at_index: (a: number, b: number, c: number, d: number, e: number, f: number) => [number, number, number]; + readonly flattraversalresult_sort: (a: number, b: number, c: number) => [number, number]; + readonly flattraversalresult_toString: (a: number) => [number, number]; + readonly gcedgedata_edge_source: (a: number) => [number, number]; + readonly gcedgedata_edge_type: (a: number) => [number, number]; + readonly gcedgedata_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number) => number; + readonly gcedgedata_source: (a: number) => [number, number]; + readonly gcedgedata_target: (a: number) => [number, number]; + readonly gcedgedata_toString: (a: number) => [number, number]; + readonly gcnodedata_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => number; + readonly gcnodedata_toString: (a: number) => [number, number]; + readonly groupededgelist_get_edges: (a: number, b: number, c: number) => [number, number]; + readonly groupededgelist_get_sorted_edges: (a: number, b: number, c: number, d: number, e: number) => [number, number, number, number]; + readonly groupededgelist_toString: (a: number) => [number, number]; + readonly mermaidgraphdata_toString: (a: number) => [number, number]; + readonly mermaidgraphoptions_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number, j: number, k: number, l: number, m: number, n: number, o: number, p: number, q: number, r: number, s: number) => number; + readonly mermaidgraphoptions_toString: (a: number) => [number, number]; + readonly nodedata_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => number; + readonly nodedata_toString: (a: number) => [number, number]; + readonly nodestringifyoptions_new: (a: number, b: number, c: number, d: number, e: number) => number; + readonly nodestringifyoptions_stringify_node: (a: number, b: number) => [number, number]; + readonly notegraph_apply_update: (a: number, b: number) => [number, number]; + readonly notegraph_build_graph: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => [number, number]; + readonly notegraph_edge_types: (a: number) => [number, number]; + readonly notegraph_generate_mermaid_graph: (a: number, b: number, c: number) => [number, number, number]; + readonly notegraph_get_filtered_grouped_outgoing_edges: (a: number, b: number, c: number, d: number, e: number) => number; + readonly notegraph_get_filtered_outgoing_edges: (a: number, b: number, c: number, d: number, e: number) => number; + readonly notegraph_get_incoming_edges: (a: number, b: number, c: number) => number; + readonly notegraph_get_node: (a: number, b: number, c: number) => number; + readonly notegraph_get_outgoing_edges: (a: number, b: number, c: number) => number; + readonly notegraph_has_node: (a: number, b: number, c: number) => number; + readonly notegraph_is_node_resolved: (a: number, b: number, c: number) => number; + readonly notegraph_iterate_edges: (a: number, b: unknown) => void; + readonly notegraph_iterate_nodes: (a: number, b: unknown) => void; + readonly notegraph_log: (a: number) => void; + readonly notegraph_new: () => number; + readonly notegraph_notify_update: (a: number) => void; + readonly notegraph_rec_traverse: (a: number, b: number) => [number, number, number]; + readonly notegraph_rec_traverse_and_process: (a: number, b: number, c: number) => [number, number, number]; + readonly notegraph_set_update_callback: (a: number, b: unknown) => void; + readonly notegrapherror_message: (a: number) => [number, number]; + readonly notegrapherror_new: (a: number, b: number) => number; + readonly notegrapherror_toString: (a: number) => [number, number]; + readonly path_equals: (a: number, b: number) => number; + readonly path_get_first_target: (a: number, b: number) => [number, number, number, number]; + readonly path_length: (a: number) => number; + readonly path_reverse_edges: (a: number) => [number, number]; + readonly path_toString: (a: number) => [number, number]; + readonly path_truncate: (a: number, b: number) => number; + readonly pathlist_max_depth: (a: number) => number; + readonly pathlist_process: (a: number, b: number, c: number) => [number, number, number, number]; + readonly pathlist_select: (a: number, b: number, c: number) => number; + readonly pathlist_toString: (a: number) => [number, number]; + readonly pathlist_to_paths: (a: number) => [number, number]; + readonly removeedgegraphupdate_add_to_batch: (a: number, b: number) => void; + readonly removeedgegraphupdate_new: (a: number, b: number, c: number, d: number, e: number, f: number) => number; + readonly removenotegraphupdate_add_to_batch: (a: number, b: number) => void; + readonly removenotegraphupdate_new: (a: number, b: number) => number; + readonly renamenotegraphupdate_add_to_batch: (a: number, b: number) => void; + readonly renamenotegraphupdate_new: (a: number, b: number, c: number, d: number) => number; + readonly sort_edges: (a: number, b: number, c: number, d: number) => [number, number, number, number]; + readonly sort_traversal_data: (a: number, b: number, c: number, d: number) => [number, number, number, number]; + readonly transitivegraphrule_create_example_graph: (a: number) => [number, number, number]; + readonly transitivegraphrule_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number) => number; + readonly transitivegraphrule_toString: (a: number) => [number, number]; + readonly transitiverulesgraphupdate_add_to_batch: (a: number, b: number) => void; + readonly transitiverulesgraphupdate_new: (a: number, b: number) => number; + readonly traversaldata_new: (a: number, b: number, c: number, d: number, e: number, f: number) => number; + readonly traversaldata_rec_sort_children: (a: number, b: number, c: number) => [number, number]; + readonly traversaldata_toString: (a: number) => [number, number]; + readonly traversaloptions_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number) => number; + readonly traversaloptions_toString: (a: number) => [number, number]; + readonly traversalpostprocessoptions_new: (a: number, b: number) => number; + readonly traversalpostprocessoptions_toString: (a: number) => [number, number]; + readonly traversalpostprocessoptions_without_sorter: (a: number) => number; + readonly traversalresult_is_empty: (a: number) => number; + readonly traversalresult_new: (a: number, b: number, c: bigint) => number; + readonly traversalresult_toString: (a: number) => [number, number]; + readonly traversalresult_to_paths: (a: number) => number; + readonly __wbindgen_malloc: (a: number, b: number) => number; + readonly __wbindgen_realloc: (a: number, b: number, c: number, d: number) => number; + readonly __wbindgen_exn_store: (a: number) => void; + readonly __externref_table_alloc: () => number; + readonly __wbindgen_externrefs: WebAssembly.Table; + readonly __wbindgen_free: (a: number, b: number, c: number) => void; + readonly __externref_table_dealloc: (a: number) => void; + readonly __externref_drop_slice: (a: number, b: number) => void; + readonly __wbindgen_start: () => void; } export type SyncInitInput = BufferSource | WebAssembly.Module; + /** -* Instantiates the given `module`, which can either be bytes or -* a precompiled `WebAssembly.Module`. -* -* @param {{ module: SyncInitInput }} module - Passing `SyncInitInput` directly is deprecated. -* -* @returns {InitOutput} -*/ + * Instantiates the given `module`, which can either be bytes or + * a precompiled `WebAssembly.Module`. + * + * @param {{ module: SyncInitInput }} module - Passing `SyncInitInput` directly is deprecated. + * + * @returns {InitOutput} + */ export function initSync(module: { module: SyncInitInput } | SyncInitInput): InitOutput; /** -* If `module_or_path` is {RequestInfo} or {URL}, makes a request and -* for everything else, calls `WebAssembly.instantiate` directly. -* -* @param {{ module_or_path: InitInput | Promise }} module_or_path - Passing `InitInput` directly is deprecated. -* -* @returns {Promise} -*/ + * If `module_or_path` is {RequestInfo} or {URL}, makes a request and + * for everything else, calls `WebAssembly.instantiate` directly. + * + * @param {{ module_or_path: InitInput | Promise }} module_or_path - Passing `InitInput` directly is deprecated. + * + * @returns {Promise} + */ export default function __wbg_init (module_or_path?: { module_or_path: InitInput | Promise } | InitInput | Promise): Promise; /* eslint-enable @typescript-eslint/no-unsafe-function-type, @typescript-eslint/no-misused-new -- End of generated bindings. */ diff --git a/wasm/pkg/breadcrumbs_graph_wasm.js b/wasm/pkg/breadcrumbs_graph_wasm.js index a75248f4..09b71f62 100644 --- a/wasm/pkg/breadcrumbs_graph_wasm.js +++ b/wasm/pkg/breadcrumbs_graph_wasm.js @@ -1,440 +1,356 @@ +/* @ts-self-types="./breadcrumbs_graph_wasm.d.ts" */ import { log } from 'src/logger/index.ts'; -let wasm; -function addToExternrefTable0(obj) { - const idx = wasm.__externref_table_alloc(); - wasm.__wbindgen_export_2.set(idx, obj); - return idx; -} - -function handleError(f, args) { - try { - return f.apply(this, args); - } catch (e) { - const idx = addToExternrefTable0(e); - wasm.__wbindgen_exn_store(idx); +export class AddEdgeGraphUpdate { + __destroy_into_raw() { + const ptr = this.__wbg_ptr; + this.__wbg_ptr = 0; + AddEdgeGraphUpdateFinalization.unregister(this); + return ptr; } -} - -const cachedTextDecoder = (typeof TextDecoder !== 'undefined' ? new TextDecoder('utf-8', { ignoreBOM: true, fatal: true }) : { decode: () => { throw Error('TextDecoder not available') } } ); - -if (typeof TextDecoder !== 'undefined') { cachedTextDecoder.decode(); }; - -let cachedUint8ArrayMemory0 = null; - -function getUint8ArrayMemory0() { - if (cachedUint8ArrayMemory0 === null || cachedUint8ArrayMemory0.byteLength === 0) { - cachedUint8ArrayMemory0 = new Uint8Array(wasm.memory.buffer); + free() { + const ptr = this.__destroy_into_raw(); + wasm.__wbg_addedgegraphupdate_free(ptr, 0); + } + /** + * @param {BatchGraphUpdate} batch + */ + add_to_batch(batch) { + const ptr = this.__destroy_into_raw(); + _assertClass(batch, BatchGraphUpdate); + wasm.addedgegraphupdate_add_to_batch(ptr, batch.__wbg_ptr); + } + /** + * @param {GCEdgeData} data + */ + constructor(data) { + _assertClass(data, GCEdgeData); + var ptr0 = data.__destroy_into_raw(); + const ret = wasm.addedgegraphupdate_new(ptr0); + this.__wbg_ptr = ret; + AddEdgeGraphUpdateFinalization.register(this, this.__wbg_ptr, this); + return this; } - return cachedUint8ArrayMemory0; -} - -function getStringFromWasm0(ptr, len) { - ptr = ptr >>> 0; - return cachedTextDecoder.decode(getUint8ArrayMemory0().subarray(ptr, ptr + len)); -} - -let WASM_VECTOR_LEN = 0; - -const cachedTextEncoder = (typeof TextEncoder !== 'undefined' ? new TextEncoder('utf-8') : { encode: () => { throw Error('TextEncoder not available') } } ); - -const encodeString = (typeof cachedTextEncoder.encodeInto === 'function' - ? function (arg, view) { - return cachedTextEncoder.encodeInto(arg, view); } - : function (arg, view) { - const buf = cachedTextEncoder.encode(arg); - view.set(buf); - return { - read: arg.length, - written: buf.length - }; -}); +if (Symbol.dispose) AddEdgeGraphUpdate.prototype[Symbol.dispose] = AddEdgeGraphUpdate.prototype.free; -function passStringToWasm0(arg, malloc, realloc) { - - if (realloc === undefined) { - const buf = cachedTextEncoder.encode(arg); - const ptr = malloc(buf.length, 1) >>> 0; - getUint8ArrayMemory0().subarray(ptr, ptr + buf.length).set(buf); - WASM_VECTOR_LEN = buf.length; +export class AddNoteGraphUpdate { + __destroy_into_raw() { + const ptr = this.__wbg_ptr; + this.__wbg_ptr = 0; + AddNoteGraphUpdateFinalization.unregister(this); return ptr; } - - let len = arg.length; - let ptr = malloc(len, 1) >>> 0; - - const mem = getUint8ArrayMemory0(); - - let offset = 0; - - for (; offset < len; offset++) { - const code = arg.charCodeAt(offset); - if (code > 0x7F) break; - mem[ptr + offset] = code; + free() { + const ptr = this.__destroy_into_raw(); + wasm.__wbg_addnotegraphupdate_free(ptr, 0); } - - if (offset !== len) { - if (offset !== 0) { - arg = arg.slice(offset); - } - ptr = realloc(ptr, len, len = offset + arg.length * 3, 1) >>> 0; - const view = getUint8ArrayMemory0().subarray(ptr + offset, ptr + len); - const ret = encodeString(arg, view); - - offset += ret.written; - ptr = realloc(ptr, len, offset, 1) >>> 0; + /** + * @param {BatchGraphUpdate} batch + */ + add_to_batch(batch) { + const ptr = this.__destroy_into_raw(); + _assertClass(batch, BatchGraphUpdate); + wasm.addnotegraphupdate_add_to_batch(ptr, batch.__wbg_ptr); } - - WASM_VECTOR_LEN = offset; - return ptr; -} - -let cachedDataViewMemory0 = null; - -function getDataViewMemory0() { - if (cachedDataViewMemory0 === null || cachedDataViewMemory0.buffer.detached === true || (cachedDataViewMemory0.buffer.detached === undefined && cachedDataViewMemory0.buffer !== wasm.memory.buffer)) { - cachedDataViewMemory0 = new DataView(wasm.memory.buffer); + /** + * @param {GCNodeData} data + */ + constructor(data) { + _assertClass(data, GCNodeData); + var ptr0 = data.__destroy_into_raw(); + const ret = wasm.addnotegraphupdate_new(ptr0); + this.__wbg_ptr = ret; + AddNoteGraphUpdateFinalization.register(this, this.__wbg_ptr, this); + return this; } - return cachedDataViewMemory0; } +if (Symbol.dispose) AddNoteGraphUpdate.prototype[Symbol.dispose] = AddNoteGraphUpdate.prototype.free; -function isLikeNone(x) { - return x === undefined || x === null; +export class BatchGraphUpdate { + __destroy_into_raw() { + const ptr = this.__wbg_ptr; + this.__wbg_ptr = 0; + BatchGraphUpdateFinalization.unregister(this); + return ptr; + } + free() { + const ptr = this.__destroy_into_raw(); + wasm.__wbg_batchgraphupdate_free(ptr, 0); + } + constructor() { + const ret = wasm.batchgraphupdate_new(); + this.__wbg_ptr = ret; + BatchGraphUpdateFinalization.register(this, this.__wbg_ptr, this); + return this; + } } +if (Symbol.dispose) BatchGraphUpdate.prototype[Symbol.dispose] = BatchGraphUpdate.prototype.free; -function debugString(val) { - // primitive types - const type = typeof val; - if (type == 'number' || type == 'boolean' || val == null) { - return `${val}`; +export class EdgeData { + static __wrap(ptr) { + const obj = Object.create(EdgeData.prototype); + obj.__wbg_ptr = ptr; + EdgeDataFinalization.register(obj, obj.__wbg_ptr, obj); + return obj; } - if (type == 'string') { - return `"${val}"`; + __destroy_into_raw() { + const ptr = this.__wbg_ptr; + this.__wbg_ptr = 0; + EdgeDataFinalization.unregister(this); + return ptr; } - if (type == 'symbol') { - const description = val.description; - if (description == null) { - return 'Symbol'; - } else { - return `Symbol(${description})`; - } + free() { + const ptr = this.__destroy_into_raw(); + wasm.__wbg_edgedata_free(ptr, 0); } - if (type == 'function') { - const name = val.name; - if (typeof name == 'string' && name.length > 0) { - return `Function(${name})`; - } else { - return 'Function'; + /** + * @returns {string} + */ + get edge_source() { + let deferred1_0; + let deferred1_1; + try { + const ret = wasm.edgedata_edge_source(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); } } - // objects - if (Array.isArray(val)) { - const length = val.length; - let debug = '['; - if (length > 0) { - debug += debugString(val[0]); - } - for(let i = 1; i < length; i++) { - debug += ', ' + debugString(val[i]); + /** + * @returns {string} + */ + get edge_type() { + let deferred1_0; + let deferred1_1; + try { + const ret = wasm.edgedata_edge_type(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); } - debug += ']'; - return debug; - } - // Test for built-in - const builtInMatches = /\[object ([^\]]+)\]/.exec(toString.call(val)); - let className; - if (builtInMatches && builtInMatches.length > 1) { - className = builtInMatches[1]; - } else { - // Failed to match the standard '[object ClassName]' - return toString.call(val); } - if (className == 'Object') { - // we're a user defined class or Object - // JSON.stringify avoids problems with cycles, and is generally much - // easier than looping through ownProperties of `val`. + /** + * @returns {string} + */ + toString() { + let deferred1_0; + let deferred1_1; try { - return 'Object(' + JSON.stringify(val) + ')'; - } catch (_) { - return 'Object'; + const ret = wasm.edgedata_toString(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); } } - // errors - if (val instanceof Error) { - return `${val.name}: ${val.message}\n${val.stack}`; + /** + * @returns {boolean} + */ + get explicit() { + const ret = wasm.__wbg_get_edgedata_explicit(this.__wbg_ptr); + return ret !== 0; } - // TODO we could test for more things here, like `Set`s and `Map`s. - return className; -} -/** - * @returns {NoteGraph} - */ -export function create_graph() { - const ret = wasm.create_graph(); - return NoteGraph.__wrap(ret); -} - -function getArrayJsValueFromWasm0(ptr, len) { - ptr = ptr >>> 0; - const mem = getDataViewMemory0(); - const result = []; - for (let i = ptr; i < ptr + 4 * len; i += 4) { - result.push(wasm.__wbindgen_export_2.get(mem.getUint32(i, true))); - } - wasm.__externref_drop_slice(ptr, len); - return result; -} - -function passArrayJsValueToWasm0(array, malloc) { - const ptr = malloc(array.length * 4, 4) >>> 0; - for (let i = 0; i < array.length; i++) { - const add = addToExternrefTable0(array[i]); - getDataViewMemory0().setUint32(ptr + 4 * i, add, true); - } - WASM_VECTOR_LEN = array.length; - return ptr; -} - -function _assertClass(instance, klass) { - if (!(instance instanceof klass)) { - throw new Error(`expected instance of ${klass.name}`); - } -} - -function takeFromExternrefTable0(idx) { - const value = wasm.__wbindgen_export_2.get(idx); - wasm.__externref_table_dealloc(idx); - return value; -} -/** - * @param {string} field - * @param {boolean} reverse - * @returns {EdgeSorter} - */ -export function create_edge_sorter(field, reverse) { - const ptr0 = passStringToWasm0(field, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); - const len0 = WASM_VECTOR_LEN; - const ret = wasm.create_edge_sorter(ptr0, len0, reverse); - if (ret[2]) { - throw takeFromExternrefTable0(ret[1]); + /** + * @returns {number} + */ + get round() { + const ret = wasm.__wbg_get_edgedata_round(this.__wbg_ptr); + return ret; } - return EdgeSorter.__wrap(ret[0]); -} - -/** - * @param {NoteGraph} graph - * @param {TraversalData[]} traversal_data - * @param {EdgeSorter} sorter - * @returns {TraversalData[]} - */ -export function sort_traversal_data(graph, traversal_data, sorter) { - _assertClass(graph, NoteGraph); - const ptr0 = passArrayJsValueToWasm0(traversal_data, wasm.__wbindgen_malloc); - const len0 = WASM_VECTOR_LEN; - _assertClass(sorter, EdgeSorter); - const ret = wasm.sort_traversal_data(graph.__wbg_ptr, ptr0, len0, sorter.__wbg_ptr); - if (ret[3]) { - throw takeFromExternrefTable0(ret[2]); + /** + * @param {boolean} arg0 + */ + set explicit(arg0) { + wasm.__wbg_set_edgedata_explicit(this.__wbg_ptr, arg0); } - var v2 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); - wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); - return v2; -} - -/** - * @param {NoteGraph} graph - * @param {EdgeStruct[]} edges - * @param {EdgeSorter} sorter - * @returns {EdgeStruct[]} - */ -export function sort_edges(graph, edges, sorter) { - _assertClass(graph, NoteGraph); - const ptr0 = passArrayJsValueToWasm0(edges, wasm.__wbindgen_malloc); - const len0 = WASM_VECTOR_LEN; - _assertClass(sorter, EdgeSorter); - const ret = wasm.sort_edges(graph.__wbg_ptr, ptr0, len0, sorter.__wbg_ptr); - if (ret[3]) { - throw takeFromExternrefTable0(ret[2]); + /** + * @param {number} arg0 + */ + set round(arg0) { + wasm.__wbg_set_edgedata_round(this.__wbg_ptr, arg0); } - var v2 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); - wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); - return v2; } +if (Symbol.dispose) EdgeData.prototype[Symbol.dispose] = EdgeData.prototype.free; -let cachedUint32ArrayMemory0 = null; - -function getUint32ArrayMemory0() { - if (cachedUint32ArrayMemory0 === null || cachedUint32ArrayMemory0.byteLength === 0) { - cachedUint32ArrayMemory0 = new Uint32Array(wasm.memory.buffer); +export class EdgeList { + static __wrap(ptr) { + const obj = Object.create(EdgeList.prototype); + obj.__wbg_ptr = ptr; + EdgeListFinalization.register(obj, obj.__wbg_ptr, obj); + return obj; } - return cachedUint32ArrayMemory0; -} - -function getArrayU32FromWasm0(ptr, len) { - ptr = ptr >>> 0; - return getUint32ArrayMemory0().subarray(ptr / 4, ptr / 4 + len); -} - -function passArray32ToWasm0(arg, malloc) { - const ptr = malloc(arg.length * 4, 4) >>> 0; - getUint32ArrayMemory0().set(arg, ptr / 4); - WASM_VECTOR_LEN = arg.length; - return ptr; -} - -const AddEdgeGraphUpdateFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_addedgegraphupdate_free(ptr >>> 0, 1)); - -export class AddEdgeGraphUpdate { - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; - AddEdgeGraphUpdateFinalization.unregister(this); + EdgeListFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); - wasm.__wbg_addedgegraphupdate_free(ptr, 0); + wasm.__wbg_edgelist_free(ptr, 0); } /** - * @param {BatchGraphUpdate} batch + * @returns {EdgeStruct | undefined} */ - add_to_batch(batch) { - const ptr = this.__destroy_into_raw(); - _assertClass(batch, BatchGraphUpdate); - wasm.addedgegraphupdate_add_to_batch(ptr, batch.__wbg_ptr); + first() { + const ret = wasm.edgelist_first(this.__wbg_ptr); + return ret === 0 ? undefined : EdgeStruct.__wrap(ret); } /** - * @param {GCEdgeData} data + * Returns a clone of the edges. + * @returns {EdgeStruct[]} */ - constructor(data) { - _assertClass(data, GCEdgeData); - var ptr0 = data.__destroy_into_raw(); - const ret = wasm.addedgegraphupdate_new(ptr0); - this.__wbg_ptr = ret >>> 0; - AddEdgeGraphUpdateFinalization.register(this, this.__wbg_ptr, this); - return this; + get_edges() { + const ret = wasm.edgelist_get_edges(this.__wbg_ptr); + var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); + wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + return v1; } -} - -const AddNoteGraphUpdateFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_addnotegraphupdate_free(ptr >>> 0, 1)); - -export class AddNoteGraphUpdate { - - __destroy_into_raw() { - const ptr = this.__wbg_ptr; - this.__wbg_ptr = 0; - AddNoteGraphUpdateFinalization.unregister(this); - return ptr; + /** + * Returns a sorted clone of the edges. + * @param {NoteGraph} graph + * @param {EdgeSorter} sorter + * @returns {EdgeStruct[]} + */ + get_sorted_edges(graph, sorter) { + _assertClass(graph, NoteGraph); + _assertClass(sorter, EdgeSorter); + const ret = wasm.edgelist_get_sorted_edges(this.__wbg_ptr, graph.__wbg_ptr, sorter.__wbg_ptr); + if (ret[3]) { + throw takeFromExternrefTable0(ret[2]); + } + var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); + wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + return v1; } - - free() { - const ptr = this.__destroy_into_raw(); - wasm.__wbg_addnotegraphupdate_free(ptr, 0); + /** + * @returns {GroupedEdgeList} + */ + group_by_type() { + const ret = wasm.edgelist_group_by_type(this.__wbg_ptr); + return GroupedEdgeList.__wrap(ret); } /** - * @param {BatchGraphUpdate} batch + * @returns {EdgeStruct | undefined} */ - add_to_batch(batch) { - const ptr = this.__destroy_into_raw(); - _assertClass(batch, BatchGraphUpdate); - wasm.addnotegraphupdate_add_to_batch(ptr, batch.__wbg_ptr); + last() { + const ret = wasm.edgelist_last(this.__wbg_ptr); + return ret === 0 ? undefined : EdgeStruct.__wrap(ret); } /** - * @param {GCNodeData} data + * @returns {string} */ - constructor(data) { - _assertClass(data, GCNodeData); - var ptr0 = data.__destroy_into_raw(); - const ret = wasm.addnotegraphupdate_new(ptr0); - this.__wbg_ptr = ret >>> 0; - AddNoteGraphUpdateFinalization.register(this, this.__wbg_ptr, this); - return this; + toString() { + let deferred1_0; + let deferred1_1; + try { + const ret = wasm.edgelist_toString(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + } + } + /** + * Consumes the [EdgeList] and returns the edges as a Vec (or array for + * JS). + * @returns {EdgeStruct[]} + */ + to_array() { + const ptr = this.__destroy_into_raw(); + const ret = wasm.edgelist_to_array(ptr); + var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); + wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + return v1; } } +if (Symbol.dispose) EdgeList.prototype[Symbol.dispose] = EdgeList.prototype.free; -const BatchGraphUpdateFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_batchgraphupdate_free(ptr >>> 0, 1)); - -export class BatchGraphUpdate { - +export class EdgeSorter { + static __wrap(ptr) { + const obj = Object.create(EdgeSorter.prototype); + obj.__wbg_ptr = ptr; + EdgeSorterFinalization.register(obj, obj.__wbg_ptr, obj); + return obj; + } __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; - BatchGraphUpdateFinalization.unregister(this); + EdgeSorterFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); - wasm.__wbg_batchgraphupdate_free(ptr, 0); - } - constructor() { - const ret = wasm.batchgraphupdate_new(); - this.__wbg_ptr = ret >>> 0; - BatchGraphUpdateFinalization.register(this, this.__wbg_ptr, this); - return this; + wasm.__wbg_edgesorter_free(ptr, 0); } } +if (Symbol.dispose) EdgeSorter.prototype[Symbol.dispose] = EdgeSorter.prototype.free; -const EdgeDataFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_edgedata_free(ptr >>> 0, 1)); - -export class EdgeData { - +export class EdgeStruct { static __wrap(ptr) { - ptr = ptr >>> 0; - const obj = Object.create(EdgeData.prototype); + const obj = Object.create(EdgeStruct.prototype); obj.__wbg_ptr = ptr; - EdgeDataFinalization.register(obj, obj.__wbg_ptr, obj); + EdgeStructFinalization.register(obj, obj.__wbg_ptr, obj); return obj; } - + static __unwrap(jsValue) { + if (!(jsValue instanceof EdgeStruct)) { + return 0; + } + return jsValue.__destroy_into_raw(); + } __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; - EdgeDataFinalization.unregister(this); + EdgeStructFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); - wasm.__wbg_edgedata_free(ptr, 0); - } - /** - * @returns {boolean} - */ - get explicit() { - const ret = wasm.__wbg_get_edgedata_explicit(this.__wbg_ptr); - return ret !== 0; - } - /** - * @param {boolean} arg0 - */ - set explicit(arg0) { - wasm.__wbg_set_edgedata_explicit(this.__wbg_ptr, arg0); + wasm.__wbg_edgestruct_free(ptr, 0); } /** - * @returns {number} + * @param {NoteGraph} graph + * @returns {EdgeData} */ - get round() { - const ret = wasm.__wbg_get_edgedata_round(this.__wbg_ptr); - return ret; + edge_data(graph) { + _assertClass(graph, NoteGraph); + const ret = wasm.edgestruct_edge_data(this.__wbg_ptr, graph.__wbg_ptr); + if (ret[2]) { + throw takeFromExternrefTable0(ret[1]); + } + return EdgeData.__wrap(ret[0]); } /** - * @param {number} arg0 + * @param {NoteGraph} graph + * @returns {string} */ - set round(arg0) { - wasm.__wbg_set_edgedata_round(this.__wbg_ptr, arg0); + edge_source(graph) { + let deferred2_0; + let deferred2_1; + try { + _assertClass(graph, NoteGraph); + const ret = wasm.edgestruct_edge_source(this.__wbg_ptr, graph.__wbg_ptr); + var ptr1 = ret[0]; + var len1 = ret[1]; + if (ret[3]) { + ptr1 = 0; len1 = 0; + throw takeFromExternrefTable0(ret[2]); + } + deferred2_0 = ptr1; + deferred2_1 = len1; + return getStringFromWasm0(ptr1, len1); + } finally { + wasm.__wbindgen_free(deferred2_0, deferred2_1, 1); + } } /** * @returns {string} @@ -443,7 +359,7 @@ export class EdgeData { let deferred1_0; let deferred1_1; try { - const ret = wasm.edgedata_edge_type(this.__wbg_ptr); + const ret = wasm.edgestruct_edge_type(this.__wbg_ptr); deferred1_0 = ret[0]; deferred1_1 = ret[1]; return getStringFromWasm0(ret[0], ret[1]); @@ -452,208 +368,136 @@ export class EdgeData { } } /** - * @returns {string} + * @param {NoteGraph} graph + * @returns {boolean} */ - get edge_source() { - let deferred1_0; - let deferred1_1; - try { - const ret = wasm.edgedata_edge_source(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); - } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + explicit(graph) { + _assertClass(graph, NoteGraph); + const ret = wasm.edgestruct_explicit(this.__wbg_ptr, graph.__wbg_ptr); + if (ret[2]) { + throw takeFromExternrefTable0(ret[1]); } + return ret[0] !== 0; } /** + * @param {NoteGraph} graph + * @param {string[]} attributes * @returns {string} */ - toString() { - let deferred1_0; - let deferred1_1; + get_attribute_label(graph, attributes) { + let deferred3_0; + let deferred3_1; try { - const ret = wasm.edgedata_toString(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); + _assertClass(graph, NoteGraph); + const ptr0 = passArrayJsValueToWasm0(attributes, wasm.__wbindgen_malloc); + const len0 = WASM_VECTOR_LEN; + const ret = wasm.edgestruct_get_attribute_label(this.__wbg_ptr, graph.__wbg_ptr, ptr0, len0); + var ptr2 = ret[0]; + var len2 = ret[1]; + if (ret[3]) { + ptr2 = 0; len2 = 0; + throw takeFromExternrefTable0(ret[2]); + } + deferred3_0 = ptr2; + deferred3_1 = len2; + return getStringFromWasm0(ptr2, len2); } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + wasm.__wbindgen_free(deferred3_0, deferred3_1, 1); } } -} - -const EdgeListFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_edgelist_free(ptr >>> 0, 1)); - -export class EdgeList { - - static __wrap(ptr) { - ptr = ptr >>> 0; - const obj = Object.create(EdgeList.prototype); - obj.__wbg_ptr = ptr; - EdgeListFinalization.register(obj, obj.__wbg_ptr, obj); - return obj; - } - - __destroy_into_raw() { - const ptr = this.__wbg_ptr; - this.__wbg_ptr = 0; - EdgeListFinalization.unregister(this); - return ptr; - } - - free() { - const ptr = this.__destroy_into_raw(); - wasm.__wbg_edgelist_free(ptr, 0); - } /** - * @returns {GroupedEdgeList} + * @returns {boolean} */ - group_by_type() { - const ret = wasm.edgelist_group_by_type(this.__wbg_ptr); - return GroupedEdgeList.__wrap(ret); + is_self_loop() { + const ret = wasm.edgestruct_is_self_loop(this.__wbg_ptr); + return ret !== 0; } /** - * @returns {string} + * @param {NoteGraph} graph + * @param {string[] | null} [edge_types] + * @returns {boolean} */ - toString() { - let deferred1_0; - let deferred1_1; - try { - const ret = wasm.edgelist_toString(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); - } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + matches_edge_filter(graph, edge_types) { + _assertClass(graph, NoteGraph); + var ptr0 = isLikeNone(edge_types) ? 0 : passArrayJsValueToWasm0(edge_types, wasm.__wbindgen_malloc); + var len0 = WASM_VECTOR_LEN; + const ret = wasm.edgestruct_matches_edge_filter(this.__wbg_ptr, graph.__wbg_ptr, ptr0, len0); + if (ret[2]) { + throw takeFromExternrefTable0(ret[1]); } + return ret[0] !== 0; } /** - * Returns a sorted clone of the edges. * @param {NoteGraph} graph - * @param {EdgeSorter} sorter - * @returns {EdgeStruct[]} + * @returns {number} */ - get_sorted_edges(graph, sorter) { + round(graph) { _assertClass(graph, NoteGraph); - _assertClass(sorter, EdgeSorter); - const ret = wasm.edgelist_get_sorted_edges(this.__wbg_ptr, graph.__wbg_ptr, sorter.__wbg_ptr); - if (ret[3]) { - throw takeFromExternrefTable0(ret[2]); + const ret = wasm.edgestruct_round(this.__wbg_ptr, graph.__wbg_ptr); + if (ret[2]) { + throw takeFromExternrefTable0(ret[1]); } - var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); - wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); - return v1; + return ret[0]; } /** - * @returns {EdgeStruct | undefined} + * @param {NoteGraph} graph + * @returns {NodeData} */ - last() { - const ret = wasm.edgelist_last(this.__wbg_ptr); - return ret === 0 ? undefined : EdgeStruct.__wrap(ret); + source_data(graph) { + _assertClass(graph, NoteGraph); + const ret = wasm.edgestruct_source_data(this.__wbg_ptr, graph.__wbg_ptr); + if (ret[2]) { + throw takeFromExternrefTable0(ret[1]); + } + return NodeData.__wrap(ret[0]); } /** - * @returns {EdgeStruct | undefined} + * @param {NoteGraph} graph + * @returns {string} */ - first() { - const ret = wasm.edgelist_first(this.__wbg_ptr); - return ret === 0 ? undefined : EdgeStruct.__wrap(ret); + source_path(graph) { + let deferred2_0; + let deferred2_1; + try { + _assertClass(graph, NoteGraph); + const ret = wasm.edgestruct_source_path(this.__wbg_ptr, graph.__wbg_ptr); + var ptr1 = ret[0]; + var len1 = ret[1]; + if (ret[3]) { + ptr1 = 0; len1 = 0; + throw takeFromExternrefTable0(ret[2]); + } + deferred2_0 = ptr1; + deferred2_1 = len1; + return getStringFromWasm0(ptr1, len1); + } finally { + wasm.__wbindgen_free(deferred2_0, deferred2_1, 1); + } } /** - * Consumes the [EdgeList] and returns the edges as a Vec (or array for - * JS). - * @returns {EdgeStruct[]} + * @param {NoteGraph} graph + * @returns {boolean} */ - to_array() { - const ptr = this.__destroy_into_raw(); - const ret = wasm.edgelist_to_array(ptr); - var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); - wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); - return v1; + source_resolved(graph) { + _assertClass(graph, NoteGraph); + const ret = wasm.edgestruct_source_resolved(this.__wbg_ptr, graph.__wbg_ptr); + if (ret[2]) { + throw takeFromExternrefTable0(ret[1]); + } + return ret[0] !== 0; } /** - * Returns a clone of the edges. - * @returns {EdgeStruct[]} + * @param {NoteGraph} graph + * @param {NodeStringifyOptions} options + * @returns {string} */ - get_edges() { - const ret = wasm.edgelist_get_edges(this.__wbg_ptr); - var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); - wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); - return v1; - } -} - -const EdgeSorterFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_edgesorter_free(ptr >>> 0, 1)); - -export class EdgeSorter { - - static __wrap(ptr) { - ptr = ptr >>> 0; - const obj = Object.create(EdgeSorter.prototype); - obj.__wbg_ptr = ptr; - EdgeSorterFinalization.register(obj, obj.__wbg_ptr, obj); - return obj; - } - - __destroy_into_raw() { - const ptr = this.__wbg_ptr; - this.__wbg_ptr = 0; - EdgeSorterFinalization.unregister(this); - return ptr; - } - - free() { - const ptr = this.__destroy_into_raw(); - wasm.__wbg_edgesorter_free(ptr, 0); - } -} - -const EdgeStructFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_edgestruct_free(ptr >>> 0, 1)); - -export class EdgeStruct { - - static __wrap(ptr) { - ptr = ptr >>> 0; - const obj = Object.create(EdgeStruct.prototype); - obj.__wbg_ptr = ptr; - EdgeStructFinalization.register(obj, obj.__wbg_ptr, obj); - return obj; - } - - static __unwrap(jsValue) { - if (!(jsValue instanceof EdgeStruct)) { - return 0; - } - return jsValue.__destroy_into_raw(); - } - - __destroy_into_raw() { - const ptr = this.__wbg_ptr; - this.__wbg_ptr = 0; - EdgeStructFinalization.unregister(this); - return ptr; - } - - free() { - const ptr = this.__destroy_into_raw(); - wasm.__wbg_edgestruct_free(ptr, 0); - } - /** - * @param {NoteGraph} graph - * @returns {string} - */ - edge_source(graph) { + stringify_source(graph, options) { let deferred2_0; let deferred2_1; try { _assertClass(graph, NoteGraph); - const ret = wasm.edgestruct_edge_source(this.__wbg_ptr, graph.__wbg_ptr); + _assertClass(options, NodeStringifyOptions); + const ret = wasm.edgestruct_stringify_source(this.__wbg_ptr, graph.__wbg_ptr, options.__wbg_ptr); var ptr1 = ret[0]; var len1 = ret[1]; if (ret[3]) { @@ -669,26 +513,16 @@ export class EdgeStruct { } /** * @param {NoteGraph} graph - * @returns {NodeData} - */ - source_data(graph) { - _assertClass(graph, NoteGraph); - const ret = wasm.edgestruct_source_data(this.__wbg_ptr, graph.__wbg_ptr); - if (ret[2]) { - throw takeFromExternrefTable0(ret[1]); - } - return NodeData.__wrap(ret[0]); - } - /** - * @param {NoteGraph} graph + * @param {NodeStringifyOptions} options * @returns {string} */ - source_path(graph) { + stringify_target(graph, options) { let deferred2_0; let deferred2_1; try { _assertClass(graph, NoteGraph); - const ret = wasm.edgestruct_source_path(this.__wbg_ptr, graph.__wbg_ptr); + _assertClass(options, NodeStringifyOptions); + const ret = wasm.edgestruct_stringify_target(this.__wbg_ptr, graph.__wbg_ptr, options.__wbg_ptr); var ptr1 = ret[0]; var len1 = ret[1]; if (ret[3]) { @@ -737,25 +571,6 @@ export class EdgeStruct { wasm.__wbindgen_free(deferred2_0, deferred2_1, 1); } } - /** - * @returns {boolean} - */ - is_self_loop() { - const ret = wasm.edgestruct_is_self_loop(this.__wbg_ptr); - return ret !== 0; - } - /** - * @param {NoteGraph} graph - * @returns {boolean} - */ - source_resolved(graph) { - _assertClass(graph, NoteGraph); - const ret = wasm.edgestruct_source_resolved(this.__wbg_ptr, graph.__wbg_ptr); - if (ret[2]) { - throw takeFromExternrefTable0(ret[1]); - } - return ret[0] !== 0; - } /** * @param {NoteGraph} graph * @returns {boolean} @@ -783,55 +598,31 @@ export class EdgeStruct { wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); } } - /** - * @param {NoteGraph} graph - * @param {NodeStringifyOptions} options - * @returns {string} - */ - stringify_source(graph, options) { - let deferred2_0; - let deferred2_1; - try { - _assertClass(graph, NoteGraph); - _assertClass(options, NodeStringifyOptions); - const ret = wasm.edgestruct_stringify_source(this.__wbg_ptr, graph.__wbg_ptr, options.__wbg_ptr); - var ptr1 = ret[0]; - var len1 = ret[1]; - if (ret[3]) { - ptr1 = 0; len1 = 0; - throw takeFromExternrefTable0(ret[2]); - } - deferred2_0 = ptr1; - deferred2_1 = len1; - return getStringFromWasm0(ptr1, len1); - } finally { - wasm.__wbindgen_free(deferred2_0, deferred2_1, 1); - } +} +if (Symbol.dispose) EdgeStruct.prototype[Symbol.dispose] = EdgeStruct.prototype.free; + +export class FlatTraversalData { + static __wrap(ptr) { + const obj = Object.create(FlatTraversalData.prototype); + obj.__wbg_ptr = ptr; + FlatTraversalDataFinalization.register(obj, obj.__wbg_ptr, obj); + return obj; } - /** - * @param {NoteGraph} graph - * @param {NodeStringifyOptions} options - * @returns {string} - */ - stringify_target(graph, options) { - let deferred2_0; - let deferred2_1; - try { - _assertClass(graph, NoteGraph); - _assertClass(options, NodeStringifyOptions); - const ret = wasm.edgestruct_stringify_target(this.__wbg_ptr, graph.__wbg_ptr, options.__wbg_ptr); - var ptr1 = ret[0]; - var len1 = ret[1]; - if (ret[3]) { - ptr1 = 0; len1 = 0; - throw takeFromExternrefTable0(ret[2]); - } - deferred2_0 = ptr1; - deferred2_1 = len1; - return getStringFromWasm0(ptr1, len1); - } finally { - wasm.__wbindgen_free(deferred2_0, deferred2_1, 1); + static __unwrap(jsValue) { + if (!(jsValue instanceof FlatTraversalData)) { + return 0; } + return jsValue.__destroy_into_raw(); + } + __destroy_into_raw() { + const ptr = this.__wbg_ptr; + this.__wbg_ptr = 0; + FlatTraversalDataFinalization.unregister(this); + return ptr; + } + free() { + const ptr = this.__destroy_into_raw(); + wasm.__wbg_flattraversaldata_free(ptr, 0); } /** * @param {NoteGraph} graph @@ -845,7 +636,7 @@ export class EdgeStruct { _assertClass(graph, NoteGraph); const ptr0 = passArrayJsValueToWasm0(attributes, wasm.__wbindgen_malloc); const len0 = WASM_VECTOR_LEN; - const ret = wasm.edgestruct_get_attribute_label(this.__wbg_ptr, graph.__wbg_ptr, ptr0, len0); + const ret = wasm.flattraversaldata_get_attribute_label(this.__wbg_ptr, graph.__wbg_ptr, ptr0, len0); var ptr2 = ret[0]; var len2 = ret[1]; if (ret[3]) { @@ -861,111 +652,77 @@ export class EdgeStruct { } /** * @param {NoteGraph} graph - * @param {string[] | null} [edge_types] - * @returns {boolean} + * @param {NodeStringifyOptions} str_opt + * @param {string[]} attributes + * @returns {any} */ - matches_edge_filter(graph, edge_types) { + to_js_rendering_obj(graph, str_opt, attributes) { _assertClass(graph, NoteGraph); - var ptr0 = isLikeNone(edge_types) ? 0 : passArrayJsValueToWasm0(edge_types, wasm.__wbindgen_malloc); - var len0 = WASM_VECTOR_LEN; - const ret = wasm.edgestruct_matches_edge_filter(this.__wbg_ptr, graph.__wbg_ptr, ptr0, len0); + _assertClass(str_opt, NodeStringifyOptions); + const ptr0 = passArrayJsValueToWasm0(attributes, wasm.__wbindgen_malloc); + const len0 = WASM_VECTOR_LEN; + const ret = wasm.flattraversaldata_to_js_rendering_obj(this.__wbg_ptr, graph.__wbg_ptr, str_opt.__wbg_ptr, ptr0, len0); if (ret[2]) { throw takeFromExternrefTable0(ret[1]); } - return ret[0] !== 0; + return takeFromExternrefTable0(ret[0]); } /** - * @param {NoteGraph} graph + * the children of the node + * @returns {Uint32Array} + */ + get children() { + const ret = wasm.__wbg_get_flattraversaldata_children(this.__wbg_ptr); + var v1 = getArrayU32FromWasm0(ret[0], ret[1]).slice(); + wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + return v1; + } + /** + * the depth of the node in the traversal * @returns {number} */ - round(graph) { - _assertClass(graph, NoteGraph); - const ret = wasm.edgestruct_round(this.__wbg_ptr, graph.__wbg_ptr); - if (ret[2]) { - throw takeFromExternrefTable0(ret[1]); - } - return ret[0]; + get depth() { + const ret = wasm.__wbg_get_flattraversaldata_depth(this.__wbg_ptr); + return ret >>> 0; } /** - * @param {NoteGraph} graph - * @returns {boolean} + * the edge struct that was traversed + * @returns {EdgeStruct} */ - explicit(graph) { - _assertClass(graph, NoteGraph); - const ret = wasm.edgestruct_explicit(this.__wbg_ptr, graph.__wbg_ptr); - if (ret[2]) { - throw takeFromExternrefTable0(ret[1]); - } - return ret[0] !== 0; + get edge() { + const ret = wasm.__wbg_get_flattraversaldata_edge(this.__wbg_ptr); + return EdgeStruct.__wrap(ret); } /** - * @param {NoteGraph} graph - * @returns {EdgeData} + * @returns {boolean} */ - edge_data(graph) { - _assertClass(graph, NoteGraph); - const ret = wasm.edgestruct_edge_data(this.__wbg_ptr, graph.__wbg_ptr); - if (ret[2]) { - throw takeFromExternrefTable0(ret[1]); - } - return EdgeData.__wrap(ret[0]); + get has_cut_of_children() { + const ret = wasm.__wbg_get_flattraversaldata_has_cut_of_children(this.__wbg_ptr); + return ret !== 0; } /** - * @returns {string} + * the number of total children of the node, so also children of children + * @returns {number} */ - get edge_type() { - let deferred1_0; - let deferred1_1; - try { - const ret = wasm.edgestruct_edge_type(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); - } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); - } + get number_of_children() { + const ret = wasm.__wbg_get_flattraversaldata_number_of_children(this.__wbg_ptr); + return ret >>> 0; } -} - -const FlatTraversalDataFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_flattraversaldata_free(ptr >>> 0, 1)); - -export class FlatTraversalData { - - static __wrap(ptr) { - ptr = ptr >>> 0; - const obj = Object.create(FlatTraversalData.prototype); - obj.__wbg_ptr = ptr; - FlatTraversalDataFinalization.register(obj, obj.__wbg_ptr, obj); - return obj; - } - - static __unwrap(jsValue) { - if (!(jsValue instanceof FlatTraversalData)) { - return 0; - } - return jsValue.__destroy_into_raw(); - } - - __destroy_into_raw() { - const ptr = this.__wbg_ptr; - this.__wbg_ptr = 0; - FlatTraversalDataFinalization.unregister(this); - return ptr; - } - - free() { - const ptr = this.__destroy_into_raw(); - wasm.__wbg_flattraversaldata_free(ptr, 0); + /** + * the children of the node + * @param {Uint32Array} arg0 + */ + set children(arg0) { + const ptr0 = passArray32ToWasm0(arg0, wasm.__wbindgen_malloc); + const len0 = WASM_VECTOR_LEN; + wasm.__wbg_set_flattraversaldata_children(this.__wbg_ptr, ptr0, len0); } /** - * the edge struct that was traversed - * @returns {EdgeStruct} + * the depth of the node in the traversal + * @param {number} arg0 */ - get edge() { - const ret = wasm.__wbg_get_flattraversaldata_edge(this.__wbg_ptr); - return EdgeStruct.__wrap(ret); + set depth(arg0) { + wasm.__wbg_set_flattraversaldata_depth(this.__wbg_ptr, arg0); } /** * the edge struct that was traversed @@ -977,27 +734,10 @@ export class FlatTraversalData { wasm.__wbg_set_flattraversaldata_edge(this.__wbg_ptr, ptr0); } /** - * the depth of the node in the traversal - * @returns {number} - */ - get depth() { - const ret = wasm.__wbg_get_flattraversaldata_depth(this.__wbg_ptr); - return ret >>> 0; - } - /** - * the depth of the node in the traversal - * @param {number} arg0 - */ - set depth(arg0) { - wasm.__wbg_set_flattraversaldata_depth(this.__wbg_ptr, arg0); - } - /** - * the number of total children of the node, so also children of children - * @returns {number} + * @param {boolean} arg0 */ - get number_of_children() { - const ret = wasm.__wbg_get_flattraversaldata_number_of_children(this.__wbg_ptr); - return ret >>> 0; + set has_cut_of_children(arg0) { + wasm.__wbg_set_flattraversaldata_has_cut_of_children(this.__wbg_ptr, arg0); } /** * the number of total children of the node, so also children of children @@ -1006,163 +746,140 @@ export class FlatTraversalData { set number_of_children(arg0) { wasm.__wbg_set_flattraversaldata_number_of_children(this.__wbg_ptr, arg0); } +} +if (Symbol.dispose) FlatTraversalData.prototype[Symbol.dispose] = FlatTraversalData.prototype.free; + +export class FlatTraversalResult { + static __wrap(ptr) { + const obj = Object.create(FlatTraversalResult.prototype); + obj.__wbg_ptr = ptr; + FlatTraversalResultFinalization.register(obj, obj.__wbg_ptr, obj); + return obj; + } + __destroy_into_raw() { + const ptr = this.__wbg_ptr; + this.__wbg_ptr = 0; + FlatTraversalResultFinalization.unregister(this); + return ptr; + } + free() { + const ptr = this.__destroy_into_raw(); + wasm.__wbg_flattraversalresult_free(ptr, 0); + } /** - * the children of the node - * @returns {Uint32Array} + * @param {number} index + * @returns {Uint32Array | undefined} */ - get children() { - const ret = wasm.__wbg_get_flattraversaldata_children(this.__wbg_ptr); - var v1 = getArrayU32FromWasm0(ret[0], ret[1]).slice(); - wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + children_at_index(index) { + const ret = wasm.flattraversalresult_children_at_index(this.__wbg_ptr, index); + let v1; + if (ret[0] !== 0) { + v1 = getArrayU32FromWasm0(ret[0], ret[1]).slice(); + wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + } return v1; } /** - * the children of the node - * @param {Uint32Array} arg0 + * @param {number} index + * @returns {FlatTraversalData | undefined} */ - set children(arg0) { - const ptr0 = passArray32ToWasm0(arg0, wasm.__wbindgen_malloc); - const len0 = WASM_VECTOR_LEN; - wasm.__wbg_set_flattraversaldata_children(this.__wbg_ptr, ptr0, len0); + data_at_index(index) { + const ret = wasm.flattraversalresult_data_at_index(this.__wbg_ptr, index); + return ret === 0 ? undefined : FlatTraversalData.__wrap(ret); } /** * @returns {boolean} */ - get has_cut_of_children() { - const ret = wasm.__wbg_get_flattraversaldata_has_cut_of_children(this.__wbg_ptr); + is_empty() { + const ret = wasm.flattraversalresult_is_empty(this.__wbg_ptr); return ret !== 0; } /** - * @param {boolean} arg0 - */ - set has_cut_of_children(arg0) { - wasm.__wbg_set_flattraversaldata_has_cut_of_children(this.__wbg_ptr, arg0); - } - /** - * @param {NoteGraph} graph - * @param {string[]} attributes - * @returns {string} - */ - get_attribute_label(graph, attributes) { - let deferred3_0; - let deferred3_1; - try { - _assertClass(graph, NoteGraph); - const ptr0 = passArrayJsValueToWasm0(attributes, wasm.__wbindgen_malloc); - const len0 = WASM_VECTOR_LEN; - const ret = wasm.flattraversaldata_get_attribute_label(this.__wbg_ptr, graph.__wbg_ptr, ptr0, len0); - var ptr2 = ret[0]; - var len2 = ret[1]; - if (ret[3]) { - ptr2 = 0; len2 = 0; - throw takeFromExternrefTable0(ret[2]); - } - deferred3_0 = ptr2; - deferred3_1 = len2; - return getStringFromWasm0(ptr2, len2); - } finally { - wasm.__wbindgen_free(deferred3_0, deferred3_1, 1); - } - } - /** + * @param {number} index * @param {NoteGraph} graph * @param {NodeStringifyOptions} str_opt * @param {string[]} attributes * @returns {any} */ - to_js_rendering_obj(graph, str_opt, attributes) { + rendering_obj_at_index(index, graph, str_opt, attributes) { _assertClass(graph, NoteGraph); _assertClass(str_opt, NodeStringifyOptions); const ptr0 = passArrayJsValueToWasm0(attributes, wasm.__wbindgen_malloc); const len0 = WASM_VECTOR_LEN; - const ret = wasm.flattraversaldata_to_js_rendering_obj(this.__wbg_ptr, graph.__wbg_ptr, str_opt.__wbg_ptr, ptr0, len0); + const ret = wasm.flattraversalresult_rendering_obj_at_index(this.__wbg_ptr, index, graph.__wbg_ptr, str_opt.__wbg_ptr, ptr0, len0); if (ret[2]) { throw takeFromExternrefTable0(ret[1]); } return takeFromExternrefTable0(ret[0]); } -} - -const FlatTraversalResultFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_flattraversalresult_free(ptr >>> 0, 1)); - -export class FlatTraversalResult { - - static __wrap(ptr) { - ptr = ptr >>> 0; - const obj = Object.create(FlatTraversalResult.prototype); - obj.__wbg_ptr = ptr; - FlatTraversalResultFinalization.register(obj, obj.__wbg_ptr, obj); - return obj; - } - - __destroy_into_raw() { - const ptr = this.__wbg_ptr; - this.__wbg_ptr = 0; - FlatTraversalResultFinalization.unregister(this); - return ptr; + /** + * Sorts the flat traversal data with a given edge sorter. + * This is not as efficient as sorting the traversal data before flattening + * it, but it's still a lot better than sorting then re-flatten. + * @param {NoteGraph} graph + * @param {EdgeSorter} sorter + */ + sort(graph, sorter) { + _assertClass(graph, NoteGraph); + _assertClass(sorter, EdgeSorter); + const ret = wasm.flattraversalresult_sort(this.__wbg_ptr, graph.__wbg_ptr, sorter.__wbg_ptr); + if (ret[1]) { + throw takeFromExternrefTable0(ret[0]); + } } - - free() { - const ptr = this.__destroy_into_raw(); - wasm.__wbg_flattraversalresult_free(ptr, 0); + /** + * @returns {string} + */ + toString() { + let deferred1_0; + let deferred1_1; + try { + const ret = wasm.flattraversalresult_toString(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + } } /** * @returns {FlatTraversalData[]} */ get data() { const ret = wasm.__wbg_get_flattraversalresult_data(this.__wbg_ptr); - var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); + var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); return v1; } /** - * @param {FlatTraversalData[]} arg0 - */ - set data(arg0) { - const ptr0 = passArrayJsValueToWasm0(arg0, wasm.__wbindgen_malloc); - const len0 = WASM_VECTOR_LEN; - wasm.__wbg_set_flattraversalresult_data(this.__wbg_ptr, ptr0, len0); - } - /** - * @returns {number} + * @returns {Uint32Array} */ - get node_count() { - const ret = wasm.__wbg_get_flattraversalresult_node_count(this.__wbg_ptr); - return ret >>> 0; + get entry_nodes() { + const ret = wasm.__wbg_get_flattraversalresult_entry_nodes(this.__wbg_ptr); + var v1 = getArrayU32FromWasm0(ret[0], ret[1]).slice(); + wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + return v1; } /** - * @param {number} arg0 + * @returns {boolean} */ - set node_count(arg0) { - wasm.__wbg_set_flattraversalresult_node_count(this.__wbg_ptr, arg0); + get hit_depth_limit() { + const ret = wasm.__wbg_get_flattraversalresult_hit_depth_limit(this.__wbg_ptr); + return ret !== 0; } /** * @returns {number} */ get max_depth() { - const ret = wasm.__wbg_get_flattraversaldata_number_of_children(this.__wbg_ptr); + const ret = wasm.__wbg_get_flattraversalresult_max_depth(this.__wbg_ptr); return ret >>> 0; } /** - * @param {number} arg0 - */ - set max_depth(arg0) { - wasm.__wbg_set_flattraversaldata_number_of_children(this.__wbg_ptr, arg0); - } - /** - * @returns {boolean} - */ - get hit_depth_limit() { - const ret = wasm.__wbg_get_flattraversalresult_hit_depth_limit(this.__wbg_ptr); - return ret !== 0; - } - /** - * @param {boolean} arg0 + * @returns {number} */ - set hit_depth_limit(arg0) { - wasm.__wbg_set_flattraversalresult_hit_depth_limit(this.__wbg_ptr, arg0); + get node_count() { + const ret = wasm.__wbg_get_flattraversalresult_node_count(this.__wbg_ptr); + return ret >>> 0; } /** * @returns {bigint} @@ -1172,19 +889,12 @@ export class FlatTraversalResult { return BigInt.asUintN(64, ret); } /** - * @param {bigint} arg0 + * @param {FlatTraversalData[]} arg0 */ - set traversal_time(arg0) { - wasm.__wbg_set_flattraversalresult_traversal_time(this.__wbg_ptr, arg0); - } - /** - * @returns {Uint32Array} - */ - get entry_nodes() { - const ret = wasm.__wbg_get_flattraversalresult_entry_nodes(this.__wbg_ptr); - var v1 = getArrayU32FromWasm0(ret[0], ret[1]).slice(); - wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); - return v1; + set data(arg0) { + const ptr0 = passArrayJsValueToWasm0(arg0, wasm.__wbindgen_malloc); + const len0 = WASM_VECTOR_LEN; + wasm.__wbg_set_flattraversalresult_data(this.__wbg_ptr, ptr0, len0); } /** * @param {Uint32Array} arg0 @@ -1195,103 +905,45 @@ export class FlatTraversalResult { wasm.__wbg_set_flattraversalresult_entry_nodes(this.__wbg_ptr, ptr0, len0); } /** - * @param {number} index - * @returns {FlatTraversalData | undefined} - */ - data_at_index(index) { - const ret = wasm.flattraversalresult_data_at_index(this.__wbg_ptr, index); - return ret === 0 ? undefined : FlatTraversalData.__wrap(ret); - } - /** - * @returns {string} - */ - toString() { - let deferred1_0; - let deferred1_1; - try { - const ret = wasm.flattraversalresult_toString(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); - } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); - } - } - /** - * @param {number} index - * @returns {Uint32Array | undefined} + * @param {boolean} arg0 */ - children_at_index(index) { - const ret = wasm.flattraversalresult_children_at_index(this.__wbg_ptr, index); - let v1; - if (ret[0] !== 0) { - v1 = getArrayU32FromWasm0(ret[0], ret[1]).slice(); - wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); - } - return v1; + set hit_depth_limit(arg0) { + wasm.__wbg_set_flattraversalresult_hit_depth_limit(this.__wbg_ptr, arg0); } /** - * @param {number} index - * @param {NoteGraph} graph - * @param {NodeStringifyOptions} str_opt - * @param {string[]} attributes - * @returns {any} + * @param {number} arg0 */ - rendering_obj_at_index(index, graph, str_opt, attributes) { - _assertClass(graph, NoteGraph); - _assertClass(str_opt, NodeStringifyOptions); - const ptr0 = passArrayJsValueToWasm0(attributes, wasm.__wbindgen_malloc); - const len0 = WASM_VECTOR_LEN; - const ret = wasm.flattraversalresult_rendering_obj_at_index(this.__wbg_ptr, index, graph.__wbg_ptr, str_opt.__wbg_ptr, ptr0, len0); - if (ret[2]) { - throw takeFromExternrefTable0(ret[1]); - } - return takeFromExternrefTable0(ret[0]); + set max_depth(arg0) { + wasm.__wbg_set_flattraversalresult_max_depth(this.__wbg_ptr, arg0); } /** - * Sorts the flat traversal data with a given edge sorter. - * This is not as efficient as sorting the traversal data before flattening - * it, but it's still a lot better than sorting then re-flatten. - * @param {NoteGraph} graph - * @param {EdgeSorter} sorter + * @param {number} arg0 */ - sort(graph, sorter) { - _assertClass(graph, NoteGraph); - _assertClass(sorter, EdgeSorter); - const ret = wasm.flattraversalresult_sort(this.__wbg_ptr, graph.__wbg_ptr, sorter.__wbg_ptr); - if (ret[1]) { - throw takeFromExternrefTable0(ret[0]); - } + set node_count(arg0) { + wasm.__wbg_set_flattraversalresult_node_count(this.__wbg_ptr, arg0); } /** - * @returns {boolean} + * @param {bigint} arg0 */ - is_empty() { - const ret = wasm.flattraversalresult_is_empty(this.__wbg_ptr); - return ret !== 0; + set traversal_time(arg0) { + wasm.__wbg_set_flattraversalresult_traversal_time(this.__wbg_ptr, arg0); } } - -const GCEdgeDataFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_gcedgedata_free(ptr >>> 0, 1)); +if (Symbol.dispose) FlatTraversalResult.prototype[Symbol.dispose] = FlatTraversalResult.prototype.free; export class GCEdgeData { - static __unwrap(jsValue) { if (!(jsValue instanceof GCEdgeData)) { return 0; } return jsValue.__destroy_into_raw(); } - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; GCEdgeDataFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_gcedgedata_free(ptr, 0); @@ -1314,11 +966,11 @@ export class GCEdgeData { /** * @returns {string} */ - toString() { + get edge_type() { let deferred1_0; let deferred1_1; try { - const ret = wasm.gcedgedata_toString(this.__wbg_ptr); + const ret = wasm.gcedgedata_edge_type(this.__wbg_ptr); deferred1_0 = ret[0]; deferred1_1 = ret[1]; return getStringFromWasm0(ret[0], ret[1]); @@ -1342,7 +994,7 @@ export class GCEdgeData { const ptr3 = passStringToWasm0(edge_source, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); const len3 = WASM_VECTOR_LEN; const ret = wasm.gcedgedata_new(ptr0, len0, ptr1, len1, ptr2, len2, ptr3, len3); - this.__wbg_ptr = ret >>> 0; + this.__wbg_ptr = ret; GCEdgeDataFinalization.register(this, this.__wbg_ptr, this); return this; } @@ -1379,11 +1031,11 @@ export class GCEdgeData { /** * @returns {string} */ - get edge_type() { + toString() { let deferred1_0; let deferred1_1; try { - const ret = wasm.gcedgedata_edge_type(this.__wbg_ptr); + const ret = wasm.gcedgedata_toString(this.__wbg_ptr); deferred1_0 = ret[0]; deferred1_1 = ret[1]; return getStringFromWasm0(ret[0], ret[1]); @@ -1392,46 +1044,25 @@ export class GCEdgeData { } } } - -const GCNodeDataFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_gcnodedata_free(ptr >>> 0, 1)); +if (Symbol.dispose) GCEdgeData.prototype[Symbol.dispose] = GCEdgeData.prototype.free; export class GCNodeData { - static __unwrap(jsValue) { if (!(jsValue instanceof GCNodeData)) { return 0; } return jsValue.__destroy_into_raw(); } - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; GCNodeDataFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_gcnodedata_free(ptr, 0); } - /** - * @returns {string} - */ - toString() { - let deferred1_0; - let deferred1_1; - try { - const ret = wasm.gcnodedata_toString(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); - } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); - } - } /** * @param {string} path * @param {string[]} aliases @@ -1445,53 +1076,62 @@ export class GCNodeData { const ptr1 = passArrayJsValueToWasm0(aliases, wasm.__wbindgen_malloc); const len1 = WASM_VECTOR_LEN; const ret = wasm.gcnodedata_new(ptr0, len0, ptr1, len1, resolved, ignore_in_edges, ignore_out_edges); - this.__wbg_ptr = ret >>> 0; + this.__wbg_ptr = ret; GCNodeDataFinalization.register(this, this.__wbg_ptr, this); return this; } + /** + * @returns {string} + */ + toString() { + let deferred1_0; + let deferred1_1; + try { + const ret = wasm.gcnodedata_toString(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + } + } } +if (Symbol.dispose) GCNodeData.prototype[Symbol.dispose] = GCNodeData.prototype.free; -const GroupedEdgeListFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_groupededgelist_free(ptr >>> 0, 1)); /** * A edge list that is grouped by edge type. */ export class GroupedEdgeList { - static __wrap(ptr) { - ptr = ptr >>> 0; const obj = Object.create(GroupedEdgeList.prototype); obj.__wbg_ptr = ptr; GroupedEdgeListFinalization.register(obj, obj.__wbg_ptr, obj); return obj; } - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; GroupedEdgeListFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_groupededgelist_free(ptr, 0); } /** - * @returns {string} + * @param {string} edge_type + * @returns {EdgeStruct[] | undefined} */ - toString() { - let deferred1_0; - let deferred1_1; - try { - const ret = wasm.groupededgelist_toString(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); - } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + get_edges(edge_type) { + const ptr0 = passStringToWasm0(edge_type, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len0 = WASM_VECTOR_LEN; + const ret = wasm.groupededgelist_get_edges(this.__wbg_ptr, ptr0, len0); + let v2; + if (ret[0] !== 0) { + v2 = getArrayJsValueFromWasm0(ret[0], ret[1]); + wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); } + return v2; } /** * @param {string} edge_type @@ -1510,49 +1150,42 @@ export class GroupedEdgeList { } let v2; if (ret[0] !== 0) { - v2 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); + v2 = getArrayJsValueFromWasm0(ret[0], ret[1]); wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); } return v2; } /** - * @param {string} edge_type - * @returns {EdgeStruct[] | undefined} + * @returns {string} */ - get_edges(edge_type) { - const ptr0 = passStringToWasm0(edge_type, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); - const len0 = WASM_VECTOR_LEN; - const ret = wasm.groupededgelist_get_edges(this.__wbg_ptr, ptr0, len0); - let v2; - if (ret[0] !== 0) { - v2 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); - wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + toString() { + let deferred1_0; + let deferred1_1; + try { + const ret = wasm.groupededgelist_toString(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); } - return v2; } } - -const MermaidGraphDataFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_mermaidgraphdata_free(ptr >>> 0, 1)); +if (Symbol.dispose) GroupedEdgeList.prototype[Symbol.dispose] = GroupedEdgeList.prototype.free; export class MermaidGraphData { - static __wrap(ptr) { - ptr = ptr >>> 0; const obj = Object.create(MermaidGraphData.prototype); obj.__wbg_ptr = ptr; MermaidGraphDataFinalization.register(obj, obj.__wbg_ptr, obj); return obj; } - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; MermaidGraphDataFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_mermaidgraphdata_free(ptr, 0); @@ -1572,27 +1205,6 @@ export class MermaidGraphData { wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); } } - /** - * @param {string} arg0 - */ - set mermaid(arg0) { - const ptr0 = passStringToWasm0(arg0, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); - const len0 = WASM_VECTOR_LEN; - wasm.__wbg_set_mermaidgraphdata_mermaid(this.__wbg_ptr, ptr0, len0); - } - /** - * @returns {bigint} - */ - get traversal_time() { - const ret = wasm.__wbg_get_mermaidgraphdata_traversal_time(this.__wbg_ptr); - return BigInt.asUintN(64, ret); - } - /** - * @param {bigint} arg0 - */ - set traversal_time(arg0) { - wasm.__wbg_set_mermaidgraphdata_traversal_time(this.__wbg_ptr, arg0); - } /** * @returns {bigint} */ @@ -1601,10 +1213,11 @@ export class MermaidGraphData { return BigInt.asUintN(64, ret); } /** - * @param {bigint} arg0 + * @returns {bigint} */ - set total_time(arg0) { - wasm.__wbg_set_mermaidgraphdata_total_time(this.__wbg_ptr, arg0); + get traversal_time() { + const ret = wasm.__wbg_get_mermaidgraphdata_traversal_time(this.__wbg_ptr); + return BigInt.asUintN(64, ret); } /** * @returns {string} @@ -1621,53 +1234,53 @@ export class MermaidGraphData { wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); } } + /** + * @param {string} arg0 + */ + set mermaid(arg0) { + const ptr0 = passStringToWasm0(arg0, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len0 = WASM_VECTOR_LEN; + wasm.__wbg_set_mermaidgraphdata_mermaid(this.__wbg_ptr, ptr0, len0); + } + /** + * @param {bigint} arg0 + */ + set total_time(arg0) { + wasm.__wbg_set_mermaidgraphdata_total_time(this.__wbg_ptr, arg0); + } + /** + * @param {bigint} arg0 + */ + set traversal_time(arg0) { + wasm.__wbg_set_mermaidgraphdata_traversal_time(this.__wbg_ptr, arg0); + } } - -const MermaidGraphOptionsFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_mermaidgraphoptions_free(ptr >>> 0, 1)); +if (Symbol.dispose) MermaidGraphData.prototype[Symbol.dispose] = MermaidGraphData.prototype.free; export class MermaidGraphOptions { - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; MermaidGraphOptionsFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_mermaidgraphoptions_free(ptr, 0); } /** - * @returns {string} - */ - toString() { - let deferred1_0; - let deferred1_1; - try { - const ret = wasm.mermaidgraphoptions_toString(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); - } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); - } - } - /** - * @param {string | null | undefined} active_node - * @param {string} init_line - * @param {string} chart_type - * @param {string} direction - * @param {boolean} collapse_opposing_edges - * @param {string[]} edge_label_attributes - * @param {EdgeSorter | null | undefined} edge_sorter - * @param {Function | null | undefined} node_label_fn - * @param {boolean} link_nodes - * @param {boolean} show_arrow_points - * @param {string[]} field_arrow_keys - * @param {string[]} field_arrow_values + * @param {string | null | undefined} active_node + * @param {string} init_line + * @param {string} chart_type + * @param {string} direction + * @param {boolean} collapse_opposing_edges + * @param {string[]} edge_label_attributes + * @param {EdgeSorter | null | undefined} edge_sorter + * @param {Function | null | undefined} node_label_fn + * @param {boolean} link_nodes + * @param {boolean} show_arrow_points + * @param {string[]} field_arrow_keys + * @param {string[]} field_arrow_values */ constructor(active_node, init_line, chart_type, direction, collapse_opposing_edges, edge_label_attributes, edge_sorter, node_label_fn, link_nodes, show_arrow_points, field_arrow_keys, field_arrow_values) { var ptr0 = isLikeNone(active_node) ? 0 : passStringToWasm0(active_node, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); @@ -1690,90 +1303,54 @@ export class MermaidGraphOptions { const ptr7 = passArrayJsValueToWasm0(field_arrow_values, wasm.__wbindgen_malloc); const len7 = WASM_VECTOR_LEN; const ret = wasm.mermaidgraphoptions_new(ptr0, len0, ptr1, len1, ptr2, len2, ptr3, len3, collapse_opposing_edges, ptr4, len4, ptr5, isLikeNone(node_label_fn) ? 0 : addToExternrefTable0(node_label_fn), link_nodes, show_arrow_points, ptr6, len6, ptr7, len7); - this.__wbg_ptr = ret >>> 0; + this.__wbg_ptr = ret; MermaidGraphOptionsFinalization.register(this, this.__wbg_ptr, this); return this; } + /** + * @returns {string} + */ + toString() { + let deferred1_0; + let deferred1_1; + try { + const ret = wasm.mermaidgraphoptions_toString(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + } + } } - -const NodeDataFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_nodedata_free(ptr >>> 0, 1)); +if (Symbol.dispose) MermaidGraphOptions.prototype[Symbol.dispose] = MermaidGraphOptions.prototype.free; export class NodeData { - static __wrap(ptr) { - ptr = ptr >>> 0; const obj = Object.create(NodeData.prototype); obj.__wbg_ptr = ptr; NodeDataFinalization.register(obj, obj.__wbg_ptr, obj); return obj; } - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; NodeDataFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_nodedata_free(ptr, 0); } - /** - * @returns {string} - */ - get path() { - let deferred1_0; - let deferred1_1; - try { - const ret = wasm.__wbg_get_nodedata_path(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); - } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); - } - } - /** - * @param {string} arg0 - */ - set path(arg0) { - const ptr0 = passStringToWasm0(arg0, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); - const len0 = WASM_VECTOR_LEN; - wasm.__wbg_set_nodedata_path(this.__wbg_ptr, ptr0, len0); - } /** * @returns {string[]} */ get aliases() { const ret = wasm.__wbg_get_nodedata_aliases(this.__wbg_ptr); - var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); + var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); return v1; } - /** - * @param {string[]} arg0 - */ - set aliases(arg0) { - const ptr0 = passArrayJsValueToWasm0(arg0, wasm.__wbindgen_malloc); - const len0 = WASM_VECTOR_LEN; - wasm.__wbg_set_nodedata_aliases(this.__wbg_ptr, ptr0, len0); - } - /** - * @returns {boolean} - */ - get resolved() { - const ret = wasm.__wbg_get_nodedata_resolved(this.__wbg_ptr); - return ret !== 0; - } - /** - * @param {boolean} arg0 - */ - set resolved(arg0) { - wasm.__wbg_set_nodedata_resolved(this.__wbg_ptr, arg0); - } /** * @returns {boolean} */ @@ -1781,12 +1358,6 @@ export class NodeData { const ret = wasm.__wbg_get_nodedata_ignore_in_edges(this.__wbg_ptr); return ret !== 0; } - /** - * @param {boolean} arg0 - */ - set ignore_in_edges(arg0) { - wasm.__wbg_set_nodedata_ignore_in_edges(this.__wbg_ptr, arg0); - } /** * @returns {boolean} */ @@ -1794,20 +1365,14 @@ export class NodeData { const ret = wasm.__wbg_get_nodedata_ignore_out_edges(this.__wbg_ptr); return ret !== 0; } - /** - * @param {boolean} arg0 - */ - set ignore_out_edges(arg0) { - wasm.__wbg_set_nodedata_ignore_out_edges(this.__wbg_ptr, arg0); - } /** * @returns {string} */ - toString() { + get path() { let deferred1_0; let deferred1_1; try { - const ret = wasm.nodedata_toString(this.__wbg_ptr); + const ret = wasm.__wbg_get_nodedata_path(this.__wbg_ptr); deferred1_0 = ret[0]; deferred1_1 = ret[1]; return getStringFromWasm0(ret[0], ret[1]); @@ -1815,6 +1380,13 @@ export class NodeData { wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); } } + /** + * @returns {boolean} + */ + get resolved() { + const ret = wasm.__wbg_get_nodedata_resolved(this.__wbg_ptr); + return ret !== 0; + } /** * @param {string} path * @param {string[]} aliases @@ -1828,25 +1400,69 @@ export class NodeData { const ptr1 = passArrayJsValueToWasm0(aliases, wasm.__wbindgen_malloc); const len1 = WASM_VECTOR_LEN; const ret = wasm.nodedata_new(ptr0, len0, ptr1, len1, resolved, ignore_in_edges, ignore_out_edges); - this.__wbg_ptr = ret >>> 0; + this.__wbg_ptr = ret; NodeDataFinalization.register(this, this.__wbg_ptr, this); return this; } + /** + * @returns {string} + */ + toString() { + let deferred1_0; + let deferred1_1; + try { + const ret = wasm.nodedata_toString(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + } + } + /** + * @param {string[]} arg0 + */ + set aliases(arg0) { + const ptr0 = passArrayJsValueToWasm0(arg0, wasm.__wbindgen_malloc); + const len0 = WASM_VECTOR_LEN; + wasm.__wbg_set_nodedata_aliases(this.__wbg_ptr, ptr0, len0); + } + /** + * @param {boolean} arg0 + */ + set ignore_in_edges(arg0) { + wasm.__wbg_set_nodedata_ignore_in_edges(this.__wbg_ptr, arg0); + } + /** + * @param {boolean} arg0 + */ + set ignore_out_edges(arg0) { + wasm.__wbg_set_nodedata_ignore_out_edges(this.__wbg_ptr, arg0); + } + /** + * @param {string} arg0 + */ + set path(arg0) { + const ptr0 = passStringToWasm0(arg0, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len0 = WASM_VECTOR_LEN; + wasm.__wbg_set_nodedata_path(this.__wbg_ptr, ptr0, len0); + } + /** + * @param {boolean} arg0 + */ + set resolved(arg0) { + wasm.__wbg_set_nodedata_resolved(this.__wbg_ptr, arg0); + } } - -const NodeStringifyOptionsFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_nodestringifyoptions_free(ptr >>> 0, 1)); +if (Symbol.dispose) NodeData.prototype[Symbol.dispose] = NodeData.prototype.free; export class NodeStringifyOptions { - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; NodeStringifyOptionsFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_nodestringifyoptions_free(ptr, 0); @@ -1861,7 +1477,7 @@ export class NodeStringifyOptions { var ptr0 = isLikeNone(trim_basename_delimiter) ? 0 : passStringToWasm0(trim_basename_delimiter, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); var len0 = WASM_VECTOR_LEN; const ret = wasm.nodestringifyoptions_new(extension, folder, alias, ptr0, len0); - this.__wbg_ptr = ret >>> 0; + this.__wbg_ptr = ret; NodeStringifyOptionsFinalization.register(this, this.__wbg_ptr, this); return this; } @@ -1883,10 +1499,8 @@ export class NodeStringifyOptions { } } } +if (Symbol.dispose) NodeStringifyOptions.prototype[Symbol.dispose] = NodeStringifyOptions.prototype.free; -const NoteGraphFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_notegraph_free(ptr >>> 0, 1)); /** * A graph that stores notes and their relationships. * @@ -1897,68 +1511,38 @@ const NoteGraphFinalization = (typeof FinalizationRegistry === 'undefined') * present in the graph. */ export class NoteGraph { - static __wrap(ptr) { - ptr = ptr >>> 0; const obj = Object.create(NoteGraph.prototype); obj.__wbg_ptr = ptr; NoteGraphFinalization.register(obj, obj.__wbg_ptr, obj); return obj; } - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; NoteGraphFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_notegraph_free(ptr, 0); } /** - * Runs a recursive traversal of the graph. - * @param {TraversalOptions} options - * @returns {TraversalResult} - */ - rec_traverse(options) { - _assertClass(options, TraversalOptions); - var ptr0 = options.__destroy_into_raw(); - const ret = wasm.notegraph_rec_traverse(this.__wbg_ptr, ptr0); - if (ret[2]) { - throw takeFromExternrefTable0(ret[1]); - } - return TraversalResult.__wrap(ret[0]); - } - /** - * Runs a recursive traversal of the graph and post-processes the result. - * The post-processed result is more efficient to work with from - * JavaScript. - * @param {TraversalOptions} options - * @param {TraversalPostprocessOptions} postprocess_options - * @returns {FlatTraversalResult} + * Applies a batch update to the graph. + * Throws an error if the update fails, and leave the graph in an + * inconsistent state. + * + * TODO: some security against errors leaving the graph in an inconsistent + * state. Maybe safely clear the entire graph. + * @param {BatchGraphUpdate} update */ - rec_traverse_and_process(options, postprocess_options) { - _assertClass(options, TraversalOptions); - var ptr0 = options.__destroy_into_raw(); - _assertClass(postprocess_options, TraversalPostprocessOptions); - var ptr1 = postprocess_options.__destroy_into_raw(); - const ret = wasm.notegraph_rec_traverse_and_process(this.__wbg_ptr, ptr0, ptr1); - if (ret[2]) { - throw takeFromExternrefTable0(ret[1]); + apply_update(update) { + _assertClass(update, BatchGraphUpdate); + var ptr0 = update.__destroy_into_raw(); + const ret = wasm.notegraph_apply_update(this.__wbg_ptr, ptr0); + if (ret[1]) { + throw takeFromExternrefTable0(ret[0]); } - return FlatTraversalResult.__wrap(ret[0]); - } - /** - * Returns all edge types that are present in the graph. - * @returns {string[]} - */ - edge_types() { - const ret = wasm.notegraph_edge_types(this.__wbg_ptr); - var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); - wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); - return v1; } /** * Builds the graph from a list of nodes, edges, and transitive rules. @@ -1980,55 +1564,58 @@ export class NoteGraph { } } /** - * Applies a batch update to the graph. - * Throws an error if the update fails, and leave the graph in an - * inconsistent state. - * - * TODO: some security against errors leaving the graph in an inconsistent - * state. Maybe safely clear the entire graph. - * @param {BatchGraphUpdate} update + * Returns all edge types that are present in the graph. + * @returns {string[]} */ - apply_update(update) { - _assertClass(update, BatchGraphUpdate); - var ptr0 = update.__destroy_into_raw(); - const ret = wasm.notegraph_apply_update(this.__wbg_ptr, ptr0); - if (ret[1]) { - throw takeFromExternrefTable0(ret[0]); - } + edge_types() { + const ret = wasm.notegraph_edge_types(this.__wbg_ptr); + var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); + wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + return v1; } /** - * Iterate all edges in the graph and call the provided function with each - * [EdgeData]. - * @param {Function} f + * @param {TraversalOptions} traversal_options + * @param {MermaidGraphOptions} diagram_options + * @returns {MermaidGraphData} */ - iterate_edges(f) { - wasm.notegraph_iterate_edges(this.__wbg_ptr, f); - } - /** - * Iterate all nodes in the graph and call the provided function with each - * [NodeData]. - * @param {Function} f - */ - iterate_nodes(f) { - wasm.notegraph_iterate_nodes(this.__wbg_ptr, f); + generate_mermaid_graph(traversal_options, diagram_options) { + _assertClass(traversal_options, TraversalOptions); + var ptr0 = traversal_options.__destroy_into_raw(); + _assertClass(diagram_options, MermaidGraphOptions); + var ptr1 = diagram_options.__destroy_into_raw(); + const ret = wasm.notegraph_generate_mermaid_graph(this.__wbg_ptr, ptr0, ptr1); + if (ret[2]) { + throw takeFromExternrefTable0(ret[1]); + } + return MermaidGraphData.__wrap(ret[0]); } /** - * Notify the JS side that the graph has been updated. + * Get all outgoing edges from a node, filtered and grouped by edge type. + * @param {string} node + * @param {string[] | null} [edge_types] + * @returns {GroupedEdgeList} */ - notify_update() { - wasm.notegraph_notify_update(this.__wbg_ptr); + get_filtered_grouped_outgoing_edges(node, edge_types) { + const ptr0 = passStringToWasm0(node, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len0 = WASM_VECTOR_LEN; + var ptr1 = isLikeNone(edge_types) ? 0 : passArrayJsValueToWasm0(edge_types, wasm.__wbindgen_malloc); + var len1 = WASM_VECTOR_LEN; + const ret = wasm.notegraph_get_filtered_grouped_outgoing_edges(this.__wbg_ptr, ptr0, len0, ptr1, len1); + return GroupedEdgeList.__wrap(ret); } /** - * Checks if a node is resolved. - * Returns false if the node is not found. + * Get all outgoing edges from a node, filtered by edge type. * @param {string} node - * @returns {boolean} + * @param {string[] | null} [edge_types] + * @returns {EdgeList} */ - is_node_resolved(node) { + get_filtered_outgoing_edges(node, edge_types) { const ptr0 = passStringToWasm0(node, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); const len0 = WASM_VECTOR_LEN; - const ret = wasm.notegraph_is_node_resolved(this.__wbg_ptr, ptr0, len0); - return ret !== 0; + var ptr1 = isLikeNone(edge_types) ? 0 : passArrayJsValueToWasm0(edge_types, wasm.__wbindgen_malloc); + var len1 = WASM_VECTOR_LEN; + const ret = wasm.notegraph_get_filtered_outgoing_edges(this.__wbg_ptr, ptr0, len0, ptr1, len1); + return EdgeList.__wrap(ret); } /** * Get all incoming edges to a node. @@ -2041,6 +1628,16 @@ export class NoteGraph { const ret = wasm.notegraph_get_incoming_edges(this.__wbg_ptr, ptr0, len0); return EdgeList.__wrap(ret); } + /** + * @param {string} node + * @returns {NodeData | undefined} + */ + get_node(node) { + const ptr0 = passStringToWasm0(node, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len0 = WASM_VECTOR_LEN; + const ret = wasm.notegraph_get_node(this.__wbg_ptr, ptr0, len0); + return ret === 0 ? undefined : NodeData.__wrap(ret); + } /** * Get all outgoing edges from a node. * @param {string} node @@ -2053,40 +1650,43 @@ export class NoteGraph { return EdgeList.__wrap(ret); } /** - * Set the update callback. - * This will be called after every update to the graph. - * @param {Function} callback - */ - set_update_callback(callback) { - wasm.notegraph_set_update_callback(this.__wbg_ptr, callback); - } - /** - * Get all outgoing edges from a node, filtered by edge type. + * Checks if a node exists in the graph. * @param {string} node - * @param {string[] | null} [edge_types] - * @returns {EdgeList} + * @returns {boolean} */ - get_filtered_outgoing_edges(node, edge_types) { + has_node(node) { const ptr0 = passStringToWasm0(node, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); const len0 = WASM_VECTOR_LEN; - var ptr1 = isLikeNone(edge_types) ? 0 : passArrayJsValueToWasm0(edge_types, wasm.__wbindgen_malloc); - var len1 = WASM_VECTOR_LEN; - const ret = wasm.notegraph_get_filtered_outgoing_edges(this.__wbg_ptr, ptr0, len0, ptr1, len1); - return EdgeList.__wrap(ret); + const ret = wasm.notegraph_has_node(this.__wbg_ptr, ptr0, len0); + return ret !== 0; } /** - * Get all outgoing edges from a node, filtered and grouped by edge type. + * Checks if a node is resolved. + * Returns false if the node is not found. * @param {string} node - * @param {string[] | null} [edge_types] - * @returns {GroupedEdgeList} + * @returns {boolean} */ - get_filtered_grouped_outgoing_edges(node, edge_types) { + is_node_resolved(node) { const ptr0 = passStringToWasm0(node, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); const len0 = WASM_VECTOR_LEN; - var ptr1 = isLikeNone(edge_types) ? 0 : passArrayJsValueToWasm0(edge_types, wasm.__wbindgen_malloc); - var len1 = WASM_VECTOR_LEN; - const ret = wasm.notegraph_get_filtered_grouped_outgoing_edges(this.__wbg_ptr, ptr0, len0, ptr1, len1); - return GroupedEdgeList.__wrap(ret); + const ret = wasm.notegraph_is_node_resolved(this.__wbg_ptr, ptr0, len0); + return ret !== 0; + } + /** + * Iterate all edges in the graph and call the provided function with each + * [EdgeData]. + * @param {Function} f + */ + iterate_edges(f) { + wasm.notegraph_iterate_edges(this.__wbg_ptr, f); + } + /** + * Iterate all nodes in the graph and call the provided function with each + * [NodeData]. + * @param {Function} f + */ + iterate_nodes(f) { + wasm.notegraph_iterate_nodes(this.__wbg_ptr, f); } log() { wasm.notegraph_log(this.__wbg_ptr); @@ -2099,65 +1699,68 @@ export class NoteGraph { return NoteGraph.__wrap(ret); } /** - * @param {string} node - * @returns {NodeData | undefined} + * Notify the JS side that the graph has been updated. */ - get_node(node) { - const ptr0 = passStringToWasm0(node, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); - const len0 = WASM_VECTOR_LEN; - const ret = wasm.notegraph_get_node(this.__wbg_ptr, ptr0, len0); - return ret === 0 ? undefined : NodeData.__wrap(ret); + notify_update() { + wasm.notegraph_notify_update(this.__wbg_ptr); } /** - * Checks if a node exists in the graph. - * @param {string} node - * @returns {boolean} + * Runs a recursive traversal of the graph. + * @param {TraversalOptions} options + * @returns {TraversalResult} */ - has_node(node) { - const ptr0 = passStringToWasm0(node, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); - const len0 = WASM_VECTOR_LEN; - const ret = wasm.notegraph_has_node(this.__wbg_ptr, ptr0, len0); - return ret !== 0; + rec_traverse(options) { + _assertClass(options, TraversalOptions); + var ptr0 = options.__destroy_into_raw(); + const ret = wasm.notegraph_rec_traverse(this.__wbg_ptr, ptr0); + if (ret[2]) { + throw takeFromExternrefTable0(ret[1]); + } + return TraversalResult.__wrap(ret[0]); } /** - * @param {TraversalOptions} traversal_options - * @param {MermaidGraphOptions} diagram_options - * @returns {MermaidGraphData} + * Runs a recursive traversal of the graph and post-processes the result. + * The post-processed result is more efficient to work with from + * JavaScript. + * @param {TraversalOptions} options + * @param {TraversalPostprocessOptions} postprocess_options + * @returns {FlatTraversalResult} */ - generate_mermaid_graph(traversal_options, diagram_options) { - _assertClass(traversal_options, TraversalOptions); - var ptr0 = traversal_options.__destroy_into_raw(); - _assertClass(diagram_options, MermaidGraphOptions); - var ptr1 = diagram_options.__destroy_into_raw(); - const ret = wasm.notegraph_generate_mermaid_graph(this.__wbg_ptr, ptr0, ptr1); + rec_traverse_and_process(options, postprocess_options) { + _assertClass(options, TraversalOptions); + var ptr0 = options.__destroy_into_raw(); + _assertClass(postprocess_options, TraversalPostprocessOptions); + var ptr1 = postprocess_options.__destroy_into_raw(); + const ret = wasm.notegraph_rec_traverse_and_process(this.__wbg_ptr, ptr0, ptr1); if (ret[2]) { throw takeFromExternrefTable0(ret[1]); } - return MermaidGraphData.__wrap(ret[0]); + return FlatTraversalResult.__wrap(ret[0]); + } + /** + * Set the update callback. + * This will be called after every update to the graph. + * @param {Function} callback + */ + set_update_callback(callback) { + wasm.notegraph_set_update_callback(this.__wbg_ptr, callback); } } - -const NoteGraphErrorFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_notegrapherror_free(ptr >>> 0, 1)); +if (Symbol.dispose) NoteGraph.prototype[Symbol.dispose] = NoteGraph.prototype.free; export class NoteGraphError { - static __wrap(ptr) { - ptr = ptr >>> 0; const obj = Object.create(NoteGraphError.prototype); obj.__wbg_ptr = ptr; NoteGraphErrorFinalization.register(obj, obj.__wbg_ptr, obj); return obj; } - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; NoteGraphErrorFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_notegrapherror_free(ptr, 0); @@ -2165,11 +1768,11 @@ export class NoteGraphError { /** * @returns {string} */ - toString() { + get message() { let deferred1_0; let deferred1_1; try { - const ret = wasm.notegrapherror_toString(this.__wbg_ptr); + const ret = wasm.notegrapherror_message(this.__wbg_ptr); deferred1_0 = ret[0]; deferred1_1 = ret[1]; return getStringFromWasm0(ret[0], ret[1]); @@ -2184,18 +1787,18 @@ export class NoteGraphError { const ptr0 = passStringToWasm0(message, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); const len0 = WASM_VECTOR_LEN; const ret = wasm.notegrapherror_new(ptr0, len0); - this.__wbg_ptr = ret >>> 0; + this.__wbg_ptr = ret; NoteGraphErrorFinalization.register(this, this.__wbg_ptr, this); return this; } /** * @returns {string} */ - get message() { + toString() { let deferred1_0; let deferred1_1; try { - const ret = wasm.notegrapherror_message(this.__wbg_ptr); + const ret = wasm.notegrapherror_toString(this.__wbg_ptr); deferred1_0 = ret[0]; deferred1_1 = ret[1]; return getStringFromWasm0(ret[0], ret[1]); @@ -2204,28 +1807,21 @@ export class NoteGraphError { } } } - -const PathFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_path_free(ptr >>> 0, 1)); +if (Symbol.dispose) NoteGraphError.prototype[Symbol.dispose] = NoteGraphError.prototype.free; export class Path { - static __wrap(ptr) { - ptr = ptr >>> 0; const obj = Object.create(Path.prototype); obj.__wbg_ptr = ptr; PathFinalization.register(obj, obj.__wbg_ptr, obj); return obj; } - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; PathFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_path_free(ptr, 0); @@ -2235,41 +1831,18 @@ export class Path { */ get edges() { const ret = wasm.__wbg_get_path_edges(this.__wbg_ptr); - var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); - wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); - return v1; - } - /** - * @param {EdgeStruct[]} arg0 - */ - set edges(arg0) { - const ptr0 = passArrayJsValueToWasm0(arg0, wasm.__wbindgen_malloc); - const len0 = WASM_VECTOR_LEN; - wasm.__wbg_set_path_edges(this.__wbg_ptr, ptr0, len0); - } - /** - * @returns {EdgeStruct[]} - */ - get reverse_edges() { - const ret = wasm.path_reverse_edges(this.__wbg_ptr); - var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); + var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); return v1; } /** - * @returns {string} + * @param {Path} other + * @returns {boolean} */ - toString() { - let deferred1_0; - let deferred1_1; - try { - const ret = wasm.path_toString(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); - } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); - } + equals(other) { + _assertClass(other, Path); + const ret = wasm.path_equals(this.__wbg_ptr, other.__wbg_ptr); + return ret !== 0; } /** * @param {NoteGraph} graph @@ -2283,20 +1856,11 @@ export class Path { } let v1; if (ret[0] !== 0) { - v1 = getStringFromWasm0(ret[0], ret[1]).slice(); + v1 = getStringFromWasm0(ret[0], ret[1]); wasm.__wbindgen_free(ret[0], ret[1] * 1, 1); } return v1; } - /** - * @param {Path} other - * @returns {boolean} - */ - equals(other) { - _assertClass(other, Path); - const ret = wasm.path_equals(this.__wbg_ptr, other.__wbg_ptr); - return ret !== 0; - } /** * @returns {number} */ @@ -2304,6 +1868,30 @@ export class Path { const ret = wasm.path_length(this.__wbg_ptr); return ret >>> 0; } + /** + * @returns {EdgeStruct[]} + */ + get reverse_edges() { + const ret = wasm.path_reverse_edges(this.__wbg_ptr); + var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); + wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + return v1; + } + /** + * @returns {string} + */ + toString() { + let deferred1_0; + let deferred1_1; + try { + const ret = wasm.path_toString(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + } + } /** * @param {number} limit * @returns {Path} @@ -2312,57 +1900,40 @@ export class Path { const ret = wasm.path_truncate(this.__wbg_ptr, limit); return Path.__wrap(ret); } -} - -const PathListFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_pathlist_free(ptr >>> 0, 1)); - -export class PathList { - + /** + * @param {EdgeStruct[]} arg0 + */ + set edges(arg0) { + const ptr0 = passArrayJsValueToWasm0(arg0, wasm.__wbindgen_malloc); + const len0 = WASM_VECTOR_LEN; + wasm.__wbg_set_path_edges(this.__wbg_ptr, ptr0, len0); + } +} +if (Symbol.dispose) Path.prototype[Symbol.dispose] = Path.prototype.free; + +export class PathList { static __wrap(ptr) { - ptr = ptr >>> 0; const obj = Object.create(PathList.prototype); obj.__wbg_ptr = ptr; PathListFinalization.register(obj, obj.__wbg_ptr, obj); return obj; } - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; PathListFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_pathlist_free(ptr, 0); } /** - * @returns {string} - */ - toString() { - let deferred1_0; - let deferred1_1; - try { - const ret = wasm.pathlist_toString(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); - } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); - } - } - /** - * @param {string} selection - * @returns {PathList} + * @returns {number} */ - select(selection) { - const ptr0 = passStringToWasm0(selection, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); - const len0 = WASM_VECTOR_LEN; - const ret = wasm.pathlist_select(this.__wbg_ptr, ptr0, len0); - return PathList.__wrap(ret); + max_depth() { + const ret = wasm.pathlist_max_depth(this.__wbg_ptr); + return ret >>> 0; } /** * Cuts off all paths at a given depth, then sorts and deduplicates them. @@ -2376,41 +1947,54 @@ export class PathList { if (ret[3]) { throw takeFromExternrefTable0(ret[2]); } - var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); + var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); return v1; } + /** + * @param {string} selection + * @returns {PathList} + */ + select(selection) { + const ptr0 = passStringToWasm0(selection, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len0 = WASM_VECTOR_LEN; + const ret = wasm.pathlist_select(this.__wbg_ptr, ptr0, len0); + return PathList.__wrap(ret); + } + /** + * @returns {string} + */ + toString() { + let deferred1_0; + let deferred1_1; + try { + const ret = wasm.pathlist_toString(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + } + } /** * @returns {Path[]} */ to_paths() { const ret = wasm.pathlist_to_paths(this.__wbg_ptr); - var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); + var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); return v1; } - /** - * @returns {number} - */ - max_depth() { - const ret = wasm.pathlist_max_depth(this.__wbg_ptr); - return ret >>> 0; - } } - -const RemoveEdgeGraphUpdateFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_removeedgegraphupdate_free(ptr >>> 0, 1)); +if (Symbol.dispose) PathList.prototype[Symbol.dispose] = PathList.prototype.free; export class RemoveEdgeGraphUpdate { - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; RemoveEdgeGraphUpdateFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_removeedgegraphupdate_free(ptr, 0); @@ -2436,25 +2020,20 @@ export class RemoveEdgeGraphUpdate { const ptr2 = passStringToWasm0(edge_type, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); const len2 = WASM_VECTOR_LEN; const ret = wasm.removeedgegraphupdate_new(ptr0, len0, ptr1, len1, ptr2, len2); - this.__wbg_ptr = ret >>> 0; + this.__wbg_ptr = ret; RemoveEdgeGraphUpdateFinalization.register(this, this.__wbg_ptr, this); return this; } } - -const RemoveNoteGraphUpdateFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_removenotegraphupdate_free(ptr >>> 0, 1)); +if (Symbol.dispose) RemoveEdgeGraphUpdate.prototype[Symbol.dispose] = RemoveEdgeGraphUpdate.prototype.free; export class RemoveNoteGraphUpdate { - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; RemoveNoteGraphUpdateFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_removenotegraphupdate_free(ptr, 0); @@ -2474,25 +2053,20 @@ export class RemoveNoteGraphUpdate { const ptr0 = passStringToWasm0(data, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); const len0 = WASM_VECTOR_LEN; const ret = wasm.removenotegraphupdate_new(ptr0, len0); - this.__wbg_ptr = ret >>> 0; + this.__wbg_ptr = ret; RemoveNoteGraphUpdateFinalization.register(this, this.__wbg_ptr, this); return this; } } - -const RenameNoteGraphUpdateFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_renamenotegraphupdate_free(ptr >>> 0, 1)); +if (Symbol.dispose) RemoveNoteGraphUpdate.prototype[Symbol.dispose] = RemoveNoteGraphUpdate.prototype.free; export class RenameNoteGraphUpdate { - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; RenameNoteGraphUpdateFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_renamenotegraphupdate_free(ptr, 0); @@ -2515,51 +2089,30 @@ export class RenameNoteGraphUpdate { const ptr1 = passStringToWasm0(new_name, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); const len1 = WASM_VECTOR_LEN; const ret = wasm.renamenotegraphupdate_new(ptr0, len0, ptr1, len1); - this.__wbg_ptr = ret >>> 0; + this.__wbg_ptr = ret; RenameNoteGraphUpdateFinalization.register(this, this.__wbg_ptr, this); return this; } } - -const TransitiveGraphRuleFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_transitivegraphrule_free(ptr >>> 0, 1)); +if (Symbol.dispose) RenameNoteGraphUpdate.prototype[Symbol.dispose] = RenameNoteGraphUpdate.prototype.free; export class TransitiveGraphRule { - static __unwrap(jsValue) { if (!(jsValue instanceof TransitiveGraphRule)) { return 0; } return jsValue.__destroy_into_raw(); } - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; TransitiveGraphRuleFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_transitivegraphrule_free(ptr, 0); } - /** - * @returns {string} - */ - toString() { - let deferred1_0; - let deferred1_1; - try { - const ret = wasm.transitivegraphrule_toString(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); - } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); - } - } /** * @returns {NoteGraph} */ @@ -2586,25 +2139,35 @@ export class TransitiveGraphRule { const ptr2 = passStringToWasm0(edge_type, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); const len2 = WASM_VECTOR_LEN; const ret = wasm.transitivegraphrule_new(ptr0, len0, ptr1, len1, ptr2, len2, rounds, can_loop, close_reversed); - this.__wbg_ptr = ret >>> 0; + this.__wbg_ptr = ret; TransitiveGraphRuleFinalization.register(this, this.__wbg_ptr, this); return this; } + /** + * @returns {string} + */ + toString() { + let deferred1_0; + let deferred1_1; + try { + const ret = wasm.transitivegraphrule_toString(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + } + } } - -const TransitiveRulesGraphUpdateFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_transitiverulesgraphupdate_free(ptr >>> 0, 1)); +if (Symbol.dispose) TransitiveGraphRule.prototype[Symbol.dispose] = TransitiveGraphRule.prototype.free; export class TransitiveRulesGraphUpdate { - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; TransitiveRulesGraphUpdateFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_transitiverulesgraphupdate_free(ptr, 0); @@ -2624,100 +2187,78 @@ export class TransitiveRulesGraphUpdate { const ptr0 = passArrayJsValueToWasm0(new_rules, wasm.__wbindgen_malloc); const len0 = WASM_VECTOR_LEN; const ret = wasm.transitiverulesgraphupdate_new(ptr0, len0); - this.__wbg_ptr = ret >>> 0; + this.__wbg_ptr = ret; TransitiveRulesGraphUpdateFinalization.register(this, this.__wbg_ptr, this); return this; } } - -const TraversalDataFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_traversaldata_free(ptr >>> 0, 1)); +if (Symbol.dispose) TransitiveRulesGraphUpdate.prototype[Symbol.dispose] = TransitiveRulesGraphUpdate.prototype.free; export class TraversalData { - static __wrap(ptr) { - ptr = ptr >>> 0; const obj = Object.create(TraversalData.prototype); obj.__wbg_ptr = ptr; TraversalDataFinalization.register(obj, obj.__wbg_ptr, obj); return obj; } - static __unwrap(jsValue) { if (!(jsValue instanceof TraversalData)) { return 0; } return jsValue.__destroy_into_raw(); } - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; TraversalDataFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_traversaldata_free(ptr, 0); } /** - * the edge struct that was traversed - * @returns {EdgeStruct} - */ - get edge() { - const ret = wasm.__wbg_get_flattraversaldata_edge(this.__wbg_ptr); - return EdgeStruct.__wrap(ret); - } - /** - * the edge struct that was traversed - * @param {EdgeStruct} arg0 + * the children of the node + * @returns {TraversalData[]} */ - set edge(arg0) { - _assertClass(arg0, EdgeStruct); - var ptr0 = arg0.__destroy_into_raw(); - wasm.__wbg_set_flattraversaldata_edge(this.__wbg_ptr, ptr0); + get children() { + const ret = wasm.__wbg_get_traversaldata_children(this.__wbg_ptr); + var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); + wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + return v1; } /** * the depth of the node in the traversal * @returns {number} */ get depth() { - const ret = wasm.__wbg_get_flattraversaldata_depth(this.__wbg_ptr); + const ret = wasm.__wbg_get_traversaldata_depth(this.__wbg_ptr); return ret >>> 0; } /** - * the depth of the node in the traversal - * @param {number} arg0 + * the edge struct that was traversed + * @returns {EdgeStruct} */ - set depth(arg0) { - wasm.__wbg_set_flattraversaldata_depth(this.__wbg_ptr, arg0); + get edge() { + const ret = wasm.__wbg_get_traversaldata_edge(this.__wbg_ptr); + return EdgeStruct.__wrap(ret); } /** - * the number of total children of the node, so also children of children - * @returns {number} + * whether the node has a cut of children due to being at the depth limit + * of a traversal, or similar + * @returns {boolean} */ - get number_of_children() { - const ret = wasm.__wbg_get_flattraversaldata_number_of_children(this.__wbg_ptr); - return ret >>> 0; + get has_cut_of_children() { + const ret = wasm.__wbg_get_traversaldata_has_cut_of_children(this.__wbg_ptr); + return ret !== 0; } /** * the number of total children of the node, so also children of children - * @param {number} arg0 - */ - set number_of_children(arg0) { - wasm.__wbg_set_flattraversaldata_number_of_children(this.__wbg_ptr, arg0); - } - /** - * the children of the node - * @returns {TraversalData[]} + * @returns {number} */ - get children() { - const ret = wasm.__wbg_get_traversaldata_children(this.__wbg_ptr); - var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); - wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); - return v1; + get number_of_children() { + const ret = wasm.__wbg_get_traversaldata_number_of_children(this.__wbg_ptr); + return ret >>> 0; } /** * the children of the node @@ -2729,13 +2270,20 @@ export class TraversalData { wasm.__wbg_set_traversaldata_children(this.__wbg_ptr, ptr0, len0); } /** - * whether the node has a cut of children due to being at the depth limit - * of a traversal, or similar - * @returns {boolean} + * the depth of the node in the traversal + * @param {number} arg0 */ - get has_cut_of_children() { - const ret = wasm.__wbg_get_flattraversaldata_has_cut_of_children(this.__wbg_ptr); - return ret !== 0; + set depth(arg0) { + wasm.__wbg_set_traversaldata_depth(this.__wbg_ptr, arg0); + } + /** + * the edge struct that was traversed + * @param {EdgeStruct} arg0 + */ + set edge(arg0) { + _assertClass(arg0, EdgeStruct); + var ptr0 = arg0.__destroy_into_raw(); + wasm.__wbg_set_traversaldata_edge(this.__wbg_ptr, ptr0); } /** * whether the node has a cut of children due to being at the depth limit @@ -2743,34 +2291,14 @@ export class TraversalData { * @param {boolean} arg0 */ set has_cut_of_children(arg0) { - wasm.__wbg_set_flattraversaldata_has_cut_of_children(this.__wbg_ptr, arg0); - } - /** - * @returns {string} - */ - toString() { - let deferred1_0; - let deferred1_1; - try { - const ret = wasm.traversaldata_toString(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); - } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); - } + wasm.__wbg_set_traversaldata_has_cut_of_children(this.__wbg_ptr, arg0); } /** - * @param {NoteGraph} graph - * @param {EdgeSorter} sorter + * the number of total children of the node, so also children of children + * @param {number} arg0 */ - rec_sort_children(graph, sorter) { - _assertClass(graph, NoteGraph); - _assertClass(sorter, EdgeSorter); - const ret = wasm.traversaldata_rec_sort_children(this.__wbg_ptr, graph.__wbg_ptr, sorter.__wbg_ptr); - if (ret[1]) { - throw takeFromExternrefTable0(ret[0]); - } + set number_of_children(arg0) { + wasm.__wbg_set_traversaldata_number_of_children(this.__wbg_ptr, arg0); } /** * @param {EdgeStruct} edge @@ -2785,45 +2313,64 @@ export class TraversalData { const ptr1 = passArrayJsValueToWasm0(children, wasm.__wbindgen_malloc); const len1 = WASM_VECTOR_LEN; const ret = wasm.traversaldata_new(ptr0, depth, number_of_children, ptr1, len1, has_cut_of_children); - this.__wbg_ptr = ret >>> 0; + this.__wbg_ptr = ret; TraversalDataFinalization.register(this, this.__wbg_ptr, this); return this; } -} - -const TraversalOptionsFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_traversaloptions_free(ptr >>> 0, 1)); - -export class TraversalOptions { - - __destroy_into_raw() { - const ptr = this.__wbg_ptr; - this.__wbg_ptr = 0; - TraversalOptionsFinalization.unregister(this); - return ptr; - } - - free() { - const ptr = this.__destroy_into_raw(); - wasm.__wbg_traversaloptions_free(ptr, 0); - } /** - * @returns {string[]} + * @param {NoteGraph} graph + * @param {EdgeSorter} sorter */ - get entry_nodes() { - const ret = wasm.__wbg_get_traversaloptions_entry_nodes(this.__wbg_ptr); - var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); - wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); - return v1; + rec_sort_children(graph, sorter) { + _assertClass(graph, NoteGraph); + _assertClass(sorter, EdgeSorter); + const ret = wasm.traversaldata_rec_sort_children(this.__wbg_ptr, graph.__wbg_ptr, sorter.__wbg_ptr); + if (ret[1]) { + throw takeFromExternrefTable0(ret[0]); + } } /** - * @param {string[]} arg0 + * @returns {string} */ - set entry_nodes(arg0) { - const ptr0 = passArrayJsValueToWasm0(arg0, wasm.__wbindgen_malloc); - const len0 = WASM_VECTOR_LEN; - wasm.__wbg_set_traversaloptions_entry_nodes(this.__wbg_ptr, ptr0, len0); + toString() { + let deferred1_0; + let deferred1_1; + try { + const ret = wasm.traversaldata_toString(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + } + } +} +if (Symbol.dispose) TraversalData.prototype[Symbol.dispose] = TraversalData.prototype.free; + +export class TraversalOptions { + __destroy_into_raw() { + const ptr = this.__wbg_ptr; + this.__wbg_ptr = 0; + TraversalOptionsFinalization.unregister(this); + return ptr; + } + free() { + const ptr = this.__destroy_into_raw(); + wasm.__wbg_traversaloptions_free(ptr, 0); + } + /** + * When set, only edges whose target node path is in this set will be + * traversed. Used for the `dataview-from` codeblock filter. + * @returns {string[] | undefined} + */ + get dataview_from_paths() { + const ret = wasm.__wbg_get_traversaloptions_dataview_from_paths(this.__wbg_ptr); + let v1; + if (ret[0] !== 0) { + v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); + wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + } + return v1; } /** * if this is None, all edge types will be traversed @@ -2833,19 +2380,19 @@ export class TraversalOptions { const ret = wasm.__wbg_get_traversaloptions_edge_types(this.__wbg_ptr); let v1; if (ret[0] !== 0) { - v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); + v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); } return v1; } /** - * if this is None, all edge types will be traversed - * @param {string[] | null} [arg0] + * @returns {string[]} */ - set edge_types(arg0) { - var ptr0 = isLikeNone(arg0) ? 0 : passArrayJsValueToWasm0(arg0, wasm.__wbindgen_malloc); - var len0 = WASM_VECTOR_LEN; - wasm.__wbg_set_traversaloptions_edge_types(this.__wbg_ptr, ptr0, len0); + get entry_nodes() { + const ret = wasm.__wbg_get_traversaloptions_entry_nodes(this.__wbg_ptr); + var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); + wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + return v1; } /** * @returns {number} @@ -2854,12 +2401,6 @@ export class TraversalOptions { const ret = wasm.__wbg_get_traversaloptions_max_depth(this.__wbg_ptr); return ret >>> 0; } - /** - * @param {number} arg0 - */ - set max_depth(arg0) { - wasm.__wbg_set_traversaloptions_max_depth(this.__wbg_ptr, arg0); - } /** * @returns {number} */ @@ -2867,12 +2408,6 @@ export class TraversalOptions { const ret = wasm.__wbg_get_traversaloptions_max_traversal_count(this.__wbg_ptr); return ret >>> 0; } - /** - * @param {number} arg0 - */ - set max_traversal_count(arg0) { - wasm.__wbg_set_traversaloptions_max_traversal_count(this.__wbg_ptr, arg0); - } /** * if true, multiple traversals - one for each edge type - will be * performed and the results will be combined. if false, one traversal @@ -2883,53 +2418,53 @@ export class TraversalOptions { const ret = wasm.__wbg_get_traversaloptions_separate_edges(this.__wbg_ptr); return ret !== 0; } - /** - * if true, multiple traversals - one for each edge type - will be - * performed and the results will be combined. if false, one traversal - * over all edge types will be performed - * @param {boolean} arg0 - */ - set separate_edges(arg0) { - wasm.__wbg_set_traversaloptions_separate_edges(this.__wbg_ptr, arg0); - } /** * When set, only edges whose target node path is in this set will be * traversed. Used for the `dataview-from` codeblock filter. - * @returns {string[] | undefined} + * @param {string[] | null} [arg0] */ - get dataview_from_paths() { - const ret = wasm.__wbg_get_traversaloptions_dataview_from_paths(this.__wbg_ptr); - let v1; - if (ret[0] !== 0) { - v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); - wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); - } - return v1; + set dataview_from_paths(arg0) { + var ptr0 = isLikeNone(arg0) ? 0 : passArrayJsValueToWasm0(arg0, wasm.__wbindgen_malloc); + var len0 = WASM_VECTOR_LEN; + wasm.__wbg_set_traversaloptions_dataview_from_paths(this.__wbg_ptr, ptr0, len0); } /** - * When set, only edges whose target node path is in this set will be - * traversed. Used for the `dataview-from` codeblock filter. + * if this is None, all edge types will be traversed * @param {string[] | null} [arg0] */ - set dataview_from_paths(arg0) { + set edge_types(arg0) { var ptr0 = isLikeNone(arg0) ? 0 : passArrayJsValueToWasm0(arg0, wasm.__wbindgen_malloc); var len0 = WASM_VECTOR_LEN; - wasm.__wbg_set_traversaloptions_dataview_from_paths(this.__wbg_ptr, ptr0, len0); + wasm.__wbg_set_traversaloptions_edge_types(this.__wbg_ptr, ptr0, len0); } /** - * @returns {string} + * @param {string[]} arg0 */ - toString() { - let deferred1_0; - let deferred1_1; - try { - const ret = wasm.traversaloptions_toString(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); - } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); - } + set entry_nodes(arg0) { + const ptr0 = passArrayJsValueToWasm0(arg0, wasm.__wbindgen_malloc); + const len0 = WASM_VECTOR_LEN; + wasm.__wbg_set_traversaloptions_entry_nodes(this.__wbg_ptr, ptr0, len0); + } + /** + * @param {number} arg0 + */ + set max_depth(arg0) { + wasm.__wbg_set_traversaloptions_max_depth(this.__wbg_ptr, arg0); + } + /** + * @param {number} arg0 + */ + set max_traversal_count(arg0) { + wasm.__wbg_set_traversaloptions_max_traversal_count(this.__wbg_ptr, arg0); + } + /** + * if true, multiple traversals - one for each edge type - will be + * performed and the results will be combined. if false, one traversal + * over all edge types will be performed + * @param {boolean} arg0 + */ + set separate_edges(arg0) { + wasm.__wbg_set_traversaloptions_separate_edges(this.__wbg_ptr, arg0); } /** * @param {string[]} entry_nodes @@ -2947,37 +2482,52 @@ export class TraversalOptions { var ptr2 = isLikeNone(dataview_from_paths) ? 0 : passArrayJsValueToWasm0(dataview_from_paths, wasm.__wbindgen_malloc); var len2 = WASM_VECTOR_LEN; const ret = wasm.traversaloptions_new(ptr0, len0, ptr1, len1, max_depth, max_traversal_count, separate_edges, ptr2, len2); - this.__wbg_ptr = ret >>> 0; + this.__wbg_ptr = ret; TraversalOptionsFinalization.register(this, this.__wbg_ptr, this); return this; } + /** + * @returns {string} + */ + toString() { + let deferred1_0; + let deferred1_1; + try { + const ret = wasm.traversaloptions_toString(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + } + } } - -const TraversalPostprocessOptionsFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_traversalpostprocessoptions_free(ptr >>> 0, 1)); +if (Symbol.dispose) TraversalOptions.prototype[Symbol.dispose] = TraversalOptions.prototype.free; export class TraversalPostprocessOptions { - static __wrap(ptr) { - ptr = ptr >>> 0; const obj = Object.create(TraversalPostprocessOptions.prototype); obj.__wbg_ptr = ptr; TraversalPostprocessOptionsFinalization.register(obj, obj.__wbg_ptr, obj); return obj; } - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; TraversalPostprocessOptionsFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_traversalpostprocessoptions_free(ptr, 0); } + /** + * @returns {boolean} + */ + get flatten() { + const ret = wasm.__wbg_get_traversalpostprocessoptions_flatten(this.__wbg_ptr); + return ret !== 0; + } /** * @returns {EdgeSorter | undefined} */ @@ -2985,6 +2535,12 @@ export class TraversalPostprocessOptions { const ret = wasm.__wbg_get_traversalpostprocessoptions_sorter(this.__wbg_ptr); return ret === 0 ? undefined : EdgeSorter.__wrap(ret); } + /** + * @param {boolean} arg0 + */ + set flatten(arg0) { + wasm.__wbg_set_traversalpostprocessoptions_flatten(this.__wbg_ptr, arg0); + } /** * @param {EdgeSorter | null} [arg0] */ @@ -2997,25 +2553,15 @@ export class TraversalPostprocessOptions { wasm.__wbg_set_traversalpostprocessoptions_sorter(this.__wbg_ptr, ptr0); } /** - * @returns {boolean} - */ - get flatten() { - const ret = wasm.__wbg_get_traversalpostprocessoptions_flatten(this.__wbg_ptr); - return ret !== 0; - } - /** - * @param {boolean} arg0 - */ - set flatten(arg0) { - wasm.__wbg_set_traversalpostprocessoptions_flatten(this.__wbg_ptr, arg0); - } - /** + * @param {EdgeSorter} sorter * @param {boolean} flatten - * @returns {TraversalPostprocessOptions} */ - static without_sorter(flatten) { - const ret = wasm.traversalpostprocessoptions_without_sorter(flatten); - return TraversalPostprocessOptions.__wrap(ret); + constructor(sorter, flatten) { + _assertClass(sorter, EdgeSorter); + const ret = wasm.traversalpostprocessoptions_new(sorter.__wbg_ptr, flatten); + this.__wbg_ptr = ret; + TraversalPostprocessOptionsFinalization.register(this, this.__wbg_ptr, this); + return this; } /** * @returns {string} @@ -3033,39 +2579,29 @@ export class TraversalPostprocessOptions { } } /** - * @param {EdgeSorter} sorter * @param {boolean} flatten + * @returns {TraversalPostprocessOptions} */ - constructor(sorter, flatten) { - _assertClass(sorter, EdgeSorter); - const ret = wasm.traversalpostprocessoptions_new(sorter.__wbg_ptr, flatten); - this.__wbg_ptr = ret >>> 0; - TraversalPostprocessOptionsFinalization.register(this, this.__wbg_ptr, this); - return this; + static without_sorter(flatten) { + const ret = wasm.traversalpostprocessoptions_without_sorter(flatten); + return TraversalPostprocessOptions.__wrap(ret); } } - -const TraversalResultFinalization = (typeof FinalizationRegistry === 'undefined') - ? { register: () => {}, unregister: () => {} } - : new FinalizationRegistry(ptr => wasm.__wbg_traversalresult_free(ptr >>> 0, 1)); +if (Symbol.dispose) TraversalPostprocessOptions.prototype[Symbol.dispose] = TraversalPostprocessOptions.prototype.free; export class TraversalResult { - static __wrap(ptr) { - ptr = ptr >>> 0; const obj = Object.create(TraversalResult.prototype); obj.__wbg_ptr = ptr; TraversalResultFinalization.register(obj, obj.__wbg_ptr, obj); return obj; } - __destroy_into_raw() { const ptr = this.__wbg_ptr; this.__wbg_ptr = 0; TraversalResultFinalization.unregister(this); return ptr; } - free() { const ptr = this.__destroy_into_raw(); wasm.__wbg_traversalresult_free(ptr, 0); @@ -3075,17 +2611,23 @@ export class TraversalResult { */ get data() { const ret = wasm.__wbg_get_traversalresult_data(this.__wbg_ptr); - var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]).slice(); + var v1 = getArrayJsValueFromWasm0(ret[0], ret[1]); wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); return v1; } /** - * @param {TraversalData[]} arg0 + * @returns {boolean} */ - set data(arg0) { - const ptr0 = passArrayJsValueToWasm0(arg0, wasm.__wbindgen_malloc); - const len0 = WASM_VECTOR_LEN; - wasm.__wbg_set_traversalresult_data(this.__wbg_ptr, ptr0, len0); + get hit_depth_limit() { + const ret = wasm.__wbg_get_traversalresult_hit_depth_limit(this.__wbg_ptr); + return ret !== 0; + } + /** + * @returns {number} + */ + get max_depth() { + const ret = wasm.__wbg_get_traversalresult_max_depth(this.__wbg_ptr); + return ret >>> 0; } /** * @returns {number} @@ -3095,17 +2637,25 @@ export class TraversalResult { return ret >>> 0; } /** - * @param {number} arg0 + * @returns {bigint} */ - set node_count(arg0) { - wasm.__wbg_set_traversalresult_node_count(this.__wbg_ptr, arg0); + get traversal_time() { + const ret = wasm.__wbg_get_traversalresult_traversal_time(this.__wbg_ptr); + return BigInt.asUintN(64, ret); } /** - * @returns {number} + * @param {TraversalData[]} arg0 */ - get max_depth() { - const ret = wasm.__wbg_get_traversalresult_max_depth(this.__wbg_ptr); - return ret >>> 0; + set data(arg0) { + const ptr0 = passArrayJsValueToWasm0(arg0, wasm.__wbindgen_malloc); + const len0 = WASM_VECTOR_LEN; + wasm.__wbg_set_traversalresult_data(this.__wbg_ptr, ptr0, len0); + } + /** + * @param {boolean} arg0 + */ + set hit_depth_limit(arg0) { + wasm.__wbg_set_traversalresult_hit_depth_limit(this.__wbg_ptr, arg0); } /** * @param {number} arg0 @@ -3113,298 +2663,661 @@ export class TraversalResult { set max_depth(arg0) { wasm.__wbg_set_traversalresult_max_depth(this.__wbg_ptr, arg0); } - /** - * @returns {boolean} - */ - get hit_depth_limit() { - const ret = wasm.__wbg_get_traversalresult_hit_depth_limit(this.__wbg_ptr); - return ret !== 0; + /** + * @param {number} arg0 + */ + set node_count(arg0) { + wasm.__wbg_set_traversalresult_node_count(this.__wbg_ptr, arg0); + } + /** + * @param {bigint} arg0 + */ + set traversal_time(arg0) { + wasm.__wbg_set_traversalresult_traversal_time(this.__wbg_ptr, arg0); + } + /** + * @returns {boolean} + */ + is_empty() { + const ret = wasm.traversalresult_is_empty(this.__wbg_ptr); + return ret !== 0; + } + /** + * @param {TraversalData[]} data + * @param {bigint} traversal_time + */ + constructor(data, traversal_time) { + const ptr0 = passArrayJsValueToWasm0(data, wasm.__wbindgen_malloc); + const len0 = WASM_VECTOR_LEN; + const ret = wasm.traversalresult_new(ptr0, len0, traversal_time); + this.__wbg_ptr = ret; + TraversalResultFinalization.register(this, this.__wbg_ptr, this); + return this; + } + /** + * @returns {string} + */ + toString() { + let deferred1_0; + let deferred1_1; + try { + const ret = wasm.traversalresult_toString(this.__wbg_ptr); + deferred1_0 = ret[0]; + deferred1_1 = ret[1]; + return getStringFromWasm0(ret[0], ret[1]); + } finally { + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + } + } + /** + * @returns {PathList} + */ + to_paths() { + const ret = wasm.traversalresult_to_paths(this.__wbg_ptr); + return PathList.__wrap(ret); + } +} +if (Symbol.dispose) TraversalResult.prototype[Symbol.dispose] = TraversalResult.prototype.free; + +/** + * @param {string} field + * @param {boolean} reverse + * @returns {EdgeSorter} + */ +export function create_edge_sorter(field, reverse) { + const ptr0 = passStringToWasm0(field, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len0 = WASM_VECTOR_LEN; + const ret = wasm.create_edge_sorter(ptr0, len0, reverse); + if (ret[2]) { + throw takeFromExternrefTable0(ret[1]); + } + return EdgeSorter.__wrap(ret[0]); +} + +/** + * @returns {NoteGraph} + */ +export function create_graph() { + const ret = wasm.create_graph(); + return NoteGraph.__wrap(ret); +} + +/** + * @param {NoteGraph} graph + * @param {EdgeStruct[]} edges + * @param {EdgeSorter} sorter + * @returns {EdgeStruct[]} + */ +export function sort_edges(graph, edges, sorter) { + _assertClass(graph, NoteGraph); + const ptr0 = passArrayJsValueToWasm0(edges, wasm.__wbindgen_malloc); + const len0 = WASM_VECTOR_LEN; + _assertClass(sorter, EdgeSorter); + const ret = wasm.sort_edges(graph.__wbg_ptr, ptr0, len0, sorter.__wbg_ptr); + if (ret[3]) { + throw takeFromExternrefTable0(ret[2]); + } + var v2 = getArrayJsValueFromWasm0(ret[0], ret[1]); + wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + return v2; +} + +/** + * @param {NoteGraph} graph + * @param {TraversalData[]} traversal_data + * @param {EdgeSorter} sorter + * @returns {TraversalData[]} + */ +export function sort_traversal_data(graph, traversal_data, sorter) { + _assertClass(graph, NoteGraph); + const ptr0 = passArrayJsValueToWasm0(traversal_data, wasm.__wbindgen_malloc); + const len0 = WASM_VECTOR_LEN; + _assertClass(sorter, EdgeSorter); + const ret = wasm.sort_traversal_data(graph.__wbg_ptr, ptr0, len0, sorter.__wbg_ptr); + if (ret[3]) { + throw takeFromExternrefTable0(ret[2]); + } + var v2 = getArrayJsValueFromWasm0(ret[0], ret[1]); + wasm.__wbindgen_free(ret[0], ret[1] * 4, 4); + return v2; +} +function __wbg_get_imports() { + const import0 = { + __proto__: null, + __wbg___wbindgen_debug_string_4687d8d8c2017d52: function(arg0, arg1) { + const ret = debugString(arg1); + const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len1 = WASM_VECTOR_LEN; + getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true); + getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true); + }, + __wbg___wbindgen_is_undefined_8865fb403f8fe9d8: function(arg0) { + const ret = arg0 === undefined; + return ret; + }, + __wbg___wbindgen_string_get_0380ccaa2f57f0d9: function(arg0, arg1) { + const obj = arg1; + const ret = typeof(obj) === 'string' ? obj : undefined; + var ptr1 = isLikeNone(ret) ? 0 : passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + var len1 = WASM_VECTOR_LEN; + getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true); + getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true); + }, + __wbg___wbindgen_throw_41e9ee4f547fc59a: function(arg0, arg1) { + throw new Error(getStringFromWasm0(arg0, arg1)); + }, + __wbg_call_187d372bd5fdd4aa: function() { return handleError(function (arg0, arg1, arg2) { + const ret = arg0.call(arg1, arg2); + return ret; + }, arguments); }, + __wbg_call_6137034ef55c9d0f: function() { return handleError(function (arg0, arg1) { + const ret = arg0.call(arg1); + return ret; + }, arguments); }, + __wbg_debug_6af0896b45fef8a9: function(arg0, arg1, arg2) { + arg0.debug(getStringFromWasm0(arg1, arg2)); + }, + __wbg_edgedata_new: function(arg0) { + const ret = EdgeData.__wrap(arg0); + return ret; + }, + __wbg_edgestruct_new: function(arg0) { + const ret = EdgeStruct.__wrap(arg0); + return ret; + }, + __wbg_edgestruct_unwrap: function(arg0) { + const ret = EdgeStruct.__unwrap(arg0); + return ret; + }, + __wbg_error_757e9472f8410341: function(arg0, arg1) { + let deferred0_0; + let deferred0_1; + try { + deferred0_0 = arg0; + deferred0_1 = arg1; + console.error(getStringFromWasm0(arg0, arg1)); + } finally { + wasm.__wbindgen_free(deferred0_0, deferred0_1, 1); + } + }, + __wbg_error_770d98d9fd68ec75: function(arg0, arg1, arg2) { + arg0.error(getStringFromWasm0(arg1, arg2)); + }, + __wbg_flattraversaldata_new: function(arg0) { + const ret = FlatTraversalData.__wrap(arg0); + return ret; + }, + __wbg_flattraversaldata_unwrap: function(arg0) { + const ret = FlatTraversalData.__unwrap(arg0); + return ret; + }, + __wbg_gcedgedata_unwrap: function(arg0) { + const ret = GCEdgeData.__unwrap(arg0); + return ret; + }, + __wbg_gcnodedata_unwrap: function(arg0) { + const ret = GCNodeData.__unwrap(arg0); + return ret; + }, + __wbg_new_227d7c05414eb861: function() { + const ret = new Error(); + return ret; + }, + __wbg_new_617a8cdb8bb1130e: function() { + const ret = new Object(); + return ret; + }, + __wbg_nodedata_new: function(arg0) { + const ret = NodeData.__wrap(arg0); + return ret; + }, + __wbg_notegrapherror_new: function(arg0) { + const ret = NoteGraphError.__wrap(arg0); + return ret; + }, + __wbg_now_e7c6795a7f81e10f: function(arg0) { + const ret = arg0.now(); + return ret; + }, + __wbg_path_new: function(arg0) { + const ret = Path.__wrap(arg0); + return ret; + }, + __wbg_performance_3fcf6e32a7e1ed0a: function(arg0) { + const ret = arg0.performance; + return ret; + }, + __wbg_set_145a351398b48c65: function() { return handleError(function (arg0, arg1, arg2) { + const ret = Reflect.set(arg0, arg1, arg2); + return ret; + }, arguments); }, + __wbg_stack_3b0d974bbf31e44f: function(arg0, arg1) { + const ret = arg1.stack; + const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len1 = WASM_VECTOR_LEN; + getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true); + getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true); + }, + __wbg_static_accessor_GLOBAL_266715b9d96ba635: function() { + const ret = typeof global === 'undefined' ? null : global; + return isLikeNone(ret) ? 0 : addToExternrefTable0(ret); + }, + __wbg_static_accessor_GLOBAL_THIS_10fb7dc1ae063179: function() { + const ret = typeof globalThis === 'undefined' ? null : globalThis; + return isLikeNone(ret) ? 0 : addToExternrefTable0(ret); + }, + __wbg_static_accessor_LOGGER_849a70838e9094f0: function() { + const ret = log; + return ret; + }, + __wbg_static_accessor_SELF_0b583911f537483a: function() { + const ret = typeof self === 'undefined' ? null : self; + return isLikeNone(ret) ? 0 : addToExternrefTable0(ret); + }, + __wbg_static_accessor_WINDOW_d7f903d1508cbdc4: function() { + const ret = typeof window === 'undefined' ? null : window; + return isLikeNone(ret) ? 0 : addToExternrefTable0(ret); + }, + __wbg_transitivegraphrule_unwrap: function(arg0) { + const ret = TransitiveGraphRule.__unwrap(arg0); + return ret; + }, + __wbg_traversaldata_new: function(arg0) { + const ret = TraversalData.__wrap(arg0); + return ret; + }, + __wbg_traversaldata_unwrap: function(arg0) { + const ret = TraversalData.__unwrap(arg0); + return ret; + }, + __wbindgen_generic_0000000000000001: function(arg0, arg1) { + // Cast intrinsic for `Ref(String) -> Externref`. + const ret = getStringFromWasm0(arg0, arg1); + return ret; + }, + __wbindgen_init_externref_table: function() { + const table = wasm.__wbindgen_externrefs; + const offset = table.grow(4); + table.set(0, undefined); + table.set(offset + 0, undefined); + table.set(offset + 1, null); + table.set(offset + 2, true); + table.set(offset + 3, false); + }, + }; + return { + __proto__: null, + "./breadcrumbs_graph_wasm_bg.js": import0, + }; +} + +const AddEdgeGraphUpdateFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_addedgegraphupdate_free(ptr, 1)); +const AddNoteGraphUpdateFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_addnotegraphupdate_free(ptr, 1)); +const BatchGraphUpdateFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_batchgraphupdate_free(ptr, 1)); +const EdgeDataFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_edgedata_free(ptr, 1)); +const EdgeListFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_edgelist_free(ptr, 1)); +const EdgeSorterFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_edgesorter_free(ptr, 1)); +const EdgeStructFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_edgestruct_free(ptr, 1)); +const FlatTraversalDataFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_flattraversaldata_free(ptr, 1)); +const FlatTraversalResultFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_flattraversalresult_free(ptr, 1)); +const GCEdgeDataFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_gcedgedata_free(ptr, 1)); +const GCNodeDataFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_gcnodedata_free(ptr, 1)); +const GroupedEdgeListFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_groupededgelist_free(ptr, 1)); +const MermaidGraphDataFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_mermaidgraphdata_free(ptr, 1)); +const MermaidGraphOptionsFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_mermaidgraphoptions_free(ptr, 1)); +const NodeDataFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_nodedata_free(ptr, 1)); +const NodeStringifyOptionsFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_nodestringifyoptions_free(ptr, 1)); +const NoteGraphFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_notegraph_free(ptr, 1)); +const NoteGraphErrorFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_notegrapherror_free(ptr, 1)); +const PathFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_path_free(ptr, 1)); +const PathListFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_pathlist_free(ptr, 1)); +const RemoveEdgeGraphUpdateFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_removeedgegraphupdate_free(ptr, 1)); +const RemoveNoteGraphUpdateFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_removenotegraphupdate_free(ptr, 1)); +const RenameNoteGraphUpdateFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_renamenotegraphupdate_free(ptr, 1)); +const TransitiveGraphRuleFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_transitivegraphrule_free(ptr, 1)); +const TransitiveRulesGraphUpdateFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_transitiverulesgraphupdate_free(ptr, 1)); +const TraversalDataFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_traversaldata_free(ptr, 1)); +const TraversalOptionsFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_traversaloptions_free(ptr, 1)); +const TraversalPostprocessOptionsFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_traversalpostprocessoptions_free(ptr, 1)); +const TraversalResultFinalization = (typeof FinalizationRegistry === 'undefined') + ? { register: () => {}, unregister: () => {} } + : new FinalizationRegistry(ptr => wasm.__wbg_traversalresult_free(ptr, 1)); + +function addToExternrefTable0(obj) { + const idx = wasm.__externref_table_alloc(); + wasm.__wbindgen_externrefs.set(idx, obj); + return idx; +} + +function _assertClass(instance, klass) { + if (!(instance instanceof klass)) { + throw new Error(`expected instance of ${klass.name}`); + } +} + +function debugString(val) { + // primitive types + const type = typeof val; + if (type == 'number' || type == 'boolean' || val == null) { + return `${val}`; + } + if (type == 'string') { + return `"${val}"`; + } + if (type == 'symbol') { + const description = val.description; + if (description == null) { + return 'Symbol'; + } else { + return `Symbol(${description})`; + } + } + if (type == 'function') { + const name = val.name; + if (typeof name == 'string' && name.length > 0) { + return `Function(${name})`; + } else { + return 'Function'; + } + } + // objects + if (Array.isArray(val)) { + const length = val.length; + let debug = '['; + if (length > 0) { + debug += debugString(val[0]); + } + for(let i = 1; i < length; i++) { + debug += ', ' + debugString(val[i]); + } + debug += ']'; + return debug; + } + // Test for built-in + const builtInMatches = /\[object ([^\]]+)\]/.exec(toString.call(val)); + let className; + if (builtInMatches && builtInMatches.length > 1) { + className = builtInMatches[1]; + } else { + // Failed to match the standard '[object ClassName]' + return toString.call(val); + } + if (className == 'Object') { + // we're a user defined class or Object + // JSON.stringify avoids problems with cycles, and is generally much + // easier than looping through ownProperties of `val`. + try { + return 'Object(' + JSON.stringify(val) + ')'; + } catch (_) { + return 'Object'; + } + } + // errors + if (val instanceof Error) { + return `${val.name}: ${val.message}\n${val.stack}`; + } + // TODO we could test for more things here, like `Set`s and `Map`s. + return className; +} + +function getArrayJsValueFromWasm0(ptr, len) { + ptr = ptr >>> 0; + const mem = getDataViewMemory0(); + const result = []; + for (let i = ptr; i < ptr + 4 * len; i += 4) { + result.push(wasm.__wbindgen_externrefs.get(mem.getUint32(i, true))); + } + wasm.__externref_drop_slice(ptr, len); + return result; +} + +function getArrayU32FromWasm0(ptr, len) { + ptr = ptr >>> 0; + return getUint32ArrayMemory0().subarray(ptr / 4, ptr / 4 + len); +} + +let cachedDataViewMemory0 = null; +function getDataViewMemory0() { + if (cachedDataViewMemory0 === null || cachedDataViewMemory0.buffer.detached === true || (cachedDataViewMemory0.buffer.detached === undefined && cachedDataViewMemory0.buffer !== wasm.memory.buffer)) { + cachedDataViewMemory0 = new DataView(wasm.memory.buffer); + } + return cachedDataViewMemory0; +} + +function getStringFromWasm0(ptr, len) { + return decodeText(ptr >>> 0, len); +} + +let cachedUint32ArrayMemory0 = null; +function getUint32ArrayMemory0() { + if (cachedUint32ArrayMemory0 === null || cachedUint32ArrayMemory0.byteLength === 0) { + cachedUint32ArrayMemory0 = new Uint32Array(wasm.memory.buffer); } - /** - * @param {boolean} arg0 - */ - set hit_depth_limit(arg0) { - wasm.__wbg_set_traversalresult_hit_depth_limit(this.__wbg_ptr, arg0); + return cachedUint32ArrayMemory0; +} + +let cachedUint8ArrayMemory0 = null; +function getUint8ArrayMemory0() { + if (cachedUint8ArrayMemory0 === null || cachedUint8ArrayMemory0.byteLength === 0) { + cachedUint8ArrayMemory0 = new Uint8Array(wasm.memory.buffer); } - /** - * @returns {bigint} - */ - get traversal_time() { - const ret = wasm.__wbg_get_flattraversalresult_traversal_time(this.__wbg_ptr); - return BigInt.asUintN(64, ret); + return cachedUint8ArrayMemory0; +} + +function handleError(f, args) { + try { + return f.apply(this, args); + } catch (e) { + const idx = addToExternrefTable0(e); + wasm.__wbindgen_exn_store(idx); } - /** - * @param {bigint} arg0 - */ - set traversal_time(arg0) { - wasm.__wbg_set_flattraversalresult_traversal_time(this.__wbg_ptr, arg0); +} + +function isLikeNone(x) { + return x === undefined || x === null; +} + +function passArray32ToWasm0(arg, malloc) { + const ptr = malloc(arg.length * 4, 4) >>> 0; + getUint32ArrayMemory0().set(arg, ptr / 4); + WASM_VECTOR_LEN = arg.length; + return ptr; +} + +function passArrayJsValueToWasm0(array, malloc) { + const ptr = malloc(array.length * 4, 4) >>> 0; + for (let i = 0; i < array.length; i++) { + const add = addToExternrefTable0(array[i]); + getDataViewMemory0().setUint32(ptr + 4 * i, add, true); } - /** - * @returns {string} - */ - toString() { - let deferred1_0; - let deferred1_1; - try { - const ret = wasm.traversalresult_toString(this.__wbg_ptr); - deferred1_0 = ret[0]; - deferred1_1 = ret[1]; - return getStringFromWasm0(ret[0], ret[1]); - } finally { - wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); - } + WASM_VECTOR_LEN = array.length; + return ptr; +} + +function passStringToWasm0(arg, malloc, realloc) { + if (realloc === undefined) { + const buf = cachedTextEncoder.encode(arg); + const ptr = malloc(buf.length, 1) >>> 0; + getUint8ArrayMemory0().subarray(ptr, ptr + buf.length).set(buf); + WASM_VECTOR_LEN = buf.length; + return ptr; } - /** - * @param {TraversalData[]} data - * @param {bigint} traversal_time - */ - constructor(data, traversal_time) { - const ptr0 = passArrayJsValueToWasm0(data, wasm.__wbindgen_malloc); - const len0 = WASM_VECTOR_LEN; - const ret = wasm.traversalresult_new(ptr0, len0, traversal_time); - this.__wbg_ptr = ret >>> 0; - TraversalResultFinalization.register(this, this.__wbg_ptr, this); - return this; + + let len = arg.length; + let ptr = malloc(len, 1) >>> 0; + + const mem = getUint8ArrayMemory0(); + + let offset = 0; + + for (; offset < len; offset++) { + const code = arg.charCodeAt(offset); + if (code > 0x7F) break; + mem[ptr + offset] = code; } - /** - * @returns {boolean} - */ - is_empty() { - const ret = wasm.flattraversalresult_is_empty(this.__wbg_ptr); - return ret !== 0; + if (offset !== len) { + if (offset !== 0) { + arg = arg.slice(offset); + } + ptr = realloc(ptr, len, len = offset + arg.length * 3, 1) >>> 0; + const view = getUint8ArrayMemory0().subarray(ptr + offset, ptr + len); + const ret = cachedTextEncoder.encodeInto(arg, view); + + offset += ret.written; + ptr = realloc(ptr, len, offset, 1) >>> 0; } - /** - * @returns {PathList} - */ - to_paths() { - const ret = wasm.traversalresult_to_paths(this.__wbg_ptr); - return PathList.__wrap(ret); + + WASM_VECTOR_LEN = offset; + return ptr; +} + +function takeFromExternrefTable0(idx) { + const value = wasm.__wbindgen_externrefs.get(idx); + wasm.__externref_table_dealloc(idx); + return value; +} + +let cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true }); +cachedTextDecoder.decode(); +const MAX_SAFARI_DECODE_BYTES = 2146435072; +let numBytesDecoded = 0; +function decodeText(ptr, len) { + numBytesDecoded += len; + if (numBytesDecoded >= MAX_SAFARI_DECODE_BYTES) { + cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true }); + cachedTextDecoder.decode(); + numBytesDecoded = len; } + return cachedTextDecoder.decode(getUint8ArrayMemory0().subarray(ptr, ptr + len)); +} + +const cachedTextEncoder = new TextEncoder(); + +if (!('encodeInto' in cachedTextEncoder)) { + cachedTextEncoder.encodeInto = function (arg, view) { + const buf = cachedTextEncoder.encode(arg); + view.set(buf); + return { + read: arg.length, + written: buf.length + }; + }; +} + +let WASM_VECTOR_LEN = 0; + +let wasmModule, wasmInstance, wasm; +function __wbg_finalize_init(instance, module) { + wasmInstance = instance; + wasm = instance.exports; + wasmModule = module; + cachedDataViewMemory0 = null; + cachedUint32ArrayMemory0 = null; + cachedUint8ArrayMemory0 = null; + wasm.__wbindgen_start(); + return wasm; } async function __wbg_load(module, imports) { if (typeof Response === 'function' && module instanceof Response) { + if (!module.ok) { + throw new Error(`failed to fetch Wasm: ${module.status} ${module.statusText} fetching '${module.url}'`); + } + if (typeof WebAssembly.instantiateStreaming === 'function') { try { return await WebAssembly.instantiateStreaming(module, imports); - } catch (e) { - if (module.headers.get('Content-Type') != 'application/wasm') { + const validResponse = expectedResponseType(module.type); + + if (validResponse && module.headers.get('Content-Type') !== 'application/wasm') { console.warn("`WebAssembly.instantiateStreaming` failed because your server does not serve Wasm with `application/wasm` MIME type. Falling back to `WebAssembly.instantiate` which is slower. Original error:\n", e); - } else { - throw e; - } + } else { throw e; } } } const bytes = await module.arrayBuffer(); return await WebAssembly.instantiate(bytes, imports); - } else { const instance = await WebAssembly.instantiate(module, imports); if (instance instanceof WebAssembly.Instance) { return { instance, module }; - } else { return instance; } } -} -function __wbg_get_imports() { - const imports = {}; - imports.wbg = {}; - imports.wbg.__wbg_call_672a4d21634d4a24 = function() { return handleError(function (arg0, arg1) { - const ret = arg0.call(arg1); - return ret; - }, arguments) }; - imports.wbg.__wbg_call_7cccdd69e0791ae2 = function() { return handleError(function (arg0, arg1, arg2) { - const ret = arg0.call(arg1, arg2); - return ret; - }, arguments) }; - imports.wbg.__wbg_debug_0e292a0dbaeda7f1 = function(arg0, arg1, arg2) { - arg0.debug(getStringFromWasm0(arg1, arg2)); - }; - imports.wbg.__wbg_edgedata_new = function(arg0) { - const ret = EdgeData.__wrap(arg0); - return ret; - }; - imports.wbg.__wbg_edgestruct_new = function(arg0) { - const ret = EdgeStruct.__wrap(arg0); - return ret; - }; - imports.wbg.__wbg_edgestruct_unwrap = function(arg0) { - const ret = EdgeStruct.__unwrap(arg0); - return ret; - }; - imports.wbg.__wbg_error_3ca53ff4a54cf621 = function(arg0, arg1, arg2) { - arg0.error(getStringFromWasm0(arg1, arg2)); - }; - imports.wbg.__wbg_error_7534b8e9a36f1ab4 = function(arg0, arg1) { - let deferred0_0; - let deferred0_1; - try { - deferred0_0 = arg0; - deferred0_1 = arg1; - console.error(getStringFromWasm0(arg0, arg1)); - } finally { - wasm.__wbindgen_free(deferred0_0, deferred0_1, 1); + function expectedResponseType(type) { + switch (type) { + case 'basic': case 'cors': case 'default': return true; } - }; - imports.wbg.__wbg_flattraversaldata_new = function(arg0) { - const ret = FlatTraversalData.__wrap(arg0); - return ret; - }; - imports.wbg.__wbg_flattraversaldata_unwrap = function(arg0) { - const ret = FlatTraversalData.__unwrap(arg0); - return ret; - }; - imports.wbg.__wbg_gcedgedata_unwrap = function(arg0) { - const ret = GCEdgeData.__unwrap(arg0); - return ret; - }; - imports.wbg.__wbg_gcnodedata_unwrap = function(arg0) { - const ret = GCNodeData.__unwrap(arg0); - return ret; - }; - imports.wbg.__wbg_new_405e22f390576ce2 = function() { - const ret = new Object(); - return ret; - }; - imports.wbg.__wbg_new_8a6f238a6ece86ea = function() { - const ret = new Error(); - return ret; - }; - imports.wbg.__wbg_newnoargs_105ed471475aaf50 = function(arg0, arg1) { - const ret = new Function(getStringFromWasm0(arg0, arg1)); - return ret; - }; - imports.wbg.__wbg_nodedata_new = function(arg0) { - const ret = NodeData.__wrap(arg0); - return ret; - }; - imports.wbg.__wbg_notegrapherror_new = function(arg0) { - const ret = NoteGraphError.__wrap(arg0); - return ret; - }; - imports.wbg.__wbg_now_2c95c9de01293173 = function(arg0) { - const ret = arg0.now(); - return ret; - }; - imports.wbg.__wbg_path_new = function(arg0) { - const ret = Path.__wrap(arg0); - return ret; - }; - imports.wbg.__wbg_performance_7a3ffd0b17f663ad = function(arg0) { - const ret = arg0.performance; - return ret; - }; - imports.wbg.__wbg_set_bb8cecf6a62b9f46 = function() { return handleError(function (arg0, arg1, arg2) { - const ret = Reflect.set(arg0, arg1, arg2); - return ret; - }, arguments) }; - imports.wbg.__wbg_stack_0ed75d68575b0f3c = function(arg0, arg1) { - const ret = arg1.stack; - const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); - const len1 = WASM_VECTOR_LEN; - getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true); - getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true); - }; - imports.wbg.__wbg_static_accessor_GLOBAL_88a902d13a557d07 = function() { - const ret = typeof global === 'undefined' ? null : global; - return isLikeNone(ret) ? 0 : addToExternrefTable0(ret); - }; - imports.wbg.__wbg_static_accessor_GLOBAL_THIS_56578be7e9f832b0 = function() { - const ret = typeof globalThis === 'undefined' ? null : globalThis; - return isLikeNone(ret) ? 0 : addToExternrefTable0(ret); - }; - imports.wbg.__wbg_static_accessor_LOGGER_849a70838e9094f0 = function() { - const ret = log; - return ret; - }; - imports.wbg.__wbg_static_accessor_SELF_37c5d418e4bf5819 = function() { - const ret = typeof self === 'undefined' ? null : self; - return isLikeNone(ret) ? 0 : addToExternrefTable0(ret); - }; - imports.wbg.__wbg_static_accessor_WINDOW_5de37043a91a9c40 = function() { - const ret = typeof window === 'undefined' ? null : window; - return isLikeNone(ret) ? 0 : addToExternrefTable0(ret); - }; - imports.wbg.__wbg_transitivegraphrule_unwrap = function(arg0) { - const ret = TransitiveGraphRule.__unwrap(arg0); - return ret; - }; - imports.wbg.__wbg_traversaldata_new = function(arg0) { - const ret = TraversalData.__wrap(arg0); - return ret; - }; - imports.wbg.__wbg_traversaldata_unwrap = function(arg0) { - const ret = TraversalData.__unwrap(arg0); - return ret; - }; - imports.wbg.__wbindgen_debug_string = function(arg0, arg1) { - const ret = debugString(arg1); - const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); - const len1 = WASM_VECTOR_LEN; - getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true); - getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true); - }; - imports.wbg.__wbindgen_init_externref_table = function() { - const table = wasm.__wbindgen_export_2; - const offset = table.grow(4); - table.set(0, undefined); - table.set(offset + 0, undefined); - table.set(offset + 1, null); - table.set(offset + 2, true); - table.set(offset + 3, false); - ; - }; - imports.wbg.__wbindgen_is_undefined = function(arg0) { - const ret = arg0 === undefined; - return ret; - }; - imports.wbg.__wbindgen_string_get = function(arg0, arg1) { - const obj = arg1; - const ret = typeof(obj) === 'string' ? obj : undefined; - var ptr1 = isLikeNone(ret) ? 0 : passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); - var len1 = WASM_VECTOR_LEN; - getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true); - getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true); - }; - imports.wbg.__wbindgen_string_new = function(arg0, arg1) { - const ret = getStringFromWasm0(arg0, arg1); - return ret; - }; - imports.wbg.__wbindgen_throw = function(arg0, arg1) { - throw new Error(getStringFromWasm0(arg0, arg1)); - }; - - return imports; -} - -function __wbg_init_memory(imports, memory) { - -} - -function __wbg_finalize_init(instance, module) { - wasm = instance.exports; - __wbg_init.__wbindgen_wasm_module = module; - cachedDataViewMemory0 = null; - cachedUint32ArrayMemory0 = null; - cachedUint8ArrayMemory0 = null; - - - wasm.__wbindgen_start(); - return wasm; + return false; + } } function initSync(module) { if (wasm !== undefined) return wasm; - if (typeof module !== 'undefined') { + if (module !== undefined) { if (Object.getPrototypeOf(module) === Object.prototype) { ({module} = module) } else { @@ -3413,15 +3326,10 @@ function initSync(module) { } const imports = __wbg_get_imports(); - - __wbg_init_memory(imports); - if (!(module instanceof WebAssembly.Module)) { module = new WebAssembly.Module(module); } - const instance = new WebAssembly.Instance(module, imports); - return __wbg_finalize_init(instance, module); } @@ -3429,7 +3337,7 @@ async function __wbg_init(module_or_path) { if (wasm !== undefined) return wasm; - if (typeof module_or_path !== 'undefined') { + if (module_or_path !== undefined) { if (Object.getPrototypeOf(module_or_path) === Object.prototype) { ({module_or_path} = module_or_path) } else { @@ -3437,7 +3345,7 @@ async function __wbg_init(module_or_path) { } } - if (typeof module_or_path === 'undefined') { + if (module_or_path === undefined) { module_or_path = new URL('breadcrumbs_graph_wasm_bg.wasm', import.meta.url); } const imports = __wbg_get_imports(); @@ -3446,12 +3354,9 @@ async function __wbg_init(module_or_path) { module_or_path = fetch(module_or_path); } - __wbg_init_memory(imports); - const { instance, module } = await __wbg_load(await module_or_path, imports); return __wbg_finalize_init(instance, module); } -export { initSync }; -export default __wbg_init; +export { initSync, __wbg_init as default }; diff --git a/wasm/pkg/breadcrumbs_graph_wasm_bg.wasm b/wasm/pkg/breadcrumbs_graph_wasm_bg.wasm index ac739459..050c3942 100644 Binary files a/wasm/pkg/breadcrumbs_graph_wasm_bg.wasm and b/wasm/pkg/breadcrumbs_graph_wasm_bg.wasm differ diff --git a/wasm/pkg/breadcrumbs_graph_wasm_bg.wasm.d.ts b/wasm/pkg/breadcrumbs_graph_wasm_bg.wasm.d.ts index 647b9492..673314a7 100644 --- a/wasm/pkg/breadcrumbs_graph_wasm_bg.wasm.d.ts +++ b/wasm/pkg/breadcrumbs_graph_wasm_bg.wasm.d.ts @@ -1,23 +1,132 @@ /* tslint:disable */ /* eslint-disable @typescript-eslint/no-unsafe-function-type, @typescript-eslint/no-misused-new -- wasm-bindgen generates bare `Function` params and a static `new`; the bindings are generated, not hand-written. */ export const memory: WebAssembly.Memory; -export const create_graph: () => number; +export const __wbg_addedgegraphupdate_free: (a: number, b: number) => void; +export const __wbg_addnotegraphupdate_free: (a: number, b: number) => void; +export const __wbg_batchgraphupdate_free: (a: number, b: number) => void; +export const __wbg_edgedata_free: (a: number, b: number) => void; +export const __wbg_edgelist_free: (a: number, b: number) => void; +export const __wbg_edgesorter_free: (a: number, b: number) => void; +export const __wbg_edgestruct_free: (a: number, b: number) => void; +export const __wbg_flattraversaldata_free: (a: number, b: number) => void; +export const __wbg_flattraversalresult_free: (a: number, b: number) => void; +export const __wbg_gcedgedata_free: (a: number, b: number) => void; +export const __wbg_gcnodedata_free: (a: number, b: number) => void; +export const __wbg_get_edgedata_explicit: (a: number) => number; +export const __wbg_get_edgedata_round: (a: number) => number; +export const __wbg_get_flattraversaldata_children: (a: number) => [number, number]; +export const __wbg_get_flattraversaldata_depth: (a: number) => number; +export const __wbg_get_flattraversaldata_edge: (a: number) => number; +export const __wbg_get_flattraversaldata_has_cut_of_children: (a: number) => number; +export const __wbg_get_flattraversaldata_number_of_children: (a: number) => number; +export const __wbg_get_flattraversalresult_data: (a: number) => [number, number]; +export const __wbg_get_flattraversalresult_entry_nodes: (a: number) => [number, number]; +export const __wbg_get_flattraversalresult_hit_depth_limit: (a: number) => number; +export const __wbg_get_flattraversalresult_max_depth: (a: number) => number; +export const __wbg_get_flattraversalresult_node_count: (a: number) => number; +export const __wbg_get_flattraversalresult_traversal_time: (a: number) => bigint; +export const __wbg_get_mermaidgraphdata_mermaid: (a: number) => [number, number]; +export const __wbg_get_mermaidgraphdata_total_time: (a: number) => bigint; +export const __wbg_get_mermaidgraphdata_traversal_time: (a: number) => bigint; +export const __wbg_get_nodedata_aliases: (a: number) => [number, number]; +export const __wbg_get_nodedata_ignore_in_edges: (a: number) => number; +export const __wbg_get_nodedata_ignore_out_edges: (a: number) => number; +export const __wbg_get_nodedata_path: (a: number) => [number, number]; +export const __wbg_get_nodedata_resolved: (a: number) => number; export const __wbg_get_path_edges: (a: number) => [number, number]; +export const __wbg_get_traversaldata_children: (a: number) => [number, number]; +export const __wbg_get_traversaldata_depth: (a: number) => number; +export const __wbg_get_traversaldata_edge: (a: number) => number; +export const __wbg_get_traversaldata_has_cut_of_children: (a: number) => number; +export const __wbg_get_traversaldata_number_of_children: (a: number) => number; +export const __wbg_get_traversaloptions_dataview_from_paths: (a: number) => [number, number]; +export const __wbg_get_traversaloptions_edge_types: (a: number) => [number, number]; +export const __wbg_get_traversaloptions_entry_nodes: (a: number) => [number, number]; +export const __wbg_get_traversaloptions_max_depth: (a: number) => number; +export const __wbg_get_traversaloptions_max_traversal_count: (a: number) => number; +export const __wbg_get_traversaloptions_separate_edges: (a: number) => number; +export const __wbg_get_traversalpostprocessoptions_flatten: (a: number) => number; +export const __wbg_get_traversalpostprocessoptions_sorter: (a: number) => number; +export const __wbg_get_traversalresult_data: (a: number) => [number, number]; +export const __wbg_get_traversalresult_hit_depth_limit: (a: number) => number; +export const __wbg_get_traversalresult_max_depth: (a: number) => number; +export const __wbg_get_traversalresult_node_count: (a: number) => number; +export const __wbg_get_traversalresult_traversal_time: (a: number) => bigint; +export const __wbg_groupededgelist_free: (a: number, b: number) => void; +export const __wbg_mermaidgraphdata_free: (a: number, b: number) => void; +export const __wbg_mermaidgraphoptions_free: (a: number, b: number) => void; +export const __wbg_nodedata_free: (a: number, b: number) => void; +export const __wbg_nodestringifyoptions_free: (a: number, b: number) => void; +export const __wbg_notegraph_free: (a: number, b: number) => void; +export const __wbg_notegrapherror_free: (a: number, b: number) => void; export const __wbg_path_free: (a: number, b: number) => void; export const __wbg_pathlist_free: (a: number, b: number) => void; +export const __wbg_removeedgegraphupdate_free: (a: number, b: number) => void; +export const __wbg_removenotegraphupdate_free: (a: number, b: number) => void; +export const __wbg_renamenotegraphupdate_free: (a: number, b: number) => void; +export const __wbg_set_edgedata_explicit: (a: number, b: number) => void; +export const __wbg_set_edgedata_round: (a: number, b: number) => void; +export const __wbg_set_flattraversaldata_children: (a: number, b: number, c: number) => void; +export const __wbg_set_flattraversaldata_depth: (a: number, b: number) => void; +export const __wbg_set_flattraversaldata_edge: (a: number, b: number) => void; +export const __wbg_set_flattraversaldata_has_cut_of_children: (a: number, b: number) => void; +export const __wbg_set_flattraversaldata_number_of_children: (a: number, b: number) => void; +export const __wbg_set_flattraversalresult_data: (a: number, b: number, c: number) => void; +export const __wbg_set_flattraversalresult_entry_nodes: (a: number, b: number, c: number) => void; +export const __wbg_set_flattraversalresult_hit_depth_limit: (a: number, b: number) => void; +export const __wbg_set_flattraversalresult_max_depth: (a: number, b: number) => void; +export const __wbg_set_flattraversalresult_node_count: (a: number, b: number) => void; +export const __wbg_set_flattraversalresult_traversal_time: (a: number, b: bigint) => void; +export const __wbg_set_mermaidgraphdata_mermaid: (a: number, b: number, c: number) => void; +export const __wbg_set_mermaidgraphdata_total_time: (a: number, b: bigint) => void; +export const __wbg_set_mermaidgraphdata_traversal_time: (a: number, b: bigint) => void; +export const __wbg_set_nodedata_aliases: (a: number, b: number, c: number) => void; +export const __wbg_set_nodedata_ignore_in_edges: (a: number, b: number) => void; +export const __wbg_set_nodedata_ignore_out_edges: (a: number, b: number) => void; +export const __wbg_set_nodedata_path: (a: number, b: number, c: number) => void; +export const __wbg_set_nodedata_resolved: (a: number, b: number) => void; export const __wbg_set_path_edges: (a: number, b: number, c: number) => void; -export const path_equals: (a: number, b: number) => number; -export const path_get_first_target: (a: number, b: number) => [number, number, number, number]; -export const path_length: (a: number) => number; -export const path_reverse_edges: (a: number) => [number, number]; -export const path_toString: (a: number) => [number, number]; -export const path_truncate: (a: number, b: number) => number; -export const pathlist_max_depth: (a: number) => number; -export const pathlist_process: (a: number, b: number, c: number) => [number, number, number, number]; -export const pathlist_select: (a: number, b: number, c: number) => number; -export const pathlist_toString: (a: number) => [number, number]; -export const pathlist_to_paths: (a: number) => [number, number]; -export const __wbg_edgestruct_free: (a: number, b: number) => void; +export const __wbg_set_traversaldata_children: (a: number, b: number, c: number) => void; +export const __wbg_set_traversaldata_depth: (a: number, b: number) => void; +export const __wbg_set_traversaldata_edge: (a: number, b: number) => void; +export const __wbg_set_traversaldata_has_cut_of_children: (a: number, b: number) => void; +export const __wbg_set_traversaldata_number_of_children: (a: number, b: number) => void; +export const __wbg_set_traversaloptions_dataview_from_paths: (a: number, b: number, c: number) => void; +export const __wbg_set_traversaloptions_edge_types: (a: number, b: number, c: number) => void; +export const __wbg_set_traversaloptions_entry_nodes: (a: number, b: number, c: number) => void; +export const __wbg_set_traversaloptions_max_depth: (a: number, b: number) => void; +export const __wbg_set_traversaloptions_max_traversal_count: (a: number, b: number) => void; +export const __wbg_set_traversaloptions_separate_edges: (a: number, b: number) => void; +export const __wbg_set_traversalpostprocessoptions_flatten: (a: number, b: number) => void; +export const __wbg_set_traversalpostprocessoptions_sorter: (a: number, b: number) => void; +export const __wbg_set_traversalresult_data: (a: number, b: number, c: number) => void; +export const __wbg_set_traversalresult_hit_depth_limit: (a: number, b: number) => void; +export const __wbg_set_traversalresult_max_depth: (a: number, b: number) => void; +export const __wbg_set_traversalresult_node_count: (a: number, b: number) => void; +export const __wbg_set_traversalresult_traversal_time: (a: number, b: bigint) => void; +export const __wbg_transitivegraphrule_free: (a: number, b: number) => void; +export const __wbg_transitiverulesgraphupdate_free: (a: number, b: number) => void; +export const __wbg_traversaldata_free: (a: number, b: number) => void; +export const __wbg_traversaloptions_free: (a: number, b: number) => void; +export const __wbg_traversalpostprocessoptions_free: (a: number, b: number) => void; +export const __wbg_traversalresult_free: (a: number, b: number) => void; +export const addedgegraphupdate_add_to_batch: (a: number, b: number) => void; +export const addedgegraphupdate_new: (a: number) => number; +export const addnotegraphupdate_add_to_batch: (a: number, b: number) => void; +export const addnotegraphupdate_new: (a: number) => number; +export const batchgraphupdate_new: () => number; +export const create_edge_sorter: (a: number, b: number, c: number) => [number, number, number]; +export const create_graph: () => number; +export const edgedata_edge_source: (a: number) => [number, number]; +export const edgedata_edge_type: (a: number) => [number, number]; +export const edgedata_toString: (a: number) => [number, number]; +export const edgelist_first: (a: number) => number; +export const edgelist_get_edges: (a: number) => [number, number]; +export const edgelist_get_sorted_edges: (a: number, b: number, c: number) => [number, number, number, number]; +export const edgelist_group_by_type: (a: number) => number; +export const edgelist_last: (a: number) => number; +export const edgelist_toString: (a: number) => [number, number]; +export const edgelist_to_array: (a: number) => [number, number]; export const edgestruct_edge_data: (a: number, b: number) => [number, number, number]; export const edgestruct_edge_source: (a: number, b: number) => [number, number, number, number]; export const edgestruct_edge_type: (a: number) => [number, number]; @@ -35,19 +144,14 @@ export const edgestruct_target_data: (a: number, b: number) => [number, number, export const edgestruct_target_path: (a: number, b: number) => [number, number, number, number]; export const edgestruct_target_resolved: (a: number, b: number) => [number, number, number]; export const edgestruct_toString: (a: number) => [number, number]; -export const notegraph_rec_traverse: (a: number, b: number) => [number, number, number]; -export const notegraph_rec_traverse_and_process: (a: number, b: number, c: number) => [number, number, number]; -export const __wbg_nodestringifyoptions_free: (a: number, b: number) => void; -export const nodestringifyoptions_new: (a: number, b: number, c: number, d: number, e: number) => number; -export const nodestringifyoptions_stringify_node: (a: number, b: number) => [number, number]; -export const __wbg_batchgraphupdate_free: (a: number, b: number) => void; -export const batchgraphupdate_new: () => number; -export const __wbg_transitivegraphrule_free: (a: number, b: number) => void; -export const transitivegraphrule_create_example_graph: (a: number) => [number, number, number]; -export const transitivegraphrule_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number) => number; -export const transitivegraphrule_toString: (a: number) => [number, number]; -export const __wbg_gcedgedata_free: (a: number, b: number) => void; -export const __wbg_gcnodedata_free: (a: number, b: number) => void; +export const flattraversaldata_get_attribute_label: (a: number, b: number, c: number, d: number) => [number, number, number, number]; +export const flattraversaldata_to_js_rendering_obj: (a: number, b: number, c: number, d: number, e: number) => [number, number, number]; +export const flattraversalresult_children_at_index: (a: number, b: number) => [number, number]; +export const flattraversalresult_data_at_index: (a: number, b: number) => number; +export const flattraversalresult_is_empty: (a: number) => number; +export const flattraversalresult_rendering_obj_at_index: (a: number, b: number, c: number, d: number, e: number, f: number) => [number, number, number]; +export const flattraversalresult_sort: (a: number, b: number, c: number) => [number, number]; +export const flattraversalresult_toString: (a: number) => [number, number]; export const gcedgedata_edge_source: (a: number) => [number, number]; export const gcedgedata_edge_type: (a: number) => [number, number]; export const gcedgedata_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number) => number; @@ -56,10 +160,20 @@ export const gcedgedata_target: (a: number) => [number, number]; export const gcedgedata_toString: (a: number) => [number, number]; export const gcnodedata_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => number; export const gcnodedata_toString: (a: number) => [number, number]; -export const __wbg_notegraph_free: (a: number, b: number) => void; +export const groupededgelist_get_edges: (a: number, b: number, c: number) => [number, number]; +export const groupededgelist_get_sorted_edges: (a: number, b: number, c: number, d: number, e: number) => [number, number, number, number]; +export const groupededgelist_toString: (a: number) => [number, number]; +export const mermaidgraphdata_toString: (a: number) => [number, number]; +export const mermaidgraphoptions_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number, j: number, k: number, l: number, m: number, n: number, o: number, p: number, q: number, r: number, s: number) => number; +export const mermaidgraphoptions_toString: (a: number) => [number, number]; +export const nodedata_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => number; +export const nodedata_toString: (a: number) => [number, number]; +export const nodestringifyoptions_new: (a: number, b: number, c: number, d: number, e: number) => number; +export const nodestringifyoptions_stringify_node: (a: number, b: number) => [number, number]; export const notegraph_apply_update: (a: number, b: number) => [number, number]; export const notegraph_build_graph: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => [number, number]; export const notegraph_edge_types: (a: number) => [number, number]; +export const notegraph_generate_mermaid_graph: (a: number, b: number, c: number) => [number, number, number]; export const notegraph_get_filtered_grouped_outgoing_edges: (a: number, b: number, c: number, d: number, e: number) => number; export const notegraph_get_filtered_outgoing_edges: (a: number, b: number, c: number, d: number, e: number) => number; export const notegraph_get_incoming_edges: (a: number, b: number, c: number) => number; @@ -72,169 +186,55 @@ export const notegraph_iterate_nodes: (a: number, b: unknown) => void; export const notegraph_log: (a: number) => void; export const notegraph_new: () => number; export const notegraph_notify_update: (a: number) => void; +export const notegraph_rec_traverse: (a: number, b: number) => [number, number, number]; +export const notegraph_rec_traverse_and_process: (a: number, b: number, c: number) => [number, number, number]; export const notegraph_set_update_callback: (a: number, b: unknown) => void; -export const __wbg_edgelist_free: (a: number, b: number) => void; -export const __wbg_groupededgelist_free: (a: number, b: number) => void; -export const edgelist_first: (a: number) => number; -export const edgelist_get_edges: (a: number) => [number, number]; -export const edgelist_get_sorted_edges: (a: number, b: number, c: number) => [number, number, number, number]; -export const edgelist_group_by_type: (a: number) => number; -export const edgelist_last: (a: number) => number; -export const edgelist_toString: (a: number) => [number, number]; -export const edgelist_to_array: (a: number) => [number, number]; -export const groupededgelist_get_edges: (a: number, b: number, c: number) => [number, number]; -export const groupededgelist_get_sorted_edges: (a: number, b: number, c: number, d: number, e: number) => [number, number, number, number]; -export const groupededgelist_toString: (a: number) => [number, number]; -export const __wbg_get_mermaidgraphdata_mermaid: (a: number) => [number, number]; -export const __wbg_get_mermaidgraphdata_total_time: (a: number) => bigint; -export const __wbg_get_mermaidgraphdata_traversal_time: (a: number) => bigint; -export const __wbg_mermaidgraphdata_free: (a: number, b: number) => void; -export const __wbg_mermaidgraphoptions_free: (a: number, b: number) => void; -export const __wbg_set_mermaidgraphdata_mermaid: (a: number, b: number, c: number) => void; -export const __wbg_set_mermaidgraphdata_total_time: (a: number, b: bigint) => void; -export const __wbg_set_mermaidgraphdata_traversal_time: (a: number, b: bigint) => void; -export const mermaidgraphdata_toString: (a: number) => [number, number]; -export const mermaidgraphoptions_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number, j: number, k: number, l: number, m: number, n: number, o: number, p: number, q: number, r: number, s: number) => number; -export const mermaidgraphoptions_toString: (a: number) => [number, number]; -export const notegraph_generate_mermaid_graph: (a: number, b: number, c: number) => [number, number, number]; -export const __wbg_notegrapherror_free: (a: number, b: number) => void; export const notegrapherror_message: (a: number) => [number, number]; export const notegrapherror_new: (a: number, b: number) => number; export const notegrapherror_toString: (a: number) => [number, number]; -export const __wbg_get_nodedata_aliases: (a: number) => [number, number]; -export const __wbg_get_nodedata_ignore_in_edges: (a: number) => number; -export const __wbg_get_nodedata_ignore_out_edges: (a: number) => number; -export const __wbg_get_nodedata_path: (a: number) => [number, number]; -export const __wbg_get_nodedata_resolved: (a: number) => number; -export const __wbg_nodedata_free: (a: number, b: number) => void; -export const __wbg_set_nodedata_aliases: (a: number, b: number, c: number) => void; -export const __wbg_set_nodedata_ignore_in_edges: (a: number, b: number) => void; -export const __wbg_set_nodedata_ignore_out_edges: (a: number, b: number) => void; -export const __wbg_set_nodedata_path: (a: number, b: number, c: number) => void; -export const __wbg_set_nodedata_resolved: (a: number, b: number) => void; -export const nodedata_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => number; -export const nodedata_toString: (a: number) => [number, number]; -export const __wbg_edgesorter_free: (a: number, b: number) => void; -export const create_edge_sorter: (a: number, b: number, c: number) => [number, number, number]; -export const sort_edges: (a: number, b: number, c: number, d: number) => [number, number, number, number]; -export const sort_traversal_data: (a: number, b: number, c: number, d: number) => [number, number, number, number]; -export const __wbg_addedgegraphupdate_free: (a: number, b: number) => void; -export const __wbg_addnotegraphupdate_free: (a: number, b: number) => void; -export const __wbg_removeedgegraphupdate_free: (a: number, b: number) => void; -export const __wbg_removenotegraphupdate_free: (a: number, b: number) => void; -export const __wbg_renamenotegraphupdate_free: (a: number, b: number) => void; -export const __wbg_transitiverulesgraphupdate_free: (a: number, b: number) => void; -export const addedgegraphupdate_add_to_batch: (a: number, b: number) => void; -export const addedgegraphupdate_new: (a: number) => number; -export const addnotegraphupdate_add_to_batch: (a: number, b: number) => void; -export const addnotegraphupdate_new: (a: number) => number; +export const path_equals: (a: number, b: number) => number; +export const path_get_first_target: (a: number, b: number) => [number, number, number, number]; +export const path_length: (a: number) => number; +export const path_reverse_edges: (a: number) => [number, number]; +export const path_toString: (a: number) => [number, number]; +export const path_truncate: (a: number, b: number) => number; +export const pathlist_max_depth: (a: number) => number; +export const pathlist_process: (a: number, b: number, c: number) => [number, number, number, number]; +export const pathlist_select: (a: number, b: number, c: number) => number; +export const pathlist_toString: (a: number) => [number, number]; +export const pathlist_to_paths: (a: number) => [number, number]; export const removeedgegraphupdate_add_to_batch: (a: number, b: number) => void; export const removeedgegraphupdate_new: (a: number, b: number, c: number, d: number, e: number, f: number) => number; export const removenotegraphupdate_add_to_batch: (a: number, b: number) => void; export const removenotegraphupdate_new: (a: number, b: number) => number; export const renamenotegraphupdate_add_to_batch: (a: number, b: number) => void; export const renamenotegraphupdate_new: (a: number, b: number, c: number, d: number) => number; +export const sort_edges: (a: number, b: number, c: number, d: number) => [number, number, number, number]; +export const sort_traversal_data: (a: number, b: number, c: number, d: number) => [number, number, number, number]; +export const transitivegraphrule_create_example_graph: (a: number) => [number, number, number]; +export const transitivegraphrule_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number) => number; +export const transitivegraphrule_toString: (a: number) => [number, number]; export const transitiverulesgraphupdate_add_to_batch: (a: number, b: number) => void; export const transitiverulesgraphupdate_new: (a: number, b: number) => number; -export const __wbg_flattraversaldata_free: (a: number, b: number) => void; -export const __wbg_flattraversalresult_free: (a: number, b: number) => void; -export const __wbg_get_flattraversaldata_children: (a: number) => [number, number]; -export const __wbg_get_flattraversaldata_depth: (a: number) => number; -export const __wbg_get_flattraversaldata_edge: (a: number) => number; -export const __wbg_get_flattraversaldata_has_cut_of_children: (a: number) => number; -export const __wbg_get_flattraversaldata_number_of_children: (a: number) => number; -export const __wbg_get_flattraversalresult_data: (a: number) => [number, number]; -export const __wbg_get_flattraversalresult_entry_nodes: (a: number) => [number, number]; -export const __wbg_get_flattraversalresult_hit_depth_limit: (a: number) => number; -export const __wbg_get_flattraversalresult_node_count: (a: number) => number; -export const __wbg_get_flattraversalresult_traversal_time: (a: number) => bigint; -export const __wbg_get_traversaldata_children: (a: number) => [number, number]; -export const __wbg_get_traversalresult_data: (a: number) => [number, number]; -export const __wbg_get_traversalresult_hit_depth_limit: (a: number) => number; -export const __wbg_get_traversalresult_max_depth: (a: number) => number; -export const __wbg_get_traversalresult_node_count: (a: number) => number; -export const __wbg_set_flattraversaldata_children: (a: number, b: number, c: number) => void; -export const __wbg_set_flattraversaldata_depth: (a: number, b: number) => void; -export const __wbg_set_flattraversaldata_edge: (a: number, b: number) => void; -export const __wbg_set_flattraversaldata_has_cut_of_children: (a: number, b: number) => void; -export const __wbg_set_flattraversaldata_number_of_children: (a: number, b: number) => void; -export const __wbg_set_flattraversalresult_data: (a: number, b: number, c: number) => void; -export const __wbg_set_flattraversalresult_entry_nodes: (a: number, b: number, c: number) => void; -export const __wbg_set_flattraversalresult_hit_depth_limit: (a: number, b: number) => void; -export const __wbg_set_flattraversalresult_node_count: (a: number, b: number) => void; -export const __wbg_set_flattraversalresult_traversal_time: (a: number, b: bigint) => void; -export const __wbg_set_traversaldata_children: (a: number, b: number, c: number) => void; -export const __wbg_set_traversalresult_data: (a: number, b: number, c: number) => void; -export const __wbg_set_traversalresult_hit_depth_limit: (a: number, b: number) => void; -export const __wbg_set_traversalresult_max_depth: (a: number, b: number) => void; -export const __wbg_set_traversalresult_node_count: (a: number, b: number) => void; -export const __wbg_traversaldata_free: (a: number, b: number) => void; -export const __wbg_traversalresult_free: (a: number, b: number) => void; -export const flattraversaldata_get_attribute_label: (a: number, b: number, c: number, d: number) => [number, number, number, number]; -export const flattraversaldata_to_js_rendering_obj: (a: number, b: number, c: number, d: number, e: number) => [number, number, number]; -export const flattraversalresult_children_at_index: (a: number, b: number) => [number, number]; -export const flattraversalresult_data_at_index: (a: number, b: number) => number; -export const flattraversalresult_is_empty: (a: number) => number; -export const flattraversalresult_rendering_obj_at_index: (a: number, b: number, c: number, d: number, e: number, f: number) => [number, number, number]; -export const flattraversalresult_sort: (a: number, b: number, c: number) => [number, number]; -export const flattraversalresult_toString: (a: number) => [number, number]; export const traversaldata_new: (a: number, b: number, c: number, d: number, e: number, f: number) => number; export const traversaldata_rec_sort_children: (a: number, b: number, c: number) => [number, number]; export const traversaldata_toString: (a: number) => [number, number]; -export const traversalresult_new: (a: number, b: number, c: bigint) => number; -export const traversalresult_toString: (a: number) => [number, number]; -export const traversalresult_to_paths: (a: number) => number; -export const __wbg_set_traversaldata_has_cut_of_children: (a: number, b: number) => void; -export const __wbg_set_flattraversalresult_max_depth: (a: number, b: number) => void; -export const __wbg_set_traversaldata_depth: (a: number, b: number) => void; -export const __wbg_set_traversaldata_number_of_children: (a: number, b: number) => void; -export const __wbg_set_traversalresult_traversal_time: (a: number, b: bigint) => void; -export const __wbg_get_traversaldata_edge: (a: number) => number; -export const traversalresult_is_empty: (a: number) => number; -export const __wbg_set_traversaldata_edge: (a: number, b: number) => void; -export const __wbg_get_traversaldata_has_cut_of_children: (a: number) => number; -export const __wbg_get_flattraversalresult_max_depth: (a: number) => number; -export const __wbg_get_traversaldata_depth: (a: number) => number; -export const __wbg_get_traversaldata_number_of_children: (a: number) => number; -export const __wbg_get_traversalresult_traversal_time: (a: number) => bigint; -export const __wbg_edgedata_free: (a: number, b: number) => void; -export const __wbg_get_edgedata_explicit: (a: number) => number; -export const __wbg_get_edgedata_round: (a: number) => number; -export const __wbg_set_edgedata_explicit: (a: number, b: number) => void; -export const __wbg_set_edgedata_round: (a: number, b: number) => void; -export const edgedata_edge_source: (a: number) => [number, number]; -export const edgedata_edge_type: (a: number) => [number, number]; -export const edgedata_toString: (a: number) => [number, number]; -export const __wbg_get_traversaloptions_dataview_from_paths: (a: number) => [number, number]; -export const __wbg_get_traversaloptions_edge_types: (a: number) => [number, number]; -export const __wbg_get_traversaloptions_entry_nodes: (a: number) => [number, number]; -export const __wbg_get_traversaloptions_max_depth: (a: number) => number; -export const __wbg_get_traversaloptions_max_traversal_count: (a: number) => number; -export const __wbg_get_traversaloptions_separate_edges: (a: number) => number; -export const __wbg_get_traversalpostprocessoptions_flatten: (a: number) => number; -export const __wbg_get_traversalpostprocessoptions_sorter: (a: number) => number; -export const __wbg_set_traversaloptions_dataview_from_paths: (a: number, b: number, c: number) => void; -export const __wbg_set_traversaloptions_edge_types: (a: number, b: number, c: number) => void; -export const __wbg_set_traversaloptions_entry_nodes: (a: number, b: number, c: number) => void; -export const __wbg_set_traversaloptions_max_depth: (a: number, b: number) => void; -export const __wbg_set_traversaloptions_max_traversal_count: (a: number, b: number) => void; -export const __wbg_set_traversaloptions_separate_edges: (a: number, b: number) => void; -export const __wbg_set_traversalpostprocessoptions_flatten: (a: number, b: number) => void; -export const __wbg_set_traversalpostprocessoptions_sorter: (a: number, b: number) => void; -export const __wbg_traversaloptions_free: (a: number, b: number) => void; -export const __wbg_traversalpostprocessoptions_free: (a: number, b: number) => void; export const traversaloptions_new: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number) => number; export const traversaloptions_toString: (a: number) => [number, number]; export const traversalpostprocessoptions_new: (a: number, b: number) => number; export const traversalpostprocessoptions_toString: (a: number) => [number, number]; export const traversalpostprocessoptions_without_sorter: (a: number) => number; +export const traversalresult_is_empty: (a: number) => number; +export const traversalresult_new: (a: number, b: number, c: bigint) => number; +export const traversalresult_toString: (a: number) => [number, number]; +export const traversalresult_to_paths: (a: number) => number; +export const __wbindgen_malloc: (a: number, b: number) => number; +export const __wbindgen_realloc: (a: number, b: number, c: number, d: number) => number; export const __wbindgen_exn_store: (a: number) => void; export const __externref_table_alloc: () => number; -export const __wbindgen_export_2: WebAssembly.Table; +export const __wbindgen_externrefs: WebAssembly.Table; export const __wbindgen_free: (a: number, b: number, c: number) => void; -export const __wbindgen_malloc: (a: number, b: number) => number; -export const __wbindgen_realloc: (a: number, b: number, c: number, d: number) => number; -export const __externref_drop_slice: (a: number, b: number) => void; export const __externref_table_dealloc: (a: number) => void; +export const __externref_drop_slice: (a: number, b: number) => void; export const __wbindgen_start: () => void; /* eslint-enable @typescript-eslint/no-unsafe-function-type, @typescript-eslint/no-misused-new -- End of generated bindings. */