[Patches] [ python-Patches-638095 ] SimpleSets

noreply@sourceforge.net noreply@sourceforge.net
Fri, 22 Nov 2002 17:33:57 -0800

Patches item #638095, was opened at 2002-11-13 17:24
You can respond by visiting: 

Category: Library (Lib)
Group: Python 2.3
Status: Open
Resolution: None
Priority: 5
Submitted By: Raymond Hettinger (rhettinger)
Assigned to: Nobody/Anonymous (nobody)
Summary: SimpleSets

Initial Comment:
In the spirit of heapq for lists, this module provides 
set operations for dictionaries.

-- lightweight, fast, and easy to learn
-- works well with any iterable input
-- takes advantage of the existing implementation

-- does not support sets of sets
-- need to wrap sets in list() before displaying
-- no operators

This lightweight module (80 lines of code) is meant to 
be a convenient, fast solution for daily tasks which do 
not require the full firepower of the heavyweight Sets 

print 'IsSet', isset('factoid'), isset('misinformation')
print 'Equals', equals('algorithm','logarithm'), equals
print 'Subset', issubset('heart', 'thread'), issubset
a = 'abracadabra'
b = 'alacazam'
print 'Union', list(union(a,b))
print 'Intersection', list(intersection(a,b))
print 'Difference', list(difference(a,b))
print 'SymmetricDifference', list(symmetric_difference
print 'Uniquification', list(set(a))
print 'Cardinality', len(set(a))
print 'Iteration', [letter.upper() for letter in set(a)]
print 'Membership', 'b' in set(a), 'e' in set(a)


Comment By: Brett Cannon (bcannon)
Date: 2002-11-22 17:33

Logged In: YES 

I personally don't see the need for this.  Basically
everything here can already be done if you are willing to
create a set first and then use the set's methods.  Yes,
there might be a performancce difference if you are using a
dictionary, but if this functionality is really needed for
dicts perhaps it should be added to dicts themselves.  I
just  don't see any special reason to add this since this is
all easily done enough using sets.

Perhaps a PEP is in order to get this in?


You can respond by visiting: