<?xml version="1.0" encoding="ISO-8859-1"?>

<!DOCTYPE message PUBLIC
  "-//MLarc//DTD MLarc output files//EN"
  "../../mlarc.dtd"[
  <!ATTLIST message
    listname CDATA #REQUIRED
    title CDATA #REQUIRED
  >
]>

  <?xml-stylesheet href="../../mlarc.xsl" type="text/xsl"?>


<message 
  url="2009/01/bc50472cb112ab569f055bf50e480381"
  from="blue storm &lt;bluestorm.dylc@g...&gt;"
  author="blue storm"
  date="2009-01-12T17:31:34"
  subject="Re: [Caml-list] Heap implementations: Fibonacci, Brodal and relaxed"
  prev="2009/01/e65211ea034261766209b913d033cd99"
  next="2009/01/4e5dda7ad406ebd71375072454f7dcb8"
  prev-in-thread="2009/01/2549cd673119c567f7c38185b8f44404"
  next-in-thread="2009/01/d1475eb01975bf531ecdab5d818cc10d"
  prev-thread="2009/01/5bb736622b71197f45b645c4e626de56"
  next-thread="2009/01/6d098a9e0587a2759e2b95fbcda926ab"
  root="../../"
  period="month"
  listname="caml-list"
  title="Archives of the Caml mailing list">

<thread subject="Heap implementations: Fibonacci, Brodal and relaxed">
<msg 
  url="2009/01/2549cd673119c567f7c38185b8f44404"
  from="Hugo Ferreira &lt;hmf@i...&gt;"
  author="Hugo Ferreira"
  date="2009-01-12T10:22:33"
  subject="Heap implementations: Fibonacci, Brodal and relaxed">
<msg 
  url="2009/01/bc50472cb112ab569f055bf50e480381"
  from="blue storm &lt;bluestorm.dylc@g...&gt;"
  author="blue storm"
  date="2009-01-12T17:31:34"
  subject="Re: [Caml-list] Heap implementations: Fibonacci, Brodal and relaxed">
<msg 
  url="2009/01/d1475eb01975bf531ecdab5d818cc10d"
  from="Hugo Ferreira &lt;hmf@i...&gt;"
  author="Hugo Ferreira"
  date="2009-01-12T17:57:36"
  subject="Re: [Caml-list] Heap implementations: Fibonacci, Brodal and relaxed">
<msg 
  url="2009/01/e0d83d4a2f1b521118fff51a57db7486"
  from="Markus Mottl &lt;markus.mottl@g...&gt;"
  author="Markus Mottl"
  date="2009-01-12T18:56:10"
  subject="Re: [Caml-list] Heap implementations: Fibonacci, Brodal and relaxed">
</msg>
</msg>
</msg>
</msg>
</thread>

<contents>
First of all, do you know about Okasaki leftist heaps (I suppose you
do as you're asking for even more advanced data structure) ? They're
simple O(log n) heap, nice to implement (~ 20 lines).

There was a page from Markus Mottl with translated OCaml code from the
book, but he removed it for some obscure reason.

</contents>

</message>

