Best JavaScript code snippet using fast-check-monorepo
drawprimitives.js
Source:drawprimitives.js
1// Copyright (c) 2009-2013 Turbulenz Limited2/*global TurbulenzEngine: false */3var DrawPrimitives = (function () {4 function DrawPrimitives() {5 this.rectPositionsParameters = {6 numVertices: 4,7 attributes: ['SHORT2'],8 dynamic: true9 };10 this.rectSemanticsParameters = ['POSITION'];11 this.rectNumVertices = 4;12 this.rectTexPositionsParameters = {13 numVertices: 4,14 attributes: ['SHORT2', 'SHORT2'],15 dynamic: true16 };17 this.rectTexSemanticsParameters = ['POSITION', 'TEXCOORD0'];18 this.rectTexNumVertices = 4;19 this.boxPositionsParameters = {20 numVertices: 36,21 attributes: ['FLOAT3'],22 dynamic: true23 };24 this.boxSemanticsParameters = ['POSITION'];25 this.boxNumVertices = 36;26 }27 DrawPrimitives.prototype.initalize = function (gd, shaderPath) {28 this.device = gd;29 this.boxPrimitive = gd.PRIMITIVE_TRIANGLES;30 this.boxPositions = gd.createVertexBuffer(this.boxPositionsParameters);31 this.boxSemantics = gd.createSemantics(this.boxSemanticsParameters);32 this.rectPrimitive = gd.PRIMITIVE_TRIANGLE_STRIP;33 this.rectPositions = gd.createVertexBuffer(this.rectPositionsParameters);34 this.rectSemantics = gd.createSemantics(this.rectSemanticsParameters);35 this.rectTexPrimitive = gd.PRIMITIVE_TRIANGLE_STRIP;36 this.rectTexPositions = gd.createVertexBuffer(this.rectTexPositionsParameters);37 this.rectTexSemantics = gd.createSemantics(this.rectTexSemanticsParameters);38 debug.assert((this.boxPositions && this.rectPositions && this.rectTexPositions), "Buffers not created.");39 if (this.boxPositions && this.rectPositions && this.rectTexPositions) {40 var that = this;41 var fileName = shaderPath + this.shaderName;42 TurbulenzEngine.request(fileName, function shaderReceivedFn(shaderText) {43 if (shaderText) {44 var shaderParameters = JSON.parse(shaderText);45 var shader = gd.createShader(shaderParameters);46 if (shader) {47 that.technique = shader.getTechnique(that.techniqueName);48 }49 }50 });51 }52 };53 DrawPrimitives.prototype.setTechnique = function (technique, isTechnique2D) {54 this.technique = technique;55 this.isTechnique2D = isTechnique2D;56 };57 DrawPrimitives.prototype.updateParameters = function (params) {58 var gd = this.device;59 var parameters = {60 worldViewProjection: null61 };62 for (var p in params) {63 if (params.hasOwnProperty(p)) {64 parameters[p] = params[p];65 }66 }67 this.techniqueParameters = gd.createTechniqueParameters(parameters);68 };69 DrawPrimitives.prototype.update2DTex = function (posa, posb) {70 var positions = this.rectTexPositions;71 var writer = positions.map();72 if (writer) {73 var v = [74 [posa[0], posa[1]],75 [posa[0], posb[1]],76 [posb[0], posb[1]],77 [posb[0], posa[1]]78 ];79 var t = [80 [0, 0],81 [0, 1],82 [1, 1],83 [1, 0]84 ];85 var index = [86 0,87 1,88 3,89 290 ];91 var i, j;92 for (i = 0; i < 4; i += 1) {93 j = index[i];94 writer(v[j], t[j]);95 }96 positions.unmap(writer);97 this.isTextured = true;98 }99 };100 DrawPrimitives.prototype.update2D = function (posa, posb) {101 var positions = this.rectPositions;102 var writer = positions.map();103 if (writer) {104 var v = [105 [posa[0], posa[1]],106 [posa[0], posb[1]],107 [posb[0], posb[1]],108 [posb[0], posa[1]]109 ];110 var index = [111 0,112 1,113 3,114 2115 ];116 var i;117 for (i = 0; i < 4; i += 1) {118 writer(v[index[i]]);119 }120 positions.unmap(writer);121 }122 };123 DrawPrimitives.prototype.update = function (posa, posb) {124 var positions = this.boxPositions;125 var writer = positions.map();126 if (writer) {127 var v = [128 [posa[0], posa[1], posa[2]],129 [posa[0], posa[1], posb[2]],130 [posa[0], posb[1], posa[2]],131 [posa[0], posb[1], posb[2]],132 [posb[0], posa[1], posa[2]],133 [posb[0], posa[1], posb[2]],134 [posb[0], posb[1], posa[2]],135 [posb[0], posb[1], posb[2]]136 ];137 var index = [138 0,139 2,140 1,141 1,142 2,143 3,144 0,145 1,146 4,147 1,148 5,149 4,150 1,151 3,152 5,153 3,154 7,155 5,156 3,157 2,158 7,159 2,160 6,161 7,162 0,163 4,164 2,165 2,166 4,167 6,168 4,169 5,170 6,171 5,172 7,173 6174 ];175 var i;176 for (i = 0; i < 3 * 12; i += 1) {177 writer(v[index[i]]);178 }179 positions.unmap(writer);180 }181 };182 DrawPrimitives.prototype.dispatch = function (camera) {183 var gd = this.device;184 var technique = this.technique;185 var isTechnique2D = this.isTechnique2D;186 var isTextured = this.isTextured;187 var vertexBuffer, semantics, primitive, numVertices;188 if (isTechnique2D) {189 if (isTextured) {190 vertexBuffer = this.rectTexPositions;191 semantics = this.rectTexSemantics;192 primitive = this.rectTexPrimitive;193 numVertices = this.rectTexNumVertices;194 } else {195 vertexBuffer = this.rectPositions;196 semantics = this.rectSemantics;197 primitive = this.rectPrimitive;198 numVertices = this.rectNumVertices;199 }200 } else {201 vertexBuffer = this.boxPositions;202 semantics = this.boxSemantics;203 primitive = this.boxPrimitive;204 numVertices = this.boxNumVertices;205 }206 var techniqueParameters = this.techniqueParameters;207 if (technique !== null) {208 techniqueParameters['worldViewProjection'] = camera.viewProjectionMatrix;209 gd.setTechnique(technique);210 gd.setTechniqueParameters(techniqueParameters);211 gd.setStream(vertexBuffer, semantics);212 gd.draw(primitive, numVertices);213 }214 };215 DrawPrimitives.create = function (gd, shaderPath, shaderName, techniqueName) {216 var dp = new DrawPrimitives();217 dp.shaderName = shaderName ? shaderName : "generic3D.cgfx";218 dp.techniqueName = techniqueName ? techniqueName : "constantColor3D";219 dp.isTechnique2D = false;220 dp.isTextured = false;221 dp.initalize(gd, shaderPath);222 return dp;223 };224 DrawPrimitives.version = 1;225 return DrawPrimitives;...
EditDistance.js
Source:EditDistance.js
1/* ************************************************************************2 qooxdoo - the new era of web development3 http://qooxdoo.org4 Copyright:5 2004-2008 1&1 Internet AG, Germany, http://www.1und1.de6 License:7 LGPL: http://www.gnu.org/licenses/lgpl.html8 EPL: http://www.eclipse.org/org/documents/epl-v10.php9 See the LICENSE file in the project's top-level directory for details.10 Authors:11 * Sebastian Werner (wpbasti)12 * Fabian Jakobs (fjakobs)13************************************************************************ */14/**15 * Class to implement different edit distance ideas.16 *17 * {@link http://en.wikipedia.org/wiki/Edit_distance}18 * {@link http://en.wikipedia.org/wiki/Levenshtein_distance}19 * {@link http://ad.informatik.uni-freiburg.de/lehre/ws9900/algorithmentheorie/vorlesung/folien/dynamische-programmierung-2/dynamische-programmierung-2.pdf}20 */21qx.Class.define("qx.util.EditDistance",22{23 statics :24 {25 OPERATION_DELETE : 1,26 OPERATION_INSERT : 2,27 OPERATION_REPLACE : 3,28 /**29 * Returns a distant matrix following a concept30 * named Levenshtein distance for two data structures31 *32 * @param dataA {Array} incoming source data33 * @param dataB {Array} incoming target data34 * @return {Integer[][]} outgoing matrix35 */36 __computeLevenshteinDistance : function(dataA, dataB)37 {38 // distance is dataA table with dataA.length+1 rows and dataB.length+1 columns39 var distance = [];40 // posA and posB are used to iterate over str1 and str241 var posA, posB, cost;42 for (posA=0; posA<=dataA.length; posA++)43 {44 distance[posA] = [];45 distance[posA][0] = posA;46 }47 for (posB=1; posB<=dataB.length; posB++) {48 distance[0][posB] = posB;49 }50 for (posA=1; posA<=dataA.length; posA++)51 {52 for (posB=1; posB<=dataB.length; posB++)53 {54 cost = dataA[posA-1] === dataB[posB-1] ? 0 : 1;55 if (distance[posA] === undefined) {56 distance[posA] = [];57 }58 distance[posA][posB] = Math.min(59 distance[posA-1][posB ] + 1, // deletion60 distance[posA ][posB-1] + 1, // insertion61 distance[posA-1][posB-1] + cost // substitution62 );63 }64 }65 return distance;66 },67 /**68 * Computes the operations needed to transform dataA to dataB.69 *70 * @param distance {Integer[][]} Precomputed matrix for the data fields71 * @param dataA {Array} incoming source data72 * @param dataB {Array} incoming target data73 * @return {Map[]} Array of maps describing the operations needed74 */75 __computeEditOperations : function(distance, dataA, dataB)76 {77 var operations = [];78 var posA = dataA.length;79 var posB = dataB.length;80 if (posA===0)81 {82 // insert from begin to end83 // reverted order than in all other cases for optimal performance84 for (var i=0; i<posB; i++) {85 operations.push({ operation : this.OPERATION_INSERT, pos : i, old : null, value : dataB[i] });86 }87 return operations;88 }89 if (posB===0)90 {91 // remove from end to begin92 for (var i=posA-1; i>=0; i--) {93 operations.push({ operation : this.OPERATION_DELETE, pos : i, old : dataA[i], value : null });94 }95 return operations;96 }97 while(posA !== 0 || posB !== 0)98 {99 if (posA != 0 && distance[posA][posB] == distance[posA-1][posB] + 1)100 {101 // console.log("delete " + dataA[posA-1] + ": " + (posA-1));102 operations.push({ operation : this.OPERATION_DELETE, pos : posA-1, old : dataA[posA-1], value : null });103 posA-=1;104 }105 else if (posB != 0 && distance[posA][posB] == distance[posA][posB-1] + 1)106 {107 // console.log("insert " + dataB[posB-1] + " ein, in: " + (posA));108 operations.push({ operation : this.OPERATION_INSERT, pos : posA, old : null, value : dataB[posB-1] });109 posB-=1;110 }111 else112 {113 if (dataA[posA-1]!==dataB[posB-1])114 {115 // console.log("replace " + dataA[posA-1] + " durch " + dataB[posB-1] + ".");116 operations.push({ operation : this.OPERATION_REPLACE, pos : posA-1, old : dataA[posA-1], value : dataB[posB-1] });117 }118 posA-=1;119 posB-=1;120 }121 }122 return operations;123 },124 /**125 * Returns the operations needed to transform dataA to dataB.126 *127 * @param dataA {Array} incoming source data128 * @param dataB {Array} incoming target data129 * @return {Map[]} Array of maps describing the operations needed130 */131 getEditOperations : function(dataA, dataB)132 {133 var distance = this.__computeLevenshteinDistance(dataA, dataB);134 var operations = this.__computeEditOperations(distance, dataA, dataB);135 return operations;136 }137 }...
Using AI Code Generation
1import { posB } from 'fast-check-monorepo'2console.log(posB())3import { posC } from 'fast-check-monorepo'4console.log(posC())5import { posD } from 'fast-check-monorepo'6console.log(posD())7import { posE } from 'fast-check-monorepo'8console.log(posE())9import { posF } from 'fast-check-monorepo'10console.log(posF())11import { posG } from 'fast-check-monorepo'12console.log(posG())13import { posH } from 'fast-check-monorepo'14console.log(posH())15import { posI } from 'fast-check-monorepo'16console.log(posI())17import { posJ } from 'fast-check-monorepo'18console.log(posJ())19import { posK } from 'fast-check-monorepo'20console.log(posK())21import { posL } from 'fast-check-monorepo'22console.log(posL())23import { posM } from 'fast-check-monorepo'24console.log(posM())25import { posN } from 'fast-check-monorepo'26console.log(posN())
Using AI Code Generation
1const { posB } = require('fast-check-monorepo');2console.log(posB(1));3const { posC } = require('fast-check-monorepo');4console.log(posC(1));5const { posD } = require('fast-check-monorepo');6console.log(posD(1));7const { posE } = require('fast-check-monorepo');8console.log(posE(1));9const { posF } = require('fast-check-monorepo');10console.log(posF(1));11const { posG } = require('fast-check-monorepo');12console.log(posG(1));13const { posH } = require('fast-check-monorepo');14console.log(posH(1));15const { posI } = require('fast-check-monorepo');16console.log(posI(1));17const { posJ } = require('fast-check-monorepo');18console.log(posJ(1));19const { posK } = require('fast-check-monorepo');20console.log(posK(1));21const { posL } = require('fast-check-monorepo');22console.log(posL(1));23const { posM } = require('fast-check-monorepo');24console.log(posM(1));
Using AI Code Generation
1import { posB } from 'fast-check-monorepo';2posB(1,2);3import { posB } from 'fast-check-monorepo';4posB(1,2);5import { posB } from 'fast-check-monorepo';6posB(1,2);7import { posB } from 'fast-check-monorepo';8posB(1,2);9import { posB } from 'fast-check-monorepo';10posB(1,2);11import { posB } from 'fast-check-monorepo';12posB(1,2);13import { posB } from 'fast-check-monorepo';14posB(1,2);15import { posB } from 'fast-check-monorepo';16posB(1,2);17import { posB } from 'fast-check-monorepo';18posB(1,2);19import { posB } from 'fast-check-monorepo';20posB(1,2);21import { posB } from 'fast-check-monorepo';22posB(1,2);23import { posB } from 'fast-check-monorepo';24posB(1,2);25import { posB } from
Using AI Code Generation
1console.log(posB(1, 2));2console.log(posB(1, 2, 3));3console.log(posB(1, 2));4console.log(posB(1, 2, 3));5console.log(posB(1, 2));6console.log(posB(1, 2, 3));7console.log(posB(1, 2));8console.log(posB(1, 2, 3));9console.log(posB(1, 2));10console.log(posB(1, 2, 3));11console.log(posB(1, 2));12console.log(posB(1, 2, 3));13console.log(posB(1, 2));14console.log(posB(1, 2, 3));15console.log(posB(1, 2));16console.log(posB(1, 2, 3));17console.log(posB(1, 2));18console.log(posB(1, 2, 3));19console.log(posB(1, 2));20console.log(posB(1, 2, 3));21console.log(posB(1, 2));22console.log(posB(1, 2, 3));23console.log(posB(1, 2));24console.log(posB
Using AI Code Generation
1const {posB} = require('fast-check-monorepo');2posB(1, 2, 3);3const {posC} = require('fast-check-monorepo');4posC(1, 2, 3);5const {posD} = require('fast-check-monorepo');6posD(1, 2, 3);7const {posE} = require('fast-check-monorepo');8posE(1, 2, 3);9const {posF} = require('fast-check-monorepo');10posF(1, 2, 3);11const {posG} = require('fast-check-monorepo');12posG(1, 2, 3);13const {posH} = require('fast-check-monorepo');14posH(1, 2, 3);15const {posI} = require('fast-check-monorepo');16posI(1, 2, 3);17const {posJ} = require('fast-check-monorepo');18posJ(1, 2, 3);19const {posK} = require('fast-check-monorepo');20posK(1, 2, 3);21const {posL} = require('fast-check-monorepo');22posL(1, 2, 3);
Using AI Code Generation
1import { posB } from 'fast-check-monorepo';2console.log(posB());3import { posB } from 'fast-check-monorepo';4console.log(posB());5import { posB } from 'fast-check-monorepo';6console.log(posB());7import { posB } from 'fast-check-monorepo';8console.log(posB());9import { posB } from 'fast-check-monorepo';10console.log(posB());11import { posB } from 'fast-check-monorepo';12console.log(posB());13import { posB } from 'fast-check-monorepo';14console.log(posB());15import { posB } from 'fast-check-monorepo';16console.log(posB());17import { posB } from 'fast-check-monorepo';18console.log(posB());19import { posB } from 'fast-check-monorepo';20console.log(posB());21import { posB } from 'fast-check-monorepo';22console.log(posB());
Using AI Code Generation
1const fc = require('fast-check');2const { posB } = require('./posB');3const arb = fc.nat().map(posB);4fc.assert(fc.property(arb, (n) => n > 0));5const fc = require('fast-check');6const { posB } = require('./posB');7const arb = fc.nat().map(posB);8fc.assert(fc.property(arb, (n) => n > 0));9const fc = require('fast-check');10const { posB } = require('./posB');11const arb = fc.nat().map(posB);12fc.assert(fc.property(arb, (n) => n > 0));13const fc = require('fast-check');14const { posB } = require('./posB');15const arb = fc.nat().map(posB);16fc.assert(fc.property(arb, (n) => n > 0));17const fc = require('fast-check');18const { posB } = require('./posB');19const arb = fc.nat().map(posB);20fc.assert(fc.property(arb, (n) => n > 0));21const fc = require('fast-check');22const { posB } = require('./posB');23const arb = fc.nat().map(posB);24fc.assert(fc.property(arb, (n) => n > 0));25const fc = require('fast-check');26const { posB } = require('./posB');27const arb = fc.nat().map(posB);28fc.assert(fc.property(arb, (n) => n > 0));29const fc = require('fast-check');30const { posB } = require('./posB');31const arb = fc.nat().map(posB
Using AI Code Generation
1const { posB } = require("fast-check-monorepo");2const test = posB(1, 2);3console.log(test);4const { posC } = require("fast-check-monorepo");5const test = posC(1, 2);6console.log(test);7const { posD } = require("fast-check-monorepo");8const test = posD(1, 2);9console.log(test);10const { posE } = require("fast-check-monorepo");11const test = posE(1, 2);12console.log(test);13const { posF } = require("fast-check-monorepo");14const test = posF(1, 2);15console.log(test);16const { posG } = require("fast-check-monorepo");17const test = posG(1, 2);18console.log(test);19const { posH } = require("fast-check-monorepo");20const test = posH(1, 2);21console.log(test);22const { posI } = require("fast-check-monorepo");23const test = posI(1, 2);24console.log(test);25const { posJ } = require("fast-check-monorepo");26const test = posJ(1, 2);27console.log(test);
Using AI Code Generation
1const posB = require('fast-check-monorepo').posB;2posB();3import { posB } from 'fast-check-monorepo';4posB();5import * as fastCheckMonorepo from 'fast-check-monorepo';6fastCheckMonorepo.posB();7const fastCheckMonorepo = require('fast-check-monorepo');8fastCheckMonorepo.posB();9import fastCheckMonorepo from 'fast-check-monorepo';10fastCheckMonorepo.posB();11import fastCheckMonorepo from 'fast-check-monorepo';12fastCheckMonorepo.posB();13import fastCheckMonorepo from 'fast-check-monorepo';14fastCheckMonorepo.posB();15import fastCheckMonorepo from 'fast-check-monorepo';16fastCheckMonorepo.posB();
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!!