Is your feature request related to a problem? Please describe.
I'm copying text one tab into another to run it with another recipe. But when I change back to the first tab, the text I originally selected is no longer selected. It would be nice if this is remembered because when working with a wall of text, it's near impossible to figure out where I was.

This applies to both to input and th

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 have tensorflow gpu v1.10 installed on my system. On running the setup I get this error:

Collecting tensorflow==2.0.0 (from imagededup)
Could not find a version that satisfies the requirement tensorflow==2.0.0 (from imagededup) (from versions: 0.12.1, 1.0.0, 1.0.1, 1.1.0rc0, 1.1.0rc1, 1.1.0rc2, 1.1.0, 1.2.0rc0, 1.2.0rc1, 1.2.0rc2, 1.2.0, 1.2.1, 1.3.0rc0, 1.3.0rc1, 1.3.0rc2, 1.3.0, 1.4.0rc0

Hi, I was upgrading my dependencies and saw this module was updated. Since it's v0.x there could be breaking changes with updates - so I went to the Releases tab to look for a changelog, but there's none for v0.24.0.

I see now that you just removed the minimum memory limit, but would you mind adding a changelog to avoid confusion? It's a bit worrying when I don't know what's changed - espec

This would give us a better starting point for getting a Kubernetes cluster up and running in the future.
Maybe also using the GraalVM with native binaries. As we didn't use reflection and other stuff which would prohibit the use of native binaries the only thing now is that we moved to Java 13 and the GraalVM just started to support Java 11.

The xxHash implementation doesn't produce predictable results when compared to python for strings (as in the given example.

I believe this is due to java's handling of character arrays: https://codeahoy.com/2016/05/08/the-char-type-in-java-is-broken/

We get predictable results when we dump to a byte array instead:
LongHashFunction.xx().hashBytes("test".getBytes()) gets the same output as

I think meson might be beneficial as a build system to simplify the build file and allow building on most targets (without having to hardcode paths to homebrew or likewise).

It was on by default, but I disabled it to fix some cloud logic. I think this should be a setting, regardless.
I'm off to work. This is here to remind me

There is a widespread belief that a cryptographicly secure hash is needed. See: https://github.com/rurban/smhasher/blob/master/README.md#security

Beyond what is already documented in https://github.com/tkaitchuck/aHash/wiki/Attacking-aHash-or-why-it's-good-enough-for-a-hashmap
There should a wiki page should be created to explain:

• How DoS attacks on hashes actually work and why even 'stron

This is clever code that could be put to good use:

char * s =... // null terminated string
uint64_t c = *( uint64_t *) (s);
uint64_t zero_mask = (c - 0x0101010101010101) & ~c & 0x8080808080808080;
uint64_t string_mask = zero_mask ^ (zero_mask - 1);
c &= string_mask;

credit: Kendall Willets.