How can i implement a Multiset in java which has all functions of treeset such as higher(),lower(),ceiling(),floor() etc. Is there is any way?
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
How can i implement a Multiset in java which has all functions of treeset such as higher(),lower(),ceiling(),floor() etc. Is there is any way?
Name |
---|
Can we get min and max keys from TreeMap in better than O(n) time? If yes, how?
Yes of course, take a look at the jdk manual of the TreeMap class, if I remember correctly it's firstKey() and lastKey() (not to sure, check it out).
multitreeset class i wrote a long time ago https://ideone.com/IxJk23
In case it helps anyone, I implemented MultiSet here and Ordered MultiSet here in Java.
Let me know if you find any mistakes. Suggestions are always welcomed.