Get the real byte length of a string.
Get utf8 byte length of string
Robustly get the byte length of a Typed Array
Get the byte length of an ArrayBuffer, even in engines without a `.byteLength` method.
Get the UTF-8 byte length of a string
See our api docs https://serialport.io/docs/api-parser-byte-length
Socket.dev optimized package override for array-buffer-byte-length
Get the byte length of a Base64 encoded string.
Get the byteLength out of a DataView, robustly.
A transform stream that emits data as a buffer of fixed byte length.
Socket.dev optimized package override for typed-array-byte-length
get the byte length of a response
nv-buf-bi ======================= - pure js, get bigint sign AND data-byte-length - for WriteVarInt -> WriteZigZag using - normally USELESS, used for encode/decode
packs - unpacks passed arguments to 7 byte length buffer
See our api docs https://serialport.io/docs/api-parser-byte-length
A minimal UTF8 implementation for number arrays.
A minimal base64 implementation for number arrays.
A flexible string byte length calculator with customizable configurations
get byte length
Parse an SMTP (RFC-5321) address
Robustly get the byte offset of a Typed Array
Get the byteOffset out of a DataView, robustly.
Base64 encoding/decoding in pure JS
LEB128 utilities for Node
Secret-sharing primitives (Shamir, Blakley, ramp, VSS, CRT, visual, etc.) implemented directly from the original papers with no external dependencies.
Centralised bincode + hex encoding helpers — a stable wrapper around bincode 1.3 and hex 0.4 with a single error type.
Pure-Rust glTF 2.0 + .glb 3D scene codec — implements oxideav-mesh3d's Decoder/Encoder traits
Pure-Rust Apple QuickTime File Format (QTFF) demuxer — atom walker, sample-table parser, codec FourCC resolution via oxideav-core registry
Boa-free schema types (MechanicsConfig, HttpEndpoint) shared between mechanics-core and the Philharmonic connector lowerer.
HTTP entropy server with an ANU-style random endpoint
Parses Variable Length Bytes files read by other file input plugins.
ByteObject is a module designed to make working with exact-length byte values in Ruby programs easier and quicker. It mostly provides attribute methods to clamp values within the range of a given byte length.
Unit conversion library supporting length, weight, temperature, volume, speed, pressure, energy, and data categories with a simple convert API, string parsing, byte humanization, unit abbreviations, and formatted output.
This library contains the opty2 library for dynamic generation of x86 multi-byte NOPs. This is useful in writing exploits and encoders. It allows you to dynamic generate variable length instruction sets that are equivalent to a No Operation(NOP) without using the actual 0x90 bytecode. The original code was written by Optyx and spoonm.
Allows simple transformation of data into hex strings, hexdigest strings, integer byte arrays, etc. as well as padding your data to a certain byte length
Tokyo Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. There is neither concept of data tables nor data types. Records are organized in hash table, B+ tree, or fixed-length array.
tlsh is a fuzzy matching library, which hashes can be used for similarity comparison. Given a byte stream with a minimum length of 256 bytes, TLSH generates a hash value which can be used for similarity comparisons. Similar objects will have similar hash values which allow for the detection of similar objects by comparing their hash values. The computed hash is 35 bytes long (output as 70 hexadecimal characters). The first 3 bytes are used to capture the information about the file as a whole (length, ...), while the last 32 bytes are used to capture information about incremental parts of the file.
ssdeep is a program for computing context triggered piecewise hashes (CTPH). Also called fuzzy hashes, CTPH can match inputs that have homologies. Such inputs have sequences of identical bytes in the same order, although bytes in between these sequences may be different in both content and length.
Kyoto Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. Each key must be unique within a database. There is neither concept of data tables nor data types. Records are organized in hash table or B+ tree.
This gem resolves basically two problems. --- 1. MySQL for strings(VARCHAR(255)) by default has limit 255 characters. And when developer left this attribute without any length validation, then it's possible to face with situation when user unintentionally or intentionally will pass in text field more characters. So, then, probably you will get 500... --- 2. PostgreSQL. The maximum number of characters for variable unlimited length types (text, varchar) is undefined. There is a limit of size in bytes for all string types: In any case, the longest possible character string that can be stored is about 1 GB. And when developer left this attribute without any length validation, then it's possible to face with situation when user unintentionally or intentionally will try to full up your database with lots of GB of 'important' info. --- Both of this cases, I guess, are not very pleasant. This gem adds default length validation for all string attributes. Except those which are already vlidated in standart rails way.
Kyoto Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. Each key must be unique within a database. There is neither concept of data tables nor data types. Records are organized in hash table or B+ tree.
Kyoto Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. Each key must be unique within a database. There is neither concept of data tables nor data types. Records are organized in hash table or B+ tree.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.