Hmm, I’m not seeing PropEr in there:
https://github.com/Qqwy/elixir-prioqueue/blob/master/mix.exs#L28-L32
/me coughs
^.^
OvermindDL1
0
Qqwy
TypeCheck Core Team
@OvermindDL1 It took me way too long to understand the joke… 
Prioqueue has been updated once more: It now contains a lot better documentation, as well as implementations for many of the Protocols of FunLand, as well as Extractable, Insertable and Elixir’s own Enumerable and Collectable. (See the docs)
Oh, and the Prioqueue priority queue protocol itself can of course be overridden by other priority queue implementations in the future 
.
Prioqueue is more-or-less done, I think.
Feedback is greatly appreciated.
On a related note: I’ve released a prerelease version 0.8 of FunLand, which is significantly backwards incompatible with the previous prerelease version, since:
- It adds a lot of functionality. (Implementation of Traversable)
- It has some breaking name changes.
- Some bells-and-whistles behaviours were changed from opt-out to opt-in (less implicit magic, more explicit power)
There still are some things I am not happy with. The most important things that will still change before 1.0:
- Documentation. A lot of it.
- Moving the zoo of ADT implementations living under the
FunLandicnamespace off to their own library. - Maybe some more breaking name changes, to make things more clear.
1
OvermindDL1
imetallica
@Qqwy, slightly offtopic, but I was looking at your Tensor library because I’m quite interested in starting building a Machine Learning library for Erlang/Elixir. I know Erlang is not the fastest language for number crunching, but I have hopes due to the upcoming JIT compiler being quite fast (currently it’s as fast as HiPE), dirty schedulers and ease of orchestrate distributed computations between nodes.
2
Qqwy
TypeCheck Core Team
@imetallica Nice!
Tensor should be reasonably fast if you are working with sparse data sets.
I am currently debating to write a second, terse, vector/matrix/tensor library which would outsource the work to Rust.
However, I’d like this work to happen in a proper, semi-preemptive fashion, which currently faces two hurdles:
- Rustler does not yet expose
enif_schedule_nif()(see here) because there is no known way to make it fully compile-time safe. - I have no idea how to ‘turn an iteration over a vector or matrix inside-out’. I think this would mean that iteration over the
Vecwould happen in a coroutine-fashion, but I have no idea how this could be done. This is necessary becauseenif_schedule_nif()takes a function pointer to call once the work should continue.
I will update Tensor today to interface with Extractable and Insertable .
1
Qqwy
TypeCheck Core Team
All right!
Tensor has been updated to version 2.0. This version is backwards incompatible because of multiple major changes:
- All modules are moved under the single
Tensornamespace, to follow HexPM package publishing rules. useuse Tensorto alias all of Tensor, Matrix and Vector in your code and us them just as before. Numbershas had multiple important changes between version 1.0 and 4.0, these changes have been reflected in Tensor.
Other, new features are:FunLand.Mappableimplementation,FunLand.Reducableimplementation.Extractableimplementation.Insertableimplementation.- Tests for the above.
2
Qqwy
TypeCheck Core Team
Oh, before I forget!
Extractable and Insertable have been updated to 0.2.0 as well. This is a backwards-incompatible change. (But probably the last; I think the API is now stable and if this is indeed the case, soon a stable 1.0 version will be released).
The backwards-incompatible change is that in case of errors, instead of returning :error, the implementations should return {:error, reason}, with standardized reasons for Extractable being :empty, and for Insertable being :invalid_item_type and :full.
Prioqueue has been updated to reflect these changes as well, now being version 0.2.4 
.
1
Qqwy
TypeCheck Core Team
And… Sets is released!
Similar to Prioqueue and Okasaki, this is a common interface to work with Sets, with multiple implementations that can be chosen between either when creating the set, or in your application’s documentation.
Implementations for MapSet, :sets, :gb_sets and :ordsets are included.
2
Qqwy
TypeCheck Core Team
And a final one for today: Arrays.
Similar to Prioqueue, Okasaki and Sets, this is a common interface to work with arrays that have fast random element access.
It contains two implementations right now, namely a version that wraps Erlang’s :array, and MapArray that uses integer keys as indexing into a map (But in a somewhat different way than I do it in Tensor; MapArray is not a sparse but a terse representation).
2