Dataset Viewer (First 5GB)
Auto-converted to Parquet Duplicate
sourcePrefix
stringlengths
7
16.3k
candidates
listlengths
0
50
group
stringclasses
496 values
target
stringlengths
2
113
kind
stringclasses
2 values
receiverKind
stringclasses
6 values
schema
stringclasses
1 value
prefix
stringlengths
2
8
candidateLimit
int64
50
50
initializeElements topologicalSortedElements := OrderedCollection ne
[ { "heuristicSource": "CoGlobalVariableMessageHeuristic", "rank": 1, "name": "new:withAll:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoGlobalVariableMessageHeuristic", "rank": 2, "name": "new", "inferredType": null, "lmAgreement": false }, {...
AI-Algorithms-Graph
new
messages
global
coo-ranking-v1
ne
50
initializeElements topologicalSortedElements := OrderedCollection new
[ { "heuristicSource": "CoGlobalVariableMessageHeuristic", "rank": 1, "name": "new:withAll:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoGlobalVariableMessageHeuristic", "rank": 2, "name": "new", "inferredType": null, "lmAgreement": false }, {...
AI-Algorithms-Graph
new
messages
global
coo-ranking-v1
new
50
initializeElements topologicalSortedElements := OrderedCollection new. "nodesWithNoIncomingEdge is a queue is a linked list because it has a better time complexity for removing the first element." nodesWithNoIncomingEdges := LinkedList ne
[ { "heuristicSource": "CoGlobalVariableMessageHeuristic", "rank": 1, "name": "new:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoGlobalVariableMessageHeuristic", "rank": 2, "name": "newFrom:", "inferredType": null, "lmAgreement": false }, { ...
AI-Algorithms-Graph
new
messages
global
coo-ranking-v1
ne
50
initializeElements topologicalSortedElements := OrderedCollection new. "nodesWithNoIncomingEdge is a queue is a linked list because it has a better time complexity for removing the first element." nodesWithNoIncomingEdges := LinkedList new
[ { "heuristicSource": "CoGlobalVariableMessageHeuristic", "rank": 1, "name": "new:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoGlobalVariableMessageHeuristic", "rank": 2, "name": "newFrom:", "inferredType": null, "lmAgreement": false }, { ...
AI-Algorithms-Graph
new
messages
global
coo-ranking-v1
new
50
removeEdgesOf: aNode aNode adjacentNodes do
[ { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 1, "name": "doRevert", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "doActivate", "inferredType": null, "lmAgreement": false }, { "heuri...
AI-Algorithms-Graph
do:
messages
unknown
coo-ranking-v1
do
50
removeEdgesOf: aNode aNode adjacentNodes do:
[ { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 1, "name": "do:separatedBy:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "do:", "inferredType": null, "lmAgreement": false }, { "heuri...
AI-Algorithms-Graph
do:
messages
unknown
coo-ranking-v1
do:
50
removeEdgesOf: aNode aNode ad
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "addIncomingEdgesFollowing:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "addNewSccForNode:", "inferredType": null, "lmAgre...
AI-Algorithms-Graph
adjacentNodes
messages
variable
coo-ranking-v1
ad
50
removeEdgesOf: aNode aNode adj
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "adjList", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "adjacenciesFor:", "inferredType": null, "lmAgreement": false }, ...
AI-Algorithms-Graph
adjacentNodes
messages
variable
coo-ranking-v1
adj
50
removeEdgesOf: aNode aNode adja
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "adjacenciesFor:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "adjacentNodes", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
adjacentNodes
messages
variable
coo-ranking-v1
adja
50
removeEdgesOf: aNode aNode adjac
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "adjacenciesFor:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "adjacentNodes", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
adjacentNodes
messages
variable
coo-ranking-v1
adjac
50
removeEdgesOf: aNode aNode adjace
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "adjacenciesFor:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "adjacentNodes", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
adjacentNodes
messages
variable
coo-ranking-v1
adjace
50
removeEdgesOf: aNode aNode adjacen
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "adjacenciesFor:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "adjacentNodes", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
adjacentNodes
messages
variable
coo-ranking-v1
adjacen
50
removeEdgesOf: aNode aNode adjacent
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "adjacentNodes", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "adjacentNodes:", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
adjacentNodes
messages
variable
coo-ranking-v1
adjacent
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes re
[ { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 1, "name": "registerFont:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "repositoriesFrom:", "inferredType": null, "lmAgreement": false }, ...
AI-Algorithms-Graph
remove:
messages
unknown
coo-ranking-v1
re
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes rem
[ { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 1, "name": "removeModalWindow", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "removeMetaSideVariables", "inferredType": null, "lmAgreement": fal...
AI-Algorithms-Graph
remove:
messages
unknown
coo-ranking-v1
rem
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remo
[ { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 1, "name": "removeModalWindow", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "removeMetaSideVariables", "inferredType": null, "lmAgreement": fal...
AI-Algorithms-Graph
remove:
messages
unknown
coo-ranking-v1
remo
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remov
[ { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 1, "name": "removeModalWindow", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "removeMetaSideVariables", "inferredType": null, "lmAgreement": fal...
AI-Algorithms-Graph
remove:
messages
unknown
coo-ranking-v1
remov
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove
[ { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 1, "name": "removeModalWindow", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "removeMetaSideVariables", "inferredType": null, "lmAgreement": fal...
AI-Algorithms-Graph
remove:
messages
unknown
coo-ranking-v1
remove
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove:
[ { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 1, "name": "remove:into:changes:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "remove:uptoLastValueLink:continuation:", "inferredType": null, ...
AI-Algorithms-Graph
remove:
messages
unknown
coo-ranking-v1
remove:
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node in
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "initializeElements", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "initialize", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
incomingNodes
messages
variable
coo-ranking-v1
in
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node inc
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "includesIdentity:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "incomingEdges", "inferredType": null, "lmAgreement": false...
AI-Algorithms-Graph
incomingNodes
messages
variable
coo-ranking-v1
inc
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node inco
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "incomingEdges", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "incomingNodes:", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
incomingNodes
messages
variable
coo-ranking-v1
inco
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incom
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "incomingEdges", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "incomingNodes:", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
incomingNodes
messages
variable
coo-ranking-v1
incom
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomi
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "incomingEdges", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "incomingNodes:", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
incomingNodes
messages
variable
coo-ranking-v1
incomi
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomin
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "incomingEdges", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "incomingNodes:", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
incomingNodes
messages
variable
coo-ranking-v1
incomin
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incoming
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "incomingEdges", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "incomingNodes:", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
incomingNodes
messages
variable
coo-ranking-v1
incoming
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf if
[ { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 1, "name": "ifNotNil:ifNil:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "ifSpecialKey:do:", "inferredType": null, "lmAgreement": false }, ...
AI-Algorithms-Graph
ifTrue:
messages
unknown
coo-ranking-v1
if
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifT
[ { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 1, "name": "ifTrueIfFalseMutlilineMessageConfiguration", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "ifTrue:ifFalse:", "inferredType": null, "...
AI-Algorithms-Graph
ifTrue:
messages
unknown
coo-ranking-v1
ifT
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifTr
[ { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 1, "name": "ifTrueIfFalseMutlilineMessageConfiguration", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "ifTrue:ifFalse:", "inferredType": null, "...
AI-Algorithms-Graph
ifTrue:
messages
unknown
coo-ranking-v1
ifTr
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifTru
[ { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 1, "name": "ifTrueIfFalseMutlilineMessageConfiguration", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "ifTrue:ifFalse:", "inferredType": null, "...
AI-Algorithms-Graph
ifTrue:
messages
unknown
coo-ranking-v1
ifTru
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifTrue
[ { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 1, "name": "ifTrueIfFalseMutlilineMessageConfiguration", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "ifTrue:ifFalse:", "inferredType": null, "...
AI-Algorithms-Graph
ifTrue:
messages
unknown
coo-ranking-v1
ifTrue
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifTrue:
[ { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 1, "name": "ifTrue:ifFalse:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "ifTrue:", "inferredType": null, "lmAgreement": false } ]
AI-Algorithms-Graph
ifTrue:
messages
unknown
coo-ranking-v1
ifTrue:
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node is
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "isRootNode:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "isMaxNodePredicate:", "inferredType": null, "lmAgreement": false...
AI-Algorithms-Graph
isLeaf
messages
variable
coo-ranking-v1
is
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isL
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "isLetterNumber", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "isLetter", "inferredType": null, "lmAgreement": false }, ...
AI-Algorithms-Graph
isLeaf
messages
variable
coo-ranking-v1
isL
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLe
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "isLetterNumber", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "isLetter", "inferredType": null, "lmAgreement": false }, ...
AI-Algorithms-Graph
isLeaf
messages
variable
coo-ranking-v1
isLe
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLea
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "isLeaf", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoUnknownMessageHeuristic", "rank": 2, "name": "isLeapYear:", "inferredType": null, "lmAgreement": false }, { "he...
AI-Algorithms-Graph
isLeaf
messages
variable
coo-ranking-v1
isLea
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "isLeaf", "inferredType": null, "lmAgreement": false } ]
AI-Algorithms-Graph
isLeaf
messages
variable
coo-ranking-v1
isLeaf
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifTrue: [ nodesWithNoIncomingEdges ad
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "addIncomingEdgesFollowing:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "addNewSccForNode:", "inferredType": null, "lmAgre...
AI-Algorithms-Graph
add:
messages
variable
coo-ranking-v1
ad
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifTrue: [ nodesWithNoIncomingEdges add
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "addIncomingEdgesFollowing:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "addNewSccForNode:", "inferredType": null, "lmAgre...
AI-Algorithms-Graph
add:
messages
variable
coo-ranking-v1
add
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifTrue: [ nodesWithNoIncomingEdges add:
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "add:afterLink:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "add:beforeIndex:", "inferredType": null, "lmAgreement": false...
AI-Algorithms-Graph
add:
messages
variable
coo-ranking-v1
add:
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifTrue: [ nodesWithNoIncomingEdges add: node ] ]. aNode ad
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "addIncomingEdgesFollowing:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "addNewSccForNode:", "inferredType": null, "lmAgre...
AI-Algorithms-Graph
adjacentNodes:
messages
variable
coo-ranking-v1
ad
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifTrue: [ nodesWithNoIncomingEdges add: node ] ]. aNode adj
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "adjList", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "adjacenciesFor:", "inferredType": null, "lmAgreement": false }, ...
AI-Algorithms-Graph
adjacentNodes:
messages
variable
coo-ranking-v1
adj
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifTrue: [ nodesWithNoIncomingEdges add: node ] ]. aNode adja
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "adjacenciesFor:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "adjacentNodes", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
adjacentNodes:
messages
variable
coo-ranking-v1
adja
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifTrue: [ nodesWithNoIncomingEdges add: node ] ]. aNode adjac
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "adjacenciesFor:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "adjacentNodes", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
adjacentNodes:
messages
variable
coo-ranking-v1
adjac
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifTrue: [ nodesWithNoIncomingEdges add: node ] ]. aNode adjace
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "adjacenciesFor:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "adjacentNodes", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
adjacentNodes:
messages
variable
coo-ranking-v1
adjace
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifTrue: [ nodesWithNoIncomingEdges add: node ] ]. aNode adjacen
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "adjacenciesFor:", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "adjacentNodes", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
adjacentNodes:
messages
variable
coo-ranking-v1
adjacen
50
removeEdgesOf: aNode aNode adjacentNodes do: [ :node | node incomingNodes remove: aNode. node isLeaf ifTrue: [ nodesWithNoIncomingEdges add: node ] ]. aNode adjacent
[ { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 1, "name": "adjacentNodes", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoDependencyMessageHeuristics", "rank": 2, "name": "adjacentNodes:", "inferredType": null, "lmAgreement": false ...
AI-Algorithms-Graph
adjacentNodes:
messages
variable
coo-ranking-v1
adjacent
50
run self in
[ { "heuristicSource": "CoSelfMessageHeuristic", "rank": 1, "name": "initializeElements", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoSelfMessageHeuristic", "rank": 2, "name": "initialize", "inferredType": null, "lmAgreement": false }, { "h...
AI-Algorithms-Graph
initializeElements
messages
self
coo-ranking-v1
in
50
run self ini
[ { "heuristicSource": "CoSelfMessageHeuristic", "rank": 1, "name": "initializeElements", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoSelfMessageHeuristic", "rank": 2, "name": "initialize", "inferredType": null, "lmAgreement": false }, { "h...
AI-Algorithms-Graph
initializeElements
messages
self
coo-ranking-v1
ini
50
run self init
[ { "heuristicSource": "CoSelfMessageHeuristic", "rank": 1, "name": "initializeElements", "inferredType": null, "lmAgreement": false }, { "heuristicSource": "CoSelfMessageHeuristic", "rank": 2, "name": "initialize", "inferredType": null, "lmAgreement": false }, { "h...
AI-Algorithms-Graph
initializeElements
messages
self
coo-ranking-v1
init
50
End of preview. Expand in Data Studio

Pharo reranker dataset: frozen corpus and runtime snapshot

This snapshot preserves 3,441,607 ranking examples from 732 Pharo packages, the original mining image and VM, frozen benchmark source, the pipeline source, and the existing experiment selection. It was prepared on 2026-10-08 from heuristics-vs-llm commit 813d45fd951bc861e905ee8122e7a7172efa12be. No pipeline code was changed to create this snapshot.

Contents

Path Contents
mining/corpus/all.jsonl.gz Losslessly compressed original JSONL, in its original row order
mining/corpus/manifest.json Original row counts, package counts and source/image/corpus SHA-256 values
mining/corpus/packages.json Original eligible package list
artifacts/pharo-image-macos-arm64.zip mining/image/: original Pharo image, changes, sources, VM and launchers
artifacts/workspace.zip All Git-tracked pipeline files and tests; mining/repository/ and image-ready marker; current experiment/ image, frozen source, split, model names and incomplete run metadata
snapshot.json Source revision, environment observations, per-member hashes, file modes, exclusions and limitations
SHA256SUMS Checksums of every published payload and metadata file except this checksum list itself

The corpus dataset split is the entire mined pool, not a training partition. Preserve the package holdouts below when training and evaluating.

Saved selection

Seed: 42. After reserving the existing 5 benchmark packages, the remaining packages use an 80/10/10 train/validation/test split.

Partition Packages Examples
Training 581 2,685,649
Validation 73 433,973
Test 73 307,853
Benchmark 5 14,132

experiment/split.json is the authoritative four-way split. experiment/benchmark-selection.json preserves the Pharo-side selection. All four sets of package names are disjoint. Benchmark rows must be excluded from model development. The existing incomplete reranker-run.* is included for reference; start a fresh run rather than trying to resume it.

Restore the same inputs

Use a new empty directory, with at least 32 GB of free disk for extraction and training partitions, plus additional space for models and package workers. Each package worker needs its own writable image. The supplied VM runs on macOS ARM64; Linux/OAR needs a compatible Linux VM and launcher before execution. Do not run the macOS VM on Linux or replace the original image by a fresh download.

Install the Hugging Face CLI separately if needed. Copy this snapshot's full commit SHA from the repository's commit history into REVISION below. Always use that fixed SHA for later downloads instead of main.

REVISION=REPLACE_WITH_FULL_DATASET_COMMIT_SHA
hf download pharo-llm/pharo-reranker-dataset \
  --repo-type dataset --revision "$REVISION" --local-dir pharo-snapshot
cd pharo-snapshot

# macOS (use sha256sum -c SHA256SUMS on Linux):
shasum -a 256 -c SHA256SUMS

unzip artifacts/workspace.zip
unzip artifacts/pharo-image-macos-arm64.zip
gzip -dk mining/corpus/all.jsonl.gz
chmod +x pipeline-benchmarks.sh pipeline-mine-training-data.sh \
  mining/image/pharo mining/image/pharo-ui \
  mining/image/pharo-vm/Pharo.app/Contents/MacOS/Pharo \
  experiment/image/pharo experiment/image/pharo-ui \
  experiment/image/pharo-vm/Pharo.app/Contents/MacOS/Pharo

python3 - <<'PY'
from pathlib import Path
import sys
sys.path.insert(0, 'scripts')
from ranking_corpus import verify, load_manifest
verify(Path('mining/corpus'), image=Path('mining/image/Pharo.image'),
       repository=Path('mining/repository'), split_path=Path('experiment/split.json'))
load_manifest(Path('mining/corpus'), image=Path('experiment/image/Pharo.image'),
              repository=Path('experiment/repository'))
print('Corpus, original images, source and saved split verified')
PY

# Choose concurrency for the available RAM/CPU/GPU; 8 is an example.
# This uses the restored selection of 5 benchmark packages.
BENCHMARK_JOBS=8 ./pipeline-benchmarks.sh

Do not set a different BENCHMARK_PACKAGE_COUNT, seed or split ratio when reusing this experiment. The pipeline will reject settings that conflict with the saved split. The archived root README.md documents the existing pipeline in detail. Extracting workspace.zip replaces this dataset card with that original README; the dataset card remains available at the pinned Hugging Face revision.

Reproducibility boundary

The snapshot preserves exact input bytes, package selections and source code. The original corpus SHA-256 is 7d93f4b3b38bf9fc77c13992066f807171aceaeeee19e8f71ba8e0e0a49b91bd. The original Pharo image SHA-256 is 4df757c743e18c3dcc191a5fd179be8b7cbd60790501360e7817352deb1d7a96.

It does not establish bit-identical model training, live LLM responses or benchmark timings. The workspace has no completed trained model or benchmark results, and does not contain Ollama weights or immutable Ollama model digests. Python dependencies use version ranges; observed local versions in snapshot.json are provenance only, not a tested dependency lock. Hardware, runtime versions, randomness and concurrency can affect results. Automatic pinned downloading, Linux runtime support and further determinism/parallelism changes are separate pipeline work.

Local credentials and all pharo-local/ state, Python caches, .DS_Store, the Git database and the obsolete previous-downloaded-image.* are excluded. The original image itself is unchanged. Third-party runtime and source components retain their upstream licenses; the repository's MIT metadata does not replace those licenses.

Downloads last month
35