diff --git a/starter-code/.jshintrc b/starter-code/.jshintrc new file mode 100644 index 0000000..697370c --- /dev/null +++ b/starter-code/.jshintrc @@ -0,0 +1 @@ +{ "esversion":6 } diff --git a/starter-code/package-lock.json b/starter-code/package-lock.json new file mode 100644 index 0000000..011765c --- /dev/null +++ b/starter-code/package-lock.json @@ -0,0 +1,243 @@ +{ + "name": "mocha-practice", + "version": "1.0.0", + "lockfileVersion": 1, + "dependencies": { + "assertion-error": { + "version": "1.0.2", + "resolved": "https://registry.npmjs.org/assertion-error/-/assertion-error-1.0.2.tgz", + "integrity": "sha1-E8pRXYYgbaC6xm6DTdOX2HWBCUw=", + "dev": true + }, + "balanced-match": { + "version": "1.0.0", + "resolved": "https://registry.npmjs.org/balanced-match/-/balanced-match-1.0.0.tgz", + "integrity": "sha1-ibTRmasr7kneFk6gK4nORi1xt2c=", + "dev": true + }, + "brace-expansion": { + "version": "1.1.8", + "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-1.1.8.tgz", + "integrity": "sha1-wHshHHyVLsH479Uad+8NHTmQopI=", + "dev": true + }, + "browser-stdout": { + "version": "1.3.0", + "resolved": "https://registry.npmjs.org/browser-stdout/-/browser-stdout-1.3.0.tgz", + "integrity": "sha1-81HTKWnTL6XXpVZxVCY9korjvR8=", + "dev": true + }, + "chai": { + "version": "3.5.0", + "resolved": "https://registry.npmjs.org/chai/-/chai-3.5.0.tgz", + "integrity": "sha1-TQJjewZ/6Vi9v906QOxW/vc3Mkc=", + "dev": true + }, + "commander": { + "version": "2.9.0", + "resolved": "https://registry.npmjs.org/commander/-/commander-2.9.0.tgz", + "integrity": "sha1-nJkJQXbhIkDLItbFFGCYQA/g99Q=", + "dev": true + }, + "concat-map": { + "version": "0.0.1", + "resolved": "https://registry.npmjs.org/concat-map/-/concat-map-0.0.1.tgz", + "integrity": "sha1-2Klr13/Wjfd5OnMDajug1UBdR3s=", + "dev": true + }, + "debug": { + "version": "2.6.0", + "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.0.tgz", + "integrity": "sha1-vFlryr52F/Edn6FTYe3tVgi4SZs=", + "dev": true + }, + "deep-eql": { + "version": "0.1.3", + "resolved": "https://registry.npmjs.org/deep-eql/-/deep-eql-0.1.3.tgz", + "integrity": "sha1-71WKyrjeJSBs1xOQbXTlaTDrafI=", + "dev": true, + "dependencies": { + "type-detect": { + "version": "0.1.1", + "resolved": "https://registry.npmjs.org/type-detect/-/type-detect-0.1.1.tgz", + "integrity": "sha1-C6XsKohWQORw6k6FBZcZANrFiCI=", + "dev": true + } + } + }, + "diff": { + "version": "3.2.0", + "resolved": "https://registry.npmjs.org/diff/-/diff-3.2.0.tgz", + "integrity": "sha1-yc45Okt8vQsFinJck98pkCeGj/k=", + "dev": true + }, + "escape-string-regexp": { + "version": "1.0.5", + "resolved": "https://registry.npmjs.org/escape-string-regexp/-/escape-string-regexp-1.0.5.tgz", + "integrity": "sha1-G2HAViGQqN/2rjuyzwIAyhMLhtQ=", + "dev": true + }, + "fs.realpath": { + "version": "1.0.0", + "resolved": "https://registry.npmjs.org/fs.realpath/-/fs.realpath-1.0.0.tgz", + "integrity": "sha1-FQStJSMVjKpA20onh8sBQRmU6k8=", + "dev": true + }, + "glob": { + "version": "7.1.1", + "resolved": "https://registry.npmjs.org/glob/-/glob-7.1.1.tgz", + "integrity": "sha1-gFIR3wT6rxxjo2ADBs31reULLsg=", + "dev": true + }, + "graceful-readlink": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/graceful-readlink/-/graceful-readlink-1.0.1.tgz", + "integrity": "sha1-TK+tdrxi8C+gObL5Tpo906ORpyU=", + "dev": true + }, + "growl": { + "version": "1.9.2", + "resolved": "https://registry.npmjs.org/growl/-/growl-1.9.2.tgz", + "integrity": "sha1-Dqd0NxXbjY3ixe3hd14bRayFwC8=", + "dev": true + }, + "has-flag": { + "version": "1.0.0", + "resolved": "https://registry.npmjs.org/has-flag/-/has-flag-1.0.0.tgz", + "integrity": "sha1-nZ55MWXOAXoA8AQYxD+UKnsdEfo=", + "dev": true + }, + "inflight": { + "version": "1.0.6", + "resolved": "https://registry.npmjs.org/inflight/-/inflight-1.0.6.tgz", + "integrity": "sha1-Sb1jMdfQLQwJvJEKEHW6gWW1bfk=", + "dev": true + }, + "inherits": { + "version": "2.0.3", + "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.3.tgz", + "integrity": "sha1-Yzwsg+PaQqUC9SRmAiSA9CCCYd4=", + "dev": true + }, + "json3": { + "version": "3.3.2", + "resolved": "https://registry.npmjs.org/json3/-/json3-3.3.2.tgz", + "integrity": "sha1-PAQ0dD35Pi9cQq7nsZvLSDV19OE=", + "dev": true + }, + "lodash._baseassign": { + "version": "3.2.0", + "resolved": "https://registry.npmjs.org/lodash._baseassign/-/lodash._baseassign-3.2.0.tgz", + "integrity": "sha1-jDigmVAPIVrQnlnxci/QxSv+Ck4=", + "dev": true + }, + "lodash._basecopy": { + "version": "3.0.1", + "resolved": "https://registry.npmjs.org/lodash._basecopy/-/lodash._basecopy-3.0.1.tgz", + "integrity": "sha1-jaDmqHbPNEwK2KVIghEd08XHyjY=", + "dev": true + }, + "lodash._basecreate": { + "version": "3.0.3", + "resolved": "https://registry.npmjs.org/lodash._basecreate/-/lodash._basecreate-3.0.3.tgz", + "integrity": "sha1-G8ZhYU2qf8MRt9A78WgGoCE8+CE=", + "dev": true + }, + "lodash._getnative": { + "version": "3.9.1", + "resolved": "https://registry.npmjs.org/lodash._getnative/-/lodash._getnative-3.9.1.tgz", + "integrity": "sha1-VwvH3t5G1hzc3mh9ZdPuy6o6r/U=", + "dev": true + }, + "lodash._isiterateecall": { + "version": "3.0.9", + "resolved": "https://registry.npmjs.org/lodash._isiterateecall/-/lodash._isiterateecall-3.0.9.tgz", + "integrity": "sha1-UgOte6Ql+uhCRg5pbbnPPmqsBXw=", + "dev": true + }, + "lodash.create": { + "version": "3.1.1", + "resolved": "https://registry.npmjs.org/lodash.create/-/lodash.create-3.1.1.tgz", + "integrity": "sha1-1/KEnw29p+BGgruM1yqwIkYd6+c=", + "dev": true + }, + "lodash.isarguments": { + "version": "3.1.0", + "resolved": "https://registry.npmjs.org/lodash.isarguments/-/lodash.isarguments-3.1.0.tgz", + "integrity": "sha1-L1c9hcaiQon/AGY7SRwdM4/zRYo=", + "dev": true + }, + "lodash.isarray": { + "version": "3.0.4", + "resolved": "https://registry.npmjs.org/lodash.isarray/-/lodash.isarray-3.0.4.tgz", + "integrity": "sha1-eeTriMNqgSKvhvhEqpvNhRtfu1U=", + "dev": true + }, + "lodash.keys": { + "version": "3.1.2", + "resolved": "https://registry.npmjs.org/lodash.keys/-/lodash.keys-3.1.2.tgz", + "integrity": "sha1-TbwEcrFWvlCgsoaFXRvQsMZWCYo=", + "dev": true + }, + "minimatch": { + "version": "3.0.4", + "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-3.0.4.tgz", + "integrity": "sha512-yJHVQEhyqPLUTgt9B83PXu6W3rx4MvvHvSUvToogpwoGDOUQ+yDrR0HRot+yOCdCO7u4hX3pWft6kWBBcqh0UA==", + "dev": true + }, + "minimist": { + "version": "0.0.8", + "resolved": "https://registry.npmjs.org/minimist/-/minimist-0.0.8.tgz", + "integrity": "sha1-hX/Kv8M5fSYluCKCYuhqp6ARsF0=", + "dev": true + }, + "mkdirp": { + "version": "0.5.1", + "resolved": "https://registry.npmjs.org/mkdirp/-/mkdirp-0.5.1.tgz", + "integrity": "sha1-MAV0OOrGz3+MR2fzhkjWaX11yQM=", + "dev": true + }, + "mocha": { + "version": "3.4.2", + "resolved": "https://registry.npmjs.org/mocha/-/mocha-3.4.2.tgz", + "integrity": "sha1-0O9NMyEm2/GNDWQMmzgt1IvpdZQ=", + "dev": true + }, + "ms": { + "version": "0.7.2", + "resolved": "https://registry.npmjs.org/ms/-/ms-0.7.2.tgz", + "integrity": "sha1-riXPJRKziFodldfwN4aNhDESR2U=", + "dev": true + }, + "once": { + "version": "1.4.0", + "resolved": "https://registry.npmjs.org/once/-/once-1.4.0.tgz", + "integrity": "sha1-WDsap3WWHUsROsF9nFC6753Xa9E=", + "dev": true + }, + "path-is-absolute": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/path-is-absolute/-/path-is-absolute-1.0.1.tgz", + "integrity": "sha1-F0uSaHNVNP+8es5r9TpanhtcX18=", + "dev": true + }, + "supports-color": { + "version": "3.1.2", + "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-3.1.2.tgz", + "integrity": "sha1-cqJiiU2dQIuVbKBf83su2KbiotU=", + "dev": true + }, + "type-detect": { + "version": "1.0.0", + "resolved": "https://registry.npmjs.org/type-detect/-/type-detect-1.0.0.tgz", + "integrity": "sha1-diIXzAbbJY7EiQihKY6LlRIejqI=", + "dev": true + }, + "wrappy": { + "version": "1.0.2", + "resolved": "https://registry.npmjs.org/wrappy/-/wrappy-1.0.2.tgz", + "integrity": "sha1-tSQ9jz7BqjXxNkYFvA0QNuMKtp8=", + "dev": true + } + } +} diff --git a/starter-code/src/array-functions.js b/starter-code/src/array-functions.js index ec99c6a..b8c883e 100644 --- a/starter-code/src/array-functions.js +++ b/starter-code/src/array-functions.js @@ -1,22 +1,41 @@ -var ArrayFunctions = function (){} +class ArrayFunctions { + constructor () { + + } + + printSpecial (array) { + return array.join(" --- "); + } + + doubleArray (array) { + return array.map(number => number * 2); + + } + + superPower (array) { + return array.reduce((sum, number, index) => sum + (number * (Math.pow(10, index)))); + + } +} +//var ArrayFunctions = function (){}; // 1) Define a function that takes an array with numbers and prints all the elements of the array, separated by " --- " // ArrayFunctions.printSpecial([12, 33, 144, 122]) // 12 -- 33 -- 144 -- 122 -ArrayFunctions.prototype.printSpecial = function (array) { +/*ArrayFunctions.prototype.printSpecial = function (array) { return array.join(" --- "); -}; +};*/ // 2) Define a function that takes an array with numbers and returns another array where each element contains double each element in the array // ArrayFunctions.doubleMyArray([10, 20, 35, 12]) // [20, 40, 70, 24] -ArrayFunctions.prototype.doubleArray = function(array){ +/*ArrayFunctions.prototype.doubleArray = function(array){ return array.map(function(number){ return number * 2; }); -}; +};*/ // 3) Define a function that takes an array with numbers and returns the result of multiplying each element by ten to the power of the position it's in: // ArrayFunctions.superPower([1,2,3,4,5]) @@ -24,10 +43,10 @@ ArrayFunctions.prototype.doubleArray = function(array){ // explanation: (1 x 10^0) + (2 x 10^1) + (3 x 10^2) + (4 x 10^3) + (5 x 10^4) // explanation: (1) + (20) + (300) + (4000) + (50000) -ArrayFunctions.prototype.superPower = function(array){ +/*ArrayFunctions.prototype.superPower = function(array){ return array.reduce(function(sum, number, index){ return sum + (number * (Math.pow(10, index))); }); -} +};*/ module.exports = ArrayFunctions; diff --git a/starter-code/src/bubble-sort.js b/starter-code/src/bubble-sort.js index fe84337..32751e7 100644 --- a/starter-code/src/bubble-sort.js +++ b/starter-code/src/bubble-sort.js @@ -1,12 +1,12 @@ function bubbleSort(array) { - var length = array.length; - for (var i = (length - 1); i > 0; i--) { + const length = array.length; + for (let i = (length - 1); i > 0; i--) { // Number of passes - for (var j = (length - i); j > 0; j--) { + for (let j = (length - i); j > 0; j--) { // Compare the adjacent positions if (array[j] < array[j - 1]) { // Swap the numbers - var tmp = array[j]; + let tmp = array[j]; array[j] = array[j - 1]; array[j - 1] = tmp; } diff --git a/starter-code/src/merge-sort.js b/starter-code/src/merge-sort.js index f6e4e70..f9b959e 100644 --- a/starter-code/src/merge-sort.js +++ b/starter-code/src/merge-sort.js @@ -1,15 +1,15 @@ function mergeSort(array) { - if(array.length < 2) { return array } + if(array.length < 2) { return array; } - var middle = Math.floor(array.length / 2); - var left = array.slice(0, middle); - var right = array.slice(middle); + const middle = Math.floor(array.length / 2); + const left = array.slice(0, middle); + const right = array.slice(middle); return sortHalves(mergeSort(left), mergeSort(right)); } function sortHalves(left, right) { - var array = []; + let array = []; while(left.length && right.length) { if(left[0] < right[0]) { @@ -21,7 +21,10 @@ function sortHalves(left, right) { // array.slice() with no arguments is a trick to make a copy of the array // .concat is to smash all of the arrays together // ...maybe there's an ES6 way to do this? - return array.concat(left.slice()).concat(right.slice()); + //return array.concat(left.slice()).concat(right.slice()); + array.push(...left, ...right); + //array = [...left, ...right]; + return array; } module.exports = mergeSort; diff --git a/starter-code/src/sequencer.js b/starter-code/src/sequencer.js index 02284cc..a539d7b 100644 --- a/starter-code/src/sequencer.js +++ b/starter-code/src/sequencer.js @@ -1,68 +1,75 @@ -var LetterSequence = function(){} +class LetterSequence { + createSequence (sequence){ + const characters = [...sequence]; + let containerString = ""; + let repeatCount = 1; -LetterSequence.prototype.createSequence = function(sequence){ - var characters = sequence.split(""); - var containerString = ""; - var repeatCount = 1; + for (let i = 0; i < characters.length; i++){ + let currentChar = characters[i]; + let prevChar = characters[i - 1]; + let nextChar = characters[i + 1]; - for (var i = 0; i < characters.length; i++){ - var currentChar = characters[i]; - var prevChar = characters[i - 1]; - var nextChar = characters[i + 1]; + if (currentChar === prevChar){ + repeatCount++; + } - if (currentChar === prevChar){ - repeatCount++ + // If the sequence is broken, and the repeat count is greater than 1 + // add the letter and the repeat count to the return string + if (currentChar !== nextChar && repeatCount >= 1){ + var repeats = repeatCount > 1 ? String(repeatCount) : ""; + containerString += (repeats + currentChar); + repeatCount = 1; + } } - // If the sequence is broken, and the repeat count is greater than 1 - // add the letter and the repeat count to the return string - if (currentChar !== nextChar && repeatCount >= 1){ - var repeats = repeatCount > 1 ? String(repeatCount) : "" - containerString += (repeats + currentChar) - repeatCount = 1; - } + return containerString; } - return containerString; -} + decodeSequence (sequence){ + let containerString = ""; + const characters = [...sequence]; + + for (let i = 0; i < characters.length; i++){ + let current = characters[i]; + let nextChar = characters[i + 1]; -LetterSequence.prototype.decodeSequence = function(sequence){ - var containerString = ""; - var characters = sequence.split(""); - - for (var i = 0; i < characters.length; i++){ - var current = characters[i]; - var nextChar = characters[i + 1]; - - // If the current character is not a number, then there must be a letter after it - if (!isNaN(characters[i])){ - // So repeat it n times, and add it to our return value - var letters = this._repeat(current, nextChar); - containerString += letters; - // If the current character is a letter, and the last character is a letter, then - // it must be a lone letter - } else if (isNaN(characters[i]) && isNaN(characters[i - 1])){ - containerString += characters[i] + // If the current character is not a number, then there must be a letter after it + if (!isNaN(characters[i])){ + // So repeat it n times, and add it to our return value + let letters = this._repeat(current, nextChar); + containerString += letters; + // If the current character is a letter, and the last character is a letter, then + // it must be a lone letter + } else if (isNaN(characters[i]) && isNaN(characters[i - 1])){ + containerString += characters[i]; + } } + + return containerString; } - return containerString; -} + _repeat (count, character){ + let characters = ""; -// Maybe there's a function to do this in ES6...? + if (count <= 1){ + count = 1; + } -LetterSequence.prototype._repeat = function(count, character){ - var characters = ""; + for (let i = 0; i < count; i++){ + characters += character; + } - if (count <= 1){ - count = 1 + return characters; } +} + + + + + + +// Maybe there's a function to do this in ES6...? - for (var i = 0; i < count; i++){ - characters += character; - } - return characters; -} module.exports = LetterSequence;