Add set operations

[spearman]

Add set operations. Possible interface based on methods from standard library BTreeSet:

• contains (element) (Add elementwise tests #10)
• difference
• intersection
• is_disjoint
• is_subset (Add elementwise tests #10)
• is_superset (Add elementwise tests #10)
• symmetric_difference
• union (v0.0.12)

[mcclure]

Would a PR on this be welcome?

[spearman]

Would a PR on this be welcome?

Yes feel free to submit one and I'll get it merged as soon as possible

[zugzwang]

Perhaps a low-hanging fruit for set operations you can include is cardinality (something along the lines of .iter().map(|r| r.end() - r.start()).sum())

Edit: (I misread the documentation. .iter() iterates over the elements. Use .as_ref().iter() instead.)

[spearman]

Perhaps a low-hanging fruit for set operations you can include is cardinality (something along the lines of .iter().map(|r| r.end() - r.start()).sum())

Edit: (I misread the documentation. .iter() iterates over the elements. Use .as_ref().iter() instead.)

Published in v0.0.12

[zugzwang]

Thank you kindly @spearman! Cool crate, by the way.

Edit: I just checked, and len is implemented wrong, though! It should read r.end() - r.start() + 1. I suggest including tests for these operations.

[spearman]

Thank you kindly @spearman! Cool crate, by the way.

Edit: I just checked, and len is implemented wrong, though! It should read r.end() - r.start() + 1. I suggest including tests for these operations.

Thanks fixed in 0.0.13 and added doc test. I had tested it in the example program but must have rewritten it at some point and forgot the +1.