@ohos-ports/stdlib-random-base-minstd 0.0.0-stage → 0.2.3-beta.1

package/lib/factory.js

@@ -0,0 +1,416 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2018 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-len */
+
+'use strict';
+
+// MODULES //
+
+var setReadOnly = require( '@ohos-ports/stdlib-utils-define-nonenumerable-read-only-property' );
+var setReadOnlyAccessor = require( '@ohos-ports/stdlib-utils-define-nonenumerable-read-only-accessor' );
+var setReadWriteAccessor = require( '@ohos-ports/stdlib-utils-define-nonenumerable-read-write-accessor' );
+var hasOwnProp = require( '@ohos-ports/stdlib-assert-has-own-property' );
+var isObject = require( '@ohos-ports/stdlib-assert-is-plain-object' );
+var isBoolean = require( '@ohos-ports/stdlib-assert-is-boolean' ).isPrimitive;
+var isCollection = require( '@ohos-ports/stdlib-assert-is-collection' );
+var isPositiveInteger = require( '@ohos-ports/stdlib-assert-is-positive-integer' ).isPrimitive;
+var isInt32Array = require( '@stdlib/assert-is-int32array' );
+var format = require( '@ohos-ports/stdlib-string-format' );
+var INT32_MAX = require( '@stdlib/constants-int32-max' );
+var Int32Array = require( '@stdlib/array-int32' );
+var gcopy = require( '@ohos-ports/stdlib-blas-base-gcopy' );
+var typedarray2json = require( '@ohos-ports/stdlib-array-to-json' );
+var randint32 = require( './rand_int32.js' );
+
+
+// VARIABLES //
+
+var NORMALIZATION_CONSTANT = (INT32_MAX - 1)|0; // asm type annotation
+var MAX_SEED = (INT32_MAX - 1)|0; // asm type annotation
+var A = 16807|0; // asm type annotation
+
+// Define the state array schema version:
+var STATE_ARRAY_VERSION = 1; // NOTE: anytime the state array schema changes, this value should be incremented!!!
+
+// Define the number of sections in the state array:
+var NUM_STATE_SECTIONS = 2; // state, seed
+
+// Define the index offset of the "state" section in the state array:
+var STATE_SECTION_OFFSET = 2; // | version | num_sections | state_length | ...state | seed_length | ...seed |
+
+// Define the index offset of the seed section in the state array:
+var SEED_SECTION_OFFSET = 4; // | version | num_sections | state_length | ...state | seed_length | ...seed |
+
+// Define the length of the "fixed" length portion of the state array:
+var STATE_FIXED_LENGTH = 5; // 1 (version) + 1 (num_sections) + 1 (state_length) + 1 (state) + 1 (seed_length)
+
+
+// FUNCTIONS //
+
+/**
+* Verifies state array integrity.
+*
+* @private
+* @param {Int32Array} state - state array
+* @param {boolean} FLG - flag indicating whether the state array was provided as an option (true) or an argument (false)
+* @returns {(Error|null)} an error or `null`
+*/
+function verifyState( state, FLG ) {
+	var s1;
+	if ( FLG ) {
+		s1 = 'option';
+	} else {
+		s1 = 'argument';
+	}
+	// The state array must have a minimum length...
+	if ( state.length < STATE_FIXED_LENGTH+1 ) {
+		return new RangeError( format( 'invalid %s. State array has insufficient length.', s1 ) );
+	}
+	// The first element of the state array must equal the supported state array schema version...
+	if ( state[ 0 ] !== STATE_ARRAY_VERSION ) {
+		return new RangeError( format( 'invalid %s. State array has an incompatible schema version. Expected: `%s`. Actual: `%s`.', s1, STATE_ARRAY_VERSION, state[ 0 ] ) );
+	}
+	// The second element of the state array must contain the number of sections...
+	if ( state[ 1 ] !== NUM_STATE_SECTIONS ) {
+		return new RangeError( format( 'invalid %s. State array has an incompatible number of sections. Expected: `%s`. Actual: `%s`.', s1, NUM_STATE_SECTIONS, state[ 1 ] ) );
+	}
+	// The length of the "state" section must equal `1`...
+	if ( state[ STATE_SECTION_OFFSET ] !== 1 ) {
+		return new RangeError( format( 'invalid %s. State array has an incompatible state length. Expected: `%u`. Actual: `%u`.', s1, 1, state[ STATE_SECTION_OFFSET ] ) );
+	}
+	// The length of the "seed" section much match the empirical length...
+	if ( state[ SEED_SECTION_OFFSET ] !== state.length-STATE_FIXED_LENGTH ) {
+		return new RangeError( format( 'invalid %s. State array length is incompatible with seed section length. Expected: `%u`. Actual: `%u`.', s1, state.length-STATE_FIXED_LENGTH, state[ SEED_SECTION_OFFSET ] ) );
+	}
+	return null;
+}
+
+
+// MAIN //
+
+/**
+* Returns a linear congruential pseudorandom number generator (LCG) based on Park and Miller.
+*
+* @param {Options} [options] - options
+* @param {PRNGSeedMINSTD} [options.seed] - pseudorandom number generator seed
+* @param {PRNGStateMINSTD} [options.state] - pseudorandom number generator state
+* @param {boolean} [options.copy=true] - boolean indicating whether to copy a provided pseudorandom number generator state
+* @throws {TypeError} options argument must be an object
+* @throws {TypeError} a seed must be either a positive integer less than the maximum signed 32-bit integer or an array-like object containing integers less than the maximum signed 32-bit integer
+* @throws {RangeError} a numeric seed must be a positive integer less than the maximum signed 32-bit integer
+* @throws {TypeError} state must be an `Int32Array`
+* @throws {Error} must provide a valid state
+* @throws {TypeError} `copy` option must be a boolean
+* @returns {PRNG} LCG PRNG
+*
+* @example
+* var minstd = factory();
+*
+* var v = minstd();
+* // returns <number>
+*
+* @example
+* // Return a seeded LCG:
+* var minstd = factory({
+*     'seed': 1234
+* });
+*
+* var v = minstd();
+* // returns 20739838
+*/
+function factory( options ) {
+	var STATE;
+	var state;
+	var opts;
+	var seed;
+	var slen;
+	var err;
+
+	opts = {};
+	if ( arguments.length ) {
+		if ( !isObject( options ) ) {
+			throw new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );
+		}
+		if ( hasOwnProp( options, 'copy' ) ) {
+			opts.copy = options.copy;
+			if ( !isBoolean( options.copy ) ) {
+				throw new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'copy', options.copy ) );
+			}
+		}
+		if ( hasOwnProp( options, 'state' ) ) {
+			state = options.state;
+			opts.state = true;
+			if ( !isInt32Array( state ) ) {
+				throw new TypeError( format( 'invalid option. `%s` option must be an Int32Array. Option: `%s`.', 'state', state ) );
+			}
+			err = verifyState( state, true );
+			if ( err ) {
+				throw err;
+			}
+			if ( opts.copy === false ) {
+				STATE = state;
+			} else {
+				STATE = new Int32Array( state.length );
+				gcopy( state.length, state, 1, STATE, 1 );
+			}
+			// Create a state "view":
+			state = new Int32Array( STATE.buffer, STATE.byteOffset+((STATE_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), 1 );
+
+			// Create a seed "view":
+			seed = new Int32Array( STATE.buffer, STATE.byteOffset+((SEED_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), state[ SEED_SECTION_OFFSET ] );
+		}
+		// If provided a PRNG state, we ignore the `seed` option...
+		if ( seed === void 0 ) {
+			if ( hasOwnProp( options, 'seed' ) ) {
+				seed = options.seed;
+				opts.seed = true;
+				if ( isPositiveInteger( seed ) ) {
+					if ( seed > MAX_SEED ) {
+						throw new RangeError( format( 'invalid option. `%s` option must be a positive integer less than the maximum signed 32-bit integer. Option: `%u`.', 'seed', seed ) );
+					}
+					seed |= 0; // asm type annotation
+				} else if ( isCollection( seed ) && seed.length > 0 ) {
+					slen = seed.length;
+					STATE = new Int32Array( STATE_FIXED_LENGTH+slen );
+
+					// Initialize sections:
+					STATE[ 0 ] = STATE_ARRAY_VERSION;
+					STATE[ 1 ] = NUM_STATE_SECTIONS;
+					STATE[ STATE_SECTION_OFFSET ] = 1;
+					STATE[ SEED_SECTION_OFFSET ] = slen;
+
+					// Copy the provided seed array to prevent external mutation, as mutation would lead to an inability to reproduce PRNG values according to the PRNG's stated seed:
+					gcopy.ndarray( slen, seed, 1, 0, STATE, 1, SEED_SECTION_OFFSET+1 );
+
+					// Create a state "view":
+					state = new Int32Array( STATE.buffer, STATE.byteOffset+((STATE_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), 1 );
+
+					// Create a seed "view":
+					seed = new Int32Array( STATE.buffer, STATE.byteOffset+((SEED_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), slen );
+
+					// Initialize the internal PRNG state:
+					state[ 0 ] = seed[ 0 ];
+				} else {
+					throw new TypeError( format( 'invalid option. `%s` option must be either a positive integer less than the maximum signed 32-bit integer or an array-like object containing integer values less than the maximum signed 32-bit integer. Option: `%s`.', 'seed', seed ) );
+				}
+			} else {
+				seed = randint32()|0; // asm type annotation
+			}
+		}
+	} else {
+		seed = randint32()|0; // asm type annotation
+	}
+	if ( state === void 0 ) {
+		STATE = new Int32Array( STATE_FIXED_LENGTH+1 );
+
+		// Initialize sections:
+		STATE[ 0 ] = STATE_ARRAY_VERSION;
+		STATE[ 1 ] = NUM_STATE_SECTIONS;
+		STATE[ STATE_SECTION_OFFSET ] = 1;
+		STATE[ SEED_SECTION_OFFSET ] = 1;
+		STATE[ SEED_SECTION_OFFSET+1 ] = seed;
+
+		// Create a state "view":
+		state = new Int32Array( STATE.buffer, STATE.byteOffset+((STATE_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), 1 );
+
+		// Create a seed "view":
+		seed = new Int32Array( STATE.buffer, STATE.byteOffset+((SEED_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), 1 );
+
+		// Initialize the internal PRNG state:
+		state[ 0 ] = seed[ 0 ];
+	}
+	setReadOnly( minstd, 'NAME', 'minstd' );
+	setReadOnlyAccessor( minstd, 'seed', getSeed );
+	setReadOnlyAccessor( minstd, 'seedLength', getSeedLength );
+	setReadWriteAccessor( minstd, 'state', getState, setState );
+	setReadOnlyAccessor( minstd, 'stateLength', getStateLength );
+	setReadOnlyAccessor( minstd, 'byteLength', getStateSize );
+	setReadOnly( minstd, 'toJSON', toJSON );
+	setReadOnly( minstd, 'MIN', 1 );
+	setReadOnly( minstd, 'MAX', INT32_MAX-1 );
+	setReadOnly( minstd, 'normalized', normalized );
+
+	setReadOnly( normalized, 'NAME', minstd.NAME );
+	setReadOnlyAccessor( normalized, 'seed', getSeed );
+	setReadOnlyAccessor( normalized, 'seedLength', getSeedLength );
+	setReadWriteAccessor( normalized, 'state', getState, setState );
+	setReadOnlyAccessor( normalized, 'stateLength', getStateLength );
+	setReadOnlyAccessor( normalized, 'byteLength', getStateSize );
+	setReadOnly( normalized, 'toJSON', toJSON );
+	setReadOnly( normalized, 'MIN', (minstd.MIN-1.0) / NORMALIZATION_CONSTANT );
+	setReadOnly( normalized, 'MAX', (minstd.MAX-1.0) / NORMALIZATION_CONSTANT );
+
+	return minstd;
+
+	/**
+	* Returns the PRNG seed.
+	*
+	* @private
+	* @returns {PRNGSeedMINSTD} seed
+	*/
+	function getSeed() {
+		var len = STATE[ SEED_SECTION_OFFSET ];
+		return gcopy( len, seed, 1, new Int32Array( len ), 1 );
+	}
+
+	/**
+	* Returns the PRNG seed length.
+	*
+	* @private
+	* @returns {PositiveInteger} seed length
+	*/
+	function getSeedLength() {
+		return STATE[ SEED_SECTION_OFFSET ];
+	}
+
+	/**
+	* Returns the PRNG state length.
+	*
+	* @private
+	* @returns {PositiveInteger} state length
+	*/
+	function getStateLength() {
+		return STATE.length;
+	}
+
+	/**
+	* Returns the PRNG state size (in bytes).
+	*
+	* @private
+	* @returns {PositiveInteger} state size (in bytes)
+	*/
+	function getStateSize() {
+		return STATE.byteLength;
+	}
+
+	/**
+	* Returns the current PRNG state.
+	*
+	* ## Notes
+	*
+	* -   The PRNG state array is comprised of a preamble followed by `2` sections:
+	*
+	*     0.  preamble (version + number of sections)
+	*     1.  internal PRNG state
+	*     2.  PRNG seed
+	*
+	* -   The first element of the PRNG state array preamble is the state array schema version.
+	*
+	* -   The second element of the PRNG state array preamble is the number of state array sections (i.e., `2`).
+	*
+	* -   The first element of each section following the preamble specifies the section length. The remaining section elements comprise the section contents.
+	*
+	* @private
+	* @returns {PRNGStateMINSTD} current state
+	*/
+	function getState() {
+		var len = STATE.length;
+		return gcopy( len, STATE, 1, new Int32Array( len ), 1 );
+	}
+
+	/**
+	* Sets the PRNG state.
+	*
+	* ## Notes
+	*
+	* -   If PRNG state is "shared" (meaning a state array was provided during PRNG creation and **not** copied) and one sets the generator state to a state array having a different length, the PRNG does **not** update the existing shared state and, instead, points to the newly provided state array. In order to synchronize PRNG output according to the new shared state array, the state array for **each** relevant PRNG must be **explicitly** set.
+	* -   If PRNG state is "shared" and one sets the generator state to a state array of the same length, the PRNG state is updated (along with the state of all other PRNGs sharing the PRNG's state array).
+	*
+	* @private
+	* @param {PRNGStateMINSTD} s - generator state
+	* @throws {TypeError} must provide an `Int32Array`
+	* @throws {Error} must provide a valid state
+	*/
+	function setState( s ) {
+		var err;
+		if ( !isInt32Array( s ) ) {
+			throw new TypeError( format( 'invalid argument. Must provide an Int32Array. Value: `%s`.', s ) );
+		}
+		err = verifyState( s, false );
+		if ( err ) {
+			throw err;
+		}
+		if ( opts.copy === false ) {
+			if ( opts.state && s.length === STATE.length ) {
+				gcopy( s.length, s, 1, STATE, 1 ); // update current shared state
+			} else {
+				STATE = s; // point to new shared state
+				opts.state = true; // setting this flag allows updating a shared state even if a state array was not provided at PRNG creation
+			}
+		} else {
+			// Check if we can reuse allocated memory...
+			if ( s.length !== STATE.length ) {
+				STATE = new Int32Array( s.length ); // reallocate
+			}
+			gcopy( s.length, s, 1, STATE, 1 );
+		}
+		// Create a new state "view":
+		state = new Int32Array( STATE.buffer, STATE.byteOffset+((STATE_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), 1 );
+
+		// Create a new seed "view":
+		seed = new Int32Array( STATE.buffer, STATE.byteOffset+((SEED_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), STATE[ SEED_SECTION_OFFSET ] );
+	}
+
+	/**
+	* Serializes the pseudorandom number generator as a JSON object.
+	*
+	* ## Notes
+	*
+	* -   `JSON.stringify()` implicitly calls this method when stringifying a PRNG.
+	*
+	* @private
+	* @returns {Object} JSON representation
+	*/
+	function toJSON() {
+		var out = {};
+		out.type = 'PRNG';
+		out.name = minstd.NAME;
+		out.state = typedarray2json( STATE );
+		out.params = [];
+		return out;
+	}
+
+	/**
+	* Generates a pseudorandom integer on the interval \\( [1,2^{31}-1) \\).
+	*
+	* @private
+	* @returns {integer32} pseudorandom integer
+	*/
+	function minstd() {
+		var s = state[ 0 ]|0; // asm type annotation
+		s = ( (A*s)%INT32_MAX )|0; // asm type annotation
+		state[ 0 ] = s;
+		return s|0; // asm type annotation
+	}
+
+	/**
+	* Generates a pseudorandom number on the interval \\( [0,1) \\).
+	*
+	* @private
+	* @returns {number} pseudorandom number
+	*/
+	function normalized() {
+		return (minstd()-1) / NORMALIZATION_CONSTANT;
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = factory;

package/lib/index.js

@@ -0,0 +1,57 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2018 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+/**
+* A linear congruential pseudorandom number generator (LCG) based on Park and Miller.
+*
+* @module @stdlib/random-base-minstd
+*
+* @example
+* var minstd = require( '@stdlib/random-base-minstd' );
+*
+* var v = minstd();
+* // returns <number>
+*
+* @example
+* var factory = require( '@stdlib/random-base-minstd' ).factory;
+*
+* var minstd = factory({
+*     'seed': 1234
+* });
+*
+* var v = minstd();
+* // returns 20739838
+*/
+
+// MODULES //
+
+var setReadOnly = require( '@ohos-ports/stdlib-utils-define-nonenumerable-read-only-property' );
+var main = require( './main.js' );
+var factory = require( './factory.js' );
+
+
+// MAIN //
+
+setReadOnly( main, 'factory', factory );
+
+
+// EXPORTS //
+
+module.exports = main;

package/lib/main.js

@@ -0,0 +1,102 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2018 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var factory = require( './factory.js' );
+var randint32 = require( './rand_int32.js' );
+
+
+// MAIN //
+
+/**
+* Generates a pseudorandom integer on the interval \\( [1,2^{31}-1) \\).
+*
+* ## Method
+*
+* Linear congruential generators (LCGs) use the recurrence relation
+*
+* ```tex
+* X_{n+1} = ( a \cdot X_n + c ) \operatorname{mod}(m)
+* ```
+*
+* where the modulus \\( m \\) is a prime number or power of a prime number and \\( a \\) is a primitive root modulo \\( m \\).
+*
+* <!-- <note> -->
+*
+* For an LCG to be a Lehmer RNG, the seed \\( X_0 \\) must be coprime to \\( m \\).
+*
+* <!-- </note> -->
+*
+* In this implementation, the constants \\( a \\), \\( c \\), and \\( m \\) have the values
+*
+* ```tex
+* \begin{align*}
+* a &= 7^5 = 16807 \\
+* c &= 0 \\
+* m &= 2^{31} - 1 = 2147483647
+* \end{align*}
+* ```
+*
+* <!-- <note> -->
+*
+* The constant \\( m \\) is a Mersenne prime (modulo \\(31\\)).
+*
+* <!-- </note> -->
+*
+* <!-- <note> -->
+*
+* The constant \\( a \\) is a primitive root (modulo \\(31\\)).
+*
+* <!-- </note> -->
+*
+* Accordingly, the maximum possible product is
+*
+* ```tex
+* 16807 \cdot (m - 1) \approx 2^{46}
+* ```
+*
+* The values for \\( a \\), \\( c \\), and \\( m \\) are taken from Park and Miller, "Random Number Generators: Good Ones Are Hard To Find". Park's and Miller's article is also the basis for a recipe in the second edition of _Numerical Recipes in C_.
+*
+* ## Notes
+*
+* -   The generator has a period of approximately \\(2.1\mbox{e}9\\) (see [Numerical Recipes in C, 2nd Edition](#references), p. 279).
+*
+* ## References
+*
+* -   Park, S. K., and K. W. Miller. 1988. "Random Number Generators: Good Ones Are Hard to Find." _Communications of the ACM_ 31 (10). New York, NY, USA: ACM: 1192–1201. doi:[10.1145/63039.63042](http://dx.doi.org/10.1145/63039.63042).
+* -   Press, William H., Brian P. Flannery, Saul A. Teukolsky, and William T. Vetterling. 1992. _Numerical Recipes in C: The Art of Scientific Computing, Second Edition_. Cambridge University Press.
+*
+* @function minstd
+* @type {PRNG}
+* @returns {PositiveInteger} pseudorandom integer
+*
+* @example
+* var v = minstd();
+* // returns <number>
+*/
+var minstd = factory({
+	'seed': randint32()
+});
+
+
+// EXPORTS //
+
+module.exports = minstd;

package/lib/rand_int32.js

@@ -0,0 +1,52 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2018 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var INT32_MAX = require( '@stdlib/constants-int32-max' );
+var floor = require( '@ohos-ports/stdlib-math-base-special-floor' );
+
+
+// VARIABLES //
+
+var MAX = INT32_MAX - 1;
+
+
+// MAIN //
+
+/**
+* Returns a pseudorandom integer on the interval \\([1, 2^{31}-1)\\).
+*
+* @private
+* @returns {PositiveInteger} pseudorandom integer
+*
+* @example
+* var v = randint32();
+* // returns <number>
+*/
+function randint32() {
+	var v = floor( 1.0 + (MAX*Math.random()) ); // eslint-disable-line stdlib/no-builtin-math
+	return v|0; // asm type annotation
+}
+
+
+// EXPORTS //
+
+module.exports = randint32;

package/manifest.json

@@ -0,0 +1,40 @@
+{
+  "options": {},
+  "fields": [
+    {
+      "field": "src",
+      "resolve": true,
+      "relative": true
+    },
+    {
+      "field": "include",
+      "resolve": true,
+      "relative": true
+    },
+    {
+      "field": "libraries",
+      "resolve": false,
+      "relative": false
+    },
+    {
+      "field": "libpath",
+      "resolve": true,
+      "relative": false
+    }
+  ],
+  "confs": [
+    {
+      "src": [
+        "./src/main.c"
+      ],
+      "include": [
+        "./include"
+      ],
+      "libraries": [],
+      "libpath": [],
+      "dependencies": [
+        "@stdlib/random-base-shared"
+      ]
+    }
+  ]
+}