-
Notifications
You must be signed in to change notification settings - Fork 2
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #2 from matburnx/main
Implement smalltalkCI to the repo, make tests usable for everyone and centralize the XML dependency
- Loading branch information
Showing
19 changed files
with
724 additions
and
81 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,33 @@ | ||
# This is a basic workflow to help you get started with Actions | ||
|
||
name: CI | ||
|
||
# Controls when the workflow will run | ||
on: | ||
# Triggers the workflow on push or pull request events but only for the "main" branch | ||
push: | ||
branches: [ "main" ] | ||
pull_request: | ||
branches: [ "main" ] | ||
|
||
# Allows you to run this workflow manually from the Actions tab | ||
workflow_dispatch: | ||
|
||
# A workflow run is made up of one or more jobs that can run sequentially or in parallel | ||
jobs: | ||
# This workflow contains a single job called "build" | ||
build: | ||
# The type of runner that the job will run on | ||
runs-on: ubuntu-latest | ||
|
||
# Steps represent a sequence of tasks that will be executed as part of the job | ||
steps: | ||
# Checks-out your repository under $GITHUB_WORKSPACE, so your job can access it | ||
- uses: actions/checkout@v2 | ||
- uses: hpi-swa/setup-smalltalkCI@v1 | ||
id: smalltalkci | ||
with: | ||
smalltalk-image: 'Pharo64-stable' | ||
- run: smalltalkci -s ${{ steps.smalltalkci.outputs.smalltalk-image }} | ||
shell: bash | ||
timeout-minutes: 15 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,9 @@ | ||
SmalltalkCISpec { | ||
#loading : [ | ||
SCIMetacelloLoadSpec { | ||
#baseline : 'XCTrace', | ||
#directory : 'src', | ||
#platforms : [ #pharo ] | ||
} | ||
] | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,19 @@ | ||
Class { | ||
#name : #BaselineOfTreeParser, | ||
#superclass : #BaselineOf, | ||
#category : #BaselineOfTreeParser | ||
} | ||
|
||
{ #category : #baselines } | ||
BaselineOfTreeParser >> baseline: spec [ | ||
<baseline> | ||
spec for: #common do: [ | ||
"Packages" | ||
spec | ||
package: #TreeParser ] | ||
] | ||
|
||
{ #category : #accessing } | ||
BaselineOfTreeParser >> projectClass [ | ||
^ MetacelloCypressBaselineProject | ||
] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1 @@ | ||
Package { #name : #BaselineOfTreeParser } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,31 @@ | ||
Class { | ||
#name : #BaselineOfXCTrace, | ||
#superclass : #BaselineOf, | ||
#category : #BaselineOfXCTrace | ||
} | ||
|
||
{ #category : #packages } | ||
BaselineOfXCTrace >> XMLParser: spec [ | ||
spec | ||
baseline: 'XMLParser' | ||
with: [ spec repository: 'github://pharo-contributions/XML-XMLParser' ] | ||
|
||
] | ||
|
||
{ #category : #baselines } | ||
BaselineOfXCTrace >> baseline: spec [ | ||
<baseline> | ||
spec for: #common do: [ | ||
"Dependencies" | ||
self XMLParser: spec. | ||
|
||
"Packages" | ||
spec | ||
package: #XCTrace with: [spec requires: #XMLParser]; | ||
package: 'XCTrace-Tests' with: [spec requires: #XCTrace] ] | ||
] | ||
|
||
{ #category : #accessing } | ||
BaselineOfXCTrace >> projectClass [ | ||
^ MetacelloCypressBaselineProject | ||
] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1 @@ | ||
Package { #name : #BaselineOfXCTrace } |
Large diffs are not rendered by default.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1 @@ | ||
Package { #name : #'TreeParser-Tests' } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,58 @@ | ||
Class { | ||
#name : #TreeChildren, | ||
#superclass : #Object, | ||
#instVars : [ | ||
'parent', | ||
'children', | ||
'name', | ||
'percentage' | ||
], | ||
#category : #TreeParser | ||
} | ||
|
||
{ #category : #properties } | ||
TreeChildren class >> childrenOf: aTreeNode [ | ||
^ self new | ||
parent: aTreeNode; | ||
children: self. | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeChildren >> children [ | ||
^ children | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeChildren >> children: aTreeChildren [ | ||
children := aTreeChildren. | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeChildren >> name [ | ||
^ name | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeChildren >> name: aName [ | ||
name := aName. | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeChildren >> parent [ | ||
^ parent | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeChildren >> parent: aTreeNode [ | ||
parent := aTreeNode. | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeChildren >> percentage [ | ||
^ percentage | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeChildren >> percentage: aFloat [ | ||
percentage := aFloat. | ||
] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,197 @@ | ||
Class { | ||
#name : #TreeNodes, | ||
#superclass : #Object, | ||
#instVars : [ | ||
'nodes' | ||
], | ||
#category : #TreeParser | ||
} | ||
|
||
{ #category : #accessing } | ||
TreeNodes >> classify [ | ||
"Recreates the parent/child links given by the file. DOES NOT WORK PROPERLY YET" | ||
|list| | ||
list := Array new: (self numberOfFunctions). | ||
|
||
1 to: (self numberOfFunctions) do: [:i | | ||
list at: i put: | ||
(TreeChildren new | ||
children: (self findChildrenOf: i); | ||
parent: (self findParentOf: i); | ||
name: (self nameOf: i); | ||
percentage: (self percentageOf: i) )]. | ||
""" | ||
1 to: (self numberOfFunctions) do: [:i | | ||
(i>1) | ||
ifTrue: [ ((self differenceOfSpacesAt: i-1) = 0) | ||
ifTrue: [(list at: i) parent: ((list at: i-1) parent)] | ||
ifFalse: [ ( (self differenceOfSpacesAt: i-1) < 0 ) | ||
ifTrue: [ self findParentFrom: i ] | ||
ifFalse: [ (list at: i) parent: (list at: i-1) ] ] ] | ||
ifFalse: [ nil ]. | ||
(i< (self numberOfFunctions) ) | ||
ifTrue: [ | ||
((self differenceOfSpacesAt: i) = 0) | ||
ifTrue: [ (list at: i) children: ((list at: i+1) children) ] | ||
ifFalse: [ ((self differenceOfSpacesAt: i) < 0) | ||
ifTrue: [ (list at: i) children: nil ] | ||
ifFalse: [ (list at: i) children: (list at: i+1) ] ] ] | ||
ifFalse: [ nil ] ].""" | ||
^ list | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeNodes >> classify: aLine [ | ||
|child| | ||
child := TreeChildren new | ||
children: (TreeChildren new parent: child ; | ||
name: ((aLine< (self numberOfFunctions) ) | ||
ifTrue: [self nameOf: (aLine+1)] | ||
ifFalse: [ nil ]) ; | ||
percentage: ((aLine< (self numberOfFunctions) ) | ||
ifTrue: [self percentageOf: (aLine+1)] | ||
ifFalse: [ nil ]) ) ; | ||
|
||
parent: (TreeChildren new | ||
children: child ; | ||
name: ((aLine>0) | ||
ifTrue: [self nameOf: (aLine+1)] | ||
ifFalse: [ nil ]) ; | ||
percentage: ((aLine>0) | ||
ifTrue: [self percentageOf: (aLine+1)] | ||
ifFalse: [ nil ]) ) ; | ||
|
||
name: (self nameOf: aLine) ; | ||
percentage: (self percentageOf: aLine). | ||
^ child | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeNodes >> differenceOfSpacesAt: aNode [ | ||
"Gives the difference of the number of spaces between 2 followed lines." | ||
self assert: aNode < (self numberOfFunctions). | ||
^ ((self numberOfSpacesAt: aNode+1) - (self numberOfSpacesAt: aNode)) | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeNodes >> findChildrenOf: aNode [ | ||
|list| | ||
list := self nodes. | ||
(aNode < self numberOfFunctions) | ||
ifTrue: [ ((self differenceOfSpacesAt: aNode) = 0) | ||
ifTrue: [^ self findChildrenOf: aNode+1] | ||
|
||
ifFalse: [ ( (self differenceOfSpacesAt: aNode) < 0 ) | ||
ifTrue: [ ^ nil ] | ||
|
||
ifFalse: [ |spaces everyChildren| | ||
everyChildren := OrderedCollection new. | ||
spaces := self numberOfSpacesAt: aNode+1. | ||
aNode to: (self numberOfFunctions - 1) do: [:j | ( (self differenceOfSpacesAt: j) >= 0 and: ( spaces = (self numberOfSpacesAt: j) ) ) | ||
ifTrue: [ everyChildren add: (list at: j) ] ]. | ||
^ everyChildren ] ] ] | ||
ifFalse: [ ^ nil ]. | ||
] | ||
|
||
{ #category : #'as yet unclassified' } | ||
TreeNodes >> findParentFrom: aNode [ | ||
|i| | ||
i := aNode. | ||
[ (i>=1) and: [ (self numberOfSpacesAt: aNode) - (self numberOfSpacesAt: i) < 10 ] ] whileTrue: | ||
[ i:=i-1 ]. | ||
^ (self nodes at: i) | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeNodes >> findParentOf: aNode [ | ||
|list| | ||
list := self nodes. | ||
(aNode > 1) | ||
ifTrue: [ ((self differenceOfSpacesAt: aNode-1) = 0) | ||
ifTrue: [^ (self findParentOf: aNode-1)] | ||
|
||
ifFalse: [ ( (self differenceOfSpacesAt: aNode-1) < 0 ) | ||
ifTrue: [ aNode to: 1 by: -1 do: [:i | | ||
(self numberOfSpacesAt: i) < (self numberOfSpacesAt: aNode) | ||
ifTrue: [ (self percentageOf: i) = (self percentageOf: aNode) | ||
ifFalse: [ ^ (list at: i) ] ] ] ] | ||
|
||
ifFalse: [ ^(list at: aNode-1) ] ] ] | ||
ifFalse: [ ^ nil ]. | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeNodes >> lastNodeOf: aPlace [ | ||
|c| | ||
c := 1. | ||
1 to: aPlace do: [:n | | ||
[ ( self differenceOfSpacesAt: c ) >= 0 ] whileTrue: [ | ||
c:=c+1]. | ||
n=aPlace ifTrue:[ ^ self nodes at: c ]. | ||
( ( self differenceOfSpacesAt: c ) >= 0) ifFalse: [c:=c+1] ] | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeNodes >> nameOf: aLine [ | ||
"Gets the name of a function at a given line." | ||
|line| | ||
line := ((self withoutSpaces at: aLine) copyWithout: $-). | ||
( (aLine > 1) and: [(self percentageOf: aLine-1) = (self percentageOf: aLine)] ) | ||
ifTrue: [ ^ line ] | ||
ifFalse: [ ^ line last: (line size - ((self percentageOf: aLine) asString) size) -1 ] | ||
|
||
] | ||
|
||
{ #category : #accessing } | ||
TreeNodes >> nodes [ | ||
|
||
^ nodes | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeNodes >> nodes: aContent [ | ||
nodes := aContent select: [:c | ((c copyWithout: (Character space)) copyWithout: $|) isNotEmpty ] | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeNodes >> numberOfFunctions [ | ||
"Gives the number of non-unique functions mentioned in the file." | ||
^ nodes size | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeNodes >> numberOfSpacesAt: aNode [ | ||
"Gives the number of spaces at a certain line." | ||
|count spacesAreEnded| | ||
count := 0. | ||
spacesAreEnded := false. | ||
(self nodes at: aNode) do: [:c | ((c ~= Character space) and: (c ~= $|)) | ||
ifFalse: [ | ||
spacesAreEnded ifFalse: [ | ||
count := count+1 ] ] | ||
ifTrue: [ spacesAreEnded := true. ] ] . | ||
^ count | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeNodes >> percentageOf: aLine [ | ||
"Gives the percentage from a function at a given line" | ||
"In the case of multiples functions for one percentage, it gives the same percentage so it's precise yet." | ||
|line numbers| | ||
self assert: aLine >=1. | ||
line := self nodes at: aLine. | ||
|
||
numbers := ( ( ( (self withoutSpaces at: aLine) copyWithout: $-) first: 5) select: [:c | {$0.$1.$2.$3.$4.$5.$6.$7.$8.$9} asSet includes: c ]). | ||
( (aLine> 1) and: (numbers isEmpty) ) ifTrue: [^ self percentageOf: aLine-1]. | ||
numbers size >= 4 | ||
ifTrue: [^ ((numbers first: 4) asInteger / 100) asFloat ] | ||
ifFalse: [^ ((numbers first: 3) asInteger / 100) asFloat ] | ||
] | ||
|
||
{ #category : #accessing } | ||
TreeNodes >> withoutSpaces [ | ||
"Gives a line without the characters that are not interesting." | ||
^ self nodes collect: [:n | (n copyWithout: Character space) copyWithout: $|] | ||
] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,32 @@ | ||
Class { | ||
#name : #TreeParse, | ||
#superclass : #Object, | ||
#instVars : [ | ||
'content' | ||
], | ||
#category : #TreeParser | ||
} | ||
|
||
{ #category : #'instance creation' } | ||
TreeParse class >> fromFile: aFile [ | ||
self assert: aFile class = FileReference. | ||
^ self new | ||
content: aFile. | ||
] | ||
|
||
{ #category : #'as yet unclassified' } | ||
TreeParse >> asNodes [ | ||
|
||
^ TreeNodes new | ||
nodes: content. | ||
] | ||
|
||
{ #category : #'as yet unclassified' } | ||
TreeParse >> content: aFile [ | ||
content := (aFile contents) lines reject: [:line | line beginsWith: '#']. | ||
] | ||
|
||
{ #category : #'as yet unclassified' } | ||
TreeParse >> readLine: pos [ | ||
^ content at: pos. | ||
] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1 @@ | ||
Package { #name : #TreeParser } |
Oops, something went wrong.