commit | f74db0b33d491a3189df7f909d382f93f9152c30 | [log] [tgz] |
---|---|---|
author | Pablo Neira Ayuso <pablo@gnumonks.org> | Mon Sep 26 11:44:57 2011 +0200 |
committer | Harald Welte <laforge@gnumonks.org> | Mon Oct 17 13:25:29 2011 +0200 |
tree | 5f125cfa22e3fb2ee430e632efb31dd7cba4d52e | |
parent | e2bcaceee6d8a8f9f50854bf1695d5cd1f53f7c6 [diff] |
add rb-tree implementation to libosmocore This patch adds red black trees implementation to libosmocore. This data structure is very useful to search for elements in ordered sets in O(log n) instead of O(n) that lists provide. The first client of this code will be one follow up patch that implements rbtree-based timer scheduler.