Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
I
inox
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
LARA
inox
Commits
2fc67c40
Commit
2fc67c40
authored
9 years ago
by
Mikaël Mayer
Browse files
Options
Downloads
Patches
Plain Diff
Corrected BinaryTreeRender.scala (Leaf() instead of Leaf)
parent
abce83ac
Branches
Branches containing commit
Tags
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
testcases/stringrender/BinaryTreeRender.scala
+30
-30
30 additions, 30 deletions
testcases/stringrender/BinaryTreeRender.scala
with
30 additions
and
30 deletions
testcases/stringrender/BinaryTreeRender.scala
+
30
−
30
View file @
2fc67c40
/**
* Name: BinaryTreeRender.scala
* Creation: 14.10.2015
* Author: Mika
l
Mayer (mikael.mayer@epfl.ch)
* Author: Mika
�l
Mayer (mikael.mayer@epfl.ch)
* Comments: Binary tree rendering specifications.
*/
...
...
@@ -18,56 +18,56 @@ object TreeRender {
/** Synthesis by example specs */
@inline
def
psStandard
(
s
:
Tree
[
Int
])(
res
:
String
)
=
(
s
,
res
)
passes
{
case
Node
(
Node
(
Leaf
,
2
,
Leaf
),
1
,
Node
(
Leaf
,
-
3
,
Leaf
))
=>
"Node(Node(Leaf, 2, Leaf), 1, Node(Leaf, -3, Leaf))"
case
Node
(
Leaf
,
1
,
Leaf
)
=>
"Node(Leaf, 1, Leaf)"
case
Leaf
=>
"Leaf"
case
Node
(
Node
(
Leaf
()
,
2
,
Leaf
()
),
1
,
Node
(
Leaf
()
,
-
3
,
Leaf
()
))
=>
"Node(Node(Leaf
()
, 2, Leaf
()
), 1, Node(Leaf
()
, -3, Leaf
()
))"
case
Node
(
Leaf
()
,
1
,
Leaf
()
)
=>
"Node(Leaf
()
, 1, Leaf
()
)"
case
Leaf
()
=>
"Leaf
()
"
}
@inline
def
psRemoveNode
(
s
:
Tree
[
Int
])(
res
:
String
)
=
(
s
,
res
)
passes
{
case
Node
(
Node
(
Leaf
,
2
,
Leaf
),
1
,
Node
(
Leaf
,
-
3
,
Leaf
))
=>
"((Leaf, 2, Leaf), 1, (Leaf, -3, Leaf))"
case
Node
(
Leaf
,
1
,
Leaf
)
=>
"(Leaf, 1, Leaf)"
case
Leaf
=>
"Leaf"
case
Node
(
Node
(
Leaf
()
,
2
,
Leaf
()
),
1
,
Node
(
Leaf
()
,
-
3
,
Leaf
()
))
=>
"((Leaf
()
, 2, Leaf
()
), 1, (Leaf
()
, -3, Leaf
()
))"
case
Node
(
Leaf
()
,
1
,
Leaf
()
)
=>
"(Leaf
()
, 1, Leaf
()
)"
case
Leaf
()
=>
"Leaf
()
"
}
@inline
def
psRemoveLeaf
(
s
:
Tree
[
Int
])(
res
:
String
)
=
(
s
,
res
)
passes
{
case
Node
(
Node
(
Leaf
,
2
,
Leaf
),
1
,
Node
(
Leaf
,
-
3
,
Leaf
))
=>
"((, 2, ), 1, (, -3, ))"
case
Node
(
Leaf
,
1
,
Leaf
)
=>
"(, 1, )"
case
Leaf
=>
""
case
Node
(
Node
(
Leaf
()
,
2
,
Leaf
()
),
1
,
Node
(
Leaf
()
,
-
3
,
Leaf
()
))
=>
"((, 2, ), 1, (, -3, ))"
case
Node
(
Leaf
()
,
1
,
Leaf
()
)
=>
"(, 1, )"
case
Leaf
()
=>
""
}
@inline
def
psRemoveComma
(
s
:
Tree
[
Int
])(
res
:
String
)
=
(
s
,
res
)
passes
{
case
Node
(
Node
(
Leaf
,
2
,
Leaf
),
1
,
Node
(
Leaf
,
-
3
,
Leaf
))
=>
"((2), 1, (-3))"
case
Node
(
Leaf
,
1
,
Node
(
Leaf
,
2
,
Leaf
))
=>
"(1, (2))"
case
Node
(
Node
(
Leaf
,
2
,
Leaf
),
1
,
Leaf
)
=>
"((2), 1)"
case
Leaf
=>
""
case
Node
(
Node
(
Leaf
()
,
2
,
Leaf
()
),
1
,
Node
(
Leaf
()
,
-
3
,
Leaf
()
))
=>
"((2), 1, (-3))"
case
Node
(
Leaf
()
,
1
,
Node
(
Leaf
()
,
2
,
Leaf
()
))
=>
"(1, (2))"
case
Node
(
Node
(
Leaf
()
,
2
,
Leaf
()
),
1
,
Leaf
()
)
=>
"((2), 1)"
case
Leaf
()
=>
""
}
@inline
def
psRemoveParentheses
(
s
:
Tree
[
Int
])(
res
:
String
)
=
(
s
,
res
)
passes
{
case
Node
(
Node
(
Leaf
,
2
,
Leaf
),
1
,
Node
(
Leaf
,
-
3
,
Leaf
))
=>
"(2), 1, (-3)"
case
Node
(
Leaf
,
1
,
Node
(
Leaf
,
2
,
Leaf
))
=>
"1, (2)"
case
Node
(
Node
(
Leaf
,
2
,
Leaf
),
1
,
Leaf
)
=>
"(2), 1"
case
Leaf
=>
""
case
Node
(
Node
(
Leaf
()
,
2
,
Leaf
()
),
1
,
Node
(
Leaf
()
,
-
3
,
Leaf
()
))
=>
"(2), 1, (-3)"
case
Node
(
Leaf
()
,
1
,
Node
(
Leaf
()
,
2
,
Leaf
()
))
=>
"1, (2)"
case
Node
(
Node
(
Leaf
()
,
2
,
Leaf
()
),
1
,
Leaf
()
)
=>
"(2), 1"
case
Leaf
()
=>
""
}
@inline
def
psPrefix
(
s
:
Tree
[
Int
])(
res
:
String
)
=
(
s
,
res
)
passes
{
case
Node
(
Node
(
Leaf
,
2
,
Leaf
),
1
,
Node
(
Leaf
,
-
3
,
Leaf
))
=>
"1 (2) (-3)"
case
Node
(
Leaf
,
1
,
Node
(
Leaf
,
2
,
Leaf
))
=>
"1 () (2)"
case
Node
(
Node
(
Leaf
,
2
,
Leaf
),
1
,
Leaf
)
=>
"1 (2) ()"
case
Leaf
=>
"()"
case
Node
(
Node
(
Leaf
()
,
2
,
Leaf
()
),
1
,
Node
(
Leaf
()
,
-
3
,
Leaf
()
))
=>
"1 (2) (-3)"
case
Node
(
Leaf
()
,
1
,
Node
(
Leaf
()
,
2
,
Leaf
()
))
=>
"1 () (2)"
case
Node
(
Node
(
Leaf
()
,
2
,
Leaf
()
),
1
,
Leaf
()
)
=>
"1 (2) ()"
case
Leaf
()
=>
"()"
}
@inline
def
psLispLike
(
s
:
Tree
[
Int
])(
res
:
String
)
=
(
s
,
res
)
passes
{
case
Node
(
Node
(
Leaf
,
2
,
Leaf
),
1
,
Node
(
Leaf
,
-
3
,
Leaf
))
=>
"(1 (2) (-3))"
case
Node
(
Leaf
,
1
,
Node
(
Leaf
,
2
,
Leaf
))
=>
"(1 () (2))"
case
Node
(
Node
(
Leaf
,
2
,
Leaf
),
1
,
Leaf
)
=>
"(1 (2) ())"
case
Leaf
=>
"()"
case
Node
(
Node
(
Leaf
()
,
2
,
Leaf
()
),
1
,
Node
(
Leaf
()
,
-
3
,
Leaf
()
))
=>
"(1 (2) (-3))"
case
Node
(
Leaf
()
,
1
,
Node
(
Leaf
()
,
2
,
Leaf
()
))
=>
"(1 () (2))"
case
Node
(
Node
(
Leaf
()
,
2
,
Leaf
()
),
1
,
Leaf
()
)
=>
"(1 (2) ())"
case
Leaf
()
=>
"()"
}
@inline
def
psSuffix
(
s
:
Tree
[
Int
])(
res
:
String
)
=
(
s
,
res
)
passes
{
case
Node
(
Node
(
Leaf
,
2
,
Leaf
),
1
,
Node
(
Leaf
,
-
3
,
Leaf
))
=>
"(2) (-3) 1"
case
Node
(
Leaf
,
1
,
Node
(
Leaf
,
2
,
Leaf
))
=>
"() (2) 1"
case
Node
(
Node
(
Leaf
,
2
,
Leaf
),
1
,
Leaf
)
=>
"(2) () 1"
case
Leaf
=>
"()"
case
Node
(
Node
(
Leaf
()
,
2
,
Leaf
()
),
1
,
Node
(
Leaf
()
,
-
3
,
Leaf
()
))
=>
"(2) (-3) 1"
case
Node
(
Leaf
()
,
1
,
Node
(
Leaf
()
,
2
,
Leaf
()
))
=>
"() (2) 1"
case
Node
(
Node
(
Leaf
()
,
2
,
Leaf
()
),
1
,
Leaf
()
)
=>
"(2) () 1"
case
Leaf
()
=>
"()"
}
//////////////////////////////////////////////
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment