A RetroSearch Logo

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

Search Query:

Showing content from https://mail.python.org/pipermail/python-dev/2007-April/072511.html below:

[Python-Dev] function for counting items in a sequence

[Python-Dev] function for counting items in a sequence [Python-Dev] function for counting items in a sequenceGuido van Rossum guido at python.org
Sun Apr 8 04:00:42 CEST 2007
On 4/7/07, Adam Olsen <rhamph at gmail.com> wrote:
> On 4/7/07, Steven Bethard <steven.bethard at gmail.com> wrote:
> > Here's a patch implementing collections.counts() as suggested above:
>
> The name doesn't make it obvious to me what's going on.  Maybe
> countunique()?  Some other options are countdistinct() and
> countduplicates().

-1. I like the name that Steve proposed just fine; "counts" perfectly
explain that it produces counts of items. If there couldn't be
duplicates then "counts" wouldn't make sense since the only outcomes
would be True or False (present or not).

-- 
--Guido van Rossum (home page: http://www.python.org/~guido/)
More information about the Python-Dev mailing list

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