heapq
E431929
heapq is a Python standard library module that provides an implementation of the heap queue algorithm, offering efficient priority queue and heap-based operations on lists.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Library Reference – heapq — Heap queue algorithm | 1 |
| heapq canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4325212 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: heapq Context triple: [Python standard library, includesModule, heapq]
-
A.
PyPy
PyPy is a high-performance alternative Python interpreter featuring a Just-In-Time (JIT) compiler designed to significantly speed up the execution of Python programs.
-
B.
Pila
Pila is a popular ski resort village in Italy’s Aosta Valley, known for its scenic Alpine slopes and views of major peaks like Mont Blanc and the Matterhorn.
-
C.
Pym
Pym is an English surname most notably associated with John Pym, a leading parliamentary figure in the early stages of the English Civil War.
-
D.
plpython2u
plpython2u is an untrusted PostgreSQL procedural language extension that allows writing database functions in Python 2.
-
E.
Pyr
Pyr is a science fiction and fantasy publishing imprint known for releasing speculative fiction titles under the Prometheus Books umbrella.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: heapq Target entity description: heapq is a Python standard library module that provides an implementation of the heap queue algorithm, offering efficient priority queue and heap-based operations on lists.
-
A.
PyPy
PyPy is a high-performance alternative Python interpreter featuring a Just-In-Time (JIT) compiler designed to significantly speed up the execution of Python programs.
-
B.
Pila
Pila is a popular ski resort village in Italy’s Aosta Valley, known for its scenic Alpine slopes and views of major peaks like Mont Blanc and the Matterhorn.
-
C.
Pym
Pym is an English surname most notably associated with John Pym, a leading parliamentary figure in the early stages of the English Civil War.
-
D.
plpython2u
plpython2u is an untrusted PostgreSQL procedural language extension that allows writing database functions in Python 2.
-
E.
Pyr
Pyr is a science fiction and fantasy publishing imprint known for releasing speculative fiction titles under the Prometheus Books umbrella.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf | Python standard library module ⓘ |
| availableIn |
Python 2
ⓘ
linked to:
Python 2.7
Python 3 ⓘ
linked to:
Python 3.x
|
| commonUseCase |
efficient retrieval of smallest items
ⓘ
merging sorted streams ⓘ priority queue implementation ⓘ top-k selection ⓘ |
| dataStructureType | binary heap ⓘ |
| defaultHeapOrder | min-heap ⓘ |
| documentationSection |
Library Reference – heapq — Heap queue algorithm
ⓘ
linked to:
heapq
|
| heapifySignature | heapify(x) ⓘ |
| heappopSignature | heappop(heap) ⓘ |
| heapProperty | parent node is less than or equal to children in min-heap ⓘ |
| heappushSignature | heappush(heap, item) ⓘ |
| implements | heap queue algorithm ⓘ |
| importSyntax | import heapq ⓘ |
| introducedBefore |
Python 3.0
ⓘ
linked to:
Python 3.x
|
| license | Python Software Foundation License ⓘ |
| maintainedBy | Python core developers ⓘ |
| mergeSignature | merge(*iterables, key=None, reverse=False) ⓘ |
| moduleCategory | Algorithms and Data Structures ⓘ |
| mutatesInPlace | True ⓘ |
| nlargestSignature | nlargest(n, iterable, key=None) ⓘ |
| nsmallestSignature | nsmallest(n, iterable, key=None) ⓘ |
| operatesOn | Python list ⓘ |
| orderingBasis | Python object comparison ⓘ |
| partOf |
Python Standard Library
ⓘ
linked to:
Python standard library
|
| programmingLanguage | Python ⓘ |
| providesFunction |
heapify
ⓘ
heappop ⓘ heappush ⓘ heappushpop ⓘ heapreplace ⓘ merge ⓘ nlargest ⓘ nsmallest ⓘ |
| requires | elements to be mutually comparable ⓘ |
| supportsCustomPriority | via tuple keys ⓘ |
| supportsIterables | any iterable ⓘ |
| supportsMaxHeap | via negated priorities or custom keys ⓘ |
| supportsMergingSortedIterables | True ⓘ |
| supportsPriorityQueueUsage | True ⓘ |
| timeComplexityHeapify | O(n) ⓘ |
| timeComplexityNlargest | O(n log k) ⓘ |
| timeComplexityNsmallest | O(n log k) ⓘ |
| timeComplexityPop | O(log n) ⓘ |
| timeComplexityPush | O(log n) ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: heapq Description of subject: heapq is a Python standard library module that provides an implementation of the heap queue algorithm, offering efficient priority queue and heap-based operations on lists.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: heapq