How to find items in an array Back

Before discussing about this topic, we have been used to using Array.prototype.indexOf() or Array.prototye.findIndex() to find an item in an array. Similarly, underscore has also implemented some methods for you to do the same thing like _.findIndex(), _.findLastIndex(), _.indexOf(), _.lastIndexOf(), and _.sortIndex().

Firstly, it's easy to know that both _.findIndex() and _.findLastIndex() are used to find items in an array with given conditions (functions). Take the following case as an example:

var arr = [1, 3, 5, 2, 4, 6];

var isEven = function(num) {
    return !(num & 1); /** `num & 1` is same as `num % 2 === 1` */
};

var idx = _.findIndex(arr, isEven); /** => 3 */

As we can see, the method _.findIndex() will return the element which has matched the given condition. Conversely, _.findLastIndex() is used to find the last element which has matched the conditions which you provide.

To implement such two familiar functions, underscore has create a so called predicate function to decide how to search: positive or negative.

/**
 * Generator function to create the findIndex and findLastIndex functions
 * dir === 1 means to find in a positive sequence
 * dir === -1 means to find in a negative sequence
 */
function createPredicateIndexFinder(dir) {
    /** return a closure function */
    return function(array, predicate, context) {
        predicate = cb(predicate, context);

        var length = getLength(array);

        /** set the start position according to dir */
        var index = dir > 0 ? 0 : length - 1;

        for (; index >= 0 && index < length; index += dir) {
          /** return the index if matched */
          if (predicate(array[index], index, array)) return index;
        }

        /** return -1 if nothing is found */
        return -1;
    };
}

/**
 * Returns the first index on an array-like that passes a predicate test
 * _.findIndex(array, predicate, [context])
 */
_.findIndex = createPredicateIndexFinder(1);

/** _.findLastIndex(array, predicate, [context]) */
_.findLastIndex = createPredicateIndexFinder(-1);

Then, how about _.sortIndex()? When there is a ordered array, and if we want to find out where to insert an item so that the array can keep itself ordered, _.sortIndex() is the choice. Apparently, we can implement such a function by using binary searching algorithm.

/**_.sortedIndex(list, value, [iteratee], [context]) */
_.sortedIndex = function(array, obj, iteratee, context) {
    /** iteratee can be null or a function */
    iteratee = cb(iteratee, context, 1);

    /** the value returned by the iterative function */
    var value = iteratee(obj);

    var low = 0, high = getLength(array);

    /** binary searching */
    while (low < high) {
        var mid = Math.floor((low + high) / 2);
        if (iteratee(array[mid]) < value) low = mid + 1; else high = mid;
    }

    return low;
};

When it comes to _.indexOf() and _.lastIndexOf(), we should know that it's not compatible under IE9, and the implementation of underscore can be taken as a polyfill case to learn (by also using a predict function to create):

/**
 * Generator function to create the indexOf and lastIndexOf functions
 * _.indexOf = createIndexFinder(1, _.findIndex, _.sortedIndex);
 * _.lastIndexOf = createIndexFinder(-1, _.findLastIndex);
 */
function createIndexFinder(dir, predicateFind, sortedIndex) {
    /**
     * three ways to call this API
     * _.indexOf(array, value, [isSorted]) 
     * _.indexOf(array, value, [fromIndex]) 
     * _.lastIndexOf(array, value, [fromIndex]) 
     */
    return function(array, item, idx) {
        var i = 0, length = getLength(array);

        /** if idx is a Number type, then we can just search in a loop way */
        if (typeof idx == 'number') {
            if (dir > 0) {
                /**
                 * search in a positive sequence
                 * reset the start position
                 */
                i = idx >= 0 ? idx : Math.max(idx + length, i);
            } else {
                /** 
                 * search in a negative sequence
                 * reset the length
                 */
                length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1;
            }
        } else if (sortedIndex && idx && length) {
            /**
             * if sortedIndex has been passed and both idx and length are not zero
             * then use binary searching to acculate
             */
            idx = sortedIndex(array, item);

            /**
             * if the item is equal to the item with the position idx,
             * then it means that this is the first place of item you're searching
             */
            return array[idx] === item ? idx : -1;
        }

        /** special case: item is NaN */
        if (item !== item) {
            idx = predicateFind(slice.call(array, i, length), _.isNaN);
            return idx >= 0 ? idx + i : -1;
        }

        /** search in a loop way */
        for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < length; idx += dir) {
            if (array[idx] === item) return idx;
        }

        return -1;
    };
}

/**
 * Return the position of the first occurrence of an item in an array,
 * or -1 if the item is not included in the array.
 * If the array is large and already in sort order, pass `true`
 * for **isSorted** to use binary search.
 */
_.indexOf = createIndexFinder(1, _.findIndex, _.sortedIndex);

/** search in a negative sequence */
_.lastIndexOf = createIndexFinder(-1, _.findLastIndex);

Comments Copyright © aleen42 all right reserved, powered by aleen42

Empty Comments

Sign in GitHub

As the plugin is integrated with a code management system like GitLab or GitHub, you may have to auth with your account before leaving comments around this article.

Notice: This plugin has used Cookie to store your token with an expiration.

authorize