mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Sales, marketing and customer service
cpq
configure-price-quote
Salesforce CPQ
System
Techniques · 11
Primitives · 51
cpq
Template engines
compilers · medium: Compile templates with loops, partials and auto-escaping into render functions
Tariff rating
finance · medium: Rate usage events against price plans: tiers, time bands, bundles and rounding rules
Usage metering
finance · medium: Counting tokens/requests per user and key, aggregating for quotas and billing with idempotent events
Bill of materials explosion
optimization · medium: MRP netting: explode BOMs level by level with lead-time offsetting into planned orders
Constraint propagation (constraint…
optimization · medium: Variables with finite domains, propagators that prune impossible values to a fixpoint, and backtracking search with trail undo between decisions.
›
Pdf digital signatures
security · medium: CMS/PAdES signatures embedded in PDFs with byte ranges and long-term validation
Change data capture
storage · medium: Decode the database's own commit log into row-change events in commit order, with a resume position, so any consumer can mirror the data exactly.
›
Largest remainder rounding
finance · low: Splitting an amount into parts that sum exactly (largest remainder / Hamilton) for allocations, splits and prorations
Money representation
finance · low: Store money as integer minor units with an explicit currency exponent, compute in wider integers, and round once with a named rounding mode.
›
Currency cross rate triangulation
finance · low: Deriving cross rates through a base currency with correct precision, inversion and spreads
Proration calculation
finance · low: Prorating charges and credits for mid-cycle plan changes by time used
Revenue recognition schedules
finance · low: Deferred revenue schedules that recognize income over service periods (ASC 606 / IFRS 15)
Binary decision diagrams
optimization · low: A reduced ordered BDD stores a Boolean function as a shared DAG that is unique per variable order, so equivalence is one integer compare and counting is one pass.
›
Dual control approval
security · low: Four-eyes / maker-checker approval with quorum policies for sensitive operations
Optimistic concurrency control
storage · low: Run transactions without locks, record what they read, and validate at commit that nothing changed; fastest when conflicts are rare.
›
Hierarchical state machine
systems · low: Nest states so a substate inherits its parent's reactions and only overrides what differs, with ordered entry and exit actions along the path.
›
Name resolution
compilers · low: Bind every use of a name to its declaration with a scope stack, handling shadowing, hoisting and closure capture in one AST walk.
›
Recursive-descent parsing
compilers · low: Hand-written top-down parser with one function per grammar rule; simple, fast, with full control over error messages and recovery.
›
Html sanitization
security · low: Allowlist-based HTML sanitizing of untrusted markup
Interval tree
data-structures · low: Index of ranges that answers "which intervals overlap this point or range?" in O(log n + k); static sorted-array form is the compact, cache-friendly choice.
›
Calendar date arithmetic
systems · low: Civil dates, time zones (tzdb), DST gaps, month-end anchoring and duration math
Sharded counters
concurrency · low: Split one hot counter into per-core or per-thread cells on separate cache lines; increments stay local and reads sum the cells.
›
Event deduplication window
distributed · low: Keep the ids of recently accepted events for a time window and drop repeats; memory stays bounded by rotating time buckets instead of per-entry timers.
›
+ 4 more techniques
+ 35 more primitives
System
Techniques · 11
Primitives · 51
cpq
Template engines
compilers · medium: Compile templates with loops, partials and auto-escaping into render functions
Tariff rating
finance · medium: Rate usage events against price plans: tiers, time bands, bundles and rounding rules
Usage metering
finance · medium: Counting tokens/requests per user and key, aggregating for quotas and billing with idempotent events
Bill of materials explosion
optimization · medium: MRP netting: explode BOMs level by level with lead-time offsetting into planned orders
Constraint propagation (constraint…
optimization · medium: Variables with finite domains, propagators that prune impossible values to a fixpoint, and backtracking search with trail undo between decisions.
›
Pdf digital signatures
security · medium: CMS/PAdES signatures embedded in PDFs with byte ranges and long-term validation
Change data capture
storage · medium: Decode the database's own commit log into row-change events in commit order, with a resume position, so any consumer can mirror the data exactly.
›
Event condition action rules
systems · medium: Event-condition-action rule engines for automations, edit checks and alerts
Rete rules engine
systems · medium: Match many rules against changing facts by caching partial matches in a shared network, so each change only does the work it actually affects.
›
Incremental sync cursors
distributed · medium: The client keeps one opaque token; each pull returns only the changes after it plus the next token, so sync cost scales with what changed, not with the dataset.
›
Rollup aggregation
storage · medium: Fold raw events into one mergeable partial aggregate per time bucket and dimension key, then merge fine buckets into coarser ones, so long ranges read few rows and stay exact.
›
Largest remainder rounding
finance · low: Splitting an amount into parts that sum exactly (largest remainder / Hamilton) for allocations, splits and prorations
Money representation
finance · low: Store money as integer minor units with an explicit currency exponent, compute in wider integers, and round once with a named rounding mode.
›
Currency cross rate triangulation
finance · low: Deriving cross rates through a base currency with correct precision, inversion and spreads
Proration calculation
finance · low: Prorating charges and credits for mid-cycle plan changes by time used
Revenue recognition schedules
finance · low: Deferred revenue schedules that recognize income over service periods (ASC 606 / IFRS 15)
Binary decision diagrams
optimization · low: A reduced ordered BDD stores a Boolean function as a shared DAG that is unique per variable order, so equivalence is one integer compare and counting is one pass.
›
Dual control approval
security · low: Four-eyes / maker-checker approval with quorum policies for sensitive operations
Optimistic concurrency control
storage · low: Run transactions without locks, record what they read, and validate at commit that nothing changed; fastest when conflicts are rare.
›
Hierarchical state machine
systems · low: Nest states so a substate inherits its parent's reactions and only overrides what differs, with ordered entry and exit actions along the path.
›
Name resolution
compilers · low: Bind every use of a name to its declaration with a scope stack, handling shadowing, hoisting and closure capture in one AST walk.
›
Recursive-descent parsing
compilers · low: Hand-written top-down parser with one function per grammar rule; simple, fast, with full control over error messages and recovery.
›
Html sanitization
security · low: Allowlist-based HTML sanitizing of untrusted markup
Interval tree
data-structures · low: Index of ranges that answers "which intervals overlap this point or range?" in O(log n + k); static sorted-array form is the compact, cache-friendly choice.
›
Calendar date arithmetic
systems · low: Civil dates, time zones (tzdb), DST gaps, month-end anchoring and duration math
Sharded counters
concurrency · low: Split one hot counter into per-core or per-thread cells on separate cache lines; increments stay local and reads sum the cells.
›
Event deduplication window
distributed · low: Keep the ids of recently accepted events for a time window and drop repeats; memory stays bounded by rotating time buckets instead of per-entry timers.
›
Idempotency keys
finance · low: Client-chosen unique key per logical operation, stored with a request fingerprint and the final response, so retries replay the first result instead of acting twice.
›
Topological sort
graphs · low: Order the vertices of a DAG so every edge points forward; the core of build systems, schedulers and dependency resolution, with cycle detection for free.
›
Hash aggregation
storage · low: GROUP BY via hash tables with partitioning and spill to disk
Interval arithmetic
numerics · low: Rigorous bounds with outward rounding; root isolation and robust geometric tests
Two watched literals
optimization · low: Unit propagation for SAT that watches just two literals per clause, so backtracking costs nothing and long clauses are rarely touched.
›
Journaled state revert
storage · low: Undo journal of state writes enabling nested checkpoints and cheap revert
Cryptographic hashes (SHA-2, BLAKE3)
security · low: Collision-resistant fingerprints of data; SHA-256 for interoperability, BLAKE3 for speed, HMAC/HKDF for keyed uses.
›
Rsa cryptosystem
security · low: RSA key generation, OAEP encryption and PSS/PKCS#1 v1.5 signatures, key sizes and padding pitfalls
Trusted timestamping
security · low: RFC 3161 time-stamp tokens: a TSA signs a hash with time, proving data existed then
X509 certificates
security · low: Certificate chains, path validation, SANs, revocation and short-lived issuance
Pdf object model parsing
storage · low: PDF xref tables, object streams, content stream operators and incremental updates
Consumer offsets
distributed · low: Each consumer group stores one integer per partition, the next position to read, so a restarted consumer resumes where it left off with at-least-once delivery.
›
Message sequence numbers
distributed · low: A per-stream counter on every message lets the receiver detect loss, duplicates and reordering, ack cheaply and resume after reconnect with "send from N".
›
Write-ahead log
storage · low: Append each change to a checksummed sequential log and fsync it before touching data pages; the basis of crash durability in nearly every database.
›
Hierarchical timing wheel
systems · low: Timers bucketed by expiry into wheels of slots, coarser wheels for far deadlines: O(1) insert and cancel for millions of timeouts.
›
Publish subscribe event bus
systems · low: In-process or on-box topic bus decoupling producers and consumers with bounded queues
Swiss table
data-structures · low: Open-addressing hash table that filters 8-16 slots at once with 1-byte hash tags and SIMD, giving fast lookups at 87.5 % load.
›
Hash join
storage · low: Build a hash table on the smaller input's join key and probe it with every row of the larger one; the linear-time workhorse for equi-joins.
›
Arena allocator
systems · low: Allocate by bumping a pointer through big chunks and free everything at once: a few instructions per allocation for objects sharing a lifetime.
›
Cursor pagination
networking · low: Keyset/opaque-cursor pagination for stable incremental reads from APIs and tables
Time partitioning
storage · low: Cut a table into fixed-interval time blocks so queries read only overlapping blocks and retention drops a whole block as one metadata change.
›
False sharing
concurrency · low: Independent variables written by different cores on one cache line force the line to bounce between cores; pad or regroup hot data to fix it.
›
Memory ordering
concurrency · low: What Relaxed, Acquire, Release and SeqCst atomics actually guarantee, what they cost on x86 and ARM, and which one each pattern needs.
›
Fencing tokens
distributed · low: A number that grows with every lock grant and is checked by the protected resource, so a paused ex-holder's late write is rejected.
›
Leases
distributed · low: A lock that expires on its own: bounded-time ownership that survives crashes and partitions, given bounded clock drift and fencing tokens on writes.
›
Segmented log
distributed · low: Split an append-only log into files named by their first offset, write only the newest, and find any record by binary search plus a sparse index.
›
BFS and DFS
graphs · low: The two basic graph traversals; BFS gives hop distances and levels, DFS gives discovery/finish order for cycles, components and topological order.
›
CPU caches and the memory hierarchy
hardware-os · low: Sizes, line widths and latencies of L1/L2/L3/DRAM on modern x86 and Apple M-series, and the data-layout rules that follow from them.
›
CRC32C checksums
hardware-os · low: The Castagnoli CRC-32 with dedicated instructions on x86 (SSE4.2) and ARMv8. It is the standard fast integrity check for storage blocks, logs and network frames.
›
fsync, O_DSYNC and O_DIRECT
hardware-os · low: What fsync, fdatasync, O_DSYNC, O_DIRECT and F_FULLFSYNC really guarantee on Linux and macOS, and the exact call sequences for crash-safe files.
›
SIMD programming
hardware-os · low: Process 4-16 lanes per instruction with AVX2, AVX-512 or NEON via Rust std::arch, with runtime dispatch and a portable fallback.
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
Sparse matrices (CSR)
numerics · low: Compressed sparse row stores only nonzeros as row pointers, column indices and values; SpMV streams them once, so it is memory-bandwidth bound.
›
Exponential backoff with jitter
systems · low: Retry after delays that grow geometrically and are randomized, so failed clients spread out instead of hammering a recovering service in synchronized waves.
›
Slab allocator
systems · low: Pre-carve pages into equal-size slots per size class with an in-place free list: O(1) alloc and free, no external fragmentation, cache-warm reuse.
›
Copy for AI
Similar systems
Share the most building blocks with this one.
insurance-policy-admin
29 %
energy-retail-billing
20 %
invoicing
18 %
securities-custody
18 %
utility-cis
18 %