[infinispan-dev] Tree API module wiki

[Eduardo Martins]

The code is pretty simple, don't think where to optimize except that
the structure is fully created for all nodes, including leaves and
nodes which are just parents, no data at all. It would be cool to have
both maps creation in a lazy way, is there a reason that makes this
not advisable, perhaps something regarding concurrent initial puts of
childs or data?

-- Eduardo
..............................................
http://emmartins.blogspot.com
http://redhat.com/solutions/telco



On Fri, Nov 26, 2010 at 4:48 PM, Manik Surtani <manik at jboss.org> wrote:
>
> On 26 Nov 2010, at 16:06, Eduardo Martins wrote:
>
>> Gave it a first look, so each node is stored in Cache by 2 atomic
>> maps, one for holding childs, another for data, both pointed by fqn
>> and a type enum. Am I getting it correctly?
>
> Yup.
>
> --
> Manik Surtani
> manik at jboss.org
> Lead, Infinispan
> Lead, JBoss Cache
> http://www.infinispan.org
> http://www.jbosscache.org
>
>
>
>
> _______________________________________________
> infinispan-dev mailing list
> infinispan-dev at lists.jboss.org
> https://lists.jboss.org/mailman/listinfo/infinispan-dev
>