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 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | pajenegod | 145 |
9 | orz | 145 |
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.