On Mon, Jan 18, 2016 at 8:13 PM, Thomas Gazagnaire
wrote:
> Seems that Dave has been busy:
>
> https://github.com/djs55/ocaml-btree
>
> (sorry Dave if I spoiled your future announcement)
>
That's ok -- I'm still experimenting with interfaces and disk layouts.
It'll be a while before I have anyth
Seems that Dave has been busy:
https://github.com/djs55/ocaml-btree
(sorry Dave if I spoiled your future announcement)
Thomas
> On 11 Nov 2015, at 15:28, Nik Sultana wrote:
>
> Coincidentally B-trees came up recently on Ocaml-list:
> https://sympa.inria.fr/sympa/arc/caml-list/2015-11/msg000
Coincidentally B-trees came up recently on Ocaml-list:
https://sympa.inria.fr/sympa/arc/caml-list/2015-11/msg00011.html
On 2015-11-11 09:58, Rupert Horlick wrote:
Hmm, it seems like that is built on top of a few packages that don't
exist any more to interface between Baardskeerder and Mirage.
Since it's for a project, take all of this with a pinch of salt: (random
thoughts follow)
A simple b-tree on disk would probably be much like an in-heap b-tree,
except the nodes would be naturally wider and you would also need to track
and reclaim free blocks (which the GC would normally do for yo
Hmm, it seems like that is built on top of a few packages that don't exist
any more to interface between Baardskeerder and Mirage.
Do you think it's worth doing a simple B-Tree implementation myself, or
would it be better to try and build a new interface module for Mirage and
Baardskeerder?
A B-T
On 10 November 2015 at 16:49, Rupert Horlick wrote:
> I'm implementing this for a Part II project, so I've decided to go ahead and
> implement my own simple FS for BLOCK, rather than using IRMIN.
>
> However, I'm coming across the difficulties that Dave mentioned,
Simple and in-memory is (surely!
I'm implementing this for a Part II project, so I've decided to go ahead
and implement my own simple FS for BLOCK, rather than using IRMIN.
However, I'm coming across the difficulties that Dave mentioned, so I'm
reading up on B-trees as we speak. I may well end up writing a simple
B-tree library,
On Mon, Nov 9, 2015 at 3:46 PM, Thomas Leonard wrote:
> Hi Rupert,
>
> The main thing is to implement Irmin's AO signature:
>
>
> https://github.com/mirage/irmin/blob/4b5d3117e4cc1ecff4a83cc508da59006423/lib/irmin.mli#L360
>
> i.e. given a block of data, write it to disk and return its hash.
Hi Rupert,
The main thing is to implement Irmin's AO signature:
https://github.com/mirage/irmin/blob/4b5d3117e4cc1ecff4a83cc508da59006423/lib/irmin.mli#L360
i.e. given a block of data, write it to disk and return its hash.
Given a hash, return the file data.
You could write the data sequent
Hi all,
I’m investigating using Irmin on top of a Mirage BLOCK implementation. I’ve
been reading through the source, but I was wondering if anyone could point me
to the files that will be of most use for this?
Thanks,
Rupert
___
MirageOS-devel mailin
10 matches
Mail list logo
