[問題] 比HashSet<Long>更好的容器
想請教一下各位前輩
小弟目前 有上萬筆形態爲long的資料,從json data 轉換爲object 時
會依照分類放在HashSet<Long> 裡面
會用HashSet的原因是免排序,
但是需要快速查出某個值是不是成員 （使用contain(long id)這個方法
因爲資料蠻多的,又把long wrap爲Long,佔用了不少記憶體
想請問有沒有更節省記憶體也可以快速判斷的方式來存放這些資料呢？
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 59.125.98.71
※ 文章網址: https://www.ptt.cc/bbs/java/M.1450340429.A.28E.html
推
12/17 18:32, , 1F
12/17 18:32, 1F
→
12/17 18:32, , 2F
12/17 18:32, 2F
推
12/17 19:52, , 3F
12/17 19:52, 3F
→
12/17 19:53, , 4F
12/17 19:53, 4F
→
12/17 19:54, , 5F
12/17 19:54, 5F
推
12/17 23:30, , 6F
12/17 23:30, 6F
→
12/17 23:31, , 7F
12/17 23:31, 7F
→
12/18 01:12, , 8F
12/18 01:12, 8F
→
12/18 01:15, , 9F
12/18 01:15, 9F
→
12/18 10:23, , 10F
12/18 10:23, 10F
→
12/18 10:24, , 11F
12/18 10:24, 11F
→
12/18 10:25, , 12F
12/18 10:25, 12F
→
12/18 12:15, , 13F
12/18 12:15, 13F
→
12/18 12:16, , 14F
12/18 12:16, 14F
推
12/18 12:18, , 15F
12/18 12:18, 15F
→
12/18 12:18, , 16F
12/18 12:18, 16F
→
12/18 15:53, , 17F
12/18 15:53, 17F
→
12/18 15:53, , 18F
12/18 15:53, 18F
→
12/18 15:54, , 19F
12/18 15:54, 19F
推
12/18 19:34, , 20F
12/18 19:34, 20F
→
12/18 19:36, , 21F
12/18 19:36, 21F
推
12/18 19:43, , 22F
12/18 19:43, 22F
推
12/18 23:29, , 23F
12/18 23:29, 23F
→
12/19 02:19, , 24F
12/19 02:19, 24F
→
12/19 02:22, , 25F
12/19 02:22, 25F
→
12/19 02:23, , 26F
12/19 02:23, 26F
推
12/19 13:54, , 27F
12/19 13:54, 27F
推
12/19 14:21, , 28F
12/19 14:21, 28F
→
12/19 14:22, , 29F
12/19 14:22, 29F
→
12/20 18:14, , 30F
12/20 18:14, 30F
→
12/24 09:21, , 31F
12/24 09:21, 31F
→
02/05 02:34, , 32F
02/05 02:34, 32F
java 近期熱門文章
PTT數位生活區 即時熱門文章
