JsDK of Number Class
React.js hook to detect if text will clamp in X number of lines
react xui x-number-change
Reads / writes floats / doubles from / to buffers in both modern and ancient browsers.
`x-number`数字
lighthouse wrapper that runs x number of audits against a list of endpoints
Json Schema Type Builder with Static Type Resolution for TypeScript
Return a normal number `y` and exponent `exp` satisfying `x = y * 2^exp`.
Json Schema Type Builder with Static Type Resolution for TypeScript
A parser for the TypeScript doc comment syntax
A little library for asserting types and values, with zero dependencies.
Find the longest common subsequence.
a point geometry with transforms
Distills a series of editing steps into deleted and added ranges
connect point a to point b with x number of cars
Combines a list of arrays, returning a single array with unique values, using strict equality for comparisons.
Convert a double-precision floating-point number to the nearest single-precision floating-point number.
Split a double-precision floating-point number into a higher order word and a lower order word.
encodes/decodes base58 encoded XRP Ledger identifiers
Return an integer corresponding to the unbiased exponent of a double-precision floating-point number.
Return an unsigned 32-bit integer corresponding to the more significant 32 bits of a double-precision floating-point number.
Set the less significant 32 bits of a double-precision floating-point number.
maximally minimal type-testing library
Utility to measure view bounds
A basic implementation of complex numbers in rust.
muehehehhehee
Vax number encoder
In every will randomly execute the supplied block of code randomly. It guarantees the code will be executed the given number of times in the code.
Backup is a Ruby library to ease the backup of files, keeping the latest X releases. Just require it and go.
A simple ruby program for returning the version number of the current Mac OS X system.
Gem allows to convert number into string like 'X рублей Y копеек' accordingly russian language rules.
Initially I created this because I wanted to compare the Streaming and Search APIs. It turns out that completely by accident it can also do the neat trick of connecting indefinitely to either API, and feeding fresh tweets to whatever program you pipe the output to. % tweetdump -h # Usage instructions
Given two integers ‘a’ and ‘m’, find modular multiplicative inverse of ‘a’ under modulo ‘m’. The modular multiplicative inverse is an integer ‘x’ such that. a x ≡ 1 (mod m) and x belongs to [0,1,2, .. m-1]
Authorizes server to server account and returns X number of most viewed pages by path
command line tool that prints a table of the first N prime numbers, (e.g. 2,3,5 x 2,3,5)
Computes approximation within a given error_limit to the values of a root of an arbitrary function f(x) or to the value of inverse function g(y) = x. Uses Newton-Raphson or Secant methods. Requires one (Newton-Raphson) or two (Secant) estimates of the target value. Raises NoConvergenceError when it does not converge within the set error_limit, on set number of iterations.
Find rational approximation to given real number. Based on the theory of continued fractions if x = a1 + 1/(a2 + 1/(a3 + 1/(a4 + ...))) then best approximation is found by truncating this series (with some adjustments in the last term). Note the fraction can be recovered as the first column of the matrix ( a1 1 ) ( a2 1 ) ( a3 1 ) ... ( 1 0 ) ( 1 0 ) ( 1 0 ) Instead of keeping the sequence of continued fraction terms, we just keep the last partial product of these matrices.
Where applicable, they come with a standard version and a class mix in. Ex: NumberDust.nearest(value) is also available as Integer.pd_nearest == FEATURES/PROBLEMS: Features: * Get random numbers in arbitrary ranges from OpenSSL (without skew due to modulo) Problems: * Need a good way to make sure that the OpenSSL library isn't using a broken PRNG == SYNOPSIS: require 'pixiedust' x = RandomDust.between(10,20)
A command line app able to generate a random word search grid n x n (n: number of rows/number of columns) and find all the words inside it. - The grid letters must be uppercase. - The valid words are defined inside the file dict.txt - The minimum size of a valid word is 3 characters. - The program must detect all possible directions: horizontal, vertical and diagonal. (The words can be on reverse order)
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.