diff options
| author | Russell Bryant <russell@russellbryant.com> | 2009-02-17 20:51:10 +0000 |
|---|---|---|
| committer | Russell Bryant <russell@russellbryant.com> | 2009-02-17 20:51:10 +0000 |
| commit | bb03ef8d47dbf2d5852b3304bcbec7ee17a8915c (patch) | |
| tree | cfbb55e6ff6db212e2fdfa882d9d155d6c45a2e5 /tests | |
| parent | 47913cab6d88937ca4b252b1a3f43a26d1d1d83e (diff) | |
Add an implementation of the heap data structure.
A heap is a convenient data structure for implementing a priority queue.
Code from svn/asterisk/team/russell/heap/.
Review: http://reviewboard.digium.com/r/160/
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@176632 65c4cc65-6c06-0410-ace0-fbb531ad65f3
Diffstat (limited to 'tests')
0 files changed, 0 insertions, 0 deletions