On Tue, Sep 08, 2009 at 05:25:35PM +0200, Martin Stjernholm wrote:
> A multiset is a binary tree which has O(log(<size>)) for lookups.
what is the reason for this difference?
would it it be possible to implement multisets as mapping(mixed:int) or
is there a specific quality of multisets that prevents this?
greetings, martin.
--
cooperative communication with sTeam - caudium, pike, roxen and unix
searching contract jobs: programming, training and administration - anywhere
--
pike programmer working in china community.gotpike.org
foresight developer foresightlinux.org open-steam.org
unix sysadmin iaeste.(tuwien.ac|or).at caudium.org
Martin Bähr http://www.iaeste.or.at/~mbaehr/ is.schon.org
|