This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const fs = require('fs'); | |
| const path = require('path'); | |
| const s3etm = require('s3-emails-to-mongo'); | |
| // MAKE THIS PART DYNAMIC LATER | |
| s3etm.configure({ | |
| Bucket: 'zhillb-mail', | |
| }); | |
| module.exports = async (req, res, next) => { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| [nodemon] 1.14.11 | |
| [nodemon] to restart at any time, enter `rs` | |
| [nodemon] watching: *.* | |
| [nodemon] starting `node server.js` | |
| express:router:route new '/' +0ms | |
| express:router:layer new '/' +1ms | |
| express:router:route get '/' +1ms | |
| express:router:layer new '/' +0ms | |
| express:router:route new '/login' +0ms | |
| express:router:layer new '/login' +0ms |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| var generate = function(numRows) { | |
| var rows = []; | |
| for (var row = 1; row <= numRows; row++) { | |
| rows.push([]); | |
| var rowIndex = row - 1; | |
| var numOfItems = row; | |
| for (var itemNum = 1; itemNum <= numOfItems; itemNum++) { | |
| if (itemNum === 1 || itemNum === numOfItems) { | |
| rows[rowIndex].push(1); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| LinkedList.prototype.reverse = function() { | |
| var node = this.head; | |
| var previous = null; | |
| while (node !== null) { | |
| var save = node.next; | |
| node.next = previous; | |
| previous = node; | |
| node = save; | |
| } | |
| var save = this.head; |
OlderNewer