Alan Donovan 61c5c64029 go.tools/container/intsets: Sparse: a space-efficient representation for ordered sets of int values. ... intsets.Sparse is a sparse bit vector. It uses space proportional to the number of elements, not the maximum element (as is the case for a dense bit vector). A forthcoming CL will make use of it in go/pointer, where it reduces solve time by 78%. A similar representation is used for Andersen's analysis in gcc and LLVM. + Tests. LGTM=sameer, crawshaw, gri R=gri CC=crawshaw, golang-codereviews, sameer https://golang.org/cl/10837043		2014-05-14 17:54:14 -04:00
..
sparse_test.go	go.tools/container/intsets: Sparse: a space-efficient representation for ordered sets of int values.	2014-05-14 17:54:14 -04:00
sparse.go	go.tools/container/intsets: Sparse: a space-efficient representation for ordered sets of int values.	2014-05-14 17:54:14 -04:00
util_test.go	go.tools/container/intsets: Sparse: a space-efficient representation for ordered sets of int values.	2014-05-14 17:54:14 -04:00
util.go	go.tools/container/intsets: Sparse: a space-efficient representation for ordered sets of int values.	2014-05-14 17:54:14 -04:00