Packages

time_queue

0.8.0
1.2.3 1.2.2 1.2.1 1.2.0 1.1.1 1.0.1 1.0.0 0.9.6 0.9.5 0.9.3 0.9.2 0.9.0 0.8.1 0.8.0 0.7.0 0.6.0 0.5.0 0.4.0 0.3.0 0.2.2 0.2.1 0.2.0 0.1.2 0.1.1 0.1.0

TimeQueue is a simple functional timer queue (no processes, no messaging, no erlang timers), serializable, based on a single list of maps.

HexDocs

Current section

Files

Jump to
Readme
25 Versions
0 Dependencies
Dependants
Files
Activity
time_queue CHANGELOG.md
Raw

CHANGELOG.md 

# CHANGELOG



All notable changes to this project will be documented in this file.

This project adheres to [Semantic Versioning](http://semver.org/) and [Keep a Changelog](http://keepachangelog.com/).







## Unreleased

---



### New



### Changes



### Fixes



### Breaks





## 0.8.0 - (2020-10-02)

---



### Breaks

* the `peek` and `pop` functions will now only return the value instead of the full entry for the `{:ok, …}` return types. The functions `peek_entry` and `pop_entry` are available to get the full entry.





## 0.7.0 - (2020-09-12)

---



### New

* It is now possible to filter the queue with a filter function, and delete all

  entries whose value match a given value. This operation is slow on the

  gb_trees implementation as the tree has to be converted to a list temporarily.





## 0.5.0 - (2020-05-08)



### Changes



* The `peek` and `pop` functions will return the entry reference in case of a

  `:delay`.

  

  Previously:



      {:delay, delay} = TimeQueue.peek(tq)



  Now:



      {:delay, tref, delay} = TimeQueue.peek(tq)

---