@qooxdoo/framework/source/class/qx/tool/utils/Values.js

The JS Framework for Coders

/* ************************************************************************
 *
 *    qooxdoo-compiler - node.js based replacement for the Qooxdoo python
 *    toolchain
 *
 *    https://github.com/qooxdoo/qooxdoo
 *
 *    Copyright:
 *      2011-2017 Zenesis Limited, http://www.zenesis.com
 *
 *    License:
 *      MIT: https://opensource.org/licenses/MIT
 *
 *      This software is provided under the same licensing terms as Qooxdoo,
 *      please see the LICENSE file in the Qooxdoo project's top-level directory
 *      for details.
 *
 *    Authors:
 *      * John Spackman (john.spackman@zenesis.com, @johnspackman)
 *
 * *********************************************************************** */

qx.Class.define("qx.tool.utils.Values", {
  statics: {
    /**
     * Performs a binary search on the host array.
     *
     * Thanks to Oliver Caldwell for this snippet, https://oli.me.uk/2013/06/08/searching-javascript-arrays-with-a-binary-search/
     *
     * @param {*} array The array to search.
     * @param {*} searchElement The item to search for within the array.
     * @return {Number} The index of the element which defaults to -1 when not found.
     */
    binaryIndexOf(array, searchElement) {
      var minIndex = 0;
      var maxIndex = array.length - 1;
      var currentIndex;
      var currentElement;

      while (minIndex <= maxIndex) {
        currentIndex = ((minIndex + maxIndex) / 2) | 0;
        currentElement = array[currentIndex];

        if (currentElement < searchElement) {
          minIndex = currentIndex + 1;
        } else if (currentElement > searchElement) {
          maxIndex = currentIndex - 1;
        } else {
          return currentIndex;
        }
      }

      return -1;
    },

    binaryStartsWith(array, searchElement) {
      var minIndex = 0;
      var maxIndex = array.length - 1;
      var currentIndex;
      var currentElement;

      while (minIndex <= maxIndex) {
        currentIndex = ((minIndex + maxIndex) / 2) | 0;
        currentElement = array[currentIndex];

        if (currentElement.startsWith(searchElement)) {
          while (currentIndex > 0) {
            if (!array[currentIndex - 1].startsWith(searchElement)) {
              break;
            }
            currentIndex--;
          }
          return currentIndex;
        }

        if (currentElement < searchElement) {
          minIndex = currentIndex + 1;
        } else if (currentElement > searchElement) {
          maxIndex = currentIndex - 1;
        }
      }

      return -1;
    },

    merge(target, ...sources) {
      if (sources) {
        sources.forEach(src => {
          for (let key in src) {
            target[key] = src[key];
          }
        });
      }
      return target;
    }
  }
});