// import visualization libraries {

const { Tracer, Array1DTracer, Array2DTracer, LogTracer, Layout, VerticalLayout } = require('algorithm-visualizer');

// }

let word = 'virgo';

const suffixArray = (function skeleton(word) {

const arr = [];

for (let i = 1; i <= word.length + 1; i++) {

arr.push([i, '-']);

}

return arr;

}(word));

// define tracer variables {

const saTracer = new Array2DTracer('Suffix Array');

const wordTracer = new Array1DTracer('Given Word');

const logger = new LogTracer('Progress');

Layout.setRoot(new VerticalLayout([saTracer, wordTracer, logger]));

saTracer.set(suffixArray);

wordTracer.set(word);

Tracer.delay();

// }

word += '$'; // special character

// logger {

logger.println('Appended \'$\' at the end of word as terminating (special) character. Beginning filling of suffixes');

// }

function selectSuffix(word, i) {

let c = i;

while (i < word.length - 1) {

// visualize {

wordTracer.select(i);

// }

i++;

}

// visualize {

Tracer.delay();

// }

while (c < word.length - 1) {

// visualize {

wordTracer.deselect(c);

// }

c++;

}

// visualize {

Tracer.delay();

// }

}

(function createSA(sa, word) {

for (let i = 0; i < word.length; i++) {

sa[i][1] = word.slice(i);

selectSuffix(word, i);

// visualize {

saTracer.patch(i, 1, sa[i][1]);

Tracer.delay();

saTracer.depatch(i, 1);

Tracer.delay();

// }

}

}(suffixArray, word));

// logger {

logger.println('Re-organizing Suffix Array in sorted order of suffixes using efficient sorting algorithm (O(N.log(N)))');

// }

suffixArray.sort((a, b) => {

// logger {

logger.println(`The condition a [1] (${a[1]}) > b [1] (${b[1]}) is ${a[1] > b[1]}`);

// }

return a[1] > b[1];

});

// visualize {

for (let i = 0; i < word.length; i++) {

saTracer.patch(i, 0, suffixArray[i][0]);

saTracer.patch(i, 1, suffixArray[i][1]);

Tracer.delay();

saTracer.depatch(i, 0);

saTracer.depatch(i, 1);

}

// }