microsecond parser
Get the current time in microseconds
TypeScript definitions for microseconds
Get the number of microseconds elapsed since January 1, 1970 00:00:00 UTC without fear of clock drift
Low-level profiling for node.js: squeeze those microseconds.
Get the current time in microseconds
Get the current time in microseconds
Get current time in microseconds (cross-environment)
Convert between microseconds, milliseconds, seconds, minutes, hours, days, and weeks.
Parse milliseconds into an object
Off-chain quoting and swap building for BFX liquidity pools. Designed for DEX aggregators — compute quotes locally in microseconds without an RPC call, then build the swap transaction when ready.
Formats microseconds into a human consumable form.
Browser and Node.js coherence gate for AI agent safety - real-time permit/defer/deny decisions in microseconds
TypeScript library to convert epoch timestamps (seconds, milliseconds, microseconds, nanoseconds) to human-readable dates, parse date strings to epoch, compute calendar-accurate durations, and handle IANA timezones. Powered by Luxon — small bundle, immuta
Get the current time in microseconds(Rust version)
SPL (Safe Policy Lisp) evaluator for Agent-Safe capability tokens. 150 lines, zero deps, microseconds.
Get the current time in microseconds
Browser and Node.js coherence gate for AI agent safety - real-time permit/defer/deny decisions in microseconds
A simple id generator based on a randomized characteristic and anme prefix to a base 36 microseconds timestamp.
Current Time in Nanoseconds
Tiny, zero-dependency full-text search for JavaScript. Builds a binary index once, then queries in microseconds — in the browser, in Node, or anywhere JS runs.
Stopwatch with microseconds (1/1000th of millisecond) resolution
Semantic shell command safety classifier for AI coding agents — AST-based risk scoring in under 100 microseconds
Interval and Timeout in microseconds
Event Camera Data Processing Library
A high-performance, lightweight date and time library for Rust with dramatically faster parsing, memory-efficient operations, and chrono-compatible formatting
Rhai package for using chrono DateTime
Macro to shim heterogeneous HAL timers to embedded-time
A simple macro that prints a warning if a function takes longer than expected
Facilitate reading and writing midi files.
Vector & lexical search engine library & multi-tenancy server
Ultra-fast neural network inference with sub-microsecond latency
bgr: BUGGU-GREP, Ultra-fast in-memory log search engine with microsecond queries
Infrared IRP encoder and decoder
A minimal, zero-dependency time utility crate for Rust CLI applications
Lock-free shared memory IPC with slotted request/response. Sub-microsecond wake latency, zero-copy payloads, 32 concurrent in-flight requests per worker.
Enjoy microsecond precision in your MySQL updated_at timestamp
200 lines of code, to manage all your documents in a microsecond, or your money back.
Densify is a general-purpose string minification gem written purely in C. It takes mere microseconds (literally) to minify thousands of lines of CSS to approximately the size other minfiers acheive.
Some versions of OS's and databases only support microsecond precision. Using this gem makes Ruby ignore nanoseconds in Time comparisons to hopefully help avoid the time != time problem.
Int64 (UInt52) autoincrement via redis-servers with timestamp in microseconds, autoincerent via redis key. Support 1-5 redis servers in one system (1 - timestamp + 4 servers - autoincrementers).
Provides perfect accuracy and microsecond performance for crystal-clear, 5-8px pixel fonts by building a trie from font glyphs and matching image column bitmasks.
Int64 (UInt64, UInt63) autoincrement via redis-servers with timestamp in microseconds, autoincerent via redis key. Support 1-5 redis servers in one system (1 - timestamp + 4 servers - autoincrementers).
Temporally Ordered IDs. Generate universally unique identifiers (UUID) that sort lexically in time order. Torid exists to solve the problem of generating UUIDs that when ordered lexically, they are also ordered temporally. I needed a way to generate ids for events that are entering a system with the following criteria: 1. Fast ID generation 2. No central coordinating server/system 3. No local storage 4. Library code, that is multiple apps on the same machine can use the same code and they will not generate duplicate ids 5. Eventually stored in a UUID field in a database. So 128bit ids are totally fine. The IDs that Torid generates are 128bit IDs made up of 2, 64bit parts. * 64bit microsecond level UNIX timestamp * 64bit hash of the system hostname, process id and a random value.