https://github.com/trekhleb/javascript-algorithms/blob/master/src/algorithms/sets/cartesian-product/cartesianProduct.js#L8

I think it makes more sense to return an empty array

// invalid input return null or throw an error
if (!setA || !setB) {
    return null;
}
if (!setA.length || !setB.length) {
    return []; 
}
// or do nothing since the for loop will not trigger anyway

一个班级60%喜欢足球，70%喜欢篮球，80%喜欢排球，问：三种球都喜欢占比最大可能有多少，最小可能有多少？即求三种球都喜欢的比例范围

Is your feature request related to a problem or area of OpenRefine? Please describe.
Users are not seeing how to delete a Project in OpenRefine.
User tweeting about this:
https://twitter.com/ruthbrarian/status/1243243600223391745

Took me forever to see the little Xs to delete them too

We also use currently use differing styles for Actions to perform on a Project:

• Img
• Text

**De

From: https://boltons.readthedocs.io/en/latest/setutils.html#boltons.setutils.IndexedSet

As you can see, the IndexedSet is almost like a UniqueList, retaining only one copy of a given value, in the order it was first added.

This appears incorrect. Perhaps it is a remnant from an earlier version of the library?

首先，十分欢迎你来给 OI WIki 开 issue，在提交之前，请花时间阅读一下这个模板的内容，谢谢合作！

• 希望添加的是什么？

git 使用指南

• 英文叫什么？

git-guidebook

• 有什么参考资料？

https://git-scm.com/docs
https://git-scm.com/book/zh/v2

issue 标题请写为 'add ' + 要添加的内容

然后可以在 htc 里 link 一下。（我刚开始写 Wiki 的时候就不知道怎么做到“一个 pr 只干一件事”）

I create leetcode directory. You can contribute solution for Leetcode algorithm by C language.
Good practice coding :)
Please put some comment for explanation. It helps other people understand your algorithm better

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.

Given a blacklist B containing unique integers from [0, N), write a function to return a uniform random integer from [0, N) which is NOT in B.

Optimize it such that it minimizes the call to system’s Math.random().

Note:

1. 1 <= N <= 1000000000
2. 0 <= B.length < min(100000, N)
3. [0, N) does NOT include N. See [interval notation](https://en.wikipedia.org/wiki/Interval_\

golangci-lint run --no-config searches

##[error]searches/binary_search.go:20:6: `iterBinarySearch` is unused (deadcode)
func iterBinarySearch(array []int, target int, lowIndex int, highIndex int) int {
     ^
##[error]searches/binary_search.go:6:6: func `binarySearch` is unused (unused)
func binarySearch(array []int, target int, lowIndex int, highIndex int) int {
     ^

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.

It's not easy to understand what the code generators under jctools-build are supposed to do. I think one or two phases documenting their goal would be useful.

I am proposing to document these classes:

• JavaParsingAtomicArrayQueueGenerator.java
• JavaParsingAtomicLinkedQueueGenerator.java
• JavaParsingAtomicQueueGenerator.java