Re: [PATCH 1/3] mds:Interval tree

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



Hi Jojy-

I merged this into the tree.  The next step is to redo the flock code to 
use this.  Should be much cleaner...

Thanks!
sage


On Tue, 11 Oct 2011, Jojy Varghese wrote:

> Hi
>   I am resending the patch series for interval set. This time I have
> integrated the unit test cases to the existing suite.
> 
>   This patch-series of 3 patches has following changes:
>        - Interval tree implementation
>        - Unit test cases for the implementation
>        - Makefile changes for unit test integration
> 
> 
> Interval tree is an optimized data structure for  representing and
> querying intervals. Elementary intervals are
> represented as nodes of an avl tree and the corresponding data  is
> stored on these nodes based on a concept of span.
>         This representation allows log(n) (where n is the number of
> data) storage. The balanced avl tree allows a log(n) query.
> 
>         The implementation is a template class that is instantiated
> based on parameters :
>         - Interval type
>         - Data type
> 
>   This is a basic component which can be used to store byte range locks.
> 
> 
> thanks
> -Jojy
> 

[Index of Archives]     [CEPH Users]     [Ceph Large]     [Information on CEPH]     [Linux BTRFS]     [Linux USB Devel]     [Video for Linux]     [Linux Audio Users]     [Yosemite News]     [Linux Kernel]     [Linux SCSI]
  Powered by Linux