diff options
| author | russell <russell@f38db490-d61c-443f-a65b-d21fe96a405b> | 2009-02-17 20:51:10 +0000 |
|---|---|---|
| committer | russell <russell@f38db490-d61c-443f-a65b-d21fe96a405b> | 2009-02-17 20:51:10 +0000 |
| commit | 18f52ab1e75f994e02b4da7d22c8d41e5b479f6a (patch) | |
| tree | cfbb55e6ff6db212e2fdfa882d9d155d6c45a2e5 /tests | |
| parent | d6b563a51dd506654db20450a81f668680f45460 (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: http://svn.digium.com/svn/asterisk/trunk@176632 f38db490-d61c-443f-a65b-d21fe96a405b
Diffstat (limited to 'tests')
0 files changed, 0 insertions, 0 deletions