synchro of spec with lseqarray, package and license

LICENSE

@@ -0,0 +1,20 @@
+The MIT License (MIT)
+
+Copyright (c) 2014 Chat-Wane
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

lib/lseqtree.js

@@ -120,7 +120,7 @@ LSEQTree.prototype.applyInsert = function(e, i){
     if (result != -1){
 	// #3a if it exists, return the index of insertion
 	this.length += 1;
-	return (this.root.getIndex(node)-1);
+	return this.root.getIndex(node);
     } else {
 	// #3b return -1 otherwise
 	return -1;
@@ -143,7 +143,7 @@ LSEQTree.prototype.applyRemove = function(i){
 	return -1;
     } else {
 	this.length -= 1;
-	return (position-1);
+	return position;
     };
 };
 

package.json

@@ -0,0 +1,33 @@
+{
+    "name": "lseqtree",
+    "version": "0.1.0",
+    "author": "Chat-Wane <[email protected]>",
+    "description": "A data structure for distributed arrays using the LSEQ allocation strategy.",
+    "main": "./lib/lseqtree.js",
+    "repository": {
+	"type": "git",
+	"url": "https://github.com/chat-wane/LSEQTree.git"
+    },
+    "keywords": [
+	"distributed structure",
+	"CRDT",
+	"LSEQ",
+	"tree",
+	"array",
+	"vector"
+    ],
+    "dependencies": {
+	"BigInt": "5.4.x"
+    },
+    "devDependencies": {
+	"expect.js":  "0.2.x",
+	"mocha":  "1.17.x"
+    },
+    "bundledDependencies": [
+	"BigInt"
+    ],
+    "license": "MIT",
+    "engines": {
+	"node": ">=0.10.28"
+    }
+}

test/testlseqtree.js

@@ -90,15 +90,15 @@ describe('lseqtree.js', function(){
 		       var exist = lseq.applyInsert(ei._e,ei._i);
 		       expect(exist).to.be.eql(-1);
 		       var position = lseq2.applyInsert(ei._e,ei._i);
-		       expect(position).to.be.eql(0);
+		       expect(position).to.be.eql(1);
 		   });
 	    });
 	describe('applyRemove', function(){
 		it('try to delete a non existing element', function(){
 			var lseq = new LSEQ(42);
 			var ei = lseq.insert('a',0);
 			var position = lseq.applyRemove(ei._i);
-			expect(position).to.be.eql(0);
+			expect(position).to.be.eql(1);
 			var exist = lseq.applyRemove(ei._i);
 			expect(exist).to.be.eql(-1);
 		    });