Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://mail.python.org/pipermail/python-dev/2002-September/028535.html below:

PEP 218 (sets); moving set.py to Lib

• Previous message: [Python-Dev] The first trustworthy <wink> GBayes results
• Next message: [Python-Dev] Proposed Mixins for Wide Interfaces
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

>> Hmm, I intended to have s1.refresh() return a new object for use in
>> s2 while leaving s1 alone (being immutable and all).  Now, I wonder
>> if that was the right thing to do.  The answer lies in use cases for
>> algorithms that need sets of sets.  If anyone knows off the top of
>> their head that would be great; otherwise, I seem to remember that
>> some of that business was found in compiler algorithms and graph
>> packages.
> 
> Let's call YAGNI on this one.
> 

Furthermore, what if I create a BIG set like this:

   s = ImmutableSet( range(2**x) )

Now, not only do I use lots of memory for s, I ALSO keep around lots of 
memory to preserve a temporary list which I never wanted to keep anyhow!

-- Michael Chermside

• Previous message: [Python-Dev] The first trustworthy <wink> GBayes results
• Next message: [Python-Dev] Proposed Mixins for Wide Interfaces
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4