Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] removing an item from a list efficiently
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-11-08 (08:50)
From: Dustin Sallings <dustin@s...>
Subject: Re: [Caml-list] removing an item from a list efficiently

On Nov 7, 2003, at 4:46, Stefano Zacchiroli wrote:

> IMHO to implement an LRU policy, lists are not the best structures due
> to the O(n) limit above. You can consider standard heaps (assuming you
> have an upper bound on the number of entries) or binomial heaps (you 
> can
> find an implementation in Okasaki's book).

	This is really what I was asking, whether ocaml lists could be 

	I'm having difficulty figuring out how to implement a double linked 
list, though.  I want something like this:

type 'a link = Nothing | Link of 'a t;;

type 'a t = {
     data: 'a;
     mutable prev: 'a link;
     mutable next: 'a link;

	But, link and t don't know about each other.  How does one go about 
doing this kind of thing in ocaml?

Dustin Sallings

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: