From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-0.8 required=5.0 tests=BAYES_00,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,43d7d94ae0906b7d,start
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1994-11-09 04:26:52 PST
Path: 
 nntp.gmd.de!xlink.net!howland.reston.ans.net!pipex!uknet!strath-cs!bradford.ac.uk!jcoates
From: J.Coates@bradford.ac.uk (JC)
Newsgroups: comp.lang.ada
Subject: binary heap
Date: 9 Nov 1994 12:21:34 GMT
Organization: University of Bradford
Message-ID: <39qese$kcm@columbia.acc.brad.ac.uk>
NNTP-Posting-Host: marjoram.acc.brad.ac.uk
X-Newsreader: TIN [version 1.2 PL2]
Date: 1994-11-09T12:21:34+00:00
List-Id: <comp.lang.ada>


I am looking for a fully working priority queue bibary heap package
including functions find_min and is_empty etc , any help would be great so I
can implement a program i am writing to emulate priority interupts. Cheers.


                                                     JC