mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Productivity and collaboration
pdf-rendering
document rendering
PDF.js, pdfium
System
Techniques · 7
Primitives · 32
pdf-rendering
Path rasterization coverage
graphics · medium: Scanline or sparse-strip coverage accumulation with nonzero and even-odd fill and analytic antialiasing
Text shaping
graphics · medium: Map Unicode to positioned glyphs via OpenType GSUB/GPOS lookups, clusters and complex scripts
Coverage-guided fuzzing
security · medium: Mutate inputs, run an instrumented target, and keep any input that reaches a new code edge; feedback turns blind guessing into incremental search.
›
Process sandboxing
security · medium: Run risky work in a separate, deliberately powerless process and let a small privileged broker do the few things it needs, over a narrow pipe.
›
Delta debugging
compilers · medium: Ddmin minimization of failing inputs or change sets
Font fallback itemization
graphics · medium: Split text into runs by script, direction and font coverage; pick fallback fonts per run
Unicode bidi algorithm
graphics · medium: UAX 9: resolve embedding levels and reorder mixed left-to-right and right-to-left text
Bézier curves
graphics · low: Smooth curves defined by 3-4 control points, evaluated and split with repeated linear interpolation (de Casteljau) and flattened to lines with a closed-form segment count.
›
Deflate
compression · low: DEFLATE/gzip: LZ77 + Huffman, the format behind HTTP gzip, zip and PNG
Alpha compositing
graphics · low: Porter-Duff compositing with premultiplied alpha and blend modes
Color space conversion
graphics · low: Convert pixels between transfer curves (sRGB, linear light), primaries (sRGB, Display P3, XYZ) and Y'CbCr, using tables for the curve and 3x3 matrices for the rest.
›
Font rasterization
graphics · low: TrueType/CFF outline parsing and anti-aliased glyph rasterization with hinting/caching
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.
›
Image codecs
media · low: JPEG (DCT, Huffman), PNG, HEIF/AVIF decoding and encoding fundamentals
HTTP range requests
networking · low: Ask for byte offsets with Range and get a 206 slice back; the standard way to resume, seek and read big remote files piecewise.
›
Pdf object model parsing
storage · low: PDF xref tables, object streams, content stream operators and incremental updates
LRU and CLOCK
systems · low: LRU evicts the least recently used entry via hash map plus linked list; CLOCK approximates it with a reference bit, so hits take no lock.
›
Parallel prefix sum
search-sort · low: Work-efficient scan (Blelloch, decoupled look-back) on CPU SIMD and GPUs; stream compaction
Opentype font parsing
graphics · low: Sfnt tables (cmap, glyf, CFF, hmtx, GSUB, GPOS), variable font axes, safe parsing
Unicode text tokenization for search
search-sort · low: Turn multilingual text into index terms: segment words (UAX 29 style, CJK bigrams), normalize, case-fold and accent-fold, identically at index and query time.
›
Code coverage instrumentation
compilers · low: Insert counters into compiled code to record which blocks, edges or lines ran; a spanning tree of the control-flow graph cuts the counters needed.
›
Fast hash functions
data-structures · low: Non-cryptographic hashes built from 64×64→128-bit multiplies and xor-shifts; pick by key size, trust level and whether the hash is persisted.
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
+ 16 more primitives
System
Techniques · 7
Primitives · 32
pdf-rendering
Path rasterization coverage
graphics · medium: Scanline or sparse-strip coverage accumulation with nonzero and even-odd fill and analytic antialiasing
Text shaping
graphics · medium: Map Unicode to positioned glyphs via OpenType GSUB/GPOS lookups, clusters and complex scripts
Coverage-guided fuzzing
security · medium: Mutate inputs, run an instrumented target, and keep any input that reaches a new code edge; feedback turns blind guessing into incremental search.
›
Process sandboxing
security · medium: Run risky work in a separate, deliberately powerless process and let a small privileged broker do the few things it needs, over a narrow pipe.
›
Delta debugging
compilers · medium: Ddmin minimization of failing inputs or change sets
Font fallback itemization
graphics · medium: Split text into runs by script, direction and font coverage; pick fallback fonts per run
Unicode bidi algorithm
graphics · medium: UAX 9: resolve embedding levels and reorder mixed left-to-right and right-to-left text
Bézier curves
graphics · low: Smooth curves defined by 3-4 control points, evaluated and split with repeated linear interpolation (de Casteljau) and flattened to lines with a closed-form segment count.
›
Deflate
compression · low: DEFLATE/gzip: LZ77 + Huffman, the format behind HTTP gzip, zip and PNG
Alpha compositing
graphics · low: Porter-Duff compositing with premultiplied alpha and blend modes
Color space conversion
graphics · low: Convert pixels between transfer curves (sRGB, linear light), primaries (sRGB, Display P3, XYZ) and Y'CbCr, using tables for the curve and 3x3 matrices for the rest.
›
Font rasterization
graphics · low: TrueType/CFF outline parsing and anti-aliased glyph rasterization with hinting/caching
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.
›
Image codecs
media · low: JPEG (DCT, Huffman), PNG, HEIF/AVIF decoding and encoding fundamentals
HTTP range requests
networking · low: Ask for byte offsets with Range and get a 206 slice back; the standard way to resume, seek and read big remote files piecewise.
›
Pdf object model parsing
storage · low: PDF xref tables, object streams, content stream operators and incremental updates
LRU and CLOCK
systems · low: LRU evicts the least recently used entry via hash map plus linked list; CLOCK approximates it with a reference bit, so hits take no lock.
›
Parallel prefix sum
search-sort · low: Work-efficient scan (Blelloch, decoupled look-back) on CPU SIMD and GPUs; stream compaction
Opentype font parsing
graphics · low: Sfnt tables (cmap, glyf, CFF, hmtx, GSUB, GPOS), variable font axes, safe parsing
Unicode text tokenization for search
search-sort · low: Turn multilingual text into index terms: segment words (UAX 29 style, CJK bigrams), normalize, case-fold and accent-fold, identically at index and query time.
›
Code coverage instrumentation
compilers · low: Insert counters into compiled code to record which blocks, edges or lines ran; a spanning tree of the control-flow graph cuts the counters needed.
›
Fast hash functions
data-structures · low: Non-cryptographic hashes built from 64×64→128-bit multiplies and xor-shifts; pick by key size, trust level and whether the hash is persisted.
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
Sanitizers
security · low: ASan/UBSan/TSan shadow memory and instrumentation to catch memory bugs
Cgroups and namespaces
hardware-os · low: Linux namespaces limit what a process can see; cgroup v2 limits and accounts what it may use. Containers, sandboxes and job schedulers are built from the two.
›
Overlay filesystem
hardware-os · low: Union mounts (overlayfs) stacking read-only layers under a writable layer
Least privilege and isolation
security · low: Assume every component will be compromised and limit what it can then reach: narrow identities, separate accounts, sandboxed processes.
›
Seccomp bpf
security · low: Syscall filtering with seccomp BPF programs
Record replay
distributed · low: Record every nondeterministic input (time, randomness, I/O, model and tool outputs, per-tick player input) and re-execute deterministically for debugging, replays and state rebuild
Failure bisection
search-sort · low: Binary search over commits, batches or inputs to isolate a failure
Text position encoding
compilers · low: Store byte offsets, convert to (line, column) on demand with a line-start table and binary search, and count columns in the unit the peer negotiated.
›
Control-flow graph
compilers · low: Split a linear instruction list into basic blocks and connect them by jumps; the graph every optimizer, SSA builder and dataflow pass walks.
›
d-ary heap
data-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.
›
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.
›
Minimum spanning tree
graphs · low: Cheapest set of edges connecting all vertices; Kruskal sorts edges and joins components with union-find, Prim grows one tree, Boruvka merges in parallel rounds.
›
Union-find
graphs · low: Disjoint-set forest with union by size and path compression; merges sets and answers same-set queries in effectively constant time.
›
Text normalization
machine-learning · low: Rewrite messy text into one canonical form for matchers and models, or into spoken words for speech output (and back), keeping a map to the original offsets.
›
Chroma subsampling
media · low: 4:2:0/4:2:2 colour plane downsampling and siting
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.
›
Copy for AI
Similar systems
Share the most building blocks with this one.
vector-graphics
21 %
text-rendering
21 %
video-editor
20 %
raster-image-editor
17 %
print-pipeline
16 %