RangeSet: A Low-Memory Set Data Structure for Integers

Scott McMaster

Rate me:

4.69/5 (14 votes)

6 May 20056 min read

62K

495

This article presents a set data structure, the RangeSet. By storing ranges of included integers rather than the integers themselves, the RangeSet can dramatically reduce the memory overhead required by large sets.

Views

Daily Counts

Downloads

Weekly Counts

License

This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here

Written By

Scott McMaster

Web Developer

United States

I have over 10 years of full-lifecycle software development experience on a variety of large projects. I have a B.S. in Math from the University of Nebraska-Lincoln, a Masters in Software Engineering from Seattle University, and a Masters in Computer Science from the University of Maryland. I specialize in building and installing tools, frameworks, and processes that improve developer productivity and product quality. I am currently based in the Seattle area.

RangeSet: A Low-Memory Set Data Structure for Integers

Views

Downloads

License

Comments and Discussions