memory « Set « Java Collection Q&A

Home
Java Collection Q&A
1.algorithm
2.array
3.Array Byte
4.Array Char
5.Array Convert
6.Array Dimension
7.Array Integer
8.Array Object
9.Array String
10.ArrayList
11.collection
12.comparator
13.Development
14.Garbage Collection
15.Generic
16.hash
17.HashMap
18.HashTable
19.iterator
20.LinkedList
21.List
22.Map
23.queue
24.Set
25.Sort
26.tree
Java Collection Q&A » Set » memory 

1. Very Compact Bitarray in Java    stackoverflow.com

I'm looking for a very compact way of storing a dense variable length bitarray in Java. Right now, I'm using BitSet, but it seems to use on average 1.5*n bits of ...

2. HashSet of Strings taking up too much memory, suggestions...?    stackoverflow.com

I am currently storing a list of words (around 120,000) in a HashSet, for the purpose of using as a list to check enetered words against to see if they are ...

3. How to use the least amount of memory to store a string in a hashset    stackoverflow.com

I have a large amount of strings that need to be stored in a very compact fashion. Currently I am storing the strings (32 characters a-f/0-9) in HashSet<byte[]>. I am simply ...

4. Java.util.BitSet VS java.util.EnumSet in terms of performance and memory    forums.oracle.com

Hi, I am working on a optimization, we are currently evaluating to use either BitSet or EnumSet. Has somebody encountered performance measuring between those types in terms of performance and memory? I guess for example the method "isEmpty" of a EnumSet is much faster then programmatically testing if a BitSet is empty. But in terms of internal memory consumption, is there ...

java2s.com  | Contact Us | Privacy Policy
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.