Login Register

heapq.nsmallest()

heapq.nsmallest(n, iterable, key=None)

Return a list with the n smallest elements from the dataset defined by iterable. key, if provided, specifies a function of one argument that is used to extract a comparison key from each element in the iterable: key=str.lower Equivalent to: sorted(iterable, key=key)[:n]

Links:

https://docs.python.org/3.5/library/heapq.html#heapq.nsmallest

doc_python

2025-01-10 15:47:30

Comments

Leave a Comment

Please login to continue.

Popular Articles

heapq.nlargest() heapq.nlargest(n, iterable, key=None) Return a list with the n largest elements from the dataset defined by iterable. key, if provided, specifies

heapq.heappush() heapq.heappush(heap, item) Push the value item onto the heap, maintaining the heap invariant.

Series.nsmallest() Series.nsmallest(*args, **kwargs) [source] Return the smallest n elements. Parameters: n : int Return this many ascending sorted values keep :

heapq.heappop() heapq.heappop(heap) Pop and return the smallest item from the heap, maintaining the heap invariant. If the heap is empty, IndexError is raised. To

DataFrame.nsmallest() DataFrame.nsmallest(n, columns, keep='first') [source] Get the rows of a DataFrame sorted by the n smallest values of columns. New in version 0.