This Pull Request is for HacktoberFest 2020

Description of Change

Checklist

• Added description

The UI of the scatterplot has got more ugly between 3.4 and the current development version.

To Reproduce

Steps to reproduce the behavior: create any scatterplot facet.

Current Results (master)

Expected Behavior (3.4)

![image](https://user-images.githubuserconten

doctest help

Description of Change

References

Checklist

steps to reproduce

Write a loop, from 1 to 80000, each time add a random int to the max heap.

In theory it takes very little time(NlogN, N=80000, <1sec ), but the program does take a long time.

I'v also tested the BinaryHeap in https://github.com/SolutionsDesign/Algorithmia, it performs well, so it is probably due to the bad algorithm.

I would like to add Yelp interview questions.
Please assign me to this.

Hi, I'm not sure if more platforms are interesting to you, but I've made a slightly more complete implementation of padding a struct to the cache line size here:

https://github.com/tinco/cache_line_size

I got the information on the cache line sizes from the Go compiler repository, so I'm pretty sure these are correct for all platforms Go runs on, which is a whole bunch.