spelling: javascript

Author: jsoref

README.md

@@ -1,4 +1,4 @@
-# Neo4j Driver 1.6 for Javascript
+# Neo4j Driver 1.6 for JavaScript
 
 
 A database driver for Neo4j 3.0.0+.
@@ -265,7 +265,7 @@ While there is no need to grab admin right if you are running tests against an e
 
 ## A note on numbers and the Integer type
 The Neo4j type system includes 64-bit integer values.
-However, Javascript can only safely represent integers between `-(2`<sup>`53`</sup>` - 1)` and `(2`<sup>`53`</sup>` - 1)`.
+However, JavaScript can only safely represent integers between `-(2`<sup>`53`</sup>` - 1)` and `(2`<sup>`53`</sup>` - 1)`.
 In order to support the full Neo4j type system, the driver will not automatically convert to javascript integers.
 Any time the driver receives an integer value from Neo4j, it will be represented with an internal integer type by the driver.
 

docs/README.md

@@ -1,4 +1,4 @@
-# Documentation for Neo4j Bolt Driver for Javascript
+# Documentation for Neo4j Bolt Driver for JavaScript
 The docs are generated with [esdoc](https://github.com/esdoc/esdoc), which is added 
 as a devDependency to this project.
 

esdoc.json

@@ -38,7 +38,7 @@
           "enable": true
         },
         "brand": {
-          "title": "Neo4j Bolt Driver 1.6 for Javascript",
+          "title": "Neo4j Bolt Driver 1.6 for JavaScript",
           "repository": "https://github.com/neo4j/neo4j-javascript-driver"
         }
       }

src/v1/integer.js

@@ -57,9 +57,9 @@ class Integer {
 
   // The internal representation of an Integer is the two given signed, 32-bit values.
   // We use 32-bit pieces because these are the size of integers on which
-  // Javascript performs bit-operations.  For operations like addition and
+  // JavaScript performs bit-operations.  For operations like addition and
   // multiplication, we split each number into 16 bit pieces, which can easily be
-  // multiplied within Javascript's floating-point representation without overflow
+  // multiplied within JavaScript's floating-point representation without overflow
   // or change in sign.
   //
   // In the algorithms below, we frequently reduce the negative case to the