Last Modified
2013-08-24 23:18:12 -0700
Requires
  • tsort
  • rbtree

Description

Copyright © 2002-2008 Akinori MUSHA <knu@iDaemons.org>

Documentation by Akinori MUSHA and Gavin Sinclair.

All rights reserved. You can redistribute and/or modify it under the same terms as Ruby.

$Id: set.rb 17051 2008-06-09 09:20:43Z knu $

Overview

This library provides the Set class, which deals with a collection of unordered values with no duplicates. It is a hybrid of Array’s intuitive inter-operation facilities and Hash’s fast lookup. If you need to keep values ordered, use the SortedSet class.

The method to_set is added to Enumerable for convenience.

See the Set class for an example of usage.

Commenting is here to help enhance the documentation. For example, code samples, or clarification of the documentation.

If you have questions about Ruby or the documentation, please post to one of the Ruby mailing lists. You will get better, faster, help that way.

If you wish to post a correction of the docs, please do so, but also file bug report so that it can be corrected for the next release. Thank you.

If you want to help improve the Ruby documentation, please visit Documenting-ruby.org.

blog comments powered by Disqus