code: function removeOverlaps(locations: AstLocation[]) {
    if (locations.length == 0) {
      return [];
    }
    const firstParent = locations[0];
    return locations.reduce(deduplicateNode, [firstParent]);
  }
docs: Return an new locations array which excludes
  items that are completely enclosed by another location in the input locations
  
  @param locations Notice! The locations MUST be sorted by `sortByStart`
  so that we can do linear time complexity operation.