PageSourceSearch

https://fast-check.dev/assets/js/83d9b65f.1d78bcf8.js

js fast-check.dev collected 2026-10-02 04:22:17 UTC 4,881 bytes, 1 lines download raw bytes

1"use strict";(self.webpackChunkwebsite=self.webpackChunkwebsite||[]).push([["26641"],{55201(e,n,i){i.r(n),i.d(n,{metadata:()=>r,default:()=>b,frontMatter:()=>l,contentTitle:()=>a,toc:()=>o,assets:()=>c});var r=JSON.parse('{"id":"core-blocks/arbitraries/primitives/bigint","title":"BigInt","description":"Generate bigint values.","source":"@site/docs/core-blocks/arbitraries/primitives/bigint.md","sourceDirName":"core-blocks/arbitraries/primitives","slug":"/core-blocks/arbitraries/primitives/bigint/","permalink":"/docs/core-blocks/arbitraries/primitives/bigint/","draft":false,"unlisted":false,"tags":[],"version":"current","lastUpdatedBy":"Nicolas DUBIEN","lastUpdatedAt":1776752983000,"frontMatter":{"slug":"/core-blocks/arbitraries/primitives/bigint/"},"sidebar":"tutorialSidebar","previous":{"title":"Primitives","permalink":"/docs/core-blocks/arbitraries/primitives/"},"next":{"title":"Boolean","permalink":"/docs/core-blocks/arbitraries/primitives/boolean/"}}'),t=i(61058),s=i(24801);let l={slug:"/core-blocks/arbitraries/primitives/bigint/"},a="BigInt",c={},o=[{value:"bigInt",id:"bigint-1",level:2}];function d(e){let n={a:"a",admonition:"admonition",br:"br",code:"code",em:"em",h1:"h1",h2:"h2",header:"header",li:"li",p:"p",pre:"pre",strong:"strong",ul:"ul",...(0,s.R)(),...e.components};return(0,t.jsxs)(t.Fragment,{children:[(0,t.jsx)(n.header,{children:(0,t.jsx)(n.h1,{id:"bigint",children:"BigInt"})}),"\n",(0,t.jsx)(n.p,{children:"Generate bigint values."}),"\n",(0,t.jsx)(n.admonition,{type:"info",children:(0,t.jsx)(n.p,{children:"If supported by your JavaScript interpreter."})}),"\n",(0,t.jsx)(n.h2,{id:"bigint-1",children:"bigInt"}),"\n",(0,t.jsxs)(n.p,{children:["Signed ",(0,t.jsx)(n.code,{children:"bigint"})," values."]}),"\n",(0,t.jsx)(n.p,{children:"Generate any bigint value taken into the specified range.\nBoth lower bound and upper bound are included into the range of possible values."}),"\n",(0,t.jsx)(n.p,{children:(0,t.jsx)(n.strong,{children:"Signatures:"})}),"\n",(0,t.jsxs)(n.ul,{children:["\n",(0,t.jsx)(n.li,{children:(0,t.jsx)(n.code,{children:"fc.bigInt()"})}),"\n",(0,t.jsx)(n.li,{children:(0,t.jsx)(n.code,{children:"fc.bigInt({min?, max?})"})}),"\n",(0,t.jsx)(n.li,{children:(0,t.jsx)(n.code,{children:"fc.bigInt(min, max)"})}),"\n"]}),"\n",(0,t.jsx)(n.p,{children:(0,t.jsx)(n.strong,{children:"with:"})}),"\n",(0,t.jsxs)(n.ul,{children:["\n",(0,t.jsxs)(n.li,{children:[(0,t.jsx)(n.code,{children:"min?"})," \u2014 ",(0,t.jsx)(n.em,{children:"lower bound of the range (included)"})]}),"\n",(0,t.jsxs)(n.li,{children:[(0,t.jsx)(n.code,{children:"max?"})," \u2014 ",(0,t.jsx)(n.em,{children:"upper bound of the range (included)"})]}),"\n"]}),"\n",(0,t.jsx)(n.p,{children:(0,t.jsx)(n.strong,{children:"Usages:"})}),"\n",(0,t.jsx)(n.pre,{children:(0,t.jsx)(n.code,{className:"language-js",children:"fc.bigInt();\n// Examples of generated values:\n// \u2022 40519302182168582469083131396737815984915854610111397506754347703341259198524n\n// \u2022 23951610212595764539175455250207245555782767082407094676187361741043426472154n\n// \u2022 30295980883260580261886608760731577493472838495202972700546280276253358609031n\n// \u2022 -11868238563800054718695098172873792117821728883208728506070757173361404354997n\n// \u2022 35n\n// \u2022 \u2026\n\nfc.bigInt({ min: 0n, max: 12345678901234567890n });\n// Note: All possible bigint values between `0n` (included) and `12345678901234567890n` (included)\n// Examples of generated values: 10743587536809719502n, 12345678901234567887n, 1n, 18n, 3991213889543870829n\u2026\n\nfc.bigInt({ min: -3000n, max: 100n });\n// Note: All possible bigint values between `-3000n` (included) and `100n` (included)\n// Examples of generated values: 1n, -2n, -1064n, 0n, -147n\u2026\n\nfc.bigInt({ min: 1n << 64n });\n// Note: Any possible bigint value greater or equal to `1n << 64n`\n// Examples of generated values:\n// \u2022 18446744073709551637n\n// \u2022 46981635298839638819090544091451527470150794541406966757340574520618867005787n\n// \u2022 18446744073709551630n\n// \u2022 56018523185942628466562775307785743268387645013311767424219309719910490250614n\n// \u2022 18446744073709551631n\n// \u2022 \u2026\n"})}),"\n",(0,t.jsxs)(n.p,{children:["Resources: ",(0,t.jsx)(n.a,{href:"/docs/api/functions/bigInt",children:"API reference"}),".",(0,t.jsx)(n.br,{}),"\n","Available since 1.9.0."]})]})}function b(e={}){let{wrapper:n}={...(0,s.R)(),...e.components};return n?(0,t.jsx)(n,{...e,children:(0,t.jsx)(d,{...e})}):d(e)}},24801(e,n,i){i.d(n,{R:()=>l,x:()=>a});var r=i(13706);let t={},s=r.createContext(t);function l(e){let n=r.useContext(s);return r.useMemo(function(){return"function"==typeof e?e(n):{...n,...e}},[n,e])}function a(e){let n;return n=e.disableParentContext?"function"==typeof e.components?e.components(t):e.components||t:l(e.components),r.createElement(s.Provider,{value:n},e.children)}}}]);

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.