How to use getTree method in Appium

...52module.exports = performGenericLeafTreeTests53function testTreeProperties(getTree) {54  const numEl = 10055  test('if height = h; leaveCount <= 2**h', () => {56    const tree = getTree(numEl)57    const h = height(tree)58    expect(leaveCount(tree)).toBeLessThanOrEqual(2**h)59  })60  test('if height = h; leaveCount >= h + 1', () => {61    const tree = getTree(numEl)62    const h = height(tree)63    expect(leaveCount(tree)).toBeGreaterThanOrEqual(h + 1)64  })65  test('if interiorNodeCount = h; leaveCount = h + 1', () => {66    const tree = getTree(numEl)67    expect(interiorNodeCount(tree)).toEqual(leaveCount(tree) - 1)68  })69}70function testSetMethod(getTree) {71  const numEl = 200072  it('replaces a key value with a new one', () => {73    const tree = getTree(numEl)74    const keyToReplace = Math.floor(numEl / 2)75    const newVal = 'new-value'76    tree.set(keyToReplace, newVal)77    expect(tree.find(keyToReplace)).toEqual(newVal)78  })79  it('inserts a key value if it does exist', () => {80    const tree = getTree(numEl)81    const newKey = numEl + 182    const newVal = valueGenerator(newKey)83    tree.set(newKey, newVal)84    expect(tree.find(newKey)).toEqual(newVal)85  })86}87function testFind(getTree) {88  it('returns null if the tree is empty', () => {89    const tree = getTree(0)90    expect(tree.find(1)).toEqual(null)91  })92  it('returns null if the a value associated with the query key is not in the tree', () => {93    const tree = getTree(10)94    const nextKey = 10 + 195    expect(tree.find(nextKey)).toEqual(null)96  })97  it('returns the value associated with the query key if it exists in the tree', () => {98    const numEl = 10099    const tree = getTree(numEl)100    for (let key = 1; key <= numEl; key++) {101      expect(tree.find(key)).toEqual(valueGenerator(key))102    }103  })104}105function testTreeHeight(getTree) {106  const numEl = 20107  it('should be >= Math.ceil(log n)', () => {108    const tree = getTree(numEl)109    const logN = Math.log2(nodeCount(tree))110    expect(height(tree)).toBeGreaterThanOrEqual(Math.ceil(logN))111  })112  it('should be <= n - 1', () => {113    const tree = getTree(numEl)114    const n = nodeCount(tree)115    expect(height(tree)).toBeLessThanOrEqual(n - 1)116  })117}118function testLeaveCount(getTree) {119  it('is 0 if empty', () => {120    const tree = getTree()121    expect(leaveCount(tree)).toEqual(0)122  })123  it('counts the number of leaves in the tree', () => {124    const numEl = 10125    const tree = getTree(numEl)126    expect(leaveCount(tree)).toEqual(numEl)127  })128}129function testInsertion(getTree) {130  performInsertionTests(getTree, false)131}132function testAdd(getTree) {133  performInsertionTests(getTree, true)134}135function performInsertionTests(getTree, useAddMethod) {136  const numEl = 20137  it('returns false (fails) if we attempt to insert a key that already exists in the tree', () => {138    const tree = getTree(numEl, null, useAddMethod)139    const existingKey = Math.floor(numEl / 2)140    expect(tree.insert(existingKey, 'existingKey')).toEqual(false)141  })142  it('returns true if insertion succeeded', () => {143    const tree = getTree(numEl, null, useAddMethod)144    const nextKey = numEl + 1145    expect(tree.insert(nextKey, 'nextKey')).toEqual(true)146  })147  it('should be able to insert in empty tree', () => {148    const tree = getTree(0, null, useAddMethod)149    tree.insert(1, 'one')150    expect(tree.isEmpty()).toEqual(false)151  })152  it('increases the leaveCount of the tree by one', () => {153    let count = 0154    getTree(numEl, (tree) => {155      expect(leaveCount(tree)).toEqual(++count)156    }, useAddMethod)157  })158  it('increases the nodeCount of the tree by one on the first insert', () => {159    const tree = getTree(1, null, useAddMethod)160    expect(nodeCount(tree)).toEqual(1)161  })162  it('increases the nodeCount by two after the first insert', () => {163    let count = 0164    let oldNodeCount = 0165    getTree(numEl, (tree) => {166      if (count) {167        expect(nodeCount(tree)).toEqual(oldNodeCount + 2)168      }169      oldNodeCount = nodeCount(tree)170      count++171    }, useAddMethod)172  })173  it('all the key value pairs inserted will exist in the tree', () => {174    let keyCount = numEl175    const tree = getTree(keyCount, null, useAddMethod)176    while (keyCount) expect(tree.find(keyCount--)).not.toEqual(null)177  })178}179function testNodeCount(getTree) {180  const numEl = 20181  it('is 0 if empty', () => {182    const tree = getTree(0)183    expect(nodeCount(tree)).toEqual(0)184  })185  it('increases by one on the very first insert', () => {186    const tree = getTree(1)187    expect(nodeCount(tree)).toEqual(1)188  })189  it('increases by two after every subsequent insert', () => {190    let count = 0191    let oldNodeCount = 0192    getTree(numEl, (tree) => {193      if (count) {194        expect(nodeCount(tree)).toEqual(oldNodeCount + 2)195      }196      count++197      oldNodeCount = nodeCount(tree)198    })199  })200}201function testDeletion(getTree) {202  const numEl = 100203  it('returns null is deletion failed (when tree is empty)', () => {204    const tree = getTree(0)205    expect(tree.delete(1)).toEqual(null)206  })207  it('returns null if deletion failed (when key does not exist in the tree)', () => {208    const tree = getTree(numEl)209    const nextKey = numEl + 1210    expect(tree.delete(nextKey)).toEqual(null)211  })212  it('returns and removes the value associated with the deleted key', () => {213    let numKeysToDelete = Math.floor(numEl / 20)214    const tree = getTree(numEl)215    while (numKeysToDelete) {216      expect(tree.delete(numKeysToDelete)).toEqual(valueGenerator(numKeysToDelete))217      numKeysToDelete--218    }219  })220  it('decreases leaveCount by 1', () => {221    let numKeysToDelete = Math.floor(numEl / 20)222    const tree = getTree(numEl)223    let oldLeaveCount = leaveCount(tree)224    while (numKeysToDelete) {225      tree.delete(numKeysToDelete--)226      expect(leaveCount(tree)).toEqual(oldLeaveCount - 1)227      oldLeaveCount = leaveCount(tree)228    }229  })230  it('decreases nodeCount by two', () => {231    let numKeysToDelete = Math.floor(numEl / 20)232    const tree = getTree(numEl)233    let oldNodeCount = nodeCount(tree)234    while (numKeysToDelete) {235      tree.delete(numKeysToDelete--)236      expect(nodeCount(tree)).toEqual(oldNodeCount - 2)237      oldNodeCount = nodeCount(tree)238    }239  })240}241function testIntervalFind(getTree) {242  const numEl = 100243  it('returns a type of linked list of the pointers in the interval', () => {244    const tree = getTree(numEl)245    const intervalStart = Math.floor(numEl / 10)246    const intervalEnd = intervalStart + 10247    let interval = tree.intervalFind(intervalStart, intervalEnd)248    let key = intervalStart249    while (key < intervalEnd) {250      expect(interval.key).toEqual(key)251      expect(interval.value).toEqual(valueGenerator(key))252      interval = interval.right253      key++254    }255  })256  it('returns null if there are no elements in the specified interval', () => {257    const tree = getTree(numEl)258    const intervalStart = numEl + 10259    const intervalEnd = intervalStart + 10260    expect(tree.intervalFind(intervalStart, intervalEnd)).toEqual(null)261  })262  it('excludes elements equal to the closing interval key', () => {263    const tree = getTree(Math.floor(numEl))264    const interval = tree.intervalFind(50, 51)265    expect(interval.right).toEqual(null)266  })267}268function testAverageDepth(getTree) {269  const numEl = 2000270  it('should be <= (n - 1)(n + 2) / 2n (approx. 0.5n)', () => {271    const tree = getTree(numEl)272    expect(averageDepth(tree)).toBeLessThanOrEqual(calculateMaxAverageDepth(leaveCount(tree)))273  })274  it('should be >= log(n)', () => {275    const tree = getTree(numEl)276    expect(averageDepth(tree)).toBeGreaterThanOrEqual(calculateMinAverageDepth(leaveCount(tree)))277  })278}279function calculateMaxAverageDepth(leaveCount) {280  return (leaveCount - 1) * (leaveCount + 2) / (2 * leaveCount)281}282function calculateMinAverageDepth(leaveCount) {283  return Math.log2(leaveCount)...

...40function testTreeProperties(getTree) {41  const numEl = 20000042  const formulaForMaxHeightGivenLeaveCount = 'Math.ceil(loga(n) + (1 - loga2)) (approx. [(1/log2(a))log2(n)]'43  test('if height = h >= 1; leaveCount >= 2a^(h-1)', () => {44    const tree = getTree(numEl)45    expect(tree.leaveCount).toBeGreaterThanOrEqual(leaveCountMin(tree.height, tree.a))46  })47  test('if height = h >= 1; leaveCount <= b^h', () => {48    const tree = getTree(numEl)49    expect(tree.leaveCount).toBeLessThanOrEqual(leaveCountMax(tree.height, tree.b))50  })51  test(`if leaveCount = n >= 2; height <= ${formulaForMaxHeightGivenLeaveCount}`, () => {52    const tree = getTree(numEl)53    expect(tree.height).toBeLessThanOrEqual(approximateHeightMax(tree.leaveCount, tree.a))54  })55}56function testFind(getTree) {57  const numEl = 20000058  it('returns the key value if it exists', () => {59    const tree = getTree(numEl)60    let keyToSearch = numEl61    while (keyToSearch) {62      expect(tree.find(keyToSearch)).toEqual(valueGenerator(keyToSearch))63      keyToSearch--64    }65  })66  it('returns null if the key value does not exist', () => {67    const tree = getTree(numEl)68    const missingKey = numEl + 1069    expect(tree.find(missingKey)).toEqual(null)70  })71}72function testInsertion(getTree) {73  const numEl = 20000074  it('returns true if insertion succeeds', () => {75    const tree = getTree(numEl)76    const nextKeyEl = numEl + 177    expect(tree.insert(nextKeyEl, valueGenerator(nextKeyEl))).toEqual(true)78  })79  it('returns false if insertion fails (like when there is a duplicate)', () => {80    const tree = getTree(numEl)81    const existingKey = Math.floor(numEl / 2)82    expect(tree.insert(existingKey, valueGenerator(existingKey))).toEqual(false)83  })84  describe('insertion into empty tree', () => {85    describe('elements inserted <= b', () => {86      it('leaveCount = 1 after first insert', () => {87        const tree = new Tree()88        tree.insert(1, 'one')89        expect(tree.leaveCount).toEqual(1)90      })91    })92  })93  it('should increase height on the b-th insert in a node', () => {94    const tree = getTree(defaultBValue)95    const prevHeight = tree.height96    const nextKey = defaultBValue + 197    tree.insert(nextKey, valueGenerator(nextKey))98    expect(tree.height).toEqual(prevHeight + 1)99  })100  it('should increase the leaveCount on the b-th insert in a node', () => {101    const tree = getTree(defaultBValue)102    const prevLeaveCount = tree.leaveCount103    const nextKey = defaultBValue + 1104    tree.insert(nextKey, valueGenerator(nextKey))105    expect(tree.leaveCount).toEqual(prevLeaveCount + 1)106  })107}108function testDeletion(getTree) {109  const numEl = 200000110  it('returns null if deletion failed (when tree is empty)', () => {111    const tree = getTree(0)112    expect(tree.delete(1)).toEqual(null)113  })114  it('returns null if deletion failed (when key does not exist in the tree)', () => {115    const tree = getTree(numEl)116    const missingKey = numEl + 1117    expect(tree.delete(missingKey)).toEqual(null)118  })119  it('returns and removes the value associated with the deleted key', () => {120    const tree = getTree(numEl)121    const existingKey = Math.floor(numEl / 2)122    expect(tree.find(existingKey)).toEqual(valueGenerator(existingKey))123    tree.delete(existingKey)124    expect(tree.find(existingKey)).toEqual(null)125  })126  it('does not decrease leaveCount if number of values >= "a" after deletion from a node', () => {127    const numEl = 1500128    const tree = getTree(numEl)129    const prevLeaveCount = tree.leaveCount130    let numToDelete = 100131    while (numToDelete) tree.delete(numToDelete--)132    expect(tree.leaveCount).toEqual(prevLeaveCount)133  })134  it('decreases leaveCount if number of values < "a" after deletion from a node', () => {135    const numEl = 1500136    const tree = getTree(numEl)137    const prevLeaveCount = tree.leaveCount138    let numToDelete = Math.floor(numEl / 2)139    while (numToDelete) tree.delete(numToDelete--)140    expect(tree.leaveCount).toEqual(prevLeaveCount - 1)141  })142  it('decreases height if number of values < "a" after deletion from a node', () => {143    const numEl = 1500144    const tree = getTree(numEl)145    const prevHeight = tree.height146    let numToDelete = Math.floor(numEl / 2)147    while (numToDelete) tree.delete(numToDelete--)148    expect(tree.height).toEqual(prevHeight - 1)149  })150  it('decreases the size by 1', () => {151    const elCount = Math.floor(numEl / 10)152    const tree = getTree(elCount)153    const existingKey = Math.floor(elCount / 2)154    const prevSize = tree.size155    tree.delete(existingKey)156    expect(tree.size).toEqual(prevSize - 1)157  })158}159function testTraversal(getTree) {160  const numEl = 100161  it('traverses the tree in key order', () => {162    const tree = getTree(numEl)163    let prevKey = null164    tree.traverse((k) => {165      if (prevKey) {166        expect(prevKey).toBeLessThanOrEqual(k)167      }168    })169  })170  it("traverses the tree with a key and it's value", () => {171    const tree = getTree(numEl)172    tree.traverse((k, v) => {173      expect(v).toEqual(valueGenerator(k))174    })175  })176}177function testSizeProperty(getTree) {178  it('= 0 for an empty tree', () => {179    const tree = getTree(0)180    expect(tree.size).toEqual(0)181  })182  it('increases by one on every insert', () => {183    let count = 0184    getTree(100, (tree) => {185      expect(tree.size).toEqual(++count)186    })187  })188  //test('decreases by one on every deletion')189  it('equals the number of elements inserted in the tree', () => {190    const numEl = 2000191    const tree = getTree(numEl)192    expect(tree.size).toEqual(numEl)193  })194}195function testLeaveCount(getTree) {196  const numEl = 600197  it('increases by one on every b+1 insert', () => {198    let prevLeaveCount = void(0)199    let count = 0200    getTree(numEl, (tree) => {201      count++202      if (prevLeaveCount !== void(0)) {203        const b = tree.b204        if (count === (b + 1)) {205          expect(tree.leaveCount).toEqual(prevLeaveCount + 1)206          count = 0207        } else {208          expect(tree.leaveCount).toEqual(prevLeaveCount)209        }210      }211      prevLeaveCount = tree.leaveCount212    })213  })214  //it('decreases by one on every a-1 deletion (assuming that a node was full before deletion)')215  //it('does not decrease on deletion-count >= a (assuming node was full before deletion)')216}217function testHeight(getTree) {218  const numEl = 570219  describe('elements inserted = b + 1', () => {220    it('increases the height', () => {221      let count = 0222      let prevHeight = 0223      getTree(numEl, (tree) => {224        count++225        const b = tree.b226        if (count === b + 1) {227          expect(tree.height).toEqual(prevHeight + 1)228        }229        prevHeight = tree.height230      })231    })232  })...

...39        });40        it("Output has grafted data",function(){41            graftComponent["T"].connectOutput(numberComponent.getOutput());42            numberComponent.getInput("N").assignPersistedData([0,1,1,0,0,1,1,0,0,1]);43            expect(graftComponent.getOutput().getTree().dataAtPath([0,0])).toEqual([0]);44            expect(graftComponent.getOutput().getTree().dataAtPath([0,1])).toEqual([1]);45            expect(graftComponent.getOutput().getTree().dataAtPath([0,2])).toEqual([1]);46            expect(graftComponent.getOutput().getTree().dataAtPath([0,3])).toEqual([0]);47            expect(graftComponent.getOutput().getTree().dataAtPath([0,4])).toEqual([0]);48            expect(graftComponent.getOutput().getTree().dataAtPath([0,5])).toEqual([1]);49            expect(graftComponent.getOutput().getTree().dataAtPath([0,6])).toEqual([1]);50            expect(graftComponent.getOutput().getTree().dataAtPath([0,7])).toEqual([0]);51            expect(graftComponent.getOutput().getTree().dataAtPath([0,8])).toEqual([0]);52            expect(graftComponent.getOutput().getTree().dataAtPath([0,9])).toEqual([1]);53        });54        it("Output's grafted data tree data updates when input data tree updates",function(){55            graftComponent["T"].connectOutput(numberComponent.getOutput());56            numberComponent.getInput("N").assignPersistedData([0,1,1]);57            expect(graftComponent.getOutput().getTree().dataAtPath([0,0])).toEqual([0]);58            expect(graftComponent.getOutput().getTree().dataAtPath([0,1])).toEqual([1]);59            expect(graftComponent.getOutput().getTree().dataAtPath([0,2])).toEqual([1]);60            // change inputs, verify outputs have updated61            numberComponent.getInput("N").assignPersistedData([2,3,4]);62            expect(graftComponent.getOutput().getTree().dataAtPath([0,0])).toEqual([2]);63            expect(graftComponent.getOutput().getTree().dataAtPath([0,1])).toEqual([3]);64            expect(graftComponent.getOutput().getTree().dataAtPath([0,2])).toEqual([4]);65        });66    }],["PathMapperComponent",function(){67        it("Should remap like the graft component")68    }]];...

1const { test } = require('tap')2const getTree = require('..')3const fs = require('fs')4test('getTree(dir)', async t => {5  const tree = await getTree(`${__dirname}/..`)6  t.ok(tree.children.length > 0, 'found dependencies')7  await t.test('noDev', async t => {8    const treeNoDev = await getTree(`${__dirname}/..`, { noDev: true })9    t.ok(tree.children.length > 0, 'found dependencies')10    t.ok(treeNoDev.children.length < tree.children.length, 'less dependencies')11  })12  await t.test('yarn', async t => {13    const tree = await getTree(`${__dirname}/react`)14    t.ok(tree.children.length > 0, 'found dependencies')15  })16  await t.test('node_modules', async t => {17    const tree = await getTree(`${__dirname}/node-modules`)18    t.ok(tree.children.length > 0, 'found dependencies')19  })20})21test('getTree.fromPackageJSON', async t => {22  const tree = getTree.fromPackageLock({23    packageJSON: require('../package'),24    packageLock: require('../package-lock')25  })26  t.ok(tree.children.length > 0, 'found dependencies')27  await t.test('noDev', async t => {28    const treeNoDev = getTree.fromPackageLock({29      packageJSON: require('../package'),30      packageLock: require('../package-lock'),31      noDev: true...

...47      });4849      var getTree = [];5051      githubInstance.getRepo(github.username, message.getTree.selectedRepo).getTree(message.getTree.selectedBranch, function(err, tree) {52        tree.forEach(function(item) {53          getTree.push(item);54        });55        getTree.sort(sortTree);56        port.postMessage({ returnTree: getTree });57      });58    }5960    if(message.getContents) {61      function sortTree(entry) {62        if(entry.type === 'tree') {63          return -1;64        } else {65          return 1;
...

...26    tree.addChild(5);27    tree.addChild(4, 5);28    tree.addChild(6, 5);29    30    expect( tree.getTree(4).parent).to.equal(5);31    expect( tree.getTree(5).children[0].value).to.equal(4);32    expect( tree.getTree(5).children[1].value).to.equal(6);33    tree.removeFromParent(4);34    expect( tree.getTree(5).children[0].value).to.equal(6);35  });36  it('should return true for a value that the tree removeFromParent for three level', function(){37    tree.addChild(5);38    tree.addChild(4, 5);39    tree.addChild(6, 4);40    tree.addChild(7, 4);41    tree.addChild(8, 5);42    43    expect( tree.getTree(4).parent).to.equal(5);44    expect( tree.getTree(6).parent).to.equal(4);45    expect( tree.getTree(7).parent).to.equal(4);46    expect( tree.getTree(8).parent).to.equal(5);47    tree.removeFromParent(4);48    expect( tree.getTree(5).children[0].value).to.equal(8);49    expect( tree.getTree(5).children.length).to.equal(1);50  });51  it('should invoke traverse function', function(){52    function fn(value) {53      return value + 3;54    };55    tree.addChild(5);56    tree.addChild(4, 5);57    tree.addChild(6, 4);58    tree.addChild(7, 4);59    tree.addChild(8, 5);60    tree.traverse(fn);61    62    expect( tree.getTree(8).value).to.equal(8);63    expect( tree.getTree(7).value).to.equal(7);64    expect( tree.getTree(9).value).to.equal(9);65    expect( tree.getTree(10).value).to.equal(10);66    expect( tree.getTree(11).value).to.equal(11);67  });...

...12      }13    )14  })15  it('calls github.gitdata.getTree', async () => {16    await getTree(context, {})17    expect(context.github.gitdata.getRef).toHaveBeenCalled()18    expect(context.github.gitdata.getTree).toHaveBeenCalled()19    expect(context.github.gitdata.getTree.mock.calls).toMatchSnapshot()20  })21  it('calls github.gitdata.getTree with recursive', async () => {22    await getTree(context, { recursive: true })23    expect(context.github.gitdata.getTree).toHaveBeenCalled()24    expect(context.github.gitdata.getTree.mock.calls).toMatchSnapshot()25  })26  it('calls github.gitdata.getTree with a custom sha', async () => {27    await getTree(context, { sha: 123 })28    expect(context.github.gitdata.getRef).not.toHaveBeenCalled()29    expect(context.github.gitdata.getTree).toHaveBeenCalled()30    expect(context.github.gitdata.getTree.mock.calls).toMatchSnapshot()31  })...

...12test('application', () => {13  const prev = document.querySelector('a[data-slide="prev"]');14  const next = document.querySelector('a[data-slide="next"]');15  next.click();16  expect(getTree()).toMatchSnapshot();17  prev.click();18  expect(getTree()).toMatchSnapshot();19  next.click();20  expect(getTree()).toMatchSnapshot();21  next.click();22  expect(getTree()).toMatchSnapshot();23  next.click();24  expect(getTree()).toMatchSnapshot();25  next.click();26  expect(getTree()).toMatchSnapshot();27  prev.click();28  expect(getTree()).toMatchSnapshot();29  prev.click();30  expect(getTree()).toMatchSnapshot();31  prev.click();32  expect(getTree()).toMatchSnapshot();33  prev.click();34  expect(getTree()).toMatchSnapshot();...