projects / asterisk/asterisk.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 47913ca) | patch
Add an implementation of the heap data structure.
authorRussell Bryant <russell@russellbryant.com>
Tue, 17 Feb 2009 20:51:10 +0000 (20:51 +0000)
committerRussell Bryant <russell@russellbryant.com>
Tue, 17 Feb 2009 20:51:10 +0000 (20:51 +0000)
commitbb03ef8d47dbf2d5852b3304bcbec7ee17a8915c
treecfbb55e6ff6db212e2fdfa882d9d155d6c45a2e5tree | snapshot
parent47913cab6d88937ca4b252b1a3f43a26d1d1d83ecommit | 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
include/asterisk/heap.h [new file with mode: 0644] blob
main/Makefile diff | blob | history
main/heap.c [new file with mode: 0644] blob
Mirror of the Asterisk Project (https://gerrit.asterisk.org)