wasm4pm 26.6.13

High-performance process mining algorithms in WebAssembly for JavaScript/TypeScript
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

//! Probabilistic data structures for memory-ephemeral process mining.
//!
//! These structures allow processing arbitrarily large event logs with bounded
//! memory by trading exact answers for approximate ones with quantifiable error.
//!
//! # Structures
//!
//! - [`CountMinSketch`] — frequency estimation for DFG edges
//! - [`HyperLogLog`] — cardinality estimation (unique trace count)
//! - [`BloomFilter`] — set membership for trace deduplication
//! - [`StreamingLog`] — combines all three into a single streaming DFG builder

pub mod bloom;
pub mod count_min;
pub mod hyperloglog;
pub mod streaming_log;

#[cfg(target_arch = "wasm32")]
pub mod wasm_bindings;

pub use bloom::BloomFilter;
pub use count_min::CountMinSketch;
pub use hyperloglog::HyperLogLog;
pub use streaming_log::StreamingLog;