'use strict';

var eclib = require('../../index');
var enums = eclib.enums;
var ECLibUtil = eclib.util;
var buffertools = require("buffertools");
var crypto = require('crypto');
var assert = require('assert');

var ec = new eclib({
  "bc_id": enums.BackendId["EC_BACKEND_FLAT_XOR_HD"],
  "k": 3,
  "m": 3,
  "hd": 3
});

ec.init();

var data = new Buffer("Hello world of Rust ! This is some serious decoding !");

describe('reconstruct multiple fragments:', function(done) {

it('shall be OK', function(done) {
ec.encode(data, function(status, dataFragments, parityFragments, fragmentLength) {
    assert.equal(status, 0);

    var allFragments = dataFragments.concat(parityFragments);
    // Lose 3 fragments, 2 of which are data. We should be able to still
    // recover the data.
    var missing_frags_indx = [1, 0, 5];
    // descending ordered
    missing_frags_indx.sort(function(a, b){return b-a});
    // backup missing fragments
    var orig_missing_frags = [allFragments[missing_frags_indx[0]]];
    for (var idx = 1; idx < missing_frags_indx.length; idx++){
        orig_missing_frags.push(allFragments[missing_frags_indx[idx]]);
    }
    // remove missing fragments
    for (idx = 0; idx < missing_frags_indx.length; idx++){
        allFragments.splice(missing_frags_indx[idx], 1);
    }

    ec.reconstruct(allFragments, [0, 5, 1], function(err, newAllFragments) {
        assert.equal(err, null);
        // check reconstructed fragments and original ones
        for (idx = 0; idx < missing_frags_indx.length; idx++){
            assert.equal(buffertools.compare(orig_missing_frags[idx], newAllFragments[missing_frags_indx[idx]]), 0);
        }

        ec.decode(newAllFragments, false, function(status, decoded_data) {
            // check that the decoded data is like the initial one
            assert.equal(buffertools.compare(data, decoded_data), 0);

            done();
        });
    });
});
});
});

@@ -875,34 +875,8 @@
 ort(
-function(a, b)%7Breturn b-a%7D
 );%0A 

correct a randomly failing test