Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.java.programmer > #29118
| From | Roedy Green <see_website@mindprod.com.invalid> |
|---|---|
| Newsgroups | comp.lang.java.programmer |
| Subject | BitSet vs boolean[] |
| Date | 2014-07-18 11:51 -0700 |
| Organization | Canadian Mind Products |
| Message-ID | <63ris9524feapq3fe288pv7lj1mdpoj444@4ax.com> (permalink) |
In terms of minimising space, how big must a boolean array be before it pays to use a BitSet? -- Roedy Green Canadian Mind Products http://mindprod.com Science is what we understand well enough to explain to a computer. Art is everything else we do. ~ Donald Ervin Knuth (born: 1938-01-10 age: 76)
Back to comp.lang.java.programmer | Previous | Next — Next in thread | Find similar | Unroll thread
BitSet vs boolean[] Roedy Green <see_website@mindprod.com.invalid> - 2014-07-18 11:51 -0700 Re: BitSet vs boolean[] Robert Klemme <shortcutter@googlemail.com> - 2014-07-18 21:11 +0200
csiph-web