UNPKG

bet

Version:

A Binary Expression Tree implementation which can evaluate infix mathematical expressions

24 lines (23 loc) 666 B
{ "name": "bet", "version": "0.2.0", "author": "Paul Moore <paul@paul-moore.ca> (http://paul-moore.ca)", "description": "A Binary Expression Tree implementation which can evaluate infix mathematical expressions", "keywords": ["binary", "expression", "tree", "shunting", "yard"], "main": "lib/BET.js", "repository": { "type": "git", "url": "https://github.com/paulmoore/BET" }, "devDependencies": { "nodeunit": "0.7.x", "coffee-script": "1.6.x", "coffeelint": "0.5.x", "source-map-support": "0.1.x" }, "scripts": { "prepublish": "cake build", "pretest": "cake -t build", "test": "nodeunit lib/tests.js" } }