How to use dataArb method in fast-check-monorepo

Best JavaScript code snippet using fast-check-monorepo

data.spec.js

Source:data.spec.js Github

copy

Full Screen

1import {2 flow,3 cloneDeep as clone,4 every,5 identity,6 merge,7 has,8 isMatch,9 isEqual,10} from "lodash/fp";11import {of} from "dashp";12import jsc, {property} from "jsverify";13import {data, queries as list} from "../../packages/core/lib";14import {unitArb, dataArb} from "../../packages/test/lib";15const {16 emptyOne,17 equalsOne,18 identicalOne,19 concatOne,20 empty,21 equals,22 identical,23 concat,24 fmap,25 fmapAsync,26 fmapList,27 fmapListAsync,28 uniq,29 hashOne,30 hash,31} = data;32const isTrue = isEqual(true);33describe("data unit interface", () => {34 property("reflexivity of identity equality", unitArb, (u) =>35 isTrue(equalsOne(u, clone(u))),36 );37 property("symmetry of identity equality", unitArb, (u) =>38 isEqual(equalsOne(u, clone(u)), equalsOne(clone(u), u)),39 );40 property("transitivity of identity equality", unitArb, (u) => {41 const j = clone(u);42 const k = clone(u);43 return equalsOne(u, j) && equalsOne(j, k) && equalsOne(u, k);44 });45 property("reflexivity of value equality", unitArb, (u) =>46 isTrue(identicalOne(u, clone(u))),47 );48 property("symmetry of value equality", unitArb, (u) =>49 isEqual(identicalOne(u, clone(u)), identicalOne(clone(u), u)),50 );51 property("transitivity of value equality", unitArb, (u) => {52 const j = clone(u);53 const k = clone(u);54 return identicalOne(u, j) && identicalOne(j, k) && identicalOne(u, k);55 });56 property("associativity of a monoid", unitArb, unitArb, unitArb, (u, j, k) =>57 equalsOne(concatOne(concatOne(u, j), k), concatOne(u, concatOne(j, k))),58 );59 property("right identity of a Monoid", unitArb, (u) =>60 equalsOne(concatOne(u, emptyOne()), u),61 );62 property("left identity of a Monoid", unitArb, (u) =>63 equalsOne(concatOne(emptyOne(), u), u),64 );65});66describe("data interface", () => {67 property("reflexivity of identity equality", dataArb, (xs) =>68 isTrue(equals(xs, clone(xs))),69 );70 property("symmetry of identical equality", dataArb, (xs) =>71 isEqual(equals(xs, clone(xs)), equals(clone(xs), xs)),72 );73 property("transitivity of identity equality", dataArb, (xs) => {74 const ys = clone(xs);75 const zs = clone(xs);76 return equals(xs, ys) && equals(ys, zs) && equals(xs, zs);77 });78 property("reflexivity of value equality", dataArb, (xs) =>79 isTrue(identical(xs, clone(xs))),80 );81 property("symmetry of value equality", dataArb, (xs) =>82 isEqual(identical(xs, clone(xs)), identical(clone(xs), xs)),83 );84 property("transitivity of value equality", dataArb, (xs) => {85 const ys = clone(xs);86 const zs = clone(xs);87 return identical(xs, ys) && identical(ys, zs) && identical(xs, zs);88 });89 property(90 "associativity of a semigroup",91 dataArb,92 dataArb,93 dataArb,94 (xs, ys, zs) =>95 equals(concat(concat(xs, ys), zs), concat(xs, concat(ys, zs))),96 );97 property("right identity of a Monoid", dataArb, (xs) =>98 equals(concat(xs, empty()), uniq(xs)),99 );100 property("left identity of a Monoid", dataArb, (xs) =>101 equals(concat(empty(), xs), uniq(xs)),102 );103 property("identity of a Functor", dataArb, (xs) =>104 equals(fmap(identity, xs), xs),105 );106 property(107 "composition of a Functor",108 dataArb,109 jsc.dict(jsc.string),110 jsc.dict(jsc.string),111 (xs, x, y) => {112 const f = merge(x);113 const g = merge(y);114 return equals(115 fmap((z) => f(g(z)), xs),116 fmap(f, fmap(g, xs)),117 );118 },119 );120 property("identity of an Applicative", dataArb, (xs) =>121 equals(data.apply(data.pure(identity), xs), xs),122 );123 property(124 "homomorphism of an Applicative",125 jsc.dict(jsc.string),126 jsc.dict(jsc.string),127 (x, y) => {128 const f = merge(y);129 const lhs = data.apply(data.pure(f), data.pure(x));130 const rhs = data.pure(f(x));131 return equals(lhs, rhs);132 },133 );134 property(135 "interchange of an Applicative",136 jsc.dict(jsc.string),137 jsc.dict(jsc.string),138 (x, y) => {139 const u = data.pure(merge(y));140 const lhs = data.apply(u, data.pure(x));141 const rhs = data.apply(142 data.pure((f) => f(x)),143 u,144 );145 return equals(lhs, rhs);146 },147 );148 property(149 "composition of an Applicative",150 dataArb,151 jsc.dict(jsc.string),152 jsc.dict(jsc.string),153 (xs, x, y) => {154 const comp = (f) => (g) => (z) => f(g(z));155 const u = data.pure(merge(x));156 const v = data.pure(merge(y));157 const lhs = data.apply(data.apply(data.apply(data.pure(comp), u), v), xs);158 const rhs = data.apply(u, data.apply(v, xs));159 return equals(lhs, rhs);160 },161 );162 describe("fmap and fmapAsync", () => {163 property(164 "maps a function over a list of unit",165 dataArb,166 jsc.dict(jsc.string),167 (xs, x) => {168 const f = (y) => concatOne(y, x);169 return every(isMatch(x), fmap(f, xs));170 },171 );172 property(173 "overloaded fmapAsync to allow two type signatures",174 dataArb,175 jsc.dict(jsc.string),176 async (xs, x) => {177 const f = (y) => concatOne(y, x);178 const p = flow([f, of]);179 return equals(await fmapAsync(f, xs), await fmapAsync(p, xs));180 },181 );182 property(183 "produces the same results synchronously and asynchronously",184 dataArb,185 jsc.dict(jsc.string),186 async (xs, x) => {187 const f = (y) => concatOne(y, x);188 return equals(fmap(f, xs), await fmapAsync(f, xs));189 },190 );191 });192 describe("fmapList and fmapListAsync", () => {193 property("maps a function over a list on units of data", dataArb, (xs) => {194 const obj = {[Symbol("key")]: Symbol("value")};195 const f = (y) => list.concatOne(y, obj);196 const ys = fmapList("_sc_downloads", f, xs);197 return every(isMatch(obj), ys._sc_downloads);198 });199 property(200 "produces the same results synchronously and asynchronously",201 dataArb,202 async (xs) => {203 const obj = {[Symbol("key")]: Symbol("value")};204 const f = (y) => list.concatOne(y, obj);205 return equals(206 fmapList("_sc_downloads", f, xs),207 await fmapListAsync("_sc_downloads", f, xs),208 );209 },210 );211 });212 describe("data merging", () => {213 it("concatOne a string into an array", () => {214 const a = {key: "string"};215 const b = {key: ["other"]};216 const expected = {key: ["string", "other"]};217 const results = data.concatOne(a, b);218 results.key.should.eql(expected.key);219 });220 it("concatOne a string into an array", () => {221 const a = {key: ["string"]};222 const b = {key: "other"};223 const expected = {key: ["string", "other"]};224 const results = data.concatOne(a, b);225 results.key.should.eql(expected.key);226 });227 it("concatOne doesn't special merge two arrays", () => {228 const a = {key: ["string"]};229 const b = {key: ["other"]};230 const expected = {key: ["other"]};231 const results = data.concatOne(a, b);232 results.key.should.eql(expected.key);233 });234 it("concatOne doesn't special merge two strings", () => {235 const a = {key: "string"};236 const b = {key: "other"};237 const expected = {key: "other"};238 const results = data.concatOne(a, b);239 results.key.should.eql(expected.key);240 });241 it("concatOne takes the older fetch date from the right argument", () => {242 const now = new Date();243 const yesterday = new Date();244 yesterday.setDate(yesterday.getDate() - 1);245 const a = {_sc_pubdates: {fetch: now, other: yesterday}};246 const b = {_sc_pubdates: {fetch: yesterday, other: now}};247 const expected = {_sc_pubdates: {fetch: yesterday, other: now}};248 const results = data.concatOne(a, b);249 results._sc_pubdates.should.eql(expected._sc_pubdates);250 });251 it("concatOne takes the older fetch date from the left argument", () => {252 const now = new Date();253 const yesterday = new Date();254 yesterday.setDate(yesterday.getDate() - 1);255 const a = {_sc_pubdates: {fetch: yesterday, other: yesterday}};256 const b = {_sc_pubdates: {fetch: now, other: now}};257 const expected = {_sc_pubdates: {fetch: yesterday, other: now}};258 const results = data.concatOne(a, b);259 results._sc_pubdates.should.eql(expected._sc_pubdates);260 });261 });262});263describe("data hashing", () => {264 property("hashes a single unit", unitArb, (u) =>265 has("_sc_id_hash", hashOne(u)),266 );267 property("hashes many homonyms", dataArb, (xs) => {268 const hs = hash(xs);269 return every(has("_sc_id_hash"), hs) && every(has("_sc_content_hash"), hs);270 });...

Full Screen

Full Screen

RecursiveStructures.spec.ts

Source:RecursiveStructures.spec.ts Github

copy

Full Screen

...32 // Arrange33 const failingLength = 2;34 const dataArb: fc.Memo<unknown[]> = fc.memo((n) => {35 if (n <= 1) return fc.constant([0]);36 else return fc.oneof({ withCrossShrink: true }, fc.constant([0]), fc.tuple(dataArb(), dataArb()));37 });38 // Act39 const out = fc.check(fc.property(dataArb(5), (data) => flat(data).length < failingLength));40 // Assert41 expect(out.failed).toBe(true);42 expect(flat(out.counterexample![0])).toHaveLength(failingLength);43 });44 it('Should shrink memo/option towards the smallest case (on very simple scenario)', () => {45 // Arrange46 const failingLength = 2;47 const dataArb: fc.Memo<unknown[]> = fc.memo((n) => {48 if (n <= 1) return fc.constant([0]);49 else return fc.option(fc.tuple(dataArb(), dataArb()), { nil: [0], depthSize: 'small' });50 });51 // Act52 const out = fc.check(fc.property(dataArb(5), (data) => flat(data).length < failingLength));53 // Assert54 expect(out.failed).toBe(true);55 expect(flat(out.counterexample![0])).toHaveLength(failingLength);56 });57 it.each`58 baseSize59 ${'xsmall'}60 ${'small'}61 ${'medium'}62 ${'large'}63 ${'xlarge'}64 `(65 'Should be able to generate $baseSize simple recursive structures without reaching out-of-memory',66 ({ baseSize }) => {...

Full Screen

Full Screen

prendus-carousel-test.ts

Source:prendus-carousel-test.ts Github

copy

Full Screen

1import {asyncMap} from '../../../../src/node_modules/prendus-shared/services/utilities-service';2import {RootReducer} from '../../../../src/redux/reducers';3import {4 ITEM_CHANGED,5 ITEMS_CHANGED,6} from '../../../../src/services/constants-service';7import {8 getListener,9 randomIndex10} from '../../services/utilities-service';11const jsc = require('jsverify');12const dataArb = jsc.array(jsc.nat);13const NEXT = 'next';14const PREV = 'prev';15const STAY = 'stay';16const COMMANDS = [NEXT, PREV, STAY];17const commandArb = jsc.elements(COMMANDS);18class PrendusCarouselTest extends Polymer.Element {19 static get is() { return 'prendus-carousel-test' }20 constructor() {21 super();22 this.rootReducer = RootReducer;23 }24 prepareTests(test) {25 test('User can carousel through data', [dataArb], async (data: number[]) => {26 const carousel = this.shadowRoot.querySelector('prendus-carousel');27 const setup = getListener(ITEMS_CHANGED, carousel)28 carousel.items = data;29 await setup;30 const initial = { index: 0, item: data[0], finished: !data.length };31 if (!verifyCarousel(initial, carousel))32 return false;33 return jsc.check(carouselStopsAtBeginningAndEnd(carousel));34 });35 }36}37function carouselStopsAtBeginningAndEnd(carousel) {38 return jsc.forall(commandArb, async command => {39 const expected = getExpected(carousel, command);40 const event = getEvent(carousel, command);41 executeCommand(carousel, command);42 await event;43 const success = verifyCarousel(expected, carousel);44 return success;45 });46}47function verifyCarousel(expect, carousel): boolean {48 return carousel.index === expect.index49 && carousel.item === expect.item50 && carousel.finished === expect.finished;51}52function randomCommand(): string {53 return COMMANDS[randomIndex(COMMANDS.length)];54}55function executeCommand(carousel, command) {56 switch (command) {57 case NEXT:58 carousel.next();59 break;60 case PREV:61 carousel.previous();62 break;63 default:64 break;65 }66}67function getEvent(carousel, command): Promise {68 const index = carousel.index;69 const items = carousel.items;70 switch (command) {71 case NEXT:72 return items[index] === items[index + 1]73 ? Promise.resolve()74 : getListener(ITEM_CHANGED, carousel);75 case PREV:76 return !index || items[index] === items[index - 1]77 ? Promise.resolve()78 : getListener(ITEM_CHANGED, carousel);79 default:80 return Promise.resolve();81 }82}83function getExpected(carousel, command): object {84 const index = carousel.index;85 const items = carousel.items;86 const item = carousel.item;87 const finished = carousel.finished;88 const currentState = { index, item, finished };89 switch (command) {90 case NEXT:91 return carousel.finished92 ? currentState93 : {94 index: index + 1,95 item: items[index + 1],96 finished: index + 1 === items.length97 };98 case PREV:99 return !index100 ? currentState101 : {102 index: index - 1,103 item: items[index - 1],104 finished: false105 };106 default:107 return currentState;108 }109}...

Full Screen

Full Screen

Using AI Code Generation

copy

Full Screen

1const dataArb = require('fast-check-monorepo').dataArb;2const fc = require('fast-check');3const data = {4};5const arb = dataArb(data);6fc.assert(fc.property(arb, (d) => {7 return d.a === 1;8}));9const dataArb = require('fast-check-monorepo').dataArb;10const fc = require('fast-check');11const data = {12};13const arb = dataArb(data);14fc.assert(fc.property(arb, (d) => {15 return d.a === 1;16}));17const dataArb = require('fast-check-monorepo').dataArb;18const fc = require('fast-check');

Full Screen

Using AI Code Generation

copy

Full Screen

1const fc = require('fast-check');2const { dataArb } = require('fast-check-monorepo');3const { dataArb: dataArb2 } = require('fast-check-monorepo');4fc.assert(5 fc.property(dataArb({ a: fc.nat(), b: fc.string() }), dataArb2({ a: fc.nat(), b: fc.string() }), (d1, d2) => {6 return d1.a === d2.a && d1.b === d2.b;7 })8);

Full Screen

Using AI Code Generation

copy

Full Screen

1const fc = require("fast-check");2const dataArb = require("fast-check-monorepo").dataArb;3const data = require("./data");4const dataArb1 = dataArb(data);5fc.assert(6 fc.property(dataArb1, (d) => {7 return d.a === 1;8 })9);

Full Screen

Using AI Code Generation

copy

Full Screen

1const { dataArb } = require('fast-check');2const { dataToJSON } = require('fast-check/lib/arbitrary/DataArbitrary');3const { dataToJSONString } = require('fast-check/lib/arbitrary/DataArbitrary');4const data = dataArb({ maxDepth: 3, maxKeys: 3, maxValues: 3, withBoxedValues: true });5const data1 = dataArb({ maxDepth: 3, maxKeys: 3, maxValues: 3, withBoxedValues: true });6const data2 = dataArb({ maxDepth: 3, maxKeys: 3, maxValues: 3, withBoxedValues: true });7const data3 = dataArb({ maxDepth: 3, maxKeys: 3, maxValues: 3, withBoxedValues: true });8const data4 = dataArb({ maxDepth: 3, maxKeys: 3, maxValues: 3, withBoxedValues: true });9const data5 = dataArb({ maxDepth: 3, maxKeys: 3, maxValues: 3, withBoxedValues: true });10const data6 = dataArb({ maxDepth: 3, maxKeys: 3, maxValues: 3, withBoxedValues: true });11const data7 = dataArb({ maxDepth: 3, maxKeys: 3, maxValues: 3, withBoxedValues: true });12const data8 = dataArb({ maxDepth: 3, maxKeys: 3, maxValues: 3, withBoxedValues: true });13const data9 = dataArb({ maxDepth: 3, maxKeys: 3, maxValues: 3, withBoxedValues: true });14const data10 = dataArb({ maxDepth: 3, maxKeys: 3, maxValues: 3, withBoxedValues: true });15const data11 = dataArb({ maxDepth: 3, maxKeys: 3, maxValues: 3, withBoxedValues: true });16const data12 = dataArb({ maxDepth: 3, maxKeys: 3, maxValues: 3, withBoxedValues: true });17const data13 = dataArb({ maxDepth: 3, maxKeys: 3, max

Full Screen

Using AI Code Generation

copy

Full Screen

1const fc = require('fast-check');2fc.assert(3 fc.property(fc.dataArb(), (data) => {4 return true;5 })6);7fc.assert(8 fc.property(fc.dataArb(), (data) => {9 return true;10 }),11 {12 }13);

Full Screen

Using AI Code Generation

copy

Full Screen

1const { dataArb } = require("fast-check");2const { dataArb: dataArb2 } = require("fast-check");3const data = dataArb.arbitrary.sample();4const data2 = dataArb2.arbitrary.sample();5console.log(data);6console.log(data2);

Full Screen

Using AI Code Generation

copy

Full Screen

1const {dataArb} = require('./dataArb.js');2const {dataArb2} = require('./dataArb2.js');3const fc = require('fast-check');4const dataArb3 = dataArb2;5const dataArb4 = dataArb2;6fc.assert(7 fc.property(8 (data1, data2) => {9 return true;10 }11);12[MIT](LICENSE)

Full Screen

Using AI Code Generation

copy

Full Screen

1const dataArb = require('fast-check-monorepo').dataArb;2const fc = require('fast-check');3const data = {4};5const data2 = {6 d: {7 g: {8 }9 }10};11const data3 = {12 d: {13 g: {14 }15 },16 j: {17 m: {18 }19 }20};21const data4 = {22 d: {23 g: {24 }25 },26 j: {27 m: {28 }29 },30 p: {31 s: {32 }33 }34};35const data5 = {36 d: {37 g: {38 }39 },40 j: {41 m: {42 }43 },44 p: {45 s: {

Full Screen

Using AI Code Generation

copy

Full Screen

1const { dataArb } = require('fast-check-monorepo')2const { arbitrary } = dataArb({ minSize: 10, maxSize: 20 })3const { sample } = require('fast-check')4const { data } = sample(arbitrary)5console.log(data)6const { dataArb } = require('fast-check-monorepo')7const { arbitrary } = dataArb({ minSize: 10, maxSize: 20 })8const { sample } = require('fast-check')9const { data } = sample(arbitrary)10console.log(data)11module.exports = {12}13"scripts": {14},15[MIT](LICENSE)

Full Screen

Automation Testing Tutorials

Learn to execute automation testing from scratch with LambdaTest Learning Hub. Right from setting up the prerequisites to run your first automation test, to following best practices and diving deeper into advanced test scenarios. LambdaTest Learning Hubs compile a list of step-by-step guides to help you be proficient with different test automation frameworks i.e. Selenium, Cypress, TestNG etc.

LambdaTest Learning Hubs:

YouTube

You could also refer to video tutorials over LambdaTest YouTube channel to get step by step demonstration from industry experts.

Run fast-check-monorepo automation tests on LambdaTest cloud grid

Perform automation testing on 3000+ real desktop and mobile devices online.

Try LambdaTest Now !!

Get 100 minutes of automation test minutes FREE!!

Next-Gen App & Browser Testing Cloud

Was this article helpful?

Helpful

NotHelpful