Kostis Sagonas
Kostis Sagonas
I got some strange fffs printed out. It turns out, there are several cases where PropEr(TM) is not using the `printer` but straight `io:format` (&co). I'd rather have a consistent...
After a long wait for PropEr to support maps, PR #152 introduced a `map()` generator in a quick-and-dirty way. Unfortunately, that implementation violates all sorts of PropEr invariants and it...
I was trying to track the origin of gen_server2 and I came to this place. Apologies if it's not the real origin. I noticed that old fashioned specs are still...
In eopenid_v1.erl there is code which reads: associate(Dict) -> try Provider = out("openid.server", Dict), {ok,Adict} = eopenid_srv:get_assoc_dict(Provider), ... But eopenid_srv:get_assoc_dict/1 returns either 'true' or {error, not_found}, probably due to its...
Perhaps you would be interested in the following: http://dialyzer.softlab.ntua.gr/current/gettext/ Kostis
The [Wrong Binary Heap challenge](https://github.com/jlink/shrinking-challenge/blob/main/challenges/binheap.md) should minimally specify: 1. what is a heap (its structure) 2. what its elements are supposed to be (general integers, or from some particular range...
The [difference challenge](https://github.com/jlink/shrinking-challenge/blob/main/challenges/difference.md) has various issues: - If we keep it, it should become _one_ challenge, not many (also, its first sentence currently has an off-by-one error ;-) ) -...
I propose the following (simple/fun) challenge to be added. Fermat primes are primes of the form 2^(2^N) + 1. According to [Wikipedia](https://en.wikipedia.org/wiki/List_of_prime_numbers#Fermat_primes), as of August 2019, the only _known_ Fermat...
I am reading the description of the [bound5 challenge](https://github.com/jlink/shrinking-challenge/blob/main/challenges/bound5.md) and there are various items that require some discussion. The current description reads: > Given a 5-tuple of lists of 16-bit...