metadata in the future.
Add Interval.subset() which we SHOULD be able to do (just keep track
of an offset/length as a subset of the original interval data)
Since we don't have merge, remove IntervalSet._optimized_copy()
Since we don't have _optimized_copy, add Interval.adjacent() and fix
__eq__ to use that instead.
git-svn-id: https://bucket.mit.edu/svn/nilm/nilmdb@9283 ddd99763-3ecb-0310-9145-efcb8ce7c51f
Now we can compare two interval sets where one has two adjacent
intervals, and one covers them both, and they correctly "match".
git-svn-id: https://bucket.mit.edu/svn/nilm/nilmdb@9278 ddd99763-3ecb-0310-9145-efcb8ce7c51f
