Var overflow in JS and mongo [duplicate] - javascript
In JavaScript I would like to create the binary hash of a large boolean array (54 elements) with the following method:
function bhash(arr) {
for (var i = 0, L = arr.length, sum = 0; i < L; sum += Math.pow(2,i)*arr[i++]);
return sum;
}
In short: it creates the smallest integer to store an array of booleans in. Now my problem is that javascript apparently uses floats as default. The maximum number I have to create is 2^54-1 but once javascript reaches 2^53 it starts doing weird things:
9007199254740992+1 = 9007199254740994
Is there any way of using integers instead of floats in javascript? Or large integer summations?
JavaScript uses floating point internally.
What is JavaScript's highest integer value that a number can go to without losing precision?
In other words you can't use more than 53 bits. In some implementations you may be limited to 31.
Try storing the bits in more than one variable, use a string, or get a bignum library, or if you only need to deal with integers, a biginteger library.
BigInt is being added as a native feature of JavaScript.
typeof 123;
// → 'number'
typeof 123n;
// → 'bigint'
Example:
const max = BigInt(Number.MAX_SAFE_INTEGER);
const two = 2n;
const result = max + two;
console.log(result);
// → '9007199254740993'
javascript now has experimental support for BigInt.
At the time of writing only chrome supports this.
caniuse has no entry yet.
BigInt can be either used with a constructor, e.g. BigInt(20) or by appending n, e.g. 20n
Example:
const max = Number.MAX_SAFE_INTEGER;
console.log('javascript Number limit reached', max + 1 === max + 2) // true;
console.log('javascript BigInt limit reached', BigInt(max) + 1n === BigInt(max) + 2n); // false
No. Javascript only has one numeric type. You've to code yourself or use a large integer library (and you cannot even overload arithmetic operators).
Update
This was true in 2010... now (2019) a BigInt library is being standardized and will most probably soon arrive natively in Javascript and it will be the second numeric type present (there are typed arrays, but - at least formally - values extracted from them are still double-precision floating point numbers).
Another implementation of large integer arithmetic (also using BigInt.js) is available at www.javascripter.net/math/calculators/100digitbigintcalculator.htm. Supports the operations + - * / as well as remainder, GCD, LCM, factorial, primality test, next prime, previous prime.
So while attempting one of the leetcode problem I have written a function which takes two numbers in form of string and returns the sum of those numbers in form of string.
(This doesn't work with negative numbers though we can modify this function to cover that)
var addTwoStr = function (s1, s2) {
s1 = s1.split("").reverse().join("")
s2 = s2.split("").reverse().join("")
var carry = 0, rS = '', x = null
if (s1.length > s2.length) {
for (let i = 0; i < s1.length; i++) {
let s = s1[i]
if (i < s2.length) {
x = Number(s) + Number(s2[i]) + carry
rS += String((x % 10))
carry = parseInt(x/10)
} else {
if (carry) {
x = Number(s) + carry
rS += String((x % 10))
carry = parseInt(x/10)
} else {
rS += s
}
}
}
} else {
for (let i = 0; i < s2.length; i++) {
let s = s2[i]
if (i < s1.length) {
x = Number(s) + Number(s1[i]) + carry
rS += String((x % 10))
carry = parseInt(x/10)
} else {
if (carry) {
x = Number(s) + carry
rS += String((x % 10))
carry = parseInt(x/10)
} else {
rS += s
}
}
}
}
if (carry) {
rS += String(carry)
}
return rS.split("").reverse().join("")
}
Example: addTwoStr('120354566', '321442535')
Output: "441797101"
There are various BigInteger Javascript libraries that you can find through googling. e.g. http://www.leemon.com/crypto/BigInt.html
Here's (yet another) wrapper around Leemon Baird's BigInt.js
It is used in this online demo of a big integer calculator in JavaScript which implements the usual four operations + - * /, the modulus (%), and four builtin functions : the square root (sqrt), the power (pow), the recursive factorial (fact) and a memoizing Fibonacci (fibo).
You're probably running into a byte length limit on your system. I'd take the array of booleans, convert it to an array of binary digits ([true, false, true] => [1,0,1]), then join this array into a string "101", then use parseInt('101',2), and you'll have your answer.
/** --if you want to show a big int as your wish use install and require this module
* By using 'big-integer' module is easier to use and handling the big int numbers than regular javascript
* https://www.npmjs.com/package/big-integer
*/
let bigInt = require('big-integer');
//variable: get_bigInt
let get_bigInt = bigInt("999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999");
let arr = [1, 100000, 21, 30, 4, BigInt(999999999999), get_bigInt.value];
console.log(arr[6]); // Output: 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999n
//Calculation
console.log(arr[6] + 1n); // +1
console.log(arr[6] + 100n); // +100
console.log(arr[6] - 1n); // -1
console.log(arr[6] - 10245n); // -1000n
console.log((arr[6] * 10000n) + 145n - 435n);
Related
[NodeJS]Converting Exponential to Non Exponential without using any libraries or builtin functions
Hello I was just wondering on how to convert an exponential value ex. 1.1111111101111111e+30 to 1111111110111111105345512013824 without the use of any libraries or built in function in NodeJS. need help in understanding how BigInt() converts it. Thank you.
After converting the exponential value number to binary, with Number.toString(2), just read the string as a normal binary integer. The least significant bit is at the end, so we do that in reversed order. const tobigint = number => { const bin = number.toString(2); let result = 0n, current = 1n; for (let i = bin.length - 1; i >= 0; i--) { if (bin[i] == '1') result += current; current *= 2n; } return number >= 0 ? result : -result; } const num = 1.1242241e+30; console.log(tobigint(num));
Random from array seeded with today's date in JavaScript [duplicate]
Is it possible to seed the random number generator (Math.random) in JavaScript?
No, it is not possible to seed Math.random(). The ECMAScript specification is intentionally vague on the subject, providing no means for seeding nor require that browsers even use the same algorithm. So such a function must be externally provided, which thankfully isn't too difficult. I've implemented a number of good, short and fast Pseudorandom number generator (PRNG) functions in plain JavaScript. All of them can be seeded and provide high quality numbers. These are not intended for security purposes--if you need a seedable CSPRNG, look into ISAAC. First of all, take care to initialize your PRNGs properly. To keep things simple, the generators below have no built-in seed generating procedure, but accept one or more 32-bit numbers as the initial seed state of the PRNG. Similar or sparse seeds (e.g. a simple seed of 1 and 2) have low entropy, and can cause correlations or other randomness quality issues, sometimes resulting in the output having similar properties (such as randomly generated levels being similar). To avoid this, it is best practice to initialize PRNGs with a well-distributed, high entropy seed and/or advancing past the first 15 or so numbers. There are many ways to do this, but here are two methods. Firstly, hash functions are very good at generating seeds from short strings. A good hash function will generate very different results even when two strings are similar, so you don't have to put much thought into the string. Here's an example hash function: function cyrb128(str) { let h1 = 1779033703, h2 = 3144134277, h3 = 1013904242, h4 = 2773480762; for (let i = 0, k; i < str.length; i++) { k = str.charCodeAt(i); h1 = h2 ^ Math.imul(h1 ^ k, 597399067); h2 = h3 ^ Math.imul(h2 ^ k, 2869860233); h3 = h4 ^ Math.imul(h3 ^ k, 951274213); h4 = h1 ^ Math.imul(h4 ^ k, 2716044179); } h1 = Math.imul(h3 ^ (h1 >>> 18), 597399067); h2 = Math.imul(h4 ^ (h2 >>> 22), 2869860233); h3 = Math.imul(h1 ^ (h3 >>> 17), 951274213); h4 = Math.imul(h2 ^ (h4 >>> 19), 2716044179); return [(h1^h2^h3^h4)>>>0, (h2^h1)>>>0, (h3^h1)>>>0, (h4^h1)>>>0]; } Calling cyrb128 will produce a 128-bit hash value from a string which can be used to seed a PRNG. Here's how you might use it: // Create cyrb128 state: var seed = cyrb128("apples"); // Four 32-bit component hashes provide the seed for sfc32. var rand = sfc32(seed[0], seed[1], seed[2], seed[3]); // Only one 32-bit component hash is needed for mulberry32. var rand = mulberry32(seed[0]); // Obtain sequential random numbers like so: rand(); rand(); Note: If you want a slightly more robust 128-bit hash, consider MurmurHash3_x86_128, it's more thorough, but intended for use with large arrays. Alternatively, simply choose some dummy data to pad the seed with, and advance the generator beforehand a few times (12-20 iterations) to mix the initial state thoroughly. This has the benefit of being simpler, and is often used in reference implementations of PRNGs, but it does limit the number of initial states: var seed = 1337 ^ 0xDEADBEEF; // 32-bit seed with optional XOR value // Pad seed with Phi, Pi and E. // https://en.wikipedia.org/wiki/Nothing-up-my-sleeve_number var rand = sfc32(0x9E3779B9, 0x243F6A88, 0xB7E15162, seed); for (var i = 0; i < 15; i++) rand(); Note: the output of these PRNG functions produce a positive 32-bit number (0 to 232-1) which is then converted to a floating-point number between 0-1 (0 inclusive, 1 exclusive) equivalent to Math.random(), if you want random numbers of a specific range, read this article on MDN. If you only want the raw bits, simply remove the final division operation. JavaScript numbers can only represent whole integers up to 53-bit resolution. And when using bitwise operations, this is reduced to 32. Modern PRNGs in other languages often use 64-bit operations, which require shims when porting to JS that can drastically reduce performance. The algorithms here only use 32-bit operations, as it is directly compatible with JS. Now, onward to the the generators. (I maintain the full list with references and license info here) sfc32 (Simple Fast Counter) sfc32 is part of the PractRand random number testing suite (which it passes of course). sfc32 has a 128-bit state and is very fast in JS. function sfc32(a, b, c, d) { return function() { a >>>= 0; b >>>= 0; c >>>= 0; d >>>= 0; var t = (a + b) | 0; a = b ^ b >>> 9; b = c + (c << 3) | 0; c = (c << 21 | c >>> 11); d = d + 1 | 0; t = t + d | 0; c = c + t | 0; return (t >>> 0) / 4294967296; } } You may wonder what the | 0 and >>>= 0 are for. These are essentially 32-bit integer casts, used for performance optimizations. Number in JS are basically floats, but during bitwise operations, they switch into a 32-bit integer mode. This mode is processed faster by JS interpreters, but any multiplication or addition will cause it to switch back to a float, resulting in a performance hit. Mulberry32 Mulberry32 is a simple generator with a 32-bit state, but is extremely fast and has good quality randomness (author states it passes all tests of gjrand testing suite and has a full 232 period, but I haven't verified). function mulberry32(a) { return function() { var t = a += 0x6D2B79F5; t = Math.imul(t ^ t >>> 15, t | 1); t ^= t + Math.imul(t ^ t >>> 7, t | 61); return ((t ^ t >>> 14) >>> 0) / 4294967296; } } I would recommend this if you just need a simple but decent PRNG and don't need billions of random numbers (see Birthday problem). xoshiro128** As of May 2018, xoshiro128** is the new member of the Xorshift family, by Vigna & Blackman (professor Vigna was also responsible for the Xorshift128+ algorithm powering most Math.random implementations under the hood). It is the fastest generator that offers a 128-bit state. function xoshiro128ss(a, b, c, d) { return function() { var t = b << 9, r = a * 5; r = (r << 7 | r >>> 25) * 9; c ^= a; d ^= b; b ^= c; a ^= d; c ^= t; d = d << 11 | d >>> 21; return (r >>> 0) / 4294967296; } } The authors claim it passes randomness tests well (albeit with caveats). Other researchers have pointed out that it fails some tests in TestU01 (particularly LinearComp and BinaryRank). In practice, it should not cause issues when floats are used (such as in these implementations), but may cause issues if relying on the raw lowest order bit. JSF (Jenkins' Small Fast) This is JSF or 'smallprng' by Bob Jenkins (2007), who also made ISAAC and SpookyHash. It passes PractRand tests and should be quite fast, although not as fast as sfc32. function jsf32(a, b, c, d) { return function() { a |= 0; b |= 0; c |= 0; d |= 0; var t = a - (b << 27 | b >>> 5) | 0; a = b ^ (c << 17 | c >>> 15); b = c + d | 0; c = d + t | 0; d = a + t | 0; return (d >>> 0) / 4294967296; } }
No, it is not possible to seed Math.random(), but it's fairly easy to write your own generator, or better yet, use an existing one. Check out: this related question. Also, see David Bau's blog for more information on seeding.
NOTE: Despite (or rather, because of) succinctness and apparent elegance, this algorithm is by no means a high-quality one in terms of randomness. Look for e.g. those listed in this answer for better results. (Originally adapted from a clever idea presented in a comment to another answer.) var seed = 1; function random() { var x = Math.sin(seed++) * 10000; return x - Math.floor(x); } You can set seed to be any number, just avoid zero (or any multiple of Math.PI). The elegance of this solution, in my opinion, comes from the lack of any "magic" numbers (besides 10000, which represents about the minimum amount of digits you must throw away to avoid odd patterns - see results with values 10, 100, 1000). Brevity is also nice. It's a bit slower than Math.random() (by a factor of 2 or 3), but I believe it's about as fast as any other solution written in JavaScript.
No, but here's a simple pseudorandom generator, an implementation of Multiply-with-carry I adapted from Wikipedia (has been removed since): var m_w = 123456789; var m_z = 987654321; var mask = 0xffffffff; // Takes any integer function seed(i) { m_w = (123456789 + i) & mask; m_z = (987654321 - i) & mask; } // Returns number between 0 (inclusive) and 1.0 (exclusive), // just like Math.random(). function random() { m_z = (36969 * (m_z & 65535) + (m_z >> 16)) & mask; m_w = (18000 * (m_w & 65535) + (m_w >> 16)) & mask; var result = ((m_z << 16) + (m_w & 65535)) >>> 0; result /= 4294967296; return result; }
Antti Sykäri's algorithm is nice and short. I initially made a variation that replaced JavaScript's Math.random when you call Math.seed(s), but then Jason commented that returning the function would be better: Math.seed = function(s) { return function() { s = Math.sin(s) * 10000; return s - Math.floor(s); }; }; // usage: var random1 = Math.seed(42); var random2 = Math.seed(random1()); Math.random = Math.seed(random2()); This gives you another functionality that JavaScript doesn't have: multiple independent random generators. That is especially important if you want to have multiple repeatable simulations running at the same time.
Please see Pierre L'Ecuyer's work going back to the late 1980s and early 1990s. There are others as well. Creating a (pseudo) random number generator on your own, if you are not an expert, is pretty dangerous, because there is a high likelihood of either the results not being statistically random or in having a small period. Pierre (and others) have put together some good (pseudo) random number generators that are easy to implement. I use one of his LFSR generators. https://www.iro.umontreal.ca/~lecuyer/myftp/papers/handstat.pdf
Combining some of the previous answers, this is the seedable random function you are looking for: Math.seed = function(s) { var mask = 0xffffffff; var m_w = (123456789 + s) & mask; var m_z = (987654321 - s) & mask; return function() { m_z = (36969 * (m_z & 65535) + (m_z >>> 16)) & mask; m_w = (18000 * (m_w & 65535) + (m_w >>> 16)) & mask; var result = ((m_z << 16) + (m_w & 65535)) >>> 0; result /= 4294967296; return result; } } var myRandomFunction = Math.seed(1234); var randomNumber = myRandomFunction();
It's not possible to seed the builtin Math.random function, but it is possible to implement a high quality RNG in Javascript with very little code. Javascript numbers are 64-bit floating point precision, which can represent all positive integers less than 2^53. This puts a hard limit to our arithmetic, but within these limits you can still pick parameters for a high quality Lehmer / LCG random number generator. function RNG(seed) { var m = 2**35 - 31 var a = 185852 var s = seed % m return function () { return (s = s * a % m) / m } } Math.random = RNG(Date.now()) If you want even higher quality random numbers, at the cost of being ~10 times slower, you can use BigInt for the arithmetic and pick parameters where m is just able to fit in a double. function RNG(seed) { var m_as_number = 2**53 - 111 var m = 2n**53n - 111n var a = 5667072534355537n var s = BigInt(seed) % m return function () { return Number(s = s * a % m) / m_as_number } } See this paper by Pierre l'Ecuyer for the parameters used in the above implementations: https://www.ams.org/journals/mcom/1999-68-225/S0025-5718-99-00996-5/S0025-5718-99-00996-5.pdf And whatever you do, avoid all the other answers here that use Math.sin!
To write your own pseudo random generator is quite simple. The suggestion of Dave Scotese is useful but, as pointed out by others, it is not quite uniformly distributed. However, it is not because of the integer arguments of sin. It's simply because of the range of sin, which happens to be a one dimensional projection of a circle. If you would take the angle of the circle instead it would be uniform. So instead of sin(x) use arg(exp(i * x)) / (2 * PI). If you don't like the linear order, mix it a bit up with xor. The actual factor doesn't matter that much either. To generate n pseudo random numbers one could use the code: function psora(k, n) { var r = Math.PI * (k ^ n) return r - Math.floor(r) } n = 42; for(k = 0; k < n; k++) console.log(psora(k, n)) Please also note that you cannot use pseudo random sequences when real entropy is needed.
Many people who need a seedable random-number generator in Javascript these days are using David Bau's seedrandom module.
Math.random no, but the ran library solves this. It has almost all distributions you can imagine and supports seeded random number generation. Example: ran.core.seed(0) myDist = new ran.Dist.Uniform(0, 1) samples = myDist.sample(1000)
Here's the adopted version of Jenkins hash, borrowed from here export function createDeterministicRandom(): () => number { let seed = 0x2F6E2B1; return function() { // Robert Jenkins’ 32 bit integer hash function seed = ((seed + 0x7ED55D16) + (seed << 12)) & 0xFFFFFFFF; seed = ((seed ^ 0xC761C23C) ^ (seed >>> 19)) & 0xFFFFFFFF; seed = ((seed + 0x165667B1) + (seed << 5)) & 0xFFFFFFFF; seed = ((seed + 0xD3A2646C) ^ (seed << 9)) & 0xFFFFFFFF; seed = ((seed + 0xFD7046C5) + (seed << 3)) & 0xFFFFFFFF; seed = ((seed ^ 0xB55A4F09) ^ (seed >>> 16)) & 0xFFFFFFFF; return (seed & 0xFFFFFFF) / 0x10000000; }; } You can use it like this: const deterministicRandom = createDeterministicRandom() deterministicRandom() // => 0.9872818551957607 deterministicRandom() // => 0.34880331158638
No, like they said it is not possible to seed Math.random() but you can install external package which make provision for that. i used these package which can be install using these command npm i random-seed the example is gotten from the package documentation. var seed = 'Hello World', rand1 = require('random-seed').create(seed), rand2 = require('random-seed').create(seed); console.log(rand1(100), rand2(100)); follow the link for documentation https://www.npmjs.com/package/random-seed
SIN(id + seed) is a very interesting replacement for RANDOM functions that cannot be seeded like SQLite: https://stackoverflow.com/a/75089040/7776828
Most of the answers here produce biased results. So here's a tested function based on seedrandom library from github: !function(f,a,c){var s,l=256,p="random",d=c.pow(l,6),g=c.pow(2,52),y=2*g,h=l-1;function n(n,t,r){function e(){for(var n=u.g(6),t=d,r=0;n<g;)n=(n+r)*l,t*=l,r=u.g(1);for(;y<=n;)n/=2,t/=2,r>>>=1;return(n+r)/t}var o=[],i=j(function n(t,r){var e,o=[],i=typeof t;if(r&&"object"==i)for(e in t)try{o.push(n(t[e],r-1))}catch(n){}return o.length?o:"string"==i?t:t+"\0"}((t=1==t?{entropy:!0}:t||{}).entropy?[n,S(a)]:null==n?function(){try{var n;return s&&(n=s.randomBytes)?n=n(l):(n=new Uint8Array(l),(f.crypto||f.msCrypto).getRandomValues(n)),S(n)}catch(n){var t=f.navigator,r=t&&t.plugins;return[+new Date,f,r,f.screen,S(a)]}}():n,3),o),u=new m(o);return e.int32=function(){return 0|u.g(4)},e.quick=function(){return u.g(4)/4294967296},e.double=e,j(S(u.S),a),(t.pass||r||function(n,t,r,e){return e&&(e.S&&v(e,u),n.state=function(){return v(u,{})}),r?(c[p]=n,t):n})(e,i,"global"in t?t.global:this==c,t.state)}function m(n){var t,r=n.length,u=this,e=0,o=u.i=u.j=0,i=u.S=[];for(r||(n=[r++]);e<l;)i[e]=e++;for(e=0;e<l;e++)i[e]=i[o=h&o+n[e%r]+(t=i[e])],i[o]=t;(u.g=function(n){for(var t,r=0,e=u.i,o=u.j,i=u.S;n--;)t=i[e=h&e+1],r=r*l+i[h&(i[e]=i[o=h&o+t])+(i[o]=t)];return u.i=e,u.j=o,r})(l)}function v(n,t){return t.i=n.i,t.j=n.j,t.S=n.S.slice(),t}function j(n,t){for(var r,e=n+"",o=0;o<e.length;)t[h&o]=h&(r^=19*t[h&o])+e.charCodeAt(o++);return S(t)}function S(n){return String.fromCharCode.apply(0,n)}if(j(c.random(),a),"object"==typeof module&&module.exports){module.exports=n;try{s=require("crypto")}catch(n){}}else"function"==typeof define&&define.amd?define(function(){return n}):c["seed"+p]=n}("undefined"!=typeof self?self:this,[],Math); function randIntWithSeed(seed, max=1) { /* returns a random number between [0,max] including zero and max seed can be either string or integer */ return Math.round(new Math.seedrandom('seed' + seed)()) * max } test for true randomness of this code: https://es6console.com/kkjkgur2/
There are plenty of good answers here but I had a similar issue with the additional requirement that I would like portability between Java's random number generator and whatever I ended up using in JavaScript. I found the java-random package These two pieces of code had identical output assuming the seed is the same: Java: Random randomGenerator = new Random(seed); int randomInt; for (int i=0; i<10; i++) { randomInt = randomGenerator.nextInt(50); System.out.println(randomInt); } JavaScript: let Random = require('java-random'); let rng = new Random(seed); for (let i=0; i<10; i++) { let val = rng.nextInt(50); console.log(val); }
I have written a function that returns a seeded random number, it uses Math.sin to have a long random number and uses the seed to pick numbers from that. Use : seedRandom("k9]:2#", 15) it will return your seeded number the first parameter is any string value ; your seed. the second parameter is how many digits will return. function seedRandom(inputSeed, lengthOfNumber){ var output = ""; var seed = inputSeed.toString(); var newSeed = 0; var characterArray = ['0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','y','x','z','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','U','R','S','T','U','V','W','X','Y','Z','!','#','#','$','%','^','&','*','(',')',' ','[','{',']','}','|',';',':',"'",',','<','.','>','/','?','`','~','-','_','=','+']; var longNum = ""; var counter = 0; var accumulator = 0; for(var i = 0; i < seed.length; i++){ var a = seed.length - (i+1); for(var x = 0; x < characterArray.length; x++){ var tempX = x.toString(); var lastDigit = tempX.charAt(tempX.length-1); var xOutput = parseInt(lastDigit); addToSeed(characterArray[x], xOutput, a, i); } } function addToSeed(character, value, a, i){ if(seed.charAt(i) === character){newSeed = newSeed + value * Math.pow(10, a)} } newSeed = newSeed.toString(); var copy = newSeed; for(var i=0; i<lengthOfNumber*9; i++){ newSeed = newSeed + copy; var x = Math.sin(20982+(i)) * 10000; var y = Math.floor((x - Math.floor(x))*10); longNum = longNum + y.toString() } for(var i=0; i<lengthOfNumber; i++){ output = output + longNum.charAt(accumulator); counter++; accumulator = accumulator + parseInt(newSeed.charAt(counter)); } return(output) }
A simple approach for a fixed seed: function fixedrandom(p){ const seed = 43758.5453123; return (Math.abs(Math.sin(p)) * seed)%1; }
In PHP, there is function srand(seed) which generate fixed random value for particular seed. But, in JS, there is no such inbuilt function. However, we can write simple and short function. Step 1: Choose some Seed (Fix Number). var seed = 100; Number should be Positive Integer and greater than 1, further explanation in Step 2. Step 2: Perform Math.sin() function on Seed, it will give sin value of that number. Store this value in variable x. var x; x = Math.sin(seed); // Will Return Fractional Value between -1 & 1 (ex. 0.4059..) sin() method returns a Fractional value between -1 and 1.And we don't need Negative value, therefore, in first step choose number greater than 1. Step 3: Returned Value is a Fractional value between -1 and 1. So mulitply this value with 10 for making it more than 1. x = x * 10; // 10 for Single Digit Number Step 4: Multiply the value with 10 for additional digits x = x * 10; // Will Give value between 10 and 99 OR x = x * 100; // Will Give value between 100 and 999 Multiply as per requirement of digits. The result will be in decimal. Step 5: Remove value after Decimal Point by Math's Round (Math.round()) Method. x = Math.round(x); // This will give Integer Value. Step 6: Turn Negative Values into Positive (if any) by Math.abs method x = Math.abs(x); // Convert Negative Values into Positive(if any) Explanation End.Final Code var seed = 111; // Any Number greater than 1 var digit = 10 // 1 => single digit, 10 => 2 Digits, 100 => 3 Digits and so. (Multiple of 10) var x; // Initialize the Value to store the result x = Math.sin(seed); // Perform Mathematical Sin Method on Seed. x = x * 10; // Convert that number into integer x = x * digit; // Number of Digits to be included x = Math.round(x); // Remove Decimals x = Math.abs(x); // Convert Negative Number into Positive Clean and Optimized Functional Code function random_seed(seed, digit = 1) { var x = Math.abs(Math.round(Math.sin(seed++) * 10 * digit)); return x; } Then Call this function using random_seed(any_number, number_of_digits)any_number is must and should be greater than 1.number_of_digits is optional parameter and if nothing passed, 1 Digit will return. random_seed(555); // 1 Digit random_seed(234, 1); // 1 Digit random_seed(7895656, 1000); // 4 Digit
For a number between 0 and 100. Number.parseInt(Math.floor(Math.random() * 100))
Generate deterministic hash number between 0 and 1 from string
I'm looking for a way to 'hash' strings in JavaScript, so that the result is deterministic (aways yields same result with the same input string) the result is a decimal number between 0 and 1 the results are (kind of) uniformly spread out in the 0 to 1 space. For example: decimalHash('hallo world') = 0.145 // some made up number decimalHash('how are you?') = 0.345 // some made up number decimalHash('fine, thanks!') = 0.945 // some made up number I've searched for such a method, but all the hash functions I found so far have different characteristics. Any help would be appreciated!
You could built an own by using a value for each chatacter with a factor and sum this value. At the end take only fractional part. This approach may produce collisions. const decimalHash = string => { let sum = 0; for (let i = 0; i < string.length; i++) sum += (i + 1) * string.codePointAt(i) / (1 << 8) return sum % 1; } console.log(decimalHash('a')); console.log(decimalHash('aa')); console.log(decimalHash('hallo world')); console.log(decimalHash('how are you?')); console.log(decimalHash('fine, thanks!'));
How to write a program that print bits of integer in JS
How to write a program that print out bits of integer. I'm trying to do something like that: function countBits(octet) { var i; var c = ""; var k = ""; i = 128; while (i > 0) { c = ""; if (octet < i) { c = '0'; i = i / 2; k += c } else { c = '1'; k += c octet = octet - i; i = i / 2; } } return k; } But if I trying to print bits with this program I have Output: Input: 123 Output 01111011 and infinity numbers of zero How can I remove this bug? P.S: I want to do this program using only loops and algorithms, NOT function like (n >>> 0).toString(2); or .map() or something like this
Your variable i is always greater than 0, so the while loop keeps running forever. When you decrement it, you halve it. That will never get to 0, however it will get to a value smaller than one, and at this point you want to stop. Try using while (i >= 1) instead as your condition.
So i added a little logging for checking the values of i and I got this in the loop: i = 64; i = 32; i = 16; ... i = 1; i = 0.5; i = 0.25 So yeah, do what AgataB said with regards to using another condition instead since for javascript, 1 / 2 does not give you 0. Unlike many other programming languages, JavaScript does not define different types of numbers, like integers, short, long, floating-point etc. JavaScript numbers are always stored as double precision floating point numbers, following the international IEEE 754 standard. Quoted from: http://www.w3schools.com/js/js_numbers.asp
How to do bitwise AND in javascript on variables that are longer than 32 bit?
I have 2 numbers in javascript that I want to bit and. They both are 33bit long in C#: ((4294967296 & 4294967296 )==0) is false but in javascript: ((4294967296 & 4294967296 )==0) is true 4294967296 is ((long)1) << 32 As I understand it, it is due to the fact that javascript converts values to int32 when performing bit wise operations. How do I work around this? Any suggestions on how to replace bit and with a set of other math operations so that bits are not lost?
Here's a fun function for arbitrarily large integers: function BitwiseAndLarge(val1, val2) { var shift = 0, result = 0; var mask = ~((~0) << 30); // Gives us a bit mask like 01111..1 (30 ones) var divisor = 1 << 30; // To work with the bit mask, we need to clear bits at a time while( (val1 != 0) && (val2 != 0) ) { var rs = (mask & val1) & (mask & val2); val1 = Math.floor(val1 / divisor); // val1 >>> 30 val2 = Math.floor(val2 / divisor); // val2 >>> 30 for(var i = shift++; i--;) { rs *= divisor; // rs << 30 } result += rs; } return result; } Assuming that the system handles at least 30-bit bitwise operations properly.
You could split each of the vars into 2 32-bit values (like a high word and low word), then do a bitwise operation on both pairs. The script below runs as a Windows .js script. You can replace WScript.Echo() with alert() for Web. var a = 4294967296; var b = 4294967296; var w = 4294967296; // 2^32 var aHI = a / w; var aLO = a % w; var bHI = b / w; var bLO = b % w; WScript.Echo((aHI & bHI) * w + (aLO & bLO));
There are several BigInteger librairy in Javascript, but none of them offer bitwise operation you need at the moment. If you are motivated and really need that functionality you can modify one of those librairy and add a method to do so. They already offer a good code base to work with huge number. You can find a list of the BigInteger librairy in Javascript in this question : Huge Integer JavaScript Library
The simplest bit-wise AND, that works up to JavaScript's maximum number JavaScript's max integer value is 2^53 for internal reasons (it's a double float). If you need more there are good libraries for that big integer handling. 2^53 is 9,007,199,254,740,992, or about 9,000 trillion (~9 quadrillion). // Works with values up to 2^53 function bitwiseAnd_53bit(value1, value2) { const maxInt32Bits = 4294967296; // 2^32 const value1_highBits = value1 / maxInt32Bits; const value1_lowBits = value1 % maxInt32Bits; const value2_highBits = value2 / maxInt32Bits; const value2_lowBits = value2 % maxInt32Bits; return (value1_highBits & value2_highBits) * maxInt32Bits + (value1_lowBits & value2_lowBits) }
Ran into this problem today and this is what I came up with: function bitwiseAnd(firstNumber, secondNumber) { let // convert the numbers to binary strings firstBitArray = (firstNumber).toString(2), secondBitArray = (secondNumber).toString(2), resultedBitArray = [], // get the length of the largest number maxLength = Math.max(firstBitArray.length, secondBitArray.length); //add zero fill ahead in case the binary strings have different lengths //so we can have strings equal in length and compare bit by bit firstBitArray = firstBitArray.padStart(maxLength,'0'); secondBitArray = secondBitArray.padStart(maxLength,'0'); // bit by bit comparison for(let i = 0; i < maxLength; i++) { resultedBitArray.push(parseInt(firstBitArray[i]) && secondBitArray[i]); } //concat the result array back to a string and parse the binary string back to an integer return parseInt(resultedBitArray.join(''),2); } Hope this helps anyone else who runs into this problem.