oadmin/cursornew2026
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

备份: 完整开发状态（含反混淆脚本和临时文件）

Browse Source
This commit is contained in:
ccdojox-crypto
2025-12-17 17:18:02 +08:00
parent 9e2333c90c
commit 7e9ea173a7
2872 changed files with 326818 additions and 249 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
node_modules/mersenne-twister/.npmignore generated vendored Normal file
View File

@@ -0,0 +1,2 @@
node_modules
*.log

3
node_modules/mersenne-twister/.travis.yml generated vendored Normal file
View File

@@ -0,0 +1,3 @@
language: node_js
node_js:
- "0.8"

4
node_modules/mersenne-twister/Makefile generated vendored Normal file
View File

@@ -0,0 +1,4 @@
test:
./node_modules/mocha/bin/_mocha -R spec -r should test --recursive
.PHONY: test

56
node_modules/mersenne-twister/README.md generated vendored Normal file
View File

@@ -0,0 +1,56 @@
## Pseudorandom number generator [![Build Status](https://travis-ci.org/boo1ean/mersenne-twister.png?branch=master)](https://travis-ci.org/boo1ean/mersenne-twister)
Mersenne Twister pseudorandom number generator.
[Origin source](https://gist.github.com/banksean/300494) (generator interface was changed)
Algorithm - http://en.wikipedia.org/wiki/Mersenne_twister
## Installation
$ npm install mersenne-twister
## Usage
```javascript
var MersenneTwister = require('mersenne-twister');
var generator = new MersenneTwister();
// Generates a random number on [0,1) real interval (same interval as Math.random)
generator.random();
// [0, 4294967295]
generator.random_int();
// [0,1]
generator.random_incl();
// (0,1)
generator.random_excl();
// [0,1) with 53-bit resolution
generator.random_long();
// [0, 2147483647]
generator.random_int31();
```
## Seeding
If you want to use a specific seed in order to get a repeatable random sequence, pass an integer into the constructor:
```javascript
var generator = new MersenneTwister(123);
```
and that will always produce the same random sequence.
Also you can do it on existing generator instance:
```javascript
generator.init_seed(123);
```
## License
See source

31
node_modules/mersenne-twister/package.json generated vendored Normal file
View File

@@ -0,0 +1,31 @@
{
"name": "mersenne-twister",
"version": "1.1.0",
"description": "Mersenne twister pseudorandom number generator",
"main": "src/mersenne-twister.js",
"scripts": {
"test": "make test"
},
"repository": {
"type": "git",
"url": "git://github.com/boo1ean/mersenne-twister.git"
},
"keywords": [
"random",
"mersenne",
"twister",
"mersennetwister",
"generator",
"seed"
],
"author": "Egor Gumenyuk <boo1ean0807@gmail.com>",
"license": "MIT",
"bugs": {
"url": "https://github.com/boo1ean/mersenne-twister/issues"
},
"homepage": "https://github.com/boo1ean/mersenne-twister",
"devDependencies": {
"should": "~3.1.2",
"mocha": "~1.17.1"
}
}

210
node_modules/mersenne-twister/src/mersenne-twister.js generated vendored Normal file
View File

@@ -0,0 +1,210 @@
/*
https://github.com/banksean wrapped Makoto Matsumoto and Takuji Nishimura's code in a namespace
so it's better encapsulated. Now you can have multiple random number generators
and they won't stomp all over eachother's state.
If you want to use this as a substitute for Math.random(), use the random()
method like so:
var m = new MersenneTwister();
var randomNumber = m.random();
You can also call the other genrand_{foo}() methods on the instance.
If you want to use a specific seed in order to get a repeatable random
sequence, pass an integer into the constructor:
var m = new MersenneTwister(123);
and that will always produce the same random sequence.
Sean McCullough (banksean@gmail.com)
*/
/*
A C-program for MT19937, with initialization improved 2002/1/26.
Coded by Takuji Nishimura and Makoto Matsumoto.
Before using, initialize the state by using init_seed(seed)
or init_by_array(init_key, key_length).
Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The names of its contributors may not be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Any feedback is very welcome.
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
*/
var MersenneTwister = function(seed) {
if (seed == undefined) {
seed = new Date().getTime();
}
/* Period parameters */
this.N = 624;
this.M = 397;
this.MATRIX_A = 0x9908b0df; /* constant vector a */
this.UPPER_MASK = 0x80000000; /* most significant w-r bits */
this.LOWER_MASK = 0x7fffffff; /* least significant r bits */
this.mt = new Array(this.N); /* the array for the state vector */
this.mti=this.N+1; /* mti==N+1 means mt[N] is not initialized */
if (seed.constructor == Array) {
this.init_by_array(seed, seed.length);
}
else {
this.init_seed(seed);
}
}
/* initializes mt[N] with a seed */
/* origin name init_genrand */
MersenneTwister.prototype.init_seed = function(s) {
this.mt[0] = s >>> 0;
for (this.mti=1; this.mti<this.N; this.mti++) {
var s = this.mt[this.mti-1] ^ (this.mt[this.mti-1] >>> 30);
this.mt[this.mti] = (((((s & 0xffff0000) >>> 16) * 1812433253) << 16) + (s & 0x0000ffff) * 1812433253)
+ this.mti;
/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
/* In the previous versions, MSBs of the seed affect */
/* only MSBs of the array mt[]. */
/* 2002/01/09 modified by Makoto Matsumoto */
this.mt[this.mti] >>>= 0;
/* for >32 bit machines */
}
}
/* initialize by an array with array-length */
/* init_key is the array for initializing keys */
/* key_length is its length */
/* slight change for C++, 2004/2/26 */
MersenneTwister.prototype.init_by_array = function(init_key, key_length) {
var i, j, k;
this.init_seed(19650218);
i=1; j=0;
k = (this.N>key_length ? this.N : key_length);
for (; k; k--) {
var s = this.mt[i-1] ^ (this.mt[i-1] >>> 30)
this.mt[i] = (this.mt[i] ^ (((((s & 0xffff0000) >>> 16) * 1664525) << 16) + ((s & 0x0000ffff) * 1664525)))
+ init_key[j] + j; /* non linear */
this.mt[i] >>>= 0; /* for WORDSIZE > 32 machines */
i++; j++;
if (i>=this.N) { this.mt[0] = this.mt[this.N-1]; i=1; }
if (j>=key_length) j=0;
}
for (k=this.N-1; k; k--) {
var s = this.mt[i-1] ^ (this.mt[i-1] >>> 30);
this.mt[i] = (this.mt[i] ^ (((((s & 0xffff0000) >>> 16) * 1566083941) << 16) + (s & 0x0000ffff) * 1566083941))
- i; /* non linear */
this.mt[i] >>>= 0; /* for WORDSIZE > 32 machines */
i++;
if (i>=this.N) { this.mt[0] = this.mt[this.N-1]; i=1; }
}
this.mt[0] = 0x80000000; /* MSB is 1; assuring non-zero initial array */
}
/* generates a random number on [0,0xffffffff]-interval */
/* origin name genrand_int32 */
MersenneTwister.prototype.random_int = function() {
var y;
var mag01 = new Array(0x0, this.MATRIX_A);
/* mag01[x] = x * MATRIX_A for x=0,1 */
if (this.mti >= this.N) { /* generate N words at one time */
var kk;
if (this.mti == this.N+1) /* if init_seed() has not been called, */
this.init_seed(5489); /* a default initial seed is used */
for (kk=0;kk<this.N-this.M;kk++) {
y = (this.mt[kk]&this.UPPER_MASK)|(this.mt[kk+1]&this.LOWER_MASK);
this.mt[kk] = this.mt[kk+this.M] ^ (y >>> 1) ^ mag01[y & 0x1];
}
for (;kk<this.N-1;kk++) {
y = (this.mt[kk]&this.UPPER_MASK)|(this.mt[kk+1]&this.LOWER_MASK);
this.mt[kk] = this.mt[kk+(this.M-this.N)] ^ (y >>> 1) ^ mag01[y & 0x1];
}
y = (this.mt[this.N-1]&this.UPPER_MASK)|(this.mt[0]&this.LOWER_MASK);
this.mt[this.N-1] = this.mt[this.M-1] ^ (y >>> 1) ^ mag01[y & 0x1];
this.mti = 0;
}
y = this.mt[this.mti++];
/* Tempering */
y ^= (y >>> 11);
y ^= (y << 7) & 0x9d2c5680;
y ^= (y << 15) & 0xefc60000;
y ^= (y >>> 18);
return y >>> 0;
}
/* generates a random number on [0,0x7fffffff]-interval */
/* origin name genrand_int31 */
MersenneTwister.prototype.random_int31 = function() {
return (this.random_int()>>>1);
}
/* generates a random number on [0,1]-real-interval */
/* origin name genrand_real1 */
MersenneTwister.prototype.random_incl = function() {
return this.random_int()*(1.0/4294967295.0);
/* divided by 2^32-1 */
}
/* generates a random number on [0,1)-real-interval */
MersenneTwister.prototype.random = function() {
return this.random_int()*(1.0/4294967296.0);
/* divided by 2^32 */
}
/* generates a random number on (0,1)-real-interval */
/* origin name genrand_real3 */
MersenneTwister.prototype.random_excl = function() {
return (this.random_int() + 0.5)*(1.0/4294967296.0);
/* divided by 2^32 */
}
/* generates a random number on [0,1) with 53-bit resolution*/
/* origin name genrand_res53 */
MersenneTwister.prototype.random_long = function() {
var a=this.random_int()>>>5, b=this.random_int()>>>6;
return(a*67108864.0+b)*(1.0/9007199254740992.0);
}
/* These real versions are due to Isaku Wada, 2002/01/09 added */
module.exports = MersenneTwister;

63
node_modules/mersenne-twister/test/generator.js generated vendored Normal file
View File

@@ -0,0 +1,63 @@
var MersenneTwister = require('../');
var g = new MersenneTwister();
describe('Generator', function() {
it('Should repeat random sequence on same seed', function() {
var seed = 123;
g.init_seed(seed);
var first_1 = g.random();
var first_2 = g.random();
g.init_seed(seed);
var second_1 = g.random();
var second_2 = g.random();
first_1.should.be.exactly(second_1);
first_2.should.be.exactly(second_2);
});
it('Should allow seeding via constructor', function() {
var seed = 325;
var g1 = new MersenneTwister(seed);
var g2 = new MersenneTwister(seed);
for (var i = 0; i < 5; ++i) {
g1.random().should.be.exactly(g2.random());
}
});
it('Should roughly match Python when seeded by array', function() {
var seed1 = 0;
var seed2 = 42;
var g1 = new MersenneTwister([seed1]);
var g2 = new MersenneTwister([seed2]);
/* We should get a near exact match with Python's rng
* when we seed by array. The code for generating
* these comparison values is something like:
import random
r = random.Random(0)
for i in range(10000000):
x = r.random()
if i % 1000000 == 0: print(x)
*/
var values1 = [0.84442, 0.34535, 0.25570, 0.32368, 0.89075];
var values2 = [0.63942, 0.55564, 0.55519, 0.81948, 0.94333];
for (var i = 0; i < 5000000; i++) {
var rval1 = g1.random_long();
var rval2 = g2.random_long();
if (i % 1000000 == 0) {
var idx = i / 1000000;
rval1.should.be.approximately(values1[idx], 1e-5);
rval2.should.be.approximately(values2[idx], 1e-5);
}
}
});
});