Age | Commit message (Collapse) | Author | |
---|---|---|---|
2019-07-19 | Optimize is_subset and is_disjoint in cerl_sets | José Valim | |
The new implementation use maps iterators and are more perfomant in banchmarks by roughly 10%. More importantly, the iterators approach allow us to short-circuit and abort early. fold and filter have also been changed to use iterators. We could simply delegate to the maps' functions, but inlining the implementation allows us to skip a double anonymous function dispatch. | |||
2019-02-25 | cerl_sets: Use maps:filter/2 in filter/2 | John Högberg | |
This should be slightly more efficient than converting to/from lists for large sets. | |||
2015-06-18 | Change license text to APLv2 | Bruce Yinhe | |
2015-05-21 | compiler: Add cerl_sets module | Björn-Egil Dahlberg | |
A sets implementation based on maps. |