{
  "name": "dbly-linked-hashtable-list",
  "version": "0.3.2",
  "description": "Javascript implementation of a doubly linked-list data structure, with built-in hashtable for O(1) lookups and removals",
  "main": "index.js",
  "directories": {
    "test": "test"
  },
  "scripts": {
    "pretest": "npm run lint",
    "test": "nyc mocha",
    "lint": "eslint index.js lib/*.js test/*.js"
  },
  "repository": {
    "type": "git",
    "url": "https://github.com/sikanrong/doubly-linked-list.git"
  },
  "keywords": [
    "doubly linked-list",
    "linked list",
    "hashtable",
    "hash table",
    "data structure"
  ],
  "author": "Jason Jones, Alexander Pilafian",
  "license": "MIT",
  "devDependencies": {
    "chai": "^4.1.2",
    "eslint": "^4.16.0",
    "mocha": "^5.0.0",
    "nyc": "^11.4.0"
  },
  "dependencies": {
    "lodash.isequal": "^4.5.0"
  }
}