Academic Work

Personal

* pot de départ

(:twitter:)

-----

[ edit | logout ]
[ help | sandbox | passwd ]

BitSet and TreeSet operations

#############################

BitSet	TreeSet
is element of A := {1,2} B := {1,2,3,5} Is A included in B? `A & B == A`	`b.containsAll(a)` true, if A is included in B
assignment A := B `A.clear(); A.or(B);`	`a.clear();` `a.addAll(b);`
union A += B `A.or(B);`	`a.addAll(b);`
intersection B := B \intersect A `b.and(a);`	`b.retainAll(a);`
difference A := {1,2,3,5} B := {2,5} A\B == {1,3} A := A\B => `A.xor(B);`	`a.removeAll(b);`

BitSet traversal:

for ( int i = bs.nextSetBit(0); i >= 0; i = bs.nextSetBit(i+1) )
{
   // work here
}

Cloud City

anime | bash | blogs | bsd | c/c++ | c64 | calc | comics | convert | cube | del.icio.us | digg | east | eBooks | egeszseg | elite | firefox | flash | fun | games | gimp | google | groovy | hardware | hit&run | howto | java | javascript | knife | lang | latex | liferay | linux | lovecraft | magyar | maths | movies | music | p2p | perl | pdf | photoshop | php | pmwiki | prog | python | radio | recept | rts | scala | scene | sci-fi | scripting | security | shell | space | súlyos | telephone | torrente | translate | ubuntu | vim | wallpapers | webutils | wikis | windows

Blogs and Dev.

* Ubuntu Incident
* Python Adventures
* me @ GitHub

Places

Debrecen | France | Hungary | Montreal | Nancy

Notes

full circle | km

Hobby Projects

* Jabba's Codes
* PmWiki
* Firefox
* PHP
* JavaScript
* Scriptorium
* Tutorials
* me @ GitHub

Quick Links

[ edit ]

View - Edit - History - Attach - Print *** Report - Recent Changes - Search

Page last modified on 2009 September 24, 15:12