usesDataStructure
P32204
predicate
Indicates that one entity employs or relies on a particular data structure in its operation or implementation.
All labels observed (11)
| Label | Occurrences |
|---|---|
| usesDataStructure canonical | 33 |
| supportsDataStructure | 20 |
| dataStructureOption | 5 |
| hasDataStructure | 5 |
| defaultDataStructures | 4 |
| dataStructureSorted | 2 |
| supportsDataStructures | 2 |
| usesHeapProperty | 2 |
| masterDataStructure | 1 |
| relatedDataStructure | 1 |
| stackImplementation | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: usesDataStructure
Generated description
Indicates that one entity employs or relies on a particular data structure in its operation or implementation.
Sample triples (76)
| Subject | Object |
|---|---|
| WSClock page replacement algorithm | clock hand pointer ⓘ |
| WSClock page replacement algorithm | circular buffer ⓘ |
| Aho–Corasick algorithm | trie ⓘ |
| Aho–Corasick algorithm | finite automaton ⓘ |
| Cilk work-stealing scheduler | double-ended queue ⓘ |
| GS1 DataMatrix | FNC1-based GS1 element string via predicate surface "hasDataStructure" ⓘ |
| Windows NT security model | access token ⓘ |
| Cadence SMV | binary decision diagrams ⓘ |
| sieve of Eratosthenes | boolean array ⓘ |
| sieve of Eratosthenes | bitset ⓘ |
| Fennel | tables via predicate surface "hasDataStructure" ⓘ |
| Fennel | sequences via predicate surface "hasDataStructure" ⓘ |
| Fennel | maps via predicate surface "hasDataStructure" ⓘ |
| Kruskal’s minimum spanning tree algorithm | disjoint-set data structure ⓘ |
| Kruskal’s minimum spanning tree algorithm | union–find data structure ⓘ |
| Dijkstra's shortest path algorithm | priority queue ⓘ |
| Dijkstra's shortest path algorithm | min-heap ⓘ |
| Dijkstra's shortest path algorithm | distance array ⓘ |
| Dijkstra's shortest path algorithm | predecessor array ⓘ |
| Prim's minimum spanning tree algorithm | priority queue via predicate surface "dataStructureOption" ⓘ |
| Prim's minimum spanning tree algorithm | binary heap via predicate surface "dataStructureOption" ⓘ |
| Prim's minimum spanning tree algorithm | Fibonacci heap via predicate surface "dataStructureOption" NERFINISHED ⓘ |
| Prim's minimum spanning tree algorithm | adjacency matrix via predicate surface "dataStructureOption" ⓘ |
| Prim's minimum spanning tree algorithm | adjacency list via predicate surface "dataStructureOption" ⓘ |
| A-buffer algorithm | per-pixel fragment list ⓘ |
| A-buffer algorithm | extended frame buffer ⓘ |