On Tue, 5 Oct 2010 15:27:03 +0200, Rene Brun <Rene.Brun_at_cern.ch> wrote:
> Hi Amnon,
>
> My solution did not force a change in the Tree structure, only new
> objects in the UserInfo list.
> I think that the solution depends a lot on the way(s) you want to use
> the filtering information.
> My suggestion was to add standard classes, much more efficient (time and
> space) than the C++ map.
one could use a hashmap rather than a r/b tree (ie: std::map) which
indeed sorts all entries upon insertion.
std::tr1::unordered_map is such a beast.
cheers,
sebastien.
-- ######################################### # Dr. Sebastien Binet # Laboratoire de l'Accelerateur Lineaire # Universite Paris-Sud XI # Batiment 200 # 91898 Orsay #########################################Received on Tue Oct 05 2010 - 16:10:11 CEST
This archive was generated by hypermail 2.2.0 : Wed Oct 06 2010 - 17:50:01 CEST