idf: lazy, incremental dataflow elisp library package

• idf

  2 9 4.6 Emacs Lisp

  Incremental, lazy dataflow library for emacs

• ement.el

  21 463 9.2 Emacs Lisp

  A Matrix client for GNU Emacs

This is very interesting. I've been thinking about using an AVL tree in Ement.el for the lists of events in each room, because they need to be used in-order by timestamp, and they can be received in any order (e.g. when loading older events), and it wouldn't be good to re-sort the whole list after each insertion. As it stands, each event is effectively sorted at the time it's inserted into a room's buffer (which may be never, depending on whether the room has an open buffer), and it works well enough, but I wonder if it could be improved.

• InfluxDB

  www.influxdata.com featured

  Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  

• sorted-list.el

  2 1 10.0 Emacs Lisp

for your specific use case in emet, I am using this: https://github.com/lordpretzel/sorted-list.el to maintain a sorted list (that is transparently backed by an AVL-tree) to enable this with O(log n) insert / deletion. This works with any list not just plists.

Suggest a related project