How to use getValueArray method in Appium

...42    }43    44    return true; // no child45}46function getValueArray(array) {47    48    var valueArray = new Array();49    for(var i = 0; i < array.length; i++) {50        if(array[i] != null) {51            valueArray[i] = array[i].getValue();52        } else {53            valueArray[i] = "__";54        }55    }56    57    return valueArray;58}59var tree = controller.tree;60var visualiser = controller.visualiser;61var alg;62var n = 1; // number of test repetition63var multiplier = new Array(); // number of operation in appropriate test64multiplier.count = 0; // sum of test65for(var c = 0; c < n; c++) {66    multiplier[c] = btv.getRandomInt(5, 30);67    multiplier.count += multiplier[c];68}69///////////////////////////////////////////////////////////70module("RandomBSTreeAlg:");71///////////////////////////////////////////////////////////72test("normal interval (min = -50, max = 50)", function() {73    expect(multiplier.count); // Synchronous Callbacks, expect(number of expected assertions)74    for(var i = 0; i < n; i++) { // test75        for(var j = 0; j < multiplier[i]; j++) {76            alg = new btv.bst.RandomBSTreeAlg(tree, visualiser, -50, 50, false);77            alg.redo();78            ok(checkSearchTreeProperty(tree), "generate -> " + getValueArray(tree.toArray()));79        }80    }81});82test("small interval (min = -2, max = 2) ", function() {83    expect(multiplier[0]);84    85    // just one test86    for(var i = 0; i < multiplier[0]; i++) { // operation87        alg = new btv.bst.RandomBSTreeAlg(tree, visualiser, -2, 2, false);88        alg.redo();89        ok(checkSearchTreeProperty(tree), "generate -> " + getValueArray(tree.toArray()));90    }91});92///////////////////////////////////////////////////////////93module("InsertAlg:");94///////////////////////////////////////////////////////////95test("random values to empty tree", function() {96    expect(n);97    98    for(var i = 0; i < n; i++) { // test99        tree.setRoot(null);100        101        var values = new Array();102        for(var j = 0; j < multiplier[i]; j++) { // operation103            104            values[j] = btv.getRandomInt(-50, 50);105            alg = new btv.bst.InsertAlg(tree, visualiser, values[j], false);106            alg.redo();107        }108        109        ok(checkSearchTreeProperty(tree), "insert: " + values + " -> " + getValueArray(tree.toArray()));110    }111});112///////////////////////////////////////////////////////////113module("FindAlg:");114///////////////////////////////////////////////////////////115test("random values in random tree", function() {116    expect(n + multiplier.count);117    118    for(var i = 0; i < n; i++) { // test119        alg = new btv.bst.RandomBSTreeAlg(tree, visualiser, -50, 50, false);120        alg.redo();121        for(var j = 0; j < multiplier[i]; j++) { // insert additional values, values can repeat122            alg = new btv.bst.InsertAlg(tree, visualiser, btv.getRandomInt(-50, 50), false);123            alg.redo();124        }        125        126        var va = getValueArray(tree.toArray());127        128        var values = new Array();129        var returnValues = new Array();130        for(j = 0; j < multiplier[i]; j++) { // operation131            132            values[j] = btv.getRandomInt(-50, 50);133            alg = new btv.bst.FindAlg(tree, visualiser, values[j], false);134            returnValues[j] = alg.redo();135        }136        137        ok(checkSearchTreeProperty(tree), va + " -> find: " + values + " -> " + getValueArray(tree.toArray()));138        for(j = 0; j < values.length; j++) {139            var index = va.indexOf(values[j]);140            strictEqual(returnValues[j] != null ? returnValues[j].getValue() : null, index != -1 ? va[index] : null, 141                values[j] + (returnValues[j] == null ? " not found" : " found"));142        }143    }144});145///////////////////////////////////////////////////////////146module("DeleteAlg:");147///////////////////////////////////////////////////////////148test("random nodes from random tree", function() {149    expect(n + multiplier.count);150    151    for(var i = 0; i < n; i++) {152        alg = new btv.bst.RandomBSTreeAlg(tree, visualiser, -50, 50, false);153        alg.redo();154        for(var j = 0; j < multiplier[i]; j++) { // insert additional values, provide enought nodes to deletion, values can repeat155            alg = new btv.bst.InsertAlg(tree, visualiser, btv.getRandomInt(-50, 50), false);156            alg.redo();157        }        158        159        var va = getValueArray(tree.toArray());160        161        var nodes = new Array();162        for(j = 0; j < multiplier[i]; j++) {163            do {164                nodes[j] = tree.getNode(btv.getRandomInt(0, tree.getCount() - 1));165            } while(nodes[j] == null);166            alg = new btv.bst.DeleteAlg(tree, visualiser, nodes[j], false);167            alg.redo();168        }169        170        var nva = getValueArray(tree.toArray());171        172        ok(checkSearchTreeProperty(tree), va + " -> delete: " + getValueArray(nodes) + " -> " + getValueArray(tree.toArray()));173        for(j = 0; j < nodes.length; j++) {174            ok(nva.indexOf(nodes[j].getValue() == -1), nodes[j].getValue() + " deleted");175        }        176    }177});178///////////////////////////////////////////////////////////179module("GetMaxAlg:");180///////////////////////////////////////////////////////////181test("of random tree", function() {182    expect(2*multiplier.count);183    184    for(var i = 0; i < n; i++) { // test185        for(var j = 0; j < multiplier[i]; j++) { // operation186            alg = new btv.bst.RandomBSTreeAlg(tree, visualiser, -50, 50, false);187            alg.redo();188            for(var k = 0; k < multiplier[i]; k++) { // insert additional values, values can repeat189                alg = new btv.bst.InsertAlg(tree, visualiser, btv.getRandomInt(-50, 50), false);190                alg.redo();191            }              192            193            var va = getValueArray(tree.toArray());194            var sva = getValueArray(tree.toInorderArray());195            196            alg = new btv.bst.GetMaxAlg(tree, visualiser, tree.getRoot(), false);197            var returnValue = alg.redo();198            199            ok(checkSearchTreeProperty(tree), va + " -> get max -> " + getValueArray(tree.toArray()));200            strictEqual(returnValue.getValue(), sva[sva.length-1], "max = " + sva[sva.length-1] + " (sorted: " + sva + ")");201        }202    }    203});204///////////////////////////////////////////////////////////205module("GetMinAlg:");206///////////////////////////////////////////////////////////207test("of random tree", function() {208    expect(2*multiplier.count);209    210    for(var i = 0; i < n; i++) { // test211        for(var j = 0; j < multiplier[i]; j++) { // operation212            alg = new btv.bst.RandomBSTreeAlg(tree, visualiser, -50, 50, false);213            alg.redo();214            for(var k = 0; k < multiplier[i]; k++) { // insert additional values, values can repeat215                alg = new btv.bst.InsertAlg(tree, visualiser, btv.getRandomInt(-50, 50), false);216                alg.redo();217            }              218            219            var va = getValueArray(tree.toArray());220            var sva = getValueArray(tree.toInorderArray());       221            222            alg = new btv.bst.GetMinAlg(tree, visualiser, tree.getRoot(), false);223            var returnValue = alg.redo();224            225            ok(checkSearchTreeProperty(tree), va + " -> get min -> " + getValueArray(tree.toArray()));226            strictEqual(returnValue.getValue(), sva[0], "min = " + sva[0] + " (sorted: " + sva + ")");227        }228    }229});230///////////////////////////////////////////////////////////231module("GetPredecessorAlg:");232///////////////////////////////////////////////////////////233function checkPredecessor(srcV, predV, sva) { // sourceValue, predecessorValue, sortedValueArray234    var fi = sva.indexOf(srcV); // firstIndex235        236    if(predV == null) {237        return (fi == 0 ? true : false);238    }239        240    if(fi != sva.lastIndexOf(srcV)) { // srcV multiple times in sva241        if(predV == sva[fi]) {242            return true;243        }244    }245    246    if(predV == sva[fi-1]) {247        return true;248    }249    250    return false;251}252test("of random nodes from random tree", function() {253    expect(2*multiplier.count);254    255    for(var i = 0; i < n; i++) { // test256        alg = new btv.bst.RandomBSTreeAlg(tree, visualiser, -50, 50, false);257        alg.redo();258        for(var j = 0; j < multiplier[i]; j++) { // insert additional values, values can repeat259            alg = new btv.bst.InsertAlg(tree, visualiser, btv.getRandomInt(-50, 50), false);260            alg.redo();261        }262        263        var va = getValueArray(tree.toArray());264        var sva = getValueArray(tree.toInorderArray());265        266        var nodes = new Array();267        var returnValues = new Array();268        for(j = 0; j < multiplier[i]; j++) { // operation269            do {270                nodes[j] = tree.getNode(btv.getRandomInt(0, tree.getCount() - 1));271            } while(nodes[j] == null);272            273            alg = new btv.bst.GetPredecessorAlg(tree, visualiser, nodes[j], false);274            returnValues[j] = alg.redo();275            276            ok(checkSearchTreeProperty(tree), va + " -> get predecessor (" + nodes[j].getValue() + ") -> " + getValueArray(tree.toArray()));277            var index = sva.lastIndexOf(nodes[j].getValue());278            //strictEqual(returnValues[j] != null ? returnValues[j].getValue() : null, index >= 1 ? sva[index - 1] : null, "predecessor = " + (returnValues[j] != null ? returnValues[j].getValue() : "null") + " (sorted: " + sva + ")");279            ok(checkPredecessor(nodes[j].getValue(), returnValues[j] != null ? returnValues[j].getValue() : null, sva), "predecessor = " + (returnValues[j] != null ? returnValues[j].getValue() : "null") + " (sorted: " + sva + ")");280        }281    }282});283///////////////////////////////////////////////////////////284module("GetSuccessorAlg:");285///////////////////////////////////////////////////////////286function checkSuccessor(srcV, sucV, sva) { // sourceValue, predecessorValue, sortedValueArray287    var li = sva.lastIndexOf(srcV); // lastIndex288    289    if(sucV == null) {290        return (li == sva.length-1 ? true : false);291    }292        293    if(sva.indexOf(srcV) != li) { // srcV multiple times in sva294        if(sucV == sva[li]) {295            return true;296        }297    }298    299    if(sucV == sva[li+1]) {300        return true;301    }302    303    return false;304}305test("of random nodes from random tree", function() {306    expect(2*multiplier.count);307    308    for(var i = 0; i < n; i++) {309        alg = new btv.bst.RandomBSTreeAlg(tree, visualiser, -50, 50, false);310        alg.redo();311        for(var j = 0; j < multiplier[i]; j++) { // insert additional values, values can repeat312            alg = new btv.bst.InsertAlg(tree, visualiser, btv.getRandomInt(-50, 50), false);313            alg.redo();314        }315        316        var va = getValueArray(tree.toArray());317        var sva = getValueArray(tree.toInorderArray());318        319        var nodes = new Array();320        var returnValues = new Array();321        for(j = 0; j < multiplier[i]; j++) {322            do {323                nodes[j] = tree.getNode(btv.getRandomInt(0, tree.getCount() - 1));324            } while(nodes[j] == null);325            326            alg = new btv.bst.GetSuccessorAlg(tree, visualiser, nodes[j], false);327            returnValues[j] = alg.redo();328            329            ok(checkSearchTreeProperty(tree), va + " -> get predecessor (" + nodes[j].getValue() + ") -> " + getValueArray(tree.toArray()));330            var index = sva.indexOf(nodes[j].getValue());331            //strictEqual(returnValues[j] != null ? returnValues[j].getValue() : null, index < sva.length - 1 ? sva[index + 1] : null, "successor = " + (returnValues[j] != null ? returnValues[j].getValue() : "null") + " (sorted: " + sva + ")");332            ok(checkSuccessor(nodes[j].getValue(), returnValues[j] != null ? returnValues[j].getValue() : null, sva) , "successor = " + (returnValues[j] != null ? returnValues[j].getValue() : "null") + " (sorted: " + sva + ")");333        }334    }335});336///////////////////////////////////////////////////////////337module("ToInorderArrayAlg:");338///////////////////////////////////////////////////////////339test("random tree", function() {340    expect(2*multiplier.count);341    for(var i = 0; i < n; i++) { // test342        for(var j = 0; j < multiplier[i]; j++) { // operation343            alg = new btv.bst.RandomBSTreeAlg(tree, visualiser, -50, 50, false);344            alg.redo();345            for(var k = 0; k < multiplier[i]; k++) { // insert additional values, values can repeat346                alg = new btv.bst.InsertAlg(tree, visualiser, btv.getRandomInt(-50, 50), false);347                alg.redo();348            }            349        350            var va = getValueArray(tree.toArray());351            var sva = getValueArray(tree.toInorderArray());352        353            alg = new btv.bst.ToInorderArrayAlg(tree, visualiser, false);354            var array = alg.redo();355        356            ok(checkSearchTreeProperty(tree), va + " -> to inorder array -> " + getValueArray(tree.toArray()));357            strictEqual(getValueArray(array).toString(), sva.toString(), "sorted = " + getValueArray(array)); // @TODO why theese array are different if not converted to string358        }359    }...

...46    }47    48    return true; // no child49}50function getValueArray(array) {51    52    var valueArray = new Array();53    for(var i = 0; i < array.length; i++) {54        if(array[i] != null) {55            valueArray[i] = array[i].getValue();56        } else {57            valueArray[i] = "__";58        }59    }60    61    return valueArray;62}63function randomArray(length) {64    if(length == null) {65        length = btv.getRandomInt(10, 40);66    } 67    68    var array = new Array();69    for(var i = 0; i < length; i++) {70        array.push(btv.getRandomInt(-50, 50));71    }72    73    return array;74}75function randomSortedArray(length) {76    var array = randomArray(length);77    array.sort(function(a, b) {78        return a - b;79    });80        81    return array;82}83function randomReversedSortedArray(length) {84    var array = randomSortedArray(length);85    array.reverse();86    87    return array;88}89var tree = controller.tree;90var visualiser = controller.visualiser;91var alg;92var n = 1; // number of test repetition93var multiplier = new Array(); // number of operation in appropriate test94multiplier.count = 0; // sum of test95for(var c = 0; c < n; c++) {96    multiplier[c] = btv.getRandomInt(5, 30);97    multiplier.count += multiplier[c];98}99///////////////////////////////////////////////////////////100module("RandomBHeapAlg:");101///////////////////////////////////////////////////////////102test("normal interval (min = -50, max = 50)", function() {103    expect(multiplier.count); // Synchronous Callbacks, expect(number of expected assertions)104    for(var i = 0; i < n; i++) { // test105        for(var j = 0; j < multiplier[i]; j++) { // operation106            alg = new btv.bh.RandomBHeapAlg(tree, visualiser, -50, 50, false);107            alg.redo();108            ok(checkHeapProperty(tree), "generate -> " + getValueArray(tree.toArray()));109        }110    }111});112test("small interval (min = -2, max = 2) ", function() {113    expect(multiplier[0]);114    // just one test115    for(var i = 0; i < multiplier[0]; i++) { // operation116        alg = new btv.bh.RandomBHeapAlg(tree, visualiser, -2, 2, false);117        alg.redo();118        ok(checkHeapProperty(tree), "generate -> " + getValueArray(tree.toArray()));119    }120});121///////////////////////////////////////////////////////////122module("BuildHeapAlg:");123///////////////////////////////////////////////////////////124test("from random array", function() {125    expect(multiplier.count);126    127    for(var i = 0; i < n; i++) { // test128        for(var j = 0; j < multiplier[i]; j++) { // operation129            var ra = randomArray();130            alg = new btv.bh.BuildHeapAlg(tree, visualiser, ra, false);131            alg.redo();132            ok(checkHeapProperty(tree), ra + " -> build -> " + getValueArray(tree.toArray()));133        }134    }135});136test("from sorted array - ascending order", function() {137    expect(multiplier[0]);138    // just one test139    for(var i = 0; i < multiplier[0]; i++) { // operation140        var rsa = randomSortedArray()141        alg = new btv.bh.BuildHeapAlg(tree, visualiser, rsa, false);142        alg.redo();143        ok(checkHeapProperty(tree), rsa + " -> build -> " + getValueArray(tree.toArray()));144    }145});146test("from sorted array - descending order", function() {147    expect(multiplier[0]);148    // just one test149    for(var i = 0; i < multiplier[0]; i++) { // operation150        var rrsa = randomReversedSortedArray();151        alg = new btv.bh.BuildHeapAlg(tree, visualiser, rrsa, false);152        alg.redo();153        ok(checkHeapProperty(tree), rrsa + " -> build -> " + getValueArray(tree.toArray()));154    }155});156///////////////////////////////////////////////////////////157module("InsertAlg:");158///////////////////////////////////////////////////////////159test("random values to empty heap", function() {160    expect(n);161    for(var i = 0; i < n; i++) { // test162        tree.setRoot(null);163        var values = new Array();164        for(var j = 0; j < multiplier[i]; j++) { // operation165            166            values[j] = btv.getRandomInt(-50, 50);167            alg = new btv.bh.InsertAlg(tree, visualiser, values[j], false);168            alg.redo();169        }170       171        ok(checkHeapProperty(tree), "insert: " + values + " -> " + getValueArray(tree.toArray()));172    }173});174///////////////////////////////////////////////////////////175module("DeleteAlg:");176///////////////////////////////////////////////////////////177test("random nodes from random heap", function() {178    expect(n + multiplier.count);179    for(var i = 0; i < n; i++) { // test180        alg = new btv.bh.RandomBHeapAlg(tree, visualiser, -50, 50, false);181        alg.redo();182        for(var j = 0; j < multiplier[i]; j++) { // insert additional values, provide enought nodes to deletion183            alg = new btv.bh.InsertAlg(tree, visualiser, btv.getRandomInt(-50, 50), false);184            alg.redo();185        }186        187        var va = getValueArray(tree.toArray());188        189        var nodes = new Array();190        for(j = 0; j < multiplier[i]; j++) { // operation191            nodes[j] = tree.getNode(btv.getRandomInt(0, tree.getCount() - 1));192            alg = new btv.bh.DeleteAlg(tree, visualiser, nodes[j], false);193            alg.redo();194        }195        196        var nva = getValueArray(tree.toArray());197        198        ok(checkHeapProperty(tree), va + " -> delete: " + getValueArray(nodes) + " -> " + nva);199        for(j = 0; j < nodes.length; j++) {200            ok(nva.indexOf(nodes[j].getValue() == -1), nodes[j].getValue() + " deleted");201        }202    }203});204///////////////////////////////////////////////////////////205module("HeapSortAlg:");206///////////////////////////////////////////////////////////207test("random heap", function() {208    expect(2*multiplier.count);209    for(var i = 0; i < n; i++) { // test210        for(var j = 0; j < multiplier[i]; j++) { // operation211            alg = new btv.bh.RandomBHeapAlg(tree, visualiser, -50, 50, false);212            alg.redo();213            for(var k = 0; k < multiplier[i]; k++) { // insert additional values, values can repeat214                alg = new btv.bh.InsertAlg(tree, visualiser, btv.getRandomInt(-50, 50), false);215                alg.redo();216            }            217        218            var va = getValueArray(tree.toArray());219            var sva = getValueArray(tree.toInorderArray()).sort(function(a, b)  {220                return a - b;221            });222        223            alg = new btv.bh.HeapSortAlg(tree, visualiser, false);224            var array = alg.redo();225        226            ok(checkHeapProperty(tree), va + " -> heap sort -> " + getValueArray(tree.toArray()));227            strictEqual(getValueArray(array).toString(), sva.toString(), "sorted = " + getValueArray(array)); // @TODO why theese array are different if not converted to string228        }229    }...

...44                    if(result.value != "@vacio"){45                        resultCadena += result.value;46                    }47                }else if(result.esArray){48                    resultCadena += this.getValueArray(result.value);49                }else if(result.type.enumType == EnumType.TYPE){50                    resultCadena += this.getDataMap(result.value.value);51                }else{52                    resultCadena += result.value;53                }54            }else{55                console.log("llega null al print");56            }57        }58        PrintConsole.printLine(resultCadena);59        return null; 60    }61    getValueArray(value){62        var cadena = "[";63        for(var i = 0; i < value.length; i++){64            if(value[i] instanceof Array && i == 0){65                cadena += `${this.getValueArray(value[i])}`;66            }else if(value[i] instanceof Array){67                cadena += `,${this.getValueArray(value[i])}`;68            }else if(i == 0){69                cadena += value[i].value;70            }else{71                cadena += `,${value[i].value}`;72            }            73        }74        75        cadena += "]";76        return cadena;77    }78    79    getDataMap(map){80        var cadena = "{";81        if(!(map instanceof Map)){...

...22    this.getValueArray = this.getValueArray.bind(this);23    this.handleSelect = this.handleSelect.bind(this);24    this.renderOption = this.renderOption.bind(this);25  }26  getValueArray() {27    return this.props.value === '' ? [] : this.props.value.split(',');28  }29  handleSelect(id) {30    const valueArray = this.getValueArray();31    if (valueArray.includes(id)) {32      pull(valueArray, id);33    } else {34      valueArray.push(id);35    }36    this.props.onChange(valueArray.join(','));37  }38  renderOption(option) {39    const onClick = () => this.handleSelect(option.id);40    const selected = this.getValueArray().includes(option.id);41    const extra = {};42    if (selected) {43      extra.bsStyle = this.props.selectedStyle;44    }45    return (46      <Label47        className="option"48        key={option.id}49        onClick={onClick}50        {...extra}51      >52        {option.name}53      </Label>54    );...

1// validate the input value2const validateData = (element) => {3  return !isNaN(element) && element !== ''4};5// get main container node6const getParentElement = (el) =>  el.parentElement.parentElement;7const getTarget = (e) => e.target;8const getInputsArray = (el) => [...getParentElement(el).querySelectorAll('.input-element')];9// remove all highlight when inputs is edited10const removeHighLight = (el) => {11  getInputsArray(el).forEach(el => el.classList.remove('selected'))12}13const highLightElements = (arr) => arr.forEach(i => i.classList.add('selected'));14const getElementValue = (el) => {15  const inputsElements = getInputsArray(el);16  const getValueArray = inputsElements.filter(i => validateData(i.value)).map(i => i.value);17  if (getValueArray.length < 1) {18    return false;19  }20  removeHighLight(el);21  // find exact value depending on which button was clicked22  const elementValue = el.dataset.sort === 'biggest' ? Math.max(...getValueArray) : Math.min(...getValueArray);23  const elementsToShow = inputsElements.filter(j => validateData(j.value) && +j.value === elementValue);24  highLightElements(elementsToShow);25}26const handleClick = (e) => {27  if (getTarget(e).classList.contains('action-btn')) {28    getElementValue(getTarget(e))29  }30}31const handleChange = (e) => {32  if (getTarget(e).classList.contains('input-element')) {33    removeHighLight(getTarget(e))34  }35}36const getInputs = [...document.getElementsByClassName('input-element')];37getInputs.forEach(i => i.addEventListener('focus', handleChange));...

...9    for (let [arg, value] of _.toPairs(obj)) {10      if (!_.isObject(value)) {11        strArr.push(`${indent}  ${arg}: ${value}`);12      } else {13        value = getValueArray(value, `${indent}  `);14        strArr.push(`${indent}  ${arg}: ${value.shift()}`);15        strArr.push(...value);16      }17    }18    strArr.push(`${indent}}`);19    return strArr;20  }21  for (let [arg, value] of _.toPairs(args)) {22    value = getValueArray(value);23    logger.info(`  ${arg}: ${value.shift()}`);24    for (let val of value) {25      logger.info(val);26    }27  }28}...

1import getValueArray from '../getValueArray';2describe('getValueArray', () => {3    it('should return an array with 2 empty positions when value is number and maxLength is 2', () => {4        const maxLength = 2;5        expect(getValueArray('', maxLength)).toEqual(['', '']);6    });7    it('should return an array with 3 positions filled with numbers when a mixed text and numbers are passed as value and maxLength is 3', () => {8        const maxLength = 3;9        expect(getValueArray('a1b2c3d4c5', maxLength)).toEqual(['1', '2', '3']);10    });11    it('should return an array with the last position empty when value is a string with two numbers and maxLength is 3', () => {12        const maxLength = 3;13        expect(getValueArray('12', maxLength)).toEqual(['1', '2', '']);14    });...

1import { useMemo } from 'react';2import getValueArray from '../helpers/getValueArray';3export default function useValueState(value, length) {4    return useMemo(() => {5        return getValueArray(value, length);6    }, [value, length]);...