jherax

# Ask for the user password
# Script only works if sudo caches the password for a few minutes
sudo true

# Install kernel extra's to enable docker aufs support
# sudo apt-get -y install linux-image-extra-$(uname -r)

# Add Docker PPA and install latest version
# sudo apt-key adv --keyserver hkp://keyserver.ubuntu.com:80 --recv-keys 36A1D7869245C8950F966E92D8576A8BA88D21E9
# sudo sh -c "echo deb https://get.docker.io/ubuntu docker main > /etc/apt/sources.list.d/docker.list"

jherax

var removeEmpty = (() => {
  /**
   * Determines if the entry parameter is not an object or array.
   *
   * @private
   * @param  {Any} v: the value to test
   * @return {Boolean}
   */
  const isNotObject = v => v === null || typeof v !== 'object';

jherax

// @private
var isObject = (value) =>
  value != null && typeof value === 'object';

/**
 * @private
 * Restores the one-level-depth object to the original nested object.
 *
 * @param  {Array} names: list of keys in the object
 * @param  {any} value: the value of the object to transform

jherax

/**
 * Gets the first value associated to an object's property.
 * Can go recursively through objects and arrays.
 *
 * @param  {Object | Array}  obj: the object or array to look for the property/index value
 * @param  {String | Number} key: the object's property name or array index
 * @return {Any}
 */
function getValueByKey(obj, key) {
  let value;

jherax

/**
 * Checks whether a storage mechanism is available.
 * @param {String} storageType: it can be "localStorage", "sessionStorage" or any global object that implements Web Storage interface.
 * @return {Boolean}
 */
function storageAvailable(storageType) {
  var storage = window[storageType];
  var data = '__proxy-storage__';
  try {
    storage.setItem(data, data);

jherax

/**
 * Sorts an array of objects In-Place,
 * sorting by multiple fields sequentially.
 *
 * @description This function is meant to be used
 * with arrays of objects, AND when you need to set
 * multiple sorting criteria. For other cases it is
 * recommended to use the native method `array.sort(callback)`
 * since for simple cases this function is more expensive
 * in time and memory.

jherax

/**
 * Sums all the values in an array by reducing it.
 *
 * @param  {Array} array: the collection to iterate
 * @param  {String | Number} prop: (optional) property name or array index
 * @return {Number}
 */
function sumValues(array, prop) {
  if (!array || !array.length) return 0;
  if ((/string|number/).test(typeof prop)) {

jherax

/**
 * Merges all inner arrays into one-level depth array.
 *
 * @param  {Array} array: the array to be flattened
 * @return {Array}
 */
const flatten = array => array.reduce(
  (flattened, cv) => flattened.concat(Array.isArray(cv) ? flatten(cv) : cv),
  [] // initial value of flattened array
);

jherax

/**
 * Returns a random integer between min and max
 *
 * @export
 * @param  {Number} min: minimum value (inclusive)
 * @param  {Number} max: maximum value (inclusive)
 * @return {Number}
 */
function randomInt(min, max) {
  return Math.floor(Math.random() * (1 + max - min)) + min;

jherax

/**
 * Gets all repeated values between two arrays
 *
 * @param  {Array} array1: array to compare
 * @param  {Array} array2: array to compare
 * @return {Array}
 */
function repeatedValues(array1, array2) {
  return array1.reduce((repeated, value) => {
    if (~array2.indexOf(value) && !~repeated.indexOf(value)) {