Best JavaScript code snippet using fast-check-monorepo
AABB.test.ts
Source:AABB.test.ts
1import { AABB } from './AABB'2import { Ray } from './Ray'3import { Vec3 } from '../math/Vec3'4import { Quaternion } from '../math/Quaternion'5import { Transform } from '../math/Transform'6describe('AABB', () => {7 test('construct', () => {8 const a = new AABB()9 expect(a).toBeDefined()10 })11 test('setFromPoints', () => {12 const a = new AABB()13 const points = [14 new Vec3(7, 0, 1),15 new Vec3(2, -1, 5),16 new Vec3(-1, -7, 0),17 new Vec3(4, 5, -9),18 new Vec3(-5, 8, 2),19 new Vec3(-3, -2, -1),20 new Vec3(5, 3, 6),21 ]22 expect(a.setFromPoints(points)).toBe(a)23 expect(a).toMatchObject(24 new AABB({25 lowerBound: new Vec3(-5, -7, -9),26 upperBound: new Vec3(7, 8, 6),27 })28 )29 const position = new Vec3(1, 2, 3)30 a.setFromPoints(points, position)31 expect(a).toMatchObject(32 new AABB({33 lowerBound: new Vec3(-4, -5, -6),34 upperBound: new Vec3(8, 10, 9),35 })36 )37 const quaternion = new Quaternion().setFromAxisAngle(new Vec3(1, 0, 0), Math.PI)38 a.setFromPoints(points, position, quaternion)39 expect(a).toMatchObject(40 new AABB({41 lowerBound: new Vec3(-4, -6, -3),42 upperBound: new Vec3(8, 9, 12),43 })44 )45 const skinSize = 146 a.setFromPoints(points, position, quaternion, skinSize)47 expect(a).toMatchObject(48 new AABB({49 lowerBound: new Vec3(-5, -7, -4),50 upperBound: new Vec3(9, 10, 13),51 })52 )53 })54 test('copy', () => {55 const a = new AABB()56 const b = new AABB()57 a.upperBound.set(1, 2, 3)58 a.lowerBound.set(4, 5, 6)59 expect(b.copy(a)).toBe(b)60 expect(b).toMatchObject(a)61 expect(b).not.toBe(a)62 })63 test('clone', () => {64 const a = new AABB({65 lowerBound: new Vec3(-1, -2, -3),66 upperBound: new Vec3(1, 2, 3),67 })68 const b = a.clone()69 expect(a).not.toBe(b)70 expect(b).toMatchObject(a)71 })72 test('extend', () => {73 const a = new AABB({74 lowerBound: new Vec3(-1, -1, -1),75 upperBound: new Vec3(1, 1, 1),76 })77 const b = new AABB({78 lowerBound: new Vec3(-2, -2, -2),79 upperBound: new Vec3(2, 2, 2),80 })81 a.extend(b)82 expect(a).toMatchObject(b)83 const c = new AABB({84 lowerBound: new Vec3(-1, -1, -1),85 upperBound: new Vec3(1, 1, 1),86 })87 const d = new AABB({88 lowerBound: new Vec3(-2, -2, -2),89 upperBound: new Vec3(2, 2, 2),90 })91 d.extend(c)92 expect(d.lowerBound).toMatchObject(new Vec3(-2, -2, -2))93 expect(d.upperBound).toMatchObject(new Vec3(2, 2, 2))94 const e = new AABB({95 lowerBound: new Vec3(-2, -1, -1),96 upperBound: new Vec3(2, 1, 1),97 })98 const f = new AABB({99 lowerBound: new Vec3(-1, -1, -1),100 upperBound: new Vec3(1, 1, 1),101 })102 f.extend(e)103 expect(e.lowerBound).toMatchObject(new Vec3(-2, -1, -1))104 expect(e.upperBound).toMatchObject(new Vec3(2, 1, 1))105 const g = new AABB({106 lowerBound: new Vec3(-5, -3, -2),107 upperBound: new Vec3(-3, -1, -1),108 })109 const h = new AABB({110 lowerBound: new Vec3(-2, -5, -1.5),111 upperBound: new Vec3(2, -2, 5),112 })113 g.extend(h)114 expect(g.lowerBound).toMatchObject(new Vec3(-5, -5, -2))115 expect(g.upperBound).toMatchObject(new Vec3(2, -1, 5))116 })117 test('overlaps', () => {118 const a = new AABB()119 const b = new AABB()120 //Same aabb121 a.lowerBound.set(-1, -1, 0)122 a.upperBound.set(1, 1, 0)123 b.lowerBound.set(-1, -1, 0)124 b.upperBound.set(1, 1, 0)125 expect(a.overlaps(b)).toBe(true)126 //Corner overlaps127 b.lowerBound.set(1, 1, 0)128 b.upperBound.set(2, 2, 0)129 expect(a.overlaps(b)).toBe(true)130 //Separate131 b.lowerBound.set(1.1, 1.1, 0)132 expect(a.overlaps(b)).toBe(false)133 //fully inside134 b.lowerBound.set(-0.5, -0.5, 0)135 b.upperBound.set(0.5, 0.5, 0)136 expect(a.overlaps(b)).toBe(true)137 b.lowerBound.set(-1.5, -1.5, 0)138 b.upperBound.set(1.5, 1.5, 0)139 expect(a.overlaps(b)).toBe(true)140 //Translated141 b.lowerBound.set(-3, -0.5, 0)142 b.upperBound.set(-2, 0.5, 0)143 expect(a.overlaps(b)).toBe(false)144 })145 test('volume', () => {146 const a = new AABB({147 lowerBound: new Vec3(-1, -2, -3),148 upperBound: new Vec3(1, 2, 3),149 })150 expect(a.volume()).toBe(2 * 4 * 6)151 })152 test('contains', () => {153 const a = new AABB()154 const b = new AABB()155 a.lowerBound.set(-1, -1, -1)156 a.upperBound.set(1, 1, 1)157 b.lowerBound.set(-1, -1, -1)158 b.upperBound.set(1, 1, 1)159 expect(a.contains(b)).toBe(true)160 a.lowerBound.set(-2, -2, -2)161 a.upperBound.set(2, 2, 2)162 expect(a.contains(b)).toBe(true)163 b.lowerBound.set(-3, -3, -3)164 b.upperBound.set(3, 3, 3)165 expect(a.contains(b)).toBe(false)166 a.lowerBound.set(0, 0, 0)167 a.upperBound.set(2, 2, 2)168 b.lowerBound.set(-1, -1, -1)169 b.upperBound.set(1, 1, 1)170 expect(a.contains(b)).toBe(false)171 })172 test('toLocalFrame', () => {173 const worldAABB = new AABB()174 const localAABB = new AABB()175 const frame = new Transform()176 worldAABB.lowerBound.set(-1, -1, -1)177 worldAABB.upperBound.set(1, 1, 1)178 //No transform - should stay the same179 worldAABB.toLocalFrame(frame, localAABB)180 expect(localAABB).toMatchObject(worldAABB)181 //Some translation182 frame.position.set(-1, 0, 0)183 worldAABB.toLocalFrame(frame, localAABB)184 expect(localAABB).toMatchObject(185 new AABB({186 lowerBound: new Vec3(0, -1, -1),187 upperBound: new Vec3(2, 1, 1),188 })189 )190 })191 test('toWorldFrame', () => {192 const localAABB = new AABB()193 const worldAABB = new AABB()194 const frame = new Transform()195 localAABB.lowerBound.set(-1, -1, -1)196 localAABB.upperBound.set(1, 1, 1)197 //No transform - should stay the same198 localAABB.toLocalFrame(frame, worldAABB)199 expect(localAABB).toMatchObject(worldAABB)200 //Some translation on the frame201 frame.position.set(1, 0, 0)202 localAABB.toWorldFrame(frame, worldAABB)203 expect(worldAABB).toMatchObject(204 new AABB({205 lowerBound: new Vec3(0, -1, -1),206 upperBound: new Vec3(2, 1, 1),207 })208 )209 })...
slots.ts
Source:slots.ts
1import dayjs, { Dayjs } from "dayjs";2import timezone from "dayjs/plugin/timezone";3import utc from "dayjs/plugin/utc";4dayjs.extend(utc);5dayjs.extend(timezone);6type WorkingHour = {7 days: number[];8 startTime: number;9 endTime: number;10};11type GetSlots = {12 inviteeDate: Dayjs;13 frequency: number;14 workingHours: WorkingHour[];15 minimumBookingNotice?: number;16 organizerTimeZone: string;17};18type Boundary = {19 lowerBound: number;20 upperBound: number;21};22const freqApply = (cb, value: number, frequency: number): number => cb(value / frequency) * frequency;23const intersectBoundary = (a: Boundary, b: Boundary) => {24 if (a.upperBound < b.lowerBound || a.lowerBound > b.upperBound) {25 return;26 }27 return {28 lowerBound: Math.max(b.lowerBound, a.lowerBound),29 upperBound: Math.min(b.upperBound, a.upperBound),30 };31};32// say invitee is -60,1380, and boundary is -120,240 - the overlap is -60,24033const getOverlaps = (inviteeBoundary: Boundary, boundaries: Boundary[]) =>34 boundaries.map((boundary) => intersectBoundary(inviteeBoundary, boundary)).filter(Boolean);35const organizerBoundaries = (36 workingHours: [],37 inviteeDate: Dayjs,38 inviteeBounds: Boundary,39 organizerTimeZone40): Boundary[] => {41 const boundaries: Boundary[] = [];42 const startDay: number = +inviteeDate.startOf("d").add(inviteeBounds.lowerBound, "minutes").format("d");43 const endDay: number = +inviteeDate.startOf("d").add(inviteeBounds.upperBound, "minutes").format("d");44 workingHours.forEach((item) => {45 const lowerBound: number = item.startTime - dayjs().tz(organizerTimeZone).utcOffset();46 const upperBound: number = item.endTime - dayjs().tz(organizerTimeZone).utcOffset();47 if (startDay !== endDay) {48 if (inviteeBounds.lowerBound < 0) {49 // lowerBound edges into the previous day50 if (item.days.includes(startDay)) {51 boundaries.push({ lowerBound: lowerBound - 1440, upperBound: upperBound - 1440 });52 }53 if (item.days.includes(endDay)) {54 boundaries.push({ lowerBound, upperBound });55 }56 } else {57 // upperBound edges into the next day58 if (item.days.includes(endDay)) {59 boundaries.push({ lowerBound: lowerBound + 1440, upperBound: upperBound + 1440 });60 }61 if (item.days.includes(startDay)) {62 boundaries.push({ lowerBound, upperBound });63 }64 }65 } else {66 if (item.days.includes(startDay)) {67 boundaries.push({ lowerBound, upperBound });68 }69 }70 });71 return boundaries;72};73const inviteeBoundary = (startTime: number, utcOffset: number, frequency: number): Boundary => {74 const upperBound: number = freqApply(Math.floor, 1440 - utcOffset, frequency);75 const lowerBound: number = freqApply(Math.ceil, startTime - utcOffset, frequency);76 return {77 lowerBound,78 upperBound,79 };80};81const getSlotsBetweenBoundary = (frequency: number, { lowerBound, upperBound }: Boundary) => {82 const slots: Dayjs[] = [];83 for (let minutes = 0; lowerBound + minutes <= upperBound - frequency; minutes += frequency) {84 slots.push(85 dayjs86 .utc()87 .startOf("d")88 .add(lowerBound + minutes, "minutes")89 );90 }91 return slots;92};93const getSlots = ({94 inviteeDate,95 frequency,96 minimumBookingNotice,97 workingHours,98 organizerTimeZone,99}: GetSlots): Dayjs[] => {100 // current date in invitee tz101 const currentDate = dayjs().utcOffset(inviteeDate.utcOffset());102 const startDate = currentDate.add(minimumBookingNotice, "minutes"); // + minimum notice period103 const startTime = startDate.isAfter(inviteeDate)104 ? // block out everything when inviteeDate is less than startDate105 startDate.diff(inviteeDate, "day") > 0106 ? 1440107 : startDate.hour() * 60 + startDate.minute()108 : 0;109 const inviteeBounds = inviteeBoundary(startTime, inviteeDate.utcOffset(), frequency);110 return getOverlaps(111 inviteeBounds,112 organizerBoundaries(workingHours, inviteeDate, inviteeBounds, organizerTimeZone)113 )114 .reduce((slots, boundary: Boundary) => [...slots, ...getSlotsBetweenBoundary(frequency, boundary)], [])115 .map((slot) =>116 slot.utcOffset(inviteeDate.utcOffset()).month(inviteeDate.month()).date(inviteeDate.date())117 );118};...
Using AI Code Generation
1const fc = require('fast-check');2const { lowerBound } = require('fast-check-monorepo');3fc.assert(4 fc.property(fc.integer(), fc.integer(), (a, b) => {5 return lowerBound(a, b) === Math.max(a, b);6 })7);8const fc = require('fast-check');9const { lowerBound } = require('fast-check-monorepo');10fc.assert(11 fc.property(fc.integer(), fc.integer(), (a, b) => {12 return lowerBound(a, b) === Math.max(a, b);13 })14);15const fc = require('fast-check');16const { lowerBound } = require('fast-check-monorepo');17fc.assert(18 fc.property(fc.integer(), fc.integer(), (a, b) => {19 return lowerBound(a, b) === Math.max(a, b);20 })21);22const fc = require('fast-check');23const { lowerBound } = require('fast-check-monorepo');24fc.assert(25 fc.property(fc.integer(), fc.integer(), (a, b) => {26 return lowerBound(a, b) === Math.max(a, b);27 })28);29const fc = require('fast-check');30const { lowerBound } = require('fast-check-monorepo');31fc.assert(32 fc.property(fc.integer(), fc.integer(), (a, b) => {33 return lowerBound(a, b) === Math.max(a, b);34 })35);36const fc = require('fast-check');37const { lowerBound } = require('fast-check-monorepo');38fc.assert(39 fc.property(fc.integer(), fc.integer(), (a, b) => {40 return lowerBound(a, b) === Math.max(a, b);41 })42);43const fc = require('fast-check');44const { lowerBound } = require('fast-check-monorepo');
Using AI Code Generation
1const { lowerBound } = require('fast-check');2const { property } = require('fast-check');3const isSorted = (arr) => {4 for (let i = 1; i < arr.length; i++) {5 if (arr[i - 1] > arr[i]) return false;6 }7 return true;8};9property([lowerBound], (arr) => {10 return isSorted(arr);11}).check({ numRuns: 1000 });12const { property } = require('fast-check');13property([string], (str) => {14 return str === str;15}).check({ numRuns: 1000 });
Using AI Code Generation
1const { lowerBound } = require('fast-check');2console.log(lowerBound(1, 10, (n) => n > 5));3console.log(lowerBound(1, 10, (n) => n > 10));4const { upperBound } = require('fast-check');5console.log(upperBound(1, 10, (n) => n > 5));6console.log(upperBound(1, 10, (n) => n > 10));7const { median } = require('fast-check');8console.log(median(1, 10, (n) => n > 5));9console.log(median(1, 10, (n) => n > 10));10const { find } = require('fast-check');11console.log(find(1, 10, (n) => n > 5));12console.log(find(1, 10, (n) => n > 10));13const { findLast } = require('fast-check');14console.log(findLast(1, 10, (n) => n > 5));15console.log(findLast(1, 10, (n) => n > 10));16const { findIndex } = require('fast-check');17console.log(findIndex(1, 10, (n) => n > 5));18console.log(findIndex(1, 10, (n) => n > 10));19const { findLastIndex } = require('fast-check');20console.log(findLastIndex(1, 10, (n) => n >
Using AI Code Generation
1import { lowerBound } from 'fast-check/lib/esm/check/arbitrary/utils/LowerBound';2const lowerBoundOfArray = lowerBound([1, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 5], 3);3console.log(lowerBoundOfArray);4import { lowerBound } from 'fast-check/lib/esm/check/arbitrary/utils/LowerBound';5const lowerBoundOfArray = lowerBound([1, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 5], 3);6console.log(lowerBoundOfArray);
Using AI Code Generation
1import { lowerBound } from 'fast-check'2const lower = lowerBound(1, 5, 10)3console.log(lower)4import { upperBound } from 'fast-check'5const upper = upperBound(1, 5, 10)6console.log(upper)7import { fullString } from 'fast-check'8const full = fullString()9console.log(full)10import { hexaString } from 'fast-check'11const hexa = hexaString()12console.log(hexa)13import { ipV4 } from 'fast-check'14const ip = ipV4()15console.log(ip)16import { ipV6 } from 'fast-check'17const ip = ipV6()18console.log(ip)19import { ipV4Extended } from 'fast-check'20const ip = ipV4Extended()21console.log(ip)22import { ipV6Extended } from 'fast-check'23const ip = ipV6Extended()24console.log(ip)25import { ipV4Mapped } from 'fast-check'26const ip = ipV4Mapped()27console.log(ip)
Using AI Code Generation
1const fc = require('fast-check');2const lowerBound = require('fast-check-monorepo').lowerBound;3const { integer } = require('fast-check');4const lowerBoundTest = lowerBound(integer(0, 100), integer(0, 100), integer(0, 100));5fc.assert(fc.property(lowerBoundTest, ([a, b, c]) => a <= b && b <= c));6✓ [0, 0, 0] passed after 1 tests (1ms)7fast-check official GitHub Contributors Graph (2 years)8fast-check official GitHub Contributors Graph (1 year)9fast-check official GitHub Contributors Graph (4 weeks)10fast-check official GitHub Contributors Graph (1 week)11fast-check official GitHub Contributors Graph (2 days)12fast-check official GitHub Contributors Graph (1 day)13fast-check official GitHub Contributors Graph (12 hours)14fast-check official GitHub Contributors Graph (6 hours)15fast-check official GitHub Contributors Graph (1 hour)16fast-check official GitHub Contributors Graph (30 minutes)17fast-check official GitHub Contributors Graph (15 minutes)18fast-check official GitHub Contributors Graph (5 minutes)19fast-check official GitHub Contributors Graph (1 minute)20fast-check official GitHub Contributors Graph (30 seconds)21fast-check official GitHub Contributors Graph (15 seconds)22fast-check official GitHub Contributors Graph (5 seconds)23fast-check official GitHub Contributors Graph (1 second)24fast-check official GitHub Contributors Graph (now)
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.
You could also refer to video tutorials over LambdaTest YouTube channel to get step by step demonstration from industry experts.
Get 100 minutes of automation test minutes FREE!!