How to use nextFlags method in fast-check-monorepo

Best JavaScript code snippet using fast-check-monorepo

patch.js

Source:patch.js Github

copy

Full Screen

1import { VNodeFlags, ChildrenFlags } from './flags'2import mount from './mount'3import options from './options'4const {5 removeChild,6 insertBefore7} = options8// 比较原则：同类比较9export default function patch(preVnode, nextVnode, container) {10 const preFlags = preVnode.flags11 const nextFlags = nextVnode.flags12 // 首先判断是否是同类vnode，同类才有比较意义，否则拆除换新13 if (preFlags & nextFlags) {14 if (preVnode.tag !== nextVnode.tag) {15 // 不是同类节点，直接替换16 mount(nextVnode, container, getRef(preVnode))17 removeChild(preVnode, container)18 } else {19 if (nextFlags & VNodeFlags.COMPONENT) {20 // 组件对比21 patchComponent(preVnode, nextVnode, container, nextFlags)22 } else if (nextFlags & VNodeFlags.TEXT_VNODE) {23 patchText(preVnode, nextVnode)24 } else if (nextFlags & VNodeFlags.FRAGMENT) {25 patchFragment(preVnode, nextVnode, container)26 } else if (nextFlags & VNodeFlags.PORTAL) {27 patchPortal(preVnode, nextVnode)28 } else {29 // 非组件时的情况30 const el = (nextVnode.el = preVnode.el)31 // 对比数据32 const preData = preVnode.data33 const nextData = nextVnode.data34 if (nextData) {35 for (let key in nextData) {36 patchData(el, key, preData[key], nextData[key])37 }38 }39 if (preData) {40 for (let key in preData) {41 const preValue = preData[key]42 if (preValue && !nextData.hasOwnProperty(key)) {43 // 删除新数据中不存在的属性44 patchData(el, key, preValue, null)45 }46 }47 }48 // 对比子节点49 patchChildren(preVnode.children, nextVnode.children, preVnode.childFlags, nextVnode.childFlags, el)50 }51 }52 } else {53 removeChild(preVnode, container)54 mount(nextVnode, container)55 }56}57const eventReg = /^on/58const domPropsReg = /^value|^checked|^selected|[A-Z]/59export function patchData(el, key, preValue, nextValue) {60 switch (key) {61 case 'style': {62 if (preValue && !nextValue) {63 for (let k in preValue) {64 el.style.removeProperty(k)65 }66 }67 if (nextValue) {68 for (let k in nextValue) {69 el.style.setProperty(k, nextValue[k])70 }71 }72 break73 }74 case 'class': {75 // 类名格式 { a: true, b: false }76 if (preValue && !nextValue) {77 for (let k in preValue) {78 preValue[k] && el.classList.remove(k)79 }80 }81 if (nextValue) {82 for (let k in nextValue) {83 nextValue[k] && el.classList.add(k)84 }85 }86 break87 }88 default: {89 if (eventReg.test(key)) {90 key = key.replace(evnetReg, '')91 if (preValue) {92 el.removeEventListener(key, preValue)93 }94 if (nextValue) {95 el.addEventListener(key, nextValue)96 }97 } else if (domPropsReg.test(key)) {98 if (preValue && !nextValue) {99 el[key] = ''100 }101 if (nextValue) {102 el[key] = nextValue103 }104 } else {105 // 普通attr106 if (preValue && !nextValue) {107 el.removeAttribute(key)108 }109 if (nextValue) {110 el.setAttribute(key, nextValue)111 }112 }113 }114 }115}116// 对比文本117function patchText(preVnode, nextVnode) {118 if (preVnode.children !== nextVnode.children) {119 const el = (nextVnode.el = preVnode.el)120 el.nodeValue = nextVnode.children121 }122}123// 对比Fragment124function patchFragment(preVnode, nextVnode, container) {125 // Fragment本质就是对比子节点，但挂载点为Fragment父节点126 const ref = getFragmentRef(preVnode)127 patchChildren(128 preVnode.children,129 nextVnode.children,130 preVnode.childFlags,131 nextVnode.childFlags,132 container,133 // 在Fragment的patch之前，Fragment中最后一个子节点的下一个元素，就是preVnode最后一个子节点的下一个元素134 // 这样做的目的是为了保证Fragment子节点的插入位置，因为不做ref标记，可能子节点在patch时会直接被插入父容器尾部135 ref136 )137 // 比较完成后设置nextValue的引用el138 const childFlags = nextVnode.childFlags139 if (childFlags & ChildrenFlags.NO_CHILDREN) {140 // 没有子节点，el用占位的空文本节点代替141 nextVnode.el = document.createTextNode('')142 } else if (childFlags & ChildrenFlags.SINGLE_CHILDREN) {143 nextVnode.el = nextVnode.children.el144 } else if (childFlags & ChildrenFlags.MULTI_CHILDREN) {145 nextVnode.el = nextVnode.children[0].el146 }147}148function getFragmentRef(vnode) {149 const childFlags = vnode.childFlags150 switch (childFlags) {151 case ChildrenFlags.NO_CHILDREN:152 return vnode.el153 case ChildrenFlags.SINGLE_CHILDREN:154 return getNextRef(vnode.children)155 case ChildrenFlags.MULTI_CHILDREN:156 return getNextRef(vnode.children[vnode.children.length - 1])157 }158}159function getNextRef(vnode) {160 return getRef(vnode).nextSibling161}162function getRef(vnode) {163 if (vnode.flags & VNodeFlags.COMPONENT) {164 if (vnode.flags & VNodeFlags.COMPONENT_STATEFUL) {165 return getRef(vnode.children._vnode)166 } else {167 return getRef(vnode.handle.next)168 }169 } else {170 return vnode.el171 }172}173function patchPortal(preVnode, nextVnode) {174 patchChildren(175 preVnode.children,176 nextVnode.children,177 preVnode.childFlags,178 nextVnode.childFlags,179 // 先在旧容器中进行更新180 preVnode.tag181 )182 nextVnode.el = preVnode.el183 // 更新完子节点后，如果新容器与旧容器不同，则转移元素184 const container = nextVnode.tag = document.querySelector(nextVnode.tag)185 if (preVnode.tag !== nextVnode.tag) {186 insertBefore(nextVnode.children, container, null)187 }188}189function patchChildren(preChildren, nextChildren, preFlags, nextFlags, container, refNext = null) {190 switch (preFlags) {191 case ChildrenFlags.NO_CHILDREN:192 switch (nextFlags) {193 case ChildrenFlags.SINGLE_CHILDREN:194 // 原本有没有节点，现在有一个子节点，直接挂载上去195 mount(nextChildren, container)196 break197 case ChildrenFlags.MULTI_CHILDREN:198 // 现在有多个子节点199 mount(nextChildren, container)200 break201 }202 break203 case ChildrenFlags.SINGLE_CHILDREN:204 switch (nextFlags) {205 case ChildrenFlags.NO_CHILDREN:206 // 原本有一个，现在没有，直接删除原本的节点207 removeChild(preChildren, container)208 break209 case ChildrenFlags.SINGLE_CHILDREN:210 // 原本有一个，现在也是一个，直接深度对比211 patch(preChildren, nextChildren, container)212 break213 case ChildrenFlags.MULTI_CHILDREN:214 // 原本是一个，现在是多个，拆除原本的，挂载新的215 removeChild(preChildren, container)216 mount(nextChildren, container)217 break218 }219 break220 case ChildrenFlags.MULTI_CHILDREN:221 switch (nextFlags) {222 case ChildrenFlags.NO_CHILDREN:223 // 原本多个，现在没有，删除原本的全部224 for (let i = 0; i < preChildren.length; i++) {225 removeChild(preChildren[i], container)226 }227 break228 case ChildrenFlags.SINGLE_CHILDREN:229 // 原本多个，现在一个，删除原本的全部，挂载新的230 for (let i = 0; i < preChildren.length; i++) {231 removeChild(preChildren[i], container)232 }233 mount(nextChildren, container)234 break235 case ChildrenFlags.MULTI_CHILDREN:236 // 前后都是多个子节点，核心diff算法237 patchMultiChildren(preChildren, nextChildren, container, refNext)238 break239 }240 break241 }242}243const NoHandle = Symbol('NoHandle')244// 算法思想：尽可能少的移动元素，即找出需要移动元素的最小数量245function patchMultiChildren(preChildren, nextChildren, container, refNext) {246 let j = 0,247 preLast = preChildren.length - 1,248 nextLast = nextChildren.length - 1249 250 // 首先处理相同的前半部分251 while (j <= preLast && j <= nextLast && preChildren[j].key === nextChildren[j].key) {252 patch(preChildren[j], nextChildren[j], container)253 j++254 }255 // 然后处理相同的后半部分256 while (preLast >= j && nextLast >= j && preChildren[preLast].key === nextChildren[nextLast].key) {257 patch(preChildren[preLast], nextChildren[nextLast], container)258 preLast--259 nextLast--260 }261 // 判断边界情况，如果 j > preLast && j <= nextLast 则说明有新增的节点262 if (j > preLast && j <= nextLast) {263 for (let i = nextLast; i >= j; i--) {264 const refEl = nextChildren[i + 1] && getRef(nextChildren[i + 1]) || refNext265 mount(nextChildren[i], container, refEl)266 }267 } else if (j <= preLast && j > nextLast) {268 // 有旧节点需要删除269 for (let i = j; j <= preLast; j++) {270 removeChild(preChildren[i], container)271 }272 } else {273 // 从 j ~ nextLast 中找到最长递增子序列，最长递增子序列就是不需要移动的元素，其余元素需要增加或移动，这样可以保证操作数量达到最小274 const nextSeq = new Array(nextLast - j + 1)275 // 填充-1表示没有在旧列表找到匹配元素276 nextSeq.fill(-1)277 // 建立新列表map，方便旧列表查找可复用索引278 const nextIndexMap = Object.create(null)279 for (let i = j; i <= nextLast; i++) {280 nextIndexMap[nextChildren[i].key] = i - j281 }282 // 遍历旧列表，查看元素是否可以复用283 let reverseFlag = false,284 lastMaxIndex = 0285 for (let i = j; i <= preLast; i++) {286 const finded = nextIndexMap[preChildren[i].key]287 if (typeof finded !== 'undefined') {288 // 如果可以找到匹配的，需要判断是否存在逆序，如果存在逆序，则需要调整元素位置关系289 if (finded < lastMaxIndex) {290 reverseFlag = true291 } else {292 lastMaxIndex = finded293 }294 // 为新列表的匹配列表增加映射295 nextSeq[finded] = i - j296 // 找到匹配元素应该进行patch297 patch(preChildren[i], nextChildren[finded + j], container)298 } else {299 // 如果未在新列表找到匹配的，则直接删除即可300 removeChild(preChildren[i], container)301 }302 }303 // 如果有逆序，利用nextSeq求出最长递增子序列，并做上不需要处理的标记304 reverseFlag && getLongestIncreacingSubSeq(nextSeq, NoHandle)305 // 处理后最长递增子序列已做上NoHandle标记306 for (let i = nextSeq.length - 1; i >= 0; i--) {307 if (nextSeq[i] === NoHandle) {308 continue309 } else if (nextSeq[i] === -1) {310 // 代表需要挂载的新元素311 const refEl = nextChildren[i + j + 1] && getRef(nextChildren[i + j + 1]) || refNext312 mount(nextChildren[i + j], container, refEl)313 } else {314 // 需要调整位置的元素315 const refEl = nextChildren[i + j + 1] && getRef(nextChildren[i + j + 1]) || refNext316 insertBefore(nextChildren[i + j], container, refEl)317 }318 }319 }320}321function getLongestIncreacingSubSeq(nextSeq, NoHandle) {322 // res记录以每一位结尾的最大长度323 const res = new Array(nextSeq.length)324 res.fill(1)325 // greedyLen[i] 存储子序列长度为i的最后一位的最小值326 const greedyLen = new Array(nextSeq.length)327 greedyLen.fill(0)328 greedyLen[0] = -1329 let len = 0, maxEndIdx330 // 求出每一位最大能接到长度为几的序列后331 for (let i = 0; i < nextSeq.length; i++) {332 if (nextSeq[i] === -1) continue333 let l = 0, r = len, mid334 while (l < r) {335 mid = l + r + 1 >> 1336 if (greedyLen[mid] < nextSeq[i]) {337 l = mid338 } else {339 r = mid - 1340 }341 }342 greedyLen[l + 1] = nextSeq[i]343 res[i] = l + 1344 if (l + 1 > len) {345 len = l + 1346 maxEndIdx = i347 }348 }349 // 开始对最大序列标记350 while (len) {351 while (res[maxEndIdx] !== len) maxEndIdx--352 nextSeq[maxEndIdx] = NoHandle353 len--354 }355}356function patchComponent(preVnode, nextVnode, container, flags) {357 // 组件更新原理就是更新组件数据，剩下流程交给组件本身358 if (flags & VNodeFlags.COMPONENT_STATEFUL) {359 const instance = nextVnode.children = preVnode.children360 instance._update()361 } else {362 const handle = nextVnode.handle = preVnode.handle363 handle.update()364 }...

Full Screen

Full Screen

ProjectFilter.js

Source:ProjectFilter.js Github

copy

Full Screen

1import React, {useEffect, useState} from "react";2import PropTypes from 'prop-types';3import ProjectFilterLabel from "../ProjectFilterLabel/ProjectFilterLabel";4import {DEFAULT_ANIMATION_DELAY, PROJECTS_MODE} from "../../../constants/settings";5import {useAnimationList} from "../../../utils/hooks";6import "./ProjectFilter.scss";7function ProjectFilter({techList, setFilteredValues}) {8 const [all, setAll] = useState(true);9 const [flags, setFlags] = useState(Array(techList.length).fill(false));10 const delays = Array(flags.length + 1).fill(0).map((value, index) => DEFAULT_ANIMATION_DELAY + 50 * (index + 1));11 const labelsInline = useAnimationList(PROJECTS_MODE, "label_rise", delays);12 useEffect(() => {13 if (all) {14 setFilteredValues(techList);15 } else {16 setFilteredValues(techList.filter((tech, index) => flags[index]));17 }18 }, [all, flags, setFilteredValues]);19 const allClickHandler = () => {20 setAll(true);21 setFlags(Array(techList.length).fill(false));22 }23 const techClickHandler = tech => {24 let nextFlags = flags.map((flag, index) => techList[index] === tech ? !flag : flag);25 const nextAll = !nextFlags.some(f => f) || nextFlags.every(f => f);26 if (nextAll) nextFlags = Array(techList.length).fill(false);27 setAll(nextAll);28 setFlags(nextFlags);29 }30 return (31 <ul className="project_filter">32 <ProjectFilterLabel33 tech="Все технологии"34 hasSelected={all}35 clickHandler={allClickHandler}36 labelInline={labelsInline[0]}37 />38 {techList.map((tech, index) =>39 <ProjectFilterLabel40 key={tech}41 tech={tech}42 hasSelected={flags[index]}43 clickHandler={() => techClickHandler(tech)}44 labelInline={labelsInline[index + 1]}45 />46 )}47 </ul>48 );49}50ProjectFilter.propTypes = {51 techList: PropTypes.arrayOf(PropTypes.string),52 setFilteredValues: PropTypes.func53}...

Full Screen

Full Screen

patch.ts

Source:patch.ts Github

copy

Full Screen

1import { VNodeFlags } from '../shared/flags'2import { RenderKit } from '../shared/render-kit'3import { VNode } from '../shared/types'4import { patchAngularComponent } from './angular-component'5import { patchClassComponent } from './class-component'6import { patchFunctionComponent } from './function-component'7import { patchIntrinsic } from './intrinsic'8import { mount } from './mount'9import { detach, parentNodeOf } from './render'10import { patchText } from './text'11import { unmount } from './unmount'12import { patchVoid } from './void'13export function patch(kit: RenderKit, lastVNode: VNode, nextVNode: VNode): void {14 const nextFlags = nextVNode.flags15 if (lastVNode.flags !== nextVNode.flags || lastVNode.type !== nextVNode.type || lastVNode.key !== nextVNode.key) {16 replaceWithNewNode(kit, lastVNode, nextVNode)17 } else if (nextFlags & VNodeFlags.Intrinsic) {18 patchIntrinsic(kit, lastVNode, nextVNode)19 } else if (nextFlags & VNodeFlags.ClassComponent) {20 patchClassComponent(kit, lastVNode, nextVNode)21 } else if (nextFlags & VNodeFlags.FunctionComponent) {22 patchFunctionComponent(kit, lastVNode, nextVNode)23 } else if (nextFlags & VNodeFlags.Text) {24 patchText(kit, lastVNode, nextVNode)25 } else if (nextFlags & VNodeFlags.Void) {26 patchVoid(lastVNode, nextVNode)27 } else if (nextFlags & VNodeFlags.AngularComponent) {28 patchAngularComponent(kit, lastVNode, nextVNode)29 } else {30 throw new Error(`Unsupported node type ${nextVNode.type}`)31 }32}33function replaceWithNewNode(kit: RenderKit, lastVNode: VNode, nextVNode: VNode): void {34 const lastNode = lastVNode.native35 let container: Element36 if (lastNode == null || (container = parentNodeOf(kit, lastNode)) == null) {37 return38 }39 unmount(kit, lastVNode)40 mount(kit, nextVNode, container, lastNode)41 detach(kit, lastNode)...

Full Screen

Full Screen

Using AI Code Generation

copy

Full Screen

1const { nextFlags } = require('fast-check');2const flags = nextFlags();3console.log(flags);4{5 "dependencies": {6 }7}8{ noShrink: false, interruptAfterTimeLimit: false, interruptAfterTimeLimitMs: 1000, interruptAfterMaxTimeLimit: false, interruptAfterMaxTimeLimitMs: 10000, interruptAfterMaxTimeLimitPerProperty: false, interruptAfterMaxTimeLimitPerPropertyMs: 1000, interruptAfterNumberOfTries: false, interruptAfterNumberOfTriesLimit: 100, interruptAfterNumberOfTriesPerProperty: false, interruptAfterNumberOfTriesPerPropertyLimit: 10, interruptAfterNumberOfTriesPerPropertyPerRun: false, interruptAfterNumberOfTriesPerPropertyPerRunLimit: 10, interruptAfterNumberOfShrinks: false, interruptAfterNumberOfShrinksLimit: 100, interruptAfterNumberOfShrinksPerProperty: false, interruptAfterNumberOfShrinksPerPropertyLimit: 10, interruptAfterNumberOfShrinksPerPropertyPerRun: false, interruptAfterNumberOfShrinksPerPropertyPerRunLimit: 10, interruptAfterNumberOfRuns: false, interruptAfterNumberOfRunsLimit: 100, interruptAfterNumberOfRunsPerProperty: false, interruptAfterNumberOfRunsPerPropertyLimit: 10, interruptAfterNumberOfRunsPerPropertyPerRun: false, interruptAfterNumberOfRunsPerPropertyPerRunLimit: 10, interruptAfterNumberOfSkips: false, interruptAfterNumberOfSkipsLimit: 100, interruptAfterNumberOfSkipsPerProperty: false, interruptAfterNumberOfSkipsPerPropertyLimit: 10, interruptAfterNumberOfSkipsPerPropertyPerRun: false, interruptAfterNumberOfSkipsPerPropertyPerRunLimit: 10, interruptAfterNumberOfDiscarded: false, interruptAfterNumberOfDiscardedLimit: 100, interruptAfterNumberOfDiscardedPerProperty: false, interruptAfterNumberOfDiscardedPerPropertyLimit: 10, interruptAfterNumberOfDiscardedPerPropertyPerRun: false, interruptAfterNumberOfDiscardedPerPropertyPerRunLimit: 10, interruptAfterNumberOfDiscardedPerRun: false

Full Screen

Full Screen

Using AI Code Generation

copy

Full Screen

1const fc = require('fast-check');2const { nextFlags } = require('fast-check/lib/arbitrary/_internals/NextArbitraryHelpers');3const { array } = require('fast-check/lib/arbitrary/array');4const { tuple } = require('fast-check/lib/arbitrary/tuple');5const arb = array(tuple(array(fc.integer()), array(fc.integer())));6const flags = nextFlags(arb, 1000);7console.log(flags);8const fc = require('fast-check');9const { nextFlags } = require('fast-check/lib/arbitrary/_internals/NextArbitraryHelpers');10const { array } = require('fast-check/lib/arbitrary/array');11const { tuple } = require('fast-check/lib/arbitrary/tuple');12const arb = array(tuple(array(fc

Full Screen

Full Screen

Using AI Code Generation

copy

Full Screen

1const fc = require('fast-check');2const { nextFlags } = require('fast-check/lib/check/runner/flags/NextFlags.js');3const flags = nextFlags();4console.log(flags);5const fc = require('fast-check');6const { nextFlags } = require('fast-check/lib/check/runner/flags/NextFlags.js');7const flags = nextFlags();8console.log(flags);9const fc = require('fast-check');10const { nextFlags } = require('fast-check/lib/check/runner/flags/NextFlags.js');11const flags = nextFlags();12console.log(flags);13const fc = require('fast-check');14const { nextFlags } = require('fast-check/lib/check/runner/flags/NextFlags.js');15const flags = nextFlags();16console.log(flags);17const fc = require('fast-check');18const { nextFlags } = require('fast-check/lib/check/runner/flags/NextFlags.js');19const flags = nextFlags();20console.log(flags);21const fc = require('fast-check');22const { nextFlags } = require('fast-check/lib/check/runner/flags/NextFlags.js');23const flags = nextFlags();24console.log(flags);25const fc = require('fast-check');26const { nextFlags } = require('fast-check/lib/check/runner/flags/NextFlags.js');27const flags = nextFlags();28console.log(flags);

Full Screen

Full Screen

Using AI Code Generation

copy

Full Screen

1const { nextFlags } = require('fast-check/lib/check/arbitrary/NextArbitrary');2const flags = nextFlags(0);3const flags = nextFlags(1);4const flags = nextFlags(2);5const flags = nextFlags(3);6const flags = nextFlags(4);7const flags = nextFlags(5);8const flags = nextFlags(6);9const flags = nextFlags(7);10const flags = nextFlags(8);11const { nextFlags } = require('fast-check/lib/check/arbitrary/NextArbitrary');12const flags = nextFlags(0);13const flags = nextFlags(1);

Full Screen

Full Screen

Using AI Code Generation

copy

Full Screen

1const fc = require('fast-check');2fc.check(3 fc.property(fc.integer(), (n) => {4 if (n >= 0) {5 return true;6 }7 return false;8 }),9 {10 nextFlags: function (flags) {11 return {12 };13 },14 }15);16const fc = require('fast-check');17fc.check(18 fc.property(fc.integer(), (n) => {19 if (n >= 0) {20 return true;21 }22 return false;23 }),24 {25 nextFlags: function (flags) {26 return {27 };28 },29 }30);

Full Screen

Full Screen

Using AI Code Generation

copy

Full Screen

1const { nextFlags } = require('fast-check-monorepo')2const { run } = require('./run')3const flags = nextFlags()4run(flags)5const { run } = require('fast-check-monorepo')6const run = (flags) => {7 console.log(flags)8}9module.exports = { run }

Full Screen

Full Screen

Using AI Code Generation

copy

Full Screen

1const fc = require('fast-check');2const nextFlags = require('fast-check-monorepo').nextFlags;3const flags = nextFlags();4console.log(flags);5{ flags: '--expose-gc --max_old_space_size=4096', command: 'node' }6const { spawn } = require('child_process');7const child = spawn('node', ['--expose-gc', '--max_old_space_size=4096', 'test.js']);8child.stdout.on('data', (data) => {9 console.log(`stdout: ${data}`);10});11child.stderr.on('data', (data) => {12 console.error(`stderr: ${data}`);13});14child.on('close', (code) => {15 console.log(`child process exited with code ${code}`);16});17const { exec } = require('child_process');18exec(`node ${flags.flags} test.js`, (error, stdout, stderr) => {19 if (error) {20 console.error(`exec error: ${error}`);21 return;22 }23 console.log(`stdout: ${stdout}`);24 console.error(`stderr: ${stderr}`);25});

Full Screen

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.

... View sample repo... View DocumentationSign up Free
›
_

Try LambdaTest Now !!

Get 100 minutes of automation test minutes FREE!!

...
Sign up with GoogleSign up with Email
Next-Gen App & Browser Testing Cloud

Was this article helpful?

Helpful

NotHelpful