and-megan

# Search in Rotated Sorted Array
# https://leetcode.com/problems/search-in-rotated-sorted-array/

# Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
# (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).

# You are given a target value to search. If found in the array return its index, otherwise return -1.

# You may assume no duplicate exists in the array.
# Your algorithm's runtime complexity must be in the order of O(log n).

and-megan

function ignoreRemoteUncaught(isUncaught, args, payload) {
  try {
    var filename = payload.body.trace.frames[0].filename;
    if (isUncaught && !filename.match(/^https?:\/\/www\.mycompany\.com/)) {
      // Ignore uncaught errors that are not from www.mycompany.com.
      return true;
    }
  } catch (e) {
    // Most likely there was no filename or the frame doesn't exist.
  }