FEATURE: Find the Algorithm

[andreacortis]

For pedagogical sake, what about adding a function that takes two values in and out and then loops through all the monadic functions and finds the one(s) that match the value of out ?

Same for the dyadic case, but with (in_1, in_2)

ToDo List:

• [x] Initial work
• [ ] Add support for dyadic functions
• [x] Add input to ask 1 or 2 functions? ⭐
• [x] Add input to ask how many cores (64 by default)
• [ ] Fix algorithm for chunking / distributing across cores (maybe use imap)
• [ ] Fix bug with list results ([1,2,3] vs [1, 2, 3])

[codereport]

Yea, that's a cool idea. There is a actually a IDE features in Pharo that does this exact thing. Shouldn't be hard to implement it.

[codereport]

After the addition of bits https://github.com/codereport/jello/issues/28, it would be super cool if with <=2 keyword search could yield:

• bits
• i_to_b sum
• sub1

For the input 3 and output 2