Toggle labels: paths names effects

↰ Results summary

list-lazy-mergesort2

step

batch name

0

Input:

Cons

458

Name

7

Art

___7

7

Cons

57

Name

6

Art

___6

6

Cons

191

Name

5

Art

___5

5

Cons

489

Name

4

Art

___4

4

Cons

258

Name

3

Art

___3

3

Cons

711

Name

2

Art

___2

2

Cons

103

Name

1

Art

___1

1

Cons

545

Name

0

Art

___0

0

Nil

Output:

Name

6-r-r-r-r

Cons

57

Art

__compute__merge___6-r-r-r-l

compute

merge

6-r-r-r-l

Name

1-r-r-r

Cons

103

Art

__compute__merge___1-r-r-l

compute

merge

1-r-r-l

Name

5-r-r-r

Cons

191

Art

__compute__merge___5-r-r-l

compute

merge

5-r-r-l

Uneval'd

DCG, post-compute:

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-l

compute

merge

6-r-l

compute

merge

6-l

compute

merge

5-l

compute

merge

5-r-l

compute

merge

1-r-r-l

compute

merge

1-r-r-l

compute

merge

1-r-l

compute

merge

1-l

compute

merge

0-l

compute

merge

5-r-r-l

Editor trace:

Alloc(LocFresh)

▣

0

Alloc(LocFresh)

▣

1

Alloc(LocFresh)

▣

2

Alloc(LocFresh)

▣

3

Alloc(LocFresh)

▣

4

Alloc(LocFresh)

▣

5

Alloc(LocFresh)

▣

6

Alloc(LocFresh)

▣

7

Archivist trace:

Alloc(LocFresh)

◯

compute

tree_of_list

7-l

Force(CompCacheMiss)

compute

tree_of_list

7-l

Force(RefGet)

7

Alloc(LocFresh)

◯

compute

tree_of_list

6-l

Force(CompCacheMiss)

compute

tree_of_list

6-l

Force(RefGet)

6

Alloc(LocFresh)

▣

compute

tree_of_list

6

Alloc(LocFresh)

◯

compute

tree_of_list

6-r

Force(CompCacheMiss)

compute

tree_of_list

6-r

Alloc(LocFresh)

◯

compute

tree_of_list

5-l

Force(CompCacheMiss)

compute

tree_of_list

5-l

Force(RefGet)

5

Alloc(LocFresh)

◯

compute

tree_of_list

4-l

Force(CompCacheMiss)

compute

tree_of_list

4-l

Force(RefGet)

4

Alloc(LocFresh)

▣

compute

tree_of_list

4

Alloc(LocFresh)

◯

compute

tree_of_list

4-r

Force(CompCacheMiss)

compute

tree_of_list

4-r

Alloc(LocFresh)

▣

compute

tree_of_list

5

Alloc(LocFresh)

◯

compute

tree_of_list

5-r

Force(CompCacheMiss)

compute

tree_of_list

5-r

Alloc(LocFresh)

▣

compute

tree_of_list

7

Alloc(LocFresh)

◯

compute

tree_of_list

7-r

Force(CompCacheMiss)

compute

tree_of_list

7-r

Alloc(LocFresh)

◯

compute

tree_of_list

3-l

Force(CompCacheMiss)

compute

tree_of_list

3-l

Force(RefGet)

3

Alloc(LocFresh)

◯

compute

tree_of_list

2-l

Force(CompCacheMiss)

compute

tree_of_list

2-l

Force(RefGet)

2

Alloc(LocFresh)

◯

compute

tree_of_list

1-l

Force(CompCacheMiss)

compute

tree_of_list

1-l

Force(RefGet)

1

Alloc(LocFresh)

◯

compute

tree_of_list

0-l

Force(CompCacheMiss)

compute

tree_of_list

0-l

Force(RefGet)

0

Alloc(LocFresh)

▣

compute

tree_of_list

0

Alloc(LocFresh)

◯

compute

tree_of_list

0-r

Force(CompCacheMiss)

compute

tree_of_list

0-r

Alloc(LocFresh)

▣

compute

tree_of_list

1

Alloc(LocFresh)

◯

compute

tree_of_list

1-r

Force(CompCacheMiss)

compute

tree_of_list

1-r

Alloc(LocFresh)

▣

compute

tree_of_list

2

Alloc(LocFresh)

◯

compute

tree_of_list

2-r

Force(CompCacheMiss)

compute

tree_of_list

2-r

Alloc(LocFresh)

▣

compute

tree_of_list

3

Alloc(LocFresh)

◯

compute

tree_of_list

3-r

Force(CompCacheMiss)

compute

tree_of_list

3-r

Force(RefGet)

compute

tree_of_list

3

Alloc(LocFresh)

◯

compute

3-l

Force(CompCacheMiss)

compute

3-l

Force(RefGet)

compute

tree_of_list

2

Alloc(LocFresh)

◯

compute

2-l

Force(CompCacheMiss)

compute

2-l

Force(RefGet)

compute

tree_of_list

1

Alloc(LocFresh)

◯

compute

1-l

Force(CompCacheMiss)

compute

1-l

Force(RefGet)

compute

tree_of_list

0

Alloc(LocFresh)

◯

compute

0-l

Force(CompCacheMiss)

compute

0-l

Alloc(LocFresh)

◯

compute

0-r

Force(CompCacheMiss)

compute

0-r

Alloc(LocFresh)

◯

compute

1-r

Force(CompCacheMiss)

compute

1-r

Alloc(LocFresh)

◯

compute

merge

1-l

Alloc(LocFresh)

◯

compute

2-r

Force(CompCacheMiss)

compute

2-r

Alloc(LocFresh)

◯

compute

merge

1-r-l

Alloc(LocFresh)

◯

compute

3-r

Force(CompCacheMiss)

compute

3-r

Force(RefGet)

compute

tree_of_list

7

Alloc(LocFresh)

◯

compute

7-l

Force(CompCacheMiss)

compute

7-l

Force(RefGet)

compute

tree_of_list

5

Alloc(LocFresh)

◯

compute

5-l

Force(CompCacheMiss)

compute

5-l

Force(RefGet)

compute

tree_of_list

4

Alloc(LocFresh)

◯

compute

4-l

Force(CompCacheMiss)

compute

4-l

Alloc(LocFresh)

◯

compute

4-r

Force(CompCacheMiss)

compute

4-r

Alloc(LocFresh)

◯

compute

merge

3-l

Alloc(LocFresh)

◯

compute

5-r

Force(CompCacheMiss)

compute

5-r

Force(RefGet)

compute

tree_of_list

6

Alloc(LocFresh)

◯

compute

6-l

Force(CompCacheMiss)

compute

6-l

Alloc(LocFresh)

◯

compute

6-r

Force(CompCacheMiss)

compute

6-r

Alloc(LocFresh)

◯

compute

merge

6-l

Alloc(LocFresh)

◯

compute

merge

6-r-l

Alloc(LocFresh)

◯

compute

7-r

Force(CompCacheMiss)

compute

7-r

Alloc(LocFresh)

◯

compute

merge

6-r-r-l

Alloc(LocFresh)

◯

compute

merge

6-r-r-r-l

Force(CompCacheMiss)

compute

merge

6-r-r-r-l

Force(CompCacheMiss)

compute

merge

6-r-r-l

Force(CompCacheMiss)

compute

merge

6-r-l

Force(CompCacheMiss)

compute

merge

6-l

Alloc(LocFresh)

◯

compute

merge

5-l

Alloc(LocFresh)

◯

compute

merge

5-r-l

Alloc(LocFresh)

◯

compute

merge

1-r-r-l

Force(CompCacheMiss)

compute

merge

1-r-r-l

Force(CompCacheMiss)

compute

merge

1-r-l

Force(CompCacheMiss)

compute

merge

1-l

Alloc(LocFresh)

◯

compute

merge

0-l

Alloc(LocFresh)

◯

compute

merge

5-r-r-l

batch name

1

Input:

Cons

208

Name

8

Art

___8

8

Cons

458

Name

7

Art

___7

7

Cons

57

Name

6

Art

___6

6

Cons

191

Name

5

Art

___5

5

Cons

489

Name

4

Art

___4

4

Cons

258

Name

3

Art

___3

3

Cons

711

Name

2

Art

___2

2

Cons

103

Name

1

Art

___1

1

Cons

545

Name

0

Art

___0

0

Nil

Output:

Name

6-r-r-r-r

Cons

57

Art

__compute__merge___6-r-r-r-l

compute

merge

6-r-r-r-l

Name

1-r-r-r

Cons

103

Art

__compute__merge___1-r-r-l

compute

merge

1-r-r-l

Name

5-r-r-r

Cons

191

Art

__compute__merge___5-r-r-l

compute

merge

5-r-r-l

Uneval'd

DCG, post-edit:

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-l

compute

merge

6-r-l

compute

merge

6-l

compute

merge

5-l

compute

merge

5-r-l

compute

merge

1-r-r-l

compute

merge

1-r-r-l

compute

merge

1-r-l

compute

merge

1-l

compute

merge

0-l

compute

merge

5-r-r-l

DCG, post-compute:

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-l

compute

merge

6-r-l

compute

merge

6-l

compute

merge

5-l

compute

merge

5-r-l

compute

merge

1-r-r-l

compute

merge

1-r-r-l

compute

merge

1-r-l

compute

merge

1-l

compute

merge

0-l

compute

merge

5-r-r-l

Editor trace:

Alloc(LocFresh)

▣

8

Archivist trace:

Alloc(LocFresh)

◯

compute

tree_of_list

8-l

Force(CompCacheMiss)

compute

tree_of_list

8-l

Force(RefGet)

8

Alloc(LocFresh)

▣

compute

tree_of_list

8

Alloc(LocFresh)

◯

compute

tree_of_list

8-r

Force(CompCacheMiss)

compute

tree_of_list

8-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

7-l

Force(CompCacheHit)

compute

tree_of_list

7-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

7

Dirty

compute

tree_of_list

7

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

7-r

Force(CompCacheHit)

compute

tree_of_list

7-r

Force(RefGet)

compute

tree_of_list

3

Alloc(LocExists(SameContent))

◯

compute

3-l

Force(CompCacheHit)

compute

3-l

Alloc(LocExists(SameContent))

◯

compute

3-r

Force(CompCacheHit)

compute

3-r

CleanRec

compute

tree_of_list

7

CleanEval

compute

3-r

Remove

compute

tree_of_list

7

Remove

compute

7-l

Remove

compute

7-l

Remove

compute

7-r

Remove

compute

7-r

Remove

compute

merge

6-r-r-l

Force(RefGet)

compute

tree_of_list

7

Alloc(LocExists(SameContent))

◯

compute

7-l

Force(CompCacheHit)

compute

7-l

Alloc(LocExists(DiffContent))

◯

compute

7-r

Force(CompCacheMiss)

compute

7-r

Force(RefGet)

compute

tree_of_list

8

Alloc(LocFresh)

◯

compute

8-l

Force(CompCacheMiss)

compute

8-l

Alloc(LocFresh)

◯

compute

8-r

Force(CompCacheMiss)

compute

8-r

Alloc(LocFresh)

◯

compute

merge

8-l

Alloc(LocExists(DiffContent))

◯

compute

merge

6-r-r-l

Dirty

compute

merge

6-r-r-l

Alloc(LocExists(SameContent))

◯

compute

merge

6-r-r-r-l

Force(CompCacheHit)

compute

merge

6-r-r-r-l

CleanRec

compute

merge

6-r-r-l

CleanEval

compute

merge

6-r-r-l

Remove

compute

merge

6-r-l

Remove

compute

merge

5-r-l

Force(CompCacheHit)

compute

merge

6-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

5-r-l

CleanEdge

compute

merge

6-r-r-l

Force(CompCacheHit)

compute

merge

1-r-r-l

batch name

2

Input:

Cons

589

Name

9

Art

___9

9

Cons

208

Name

8

Art

___8

8

Cons

458

Name

7

Art

___7

7

Cons

57

Name

6

Art

___6

6

Cons

191

Name

5

Art

___5

5

Cons

489

Name

4

Art

___4

4

Cons

258

Name

3

Art

___3

3

Cons

711

Name

2

Art

___2

2

Cons

103

Name

1

Art

___1

1

Cons

545

Name

0

Art

___0

0

Nil

Output:

Name

6-r-r-r-r

Cons

57

Art

__compute__merge___6-r-r-r-l

compute

merge

6-r-r-r-l

Name

1-r-r-r

Cons

103

Art

__compute__merge___1-r-r-l

compute

merge

1-r-r-l

Name

5-r-r-r

Cons

191

Art

__compute__merge___5-r-r-l

compute

merge

5-r-r-l

Uneval'd

DCG, post-edit:

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-l

compute

merge

6-r-l

compute

merge

6-l

compute

merge

5-l

compute

merge

5-r-l

compute

merge

1-r-r-l

compute

merge

1-r-r-l

compute

merge

1-r-l

compute

merge

1-l

compute

merge

0-l

compute

merge

5-r-r-l

DCG, post-compute:

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-l

compute

merge

6-r-l

compute

merge

6-l

compute

merge

5-l

compute

merge

5-r-l

compute

merge

1-r-r-l

compute

merge

1-r-r-l

compute

merge

1-r-l

compute

merge

1-l

compute

merge

0-l

compute

merge

5-r-r-l

Editor trace:

Alloc(LocFresh)

▣

9

Archivist trace:

Alloc(LocFresh)

◯

compute

tree_of_list

9-l

Force(CompCacheMiss)

compute

tree_of_list

9-l

Force(RefGet)

9

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

8-l

Force(CompCacheHit)

compute

tree_of_list

8-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

8

Alloc(LocExists(DiffContent))

◯

compute

tree_of_list

8-r

Force(CompCacheMiss)

compute

tree_of_list

8-r

Remove

compute

tree_of_list

7-l

Remove

compute

tree_of_list

7-l

Remove

compute

tree_of_list

7

Remove

compute

tree_of_list

7-r

Remove

compute

tree_of_list

7-r

Alloc(LocFresh)

▣

compute

tree_of_list

9

Alloc(LocFresh)

◯

compute

tree_of_list

9-r

Force(CompCacheMiss)

compute

tree_of_list

9-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

7-l

Force(CompCacheHit)

compute

tree_of_list

7-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

7

Dirty

compute

tree_of_list

7

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

7-r

Force(CompCacheHit)

compute

tree_of_list

7-r

Force(RefGet)

compute

tree_of_list

3

Alloc(LocExists(SameContent))

◯

compute

3-l

Force(CompCacheHit)

compute

3-l

Alloc(LocExists(SameContent))

◯

compute

3-r

Force(CompCacheHit)

compute

3-r

CleanRec

compute

tree_of_list

7

CleanEval

compute

3-r

Remove

compute

tree_of_list

7

Remove

compute

7-l

Remove

compute

7-l

Remove

compute

7-r

Remove

compute

7-r

Remove

compute

merge

6-r-r-l

Force(RefGet)

compute

tree_of_list

7

Alloc(LocExists(SameContent))

◯

compute

7-l

Force(CompCacheHit)

compute

7-l

Alloc(LocExists(DiffContent))

◯

compute

7-r

Force(CompCacheMiss)

compute

7-r

Remove

compute

tree_of_list

8

Remove

compute

8-l

Remove

compute

8-l

Remove

compute

8-r

Remove

compute

8-r

Remove

compute

merge

8-l

Force(RefGet)

compute

tree_of_list

9

Alloc(LocFresh)

◯

compute

9-l

Force(CompCacheMiss)

compute

9-l

Force(RefGet)

compute

tree_of_list

8

Alloc(LocExists(SameContent))

◯

compute

8-l

Force(CompCacheHit)

compute

8-l

Alloc(LocExists(SameContent))

◯

compute

8-r

Force(CompCacheHit)

compute

8-r

Alloc(LocExists(SameContent))

◯

compute

merge

8-l

Alloc(LocFresh)

◯

compute

9-r

Force(CompCacheMiss)

compute

9-r

Alloc(LocFresh)

◯

compute

merge

8-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

6-r-r-l

Dirty

compute

merge

6-r-r-l

Alloc(LocExists(SameContent))

◯

compute

merge

6-r-r-r-l

Force(CompCacheHit)

compute

merge

6-r-r-r-l

CleanRec

compute

merge

6-r-r-l

CleanEval

compute

merge

6-r-r-l

Remove

compute

merge

6-r-l

Remove

compute

merge

5-r-l

Force(CompCacheHit)

compute

merge

6-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

5-r-l

CleanEdge

compute

merge

6-r-r-l

Force(CompCacheHit)

compute

merge

1-r-r-l

batch name

3

Input:

Cons

304

Name

10

Art

___10

10

Cons

589

Name

9

Art

___9

9

Cons

208

Name

8

Art

___8

8

Cons

458

Name

7

Art

___7

7

Cons

57

Name

6

Art

___6

6

Cons

191

Name

5

Art

___5

5

Cons

489

Name

4

Art

___4

4

Cons

258

Name

3

Art

___3

3

Cons

711

Name

2

Art

___2

2

Cons

103

Name

1

Art

___1

1

Cons

545

Name

0

Art

___0

0

Nil

Output:

Name

6-r-r-r-r-r

Cons

57

Art

__compute__merge___6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

Name

1-r-r-r-r

Cons

103

Art

__compute__merge___1-r-r-r-l

compute

merge

1-r-r-r-l

Name

5-r-r-r-r

Cons

191

Art

__compute__merge___5-r-r-r-l

compute

merge

5-r-r-r-l

Uneval'd

DCG, post-edit:

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-l

compute

merge

6-r-l

compute

merge

6-l

compute

merge

5-l

compute

merge

5-r-l

compute

merge

1-r-r-l

compute

merge

1-r-r-l

compute

merge

1-r-l

compute

merge

1-l

compute

merge

0-l

compute

merge

5-r-r-l

DCG, post-compute:

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-l

compute

merge

6-r-l

compute

merge

6-l

compute

merge

5-l

compute

merge

5-r-l

compute

merge

1-r-r-l

compute

merge

1-r-r-r-l

compute

merge

1-r-r-r-l

compute

merge

1-r-r-l

compute

merge

1-r-l

compute

merge

1-l

compute

merge

0-l

compute

merge

5-r-r-l

compute

merge

5-r-r-r-l

Editor trace:

Alloc(LocFresh)

▣

10

Archivist trace:

Alloc(LocFresh)

◯

compute

tree_of_list

10-l

Force(CompCacheMiss)

compute

tree_of_list

10-l

Force(RefGet)

10

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

9-l

Force(CompCacheHit)

compute

tree_of_list

9-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

9

Alloc(LocExists(DiffContent))

◯

compute

tree_of_list

9-r

Force(CompCacheMiss)

compute

tree_of_list

9-r

Remove

compute

tree_of_list

7-l

Remove

compute

tree_of_list

7-l

Remove

compute

tree_of_list

7

Remove

compute

tree_of_list

7-r

Remove

compute

tree_of_list

7-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

7-l

Force(CompCacheHit)

compute

tree_of_list

7-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

7

Alloc(LocExists(DiffContent))

◯

compute

tree_of_list

7-r

Force(CompCacheMiss)

compute

tree_of_list

7-r

Remove

compute

tree_of_list

3-l

Remove

compute

tree_of_list

3-l

Remove

compute

tree_of_list

3

Remove

compute

tree_of_list

3-r

Remove

compute

tree_of_list

3-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

3-l

Force(CompCacheHit)

compute

tree_of_list

3-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

3

Alloc(LocExists(DiffContent))

◯

compute

tree_of_list

3-r

Force(CompCacheMiss)

compute

tree_of_list

3-r

Alloc(LocFresh)

▣

compute

tree_of_list

10

Alloc(LocFresh)

◯

compute

tree_of_list

10-r

Force(CompCacheMiss)

compute

tree_of_list

10-r

Force(RefGet)

compute

tree_of_list

10

Alloc(LocFresh)

◯

compute

10-l

Force(CompCacheMiss)

compute

10-l

Force(RefGet)

compute

tree_of_list

3

Alloc(LocExists(SameContent))

◯

compute

3-l

Force(CompCacheHit)

compute

3-l

Alloc(LocExists(SameContent))

◯

compute

3-r

Force(CompCacheHit)

compute

3-r

Alloc(LocExists(SameContent))

◯

compute

merge

6-r-r-r-l

Alloc(LocFresh)

◯

compute

10-r

Force(CompCacheMiss)

compute

10-r

Alloc(LocFresh)

◯

compute

merge

6-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

6-r-r-r-r-l

Force(CompCacheHit)

compute

merge

6-r-r-r-l

Alloc(LocFresh)

◯

compute

merge

1-r-r-r-l

Force(CompCacheMiss)

compute

merge

1-r-r-r-l

Force(CompCacheHit)

compute

merge

1-r-r-l

Alloc(LocFresh)

◯

compute

merge

5-r-r-r-l

batch name

4

Input:

Cons

469

Name

11

Art

___11

11

Cons

304

Name

10

Art

___10

10

Cons

589

Name

9

Art

___9

9

Cons

208

Name

8

Art

___8

8

Cons

458

Name

7

Art

___7

7

Cons

57

Name

6

Art

___6

6

Cons

191

Name

5

Art

___5

5

Cons

489

Name

4

Art

___4

4

Cons

258

Name

3

Art

___3

3

Cons

711

Name

2

Art

___2

2

Cons

103

Name

1

Art

___1

1

Cons

545

Name

0

Art

___0

0

Nil

Output:

Name

6-r-r-r-r-r

Cons

57

Art

__compute__merge___6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

Name

1-r-r-r-r

Cons

103

Art

__compute__merge___1-r-r-r-l

compute

merge

1-r-r-r-l

Name

5-r-r-r-r

Cons

191

Art

__compute__merge___5-r-r-r-l

compute

merge

5-r-r-r-l

Uneval'd

DCG, post-edit:

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-l

compute

merge

6-r-l

compute

merge

6-l

compute

merge

5-l

compute

merge

5-r-l

compute

merge

1-r-r-l

compute

merge

1-r-r-r-l

compute

merge

1-r-r-r-l

compute

merge

1-r-r-l

compute

merge

1-r-l

compute

merge

1-l

compute

merge

0-l

compute

merge

5-r-r-l

compute

merge

5-r-r-r-l

DCG, post-compute:

compute

tree_of_list

11-l

compute

tree_of_list

11-l

11

compute

tree_of_list

11

compute

tree_of_list

11-r

compute

tree_of_list

11-r

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

tree_of_list

11

compute

11-l

compute

11-l

compute

11-r

compute

11-r

compute

merge

10-l

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-l

compute

merge

6-r-l

compute

merge

6-l

compute

merge

5-l

compute

merge

5-r-l

compute

merge

1-r-r-l

compute

merge

1-r-r-r-l

compute

merge

1-r-r-r-l

compute

merge

1-r-r-l

compute

merge

1-r-l

compute

merge

1-l

compute

merge

0-l

compute

merge

5-r-r-l

compute

merge

5-r-r-r-l

Editor trace:

Alloc(LocFresh)

▣

11

Archivist trace:

Alloc(LocFresh)

◯

compute

tree_of_list

11-l

Force(CompCacheMiss)

compute

tree_of_list

11-l

Force(RefGet)

11

Alloc(LocFresh)

▣

compute

tree_of_list

11

Alloc(LocFresh)

◯

compute

tree_of_list

11-r

Force(CompCacheMiss)

compute

tree_of_list

11-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

10-l

Force(CompCacheHit)

compute

tree_of_list

10-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

10

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

10-r

Force(CompCacheHit)

compute

tree_of_list

10-r

Force(RefGet)

compute

tree_of_list

10

Alloc(LocExists(SameContent))

◯

compute

10-l

Force(CompCacheHit)

compute

10-l

Alloc(LocExists(DiffContent))

◯

compute

10-r

Force(CompCacheMiss)

compute

10-r

Force(RefGet)

compute

tree_of_list

11

Alloc(LocFresh)

◯

compute

11-l

Force(CompCacheMiss)

compute

11-l

Alloc(LocFresh)

◯

compute

11-r

Force(CompCacheMiss)

compute

11-r

Alloc(LocFresh)

◯

compute

merge

10-l

Alloc(LocExists(DiffContent))

◯

compute

merge

6-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

6-r-r-r-r-l

Remove

compute

merge

6-r-r-r-l

Remove

compute

merge

1-r-r-r-l

Force(CompCacheHit)

compute

merge

6-r-r-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

1-r-r-r-l

Force(CompCacheMiss)

compute

merge

1-r-r-r-l

Remove

compute

merge

1-r-r-l

Remove

compute

merge

5-r-r-r-l

Force(CompCacheHit)

compute

merge

1-r-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

5-r-r-r-l

batch name

5

Input:

Cons

50

Name

12

Art

___12

12

Cons

469

Name

11

Art

___11

11

Cons

304

Name

10

Art

___10

10

Cons

589

Name

9

Art

___9

9

Cons

208

Name

8

Art

___8

8

Cons

458

Name

7

Art

___7

7

Cons

57

Name

6

Art

___6

6

Cons

191

Name

5

Art

___5

5

Cons

489

Name

4

Art

___4

4

Cons

258

Name

3

Art

___3

3

Cons

711

Name

2

Art

___2

2

Cons

103

Name

1

Art

___1

1

Cons

545

Name

0

Art

___0

0

Nil

Output:

Name

12-r-r-r

Cons

50

Art

__compute__merge___12-r-r-l

compute

merge

12-r-r-l

Name

6-r-r-r-r-r

Cons

57

Art

__compute__merge___6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

Name

1-r-r-r-r

Cons

103

Art

__compute__merge___1-r-r-r-l

compute

merge

1-r-r-r-l

Name

5-r-r-r-r

Cons

191

Art

__compute__merge___5-r-r-r-l

compute

merge

5-r-r-r-l

Uneval'd

DCG, post-edit:

compute

tree_of_list

11-l

compute

tree_of_list

11-l

11

compute

tree_of_list

11

compute

tree_of_list

11-r

compute

tree_of_list

11-r

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

tree_of_list

11

compute

11-l

compute

11-l

compute

11-r

compute

11-r

compute

merge

10-l

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-l

compute

merge

6-r-l

compute

merge

6-l

compute

merge

5-l

compute

merge

5-r-l

compute

merge

1-r-r-l

compute

merge

1-r-r-r-l

compute

merge

1-r-r-r-l

compute

merge

1-r-r-l

compute

merge

1-r-l

compute

merge

1-l

compute

merge

0-l

compute

merge

5-r-r-l

compute

merge

5-r-r-r-l

DCG, post-compute:

compute

tree_of_list

12-l

compute

tree_of_list

12-l

12

compute

tree_of_list

12

compute

tree_of_list

12-r

compute

tree_of_list

12-r

compute

tree_of_list

11-l

compute

tree_of_list

11-l

11

compute

tree_of_list

11

compute

tree_of_list

11-r

compute

tree_of_list

11-r

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

tree_of_list

11

compute

11-l

compute

11-l

compute

11-r

compute

11-r

compute

tree_of_list

12

compute

12-l

compute

12-l

compute

12-r

compute

12-r

compute

merge

12-l

compute

merge

12-r-l

compute

merge

12-r-r-l

compute

merge

12-r-r-l

compute

merge

12-r-l

compute

merge

12-l

compute

merge

10-l

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-l

compute

merge

6-r-l

compute

merge

6-l

compute

merge

5-l

compute

merge

5-r-l

compute

merge

1-r-r-l

compute

merge

1-r-r-r-l

Editor trace:

Alloc(LocFresh)

▣

12

Archivist trace:

Alloc(LocFresh)

◯

compute

tree_of_list

12-l

Force(CompCacheMiss)

compute

tree_of_list

12-l

Force(RefGet)

12

Alloc(LocFresh)

▣

compute

tree_of_list

12

Alloc(LocFresh)

◯

compute

tree_of_list

12-r

Force(CompCacheMiss)

compute

tree_of_list

12-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

11-l

Force(CompCacheHit)

compute

tree_of_list

11-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

11

Dirty

compute

tree_of_list

11

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

11-r

Force(CompCacheHit)

compute

tree_of_list

11-r

Force(RefGet)

compute

tree_of_list

10

Alloc(LocExists(SameContent))

◯

compute

10-l

Force(CompCacheHit)

compute

10-l

Alloc(LocExists(SameContent))

◯

compute

10-r

Force(CompCacheHit)

compute

10-r

CleanRec

compute

tree_of_list

11

CleanEval

compute

10-r

Remove

compute

tree_of_list

11

Remove

compute

11-l

Remove

compute

11-l

Remove

compute

11-r

Remove

compute

11-r

Remove

compute

merge

10-l

Force(RefGet)

compute

tree_of_list

11

Alloc(LocExists(SameContent))

◯

compute

11-l

Force(CompCacheHit)

compute

11-l

Alloc(LocExists(DiffContent))

◯

compute

11-r

Force(CompCacheMiss)

compute

11-r

Force(RefGet)

compute

tree_of_list

12

Alloc(LocFresh)

◯

compute

12-l

Force(CompCacheMiss)

compute

12-l

Alloc(LocFresh)

◯

compute

12-r

Force(CompCacheMiss)

compute

12-r

Alloc(LocFresh)

◯

compute

merge

12-l

Alloc(LocFresh)

◯

compute

merge

12-r-l

Alloc(LocFresh)

◯

compute

merge

12-r-r-l

Force(CompCacheMiss)

compute

merge

12-r-r-l

Force(CompCacheMiss)

compute

merge

12-r-l

Force(CompCacheMiss)

compute

merge

12-l

Alloc(LocExists(SameContent))

◯

compute

merge

10-l

Alloc(LocExists(SameContent))

◯

compute

merge

6-r-r-r-r-l

Force(CompCacheHit)

compute

merge

6-r-r-r-r-l

batch name

6

Input:

Cons

117

Name

13

Art

___13

13

Cons

50

Name

12

Art

___12

12

Cons

469

Name

11

Art

___11

11

Cons

304

Name

10

Art

___10

10

Cons

589

Name

9

Art

___9

9

Cons

208

Name

8

Art

___8

8

Cons

458

Name

7

Art

___7

7

Cons

57

Name

6

Art

___6

6

Cons

191

Name

5

Art

___5

5

Cons

489

Name

4

Art

___4

4

Cons

258

Name

3

Art

___3

3

Cons

711

Name

2

Art

___2

2

Cons

103

Name

1

Art

___1

1

Cons

545

Name

0

Art

___0

0

Nil

Output:

Name

12-r-r-r-r

Cons

50

Art

__compute__merge___12-r-r-r-l

compute

merge

12-r-r-r-l

Name

6-r-r-r-r-r

Cons

57

Art

__compute__merge___6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

Name

1-r-r-r-r

Cons

103

Art

__compute__merge___1-r-r-r-l

compute

merge

1-r-r-r-l

Uneval'd

DCG, post-edit:

compute

tree_of_list

12-l

compute

tree_of_list

12-l

12

compute

tree_of_list

12

compute

tree_of_list

12-r

compute

tree_of_list

12-r

compute

tree_of_list

11-l

compute

tree_of_list

11-l

11

compute

tree_of_list

11

compute

tree_of_list

11-r

compute

tree_of_list

11-r

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

tree_of_list

11

compute

11-l

compute

11-l

compute

11-r

compute

11-r

compute

tree_of_list

12

compute

12-l

compute

12-l

compute

12-r

compute

12-r

compute

merge

12-l

compute

merge

12-r-l

compute

merge

12-r-r-l

compute

merge

12-r-r-l

compute

merge

12-r-l

compute

merge

12-l

compute

merge

10-l

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-l

compute

merge

6-r-l

compute

merge

6-l

compute

merge

5-l

compute

merge

5-r-l

compute

merge

1-r-r-l

compute

merge

1-r-r-r-l

DCG, post-compute:

compute

tree_of_list

13-l

compute

tree_of_list

13-l

13

compute

tree_of_list

13

compute

tree_of_list

13-r

compute

tree_of_list

13-r

compute

tree_of_list

12-l

compute

tree_of_list

12-l

12

compute

tree_of_list

12

compute

tree_of_list

12-r

compute

tree_of_list

12-r

compute

tree_of_list

11-l

compute

tree_of_list

11-l

11

compute

tree_of_list

11

compute

tree_of_list

11-r

compute

tree_of_list

11-r

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

tree_of_list

11

compute

11-l

compute

11-l

compute

11-r

compute

11-r

compute

tree_of_list

12

compute

12-l

compute

12-l

compute

12-r

compute

12-r

compute

tree_of_list

13

compute

13-l

compute

13-l

compute

13-r

compute

13-r

compute

merge

12-l

compute

merge

12-r-l

compute

merge

12-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-l

compute

merge

12-r-l

compute

merge

12-l

compute

merge

13-l

compute

merge

13-r-l

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-l

compute

merge

6-r-l

compute

merge

6-l

compute

merge

5-l

compute

merge

5-r-l

compute

merge

1-r-r-l

compute

merge

1-r-r-r-l

Editor trace:

Alloc(LocFresh)

▣

13

Archivist trace:

Alloc(LocFresh)

◯

compute

tree_of_list

13-l

Force(CompCacheMiss)

compute

tree_of_list

13-l

Force(RefGet)

13

Alloc(LocFresh)

▣

compute

tree_of_list

13

Alloc(LocFresh)

◯

compute

tree_of_list

13-r

Force(CompCacheMiss)

compute

tree_of_list

13-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

12-l

Force(CompCacheHit)

compute

tree_of_list

12-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

12

Dirty

compute

tree_of_list

12

Dirty

compute

11-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

12-r

Force(CompCacheHit)

compute

tree_of_list

12-r

Force(RefGet)

compute

tree_of_list

10

Alloc(LocExists(SameContent))

◯

compute

10-l

Force(CompCacheHit)

compute

10-l

Alloc(LocExists(SameContent))

◯

compute

10-r

Force(CompCacheHit)

compute

10-r

CleanRec

compute

11-r

CleanRec

compute

tree_of_list

12

CleanEval

compute

11-r

Remove

compute

tree_of_list

12

Remove

compute

12-l

Remove

compute

12-l

Remove

compute

12-r

Remove

compute

12-r

Remove

compute

merge

12-l

Force(RefGet)

compute

tree_of_list

12

Alloc(LocExists(SameContent))

◯

compute

12-l

Force(CompCacheHit)

compute

12-l

Alloc(LocExists(DiffContent))

◯

compute

12-r

Force(CompCacheMiss)

compute

12-r

Force(RefGet)

compute

tree_of_list

13

Alloc(LocFresh)

◯

compute

13-l

Force(CompCacheMiss)

compute

13-l

Alloc(LocFresh)

◯

compute

13-r

Force(CompCacheMiss)

compute

13-r

Alloc(LocExists(DiffContent))

◯

compute

merge

12-l

Dirty

compute

merge

12-l

Dirty

compute

merge

12-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

12-r-l

Dirty

compute

merge

12-r-l

CleanEval

compute

10-r

Remove

compute

tree_of_list

11

Remove

compute

11-l

Remove

compute

11-l

Remove

compute

11-r

Remove

compute

11-r

Remove

compute

merge

12-r-l

Force(RefGet)

compute

tree_of_list

11

Alloc(LocExists(SameContent))

◯

compute

11-l

Force(CompCacheHit)

compute

11-l

Alloc(LocExists(SameContent))

◯

compute

11-r

Force(CompCacheHit)

compute

11-r

Alloc(LocExists(DiffContent))

◯

compute

merge

12-r-r-l

Alloc(LocFresh)

◯

compute

merge

12-r-r-r-l

Force(CompCacheMiss)

compute

merge

12-r-r-r-l

Force(CompCacheMiss)

compute

merge

12-r-r-l

Remove

compute

merge

12-r-l

Remove

compute

merge

6-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

12-r-l

Remove

compute

merge

12-l

Remove

compute

merge

10-l

Force(CompCacheMiss)

compute

merge

12-l

Alloc(LocFresh)

◯

compute

merge

13-l

Alloc(LocFresh)

◯

compute

merge

13-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

6-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

6-r-r-r-r-l

Remove

compute

merge

6-r-r-r-l

Remove

compute

merge

1-r-r-r-l

Force(CompCacheHit)

compute

merge

6-r-r-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

1-r-r-r-l

batch name

7

Input:

Cons

5

Name

14

Art

___14

14

Cons

117

Name

13

Art

___13

13

Cons

50

Name

12

Art

___12

12

Cons

469

Name

11

Art

___11

11

Cons

304

Name

10

Art

___10

10

Cons

589

Name

9

Art

___9

9

Cons

208

Name

8

Art

___8

8

Cons

458

Name

7

Art

___7

7

Cons

57

Name

6

Art

___6

6

Cons

191

Name

5

Art

___5

5

Cons

489

Name

4

Art

___4

4

Cons

258

Name

3

Art

___3

3

Cons

711

Name

2

Art

___2

2

Cons

103

Name

1

Art

___1

1

Cons

545

Name

0

Art

___0

0

Nil

Output:

Name

14-r-r-r-r

Cons

5

Art

__compute__merge___14-r-r-r-l

compute

merge

14-r-r-r-l

Name

12-r-r-r-r

Cons

50

Art

__compute__merge___12-r-r-r-l

compute

merge

12-r-r-r-l

Name

6-r-r-r-r-r

Cons

57

Art

__compute__merge___6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

Name

1-r-r-r-r

Cons

103

Art

__compute__merge___1-r-r-r-l

compute

merge

1-r-r-r-l

Uneval'd

DCG, post-edit:

compute

tree_of_list

13-l

compute

tree_of_list

13-l

13

compute

tree_of_list

13

compute

tree_of_list

13-r

compute

tree_of_list

13-r

compute

tree_of_list

12-l

compute

tree_of_list

12-l

12

compute

tree_of_list

12

compute

tree_of_list

12-r

compute

tree_of_list

12-r

compute

tree_of_list

11-l

compute

tree_of_list

11-l

11

compute

tree_of_list

11

compute

tree_of_list

11-r

compute

tree_of_list

11-r

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

tree_of_list

11

compute

11-l

compute

11-l

compute

11-r

compute

11-r

compute

tree_of_list

12

compute

12-l

compute

12-l

compute

12-r

compute

12-r

compute

tree_of_list

13

compute

13-l

compute

13-l

compute

13-r

compute

13-r

compute

merge

12-l

compute

merge

12-r-l

compute

merge

12-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-l

compute

merge

12-r-l

compute

merge

12-l

compute

merge

13-l

compute

merge

13-r-l

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

compute

merge

6-r-r-r-l

compute

merge

6-r-r-l

compute

merge

6-r-l

compute

merge

6-l

compute

merge

5-l

compute

merge

5-r-l

compute

merge

1-r-r-l

compute

merge

1-r-r-r-l

DCG, post-compute:

compute

tree_of_list

14-l

compute

tree_of_list

14-l

14

compute

tree_of_list

13-l

compute

tree_of_list

13-l

13

compute

tree_of_list

13

compute

tree_of_list

13-r

compute

tree_of_list

13-r

compute

tree_of_list

14

compute

tree_of_list

14-r

compute

tree_of_list

14-r

compute

tree_of_list

12-l

compute

tree_of_list

12-l

12

compute

tree_of_list

12

compute

tree_of_list

12-r

compute

tree_of_list

12-r

compute

tree_of_list

11-l

compute

tree_of_list

11-l

11

compute

tree_of_list

11

compute

tree_of_list

11-r

compute

tree_of_list

11-r

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

tree_of_list

11

compute

11-l

compute

11-l

compute

11-r

compute

11-r

compute

tree_of_list

12

compute

12-l

compute

12-l

compute

12-r

compute

12-r

compute

tree_of_list

14

compute

14-l

compute

14-l

compute

tree_of_list

13

compute

13-l

compute

13-l

compute

13-r

compute

13-r

compute

merge

12-l

compute

14-r

compute

14-r

compute

merge

14-l

compute

merge

14-r-l

compute

merge

14-r-r-l

compute

merge

14-r-r-r-l

compute

merge

14-r-r-r-l

compute

merge

14-r-r-l

compute

merge

14-r-l

compute

merge

14-l

compute

merge

12-r-l

compute

merge

12-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-l

compute

merge

12-r-l

compute

merge

12-l

compute

merge

13-l

compute

merge

13-r-l

compute

merge

6-r-r-r-r-l

Editor trace:

Alloc(LocFresh)

▣

14

Archivist trace:

Alloc(LocFresh)

◯

compute

tree_of_list

14-l

Force(CompCacheMiss)

compute

tree_of_list

14-l

Force(RefGet)

14

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

13-l

Force(CompCacheHit)

compute

tree_of_list

13-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

13

Alloc(LocExists(DiffContent))

◯

compute

tree_of_list

13-r

Force(CompCacheMiss)

compute

tree_of_list

13-r

Remove

compute

tree_of_list

12-l

Remove

compute

tree_of_list

12-l

Remove

compute

tree_of_list

12

Remove

compute

tree_of_list

12-r

Remove

compute

tree_of_list

12-r

Alloc(LocFresh)

▣

compute

tree_of_list

14

Alloc(LocFresh)

◯

compute

tree_of_list

14-r

Force(CompCacheMiss)

compute

tree_of_list

14-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

12-l

Force(CompCacheHit)

compute

tree_of_list

12-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

12

Dirty

compute

tree_of_list

12

Dirty

compute

11-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

12-r

Force(CompCacheHit)

compute

tree_of_list

12-r

Force(RefGet)

compute

tree_of_list

10

Alloc(LocExists(SameContent))

◯

compute

10-l

Force(CompCacheHit)

compute

10-l

Alloc(LocExists(SameContent))

◯

compute

10-r

Force(CompCacheHit)

compute

10-r

CleanRec

compute

11-r

CleanRec

compute

tree_of_list

12

CleanEval

compute

11-r

Remove

compute

tree_of_list

12

Remove

compute

12-l

Remove

compute

12-l

Remove

compute

12-r

Remove

compute

12-r

Remove

compute

merge

12-r-l

Force(RefGet)

compute

tree_of_list

12

Alloc(LocExists(SameContent))

◯

compute

12-l

Force(CompCacheHit)

compute

12-l

Alloc(LocExists(DiffContent))

◯

compute

12-r

Force(CompCacheMiss)

compute

12-r

Remove

compute

tree_of_list

13

Remove

compute

13-l

Remove

compute

13-l

Remove

compute

13-r

Remove

compute

13-r

Remove

compute

merge

12-l

Force(RefGet)

compute

tree_of_list

14

Alloc(LocFresh)

◯

compute

14-l

Force(CompCacheMiss)

compute

14-l

Force(RefGet)

compute

tree_of_list

13

Alloc(LocExists(SameContent))

◯

compute

13-l

Force(CompCacheHit)

compute

13-l

Alloc(LocExists(SameContent))

◯

compute

13-r

Force(CompCacheHit)

compute

13-r

Alloc(LocExists(SameContent))

◯

compute

merge

12-l

Alloc(LocFresh)

◯

compute

14-r

Force(CompCacheMiss)

compute

14-r

Alloc(LocFresh)

◯

compute

merge

14-l

Alloc(LocFresh)

◯

compute

merge

14-r-l

CleanEval

compute

10-r

Remove

compute

tree_of_list

11

Remove

compute

11-l

Remove

compute

11-l

Remove

compute

11-r

Remove

compute

11-r

Remove

compute

merge

12-r-r-l

Force(RefGet)

compute

tree_of_list

11

Alloc(LocExists(SameContent))

◯

compute

11-l

Force(CompCacheHit)

compute

11-l

Alloc(LocExists(SameContent))

◯

compute

11-r

Force(CompCacheHit)

compute

11-r

Alloc(LocFresh)

◯

compute

merge

14-r-r-l

Alloc(LocFresh)

◯

compute

merge

14-r-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-l

Force(CompCacheMiss)

compute

merge

14-l

Alloc(LocExists(SameContent))

◯

compute

merge

12-r-l

Alloc(LocExists(SameContent))

◯

compute

merge

12-r-r-l

Alloc(LocExists(SameContent))

◯

compute

merge

12-r-r-r-l

Force(CompCacheHit)

compute

merge

12-r-r-r-l

batch name

8

Input:

Cons

76

Name

15

Art

___15

15

Cons

5

Name

14

Art

___14

14

Cons

117

Name

13

Art

___13

13

Cons

50

Name

12

Art

___12

12

Cons

469

Name

11

Art

___11

11

Cons

304

Name

10

Art

___10

10

Cons

589

Name

9

Art

___9

9

Cons

208

Name

8

Art

___8

8

Cons

458

Name

7

Art

___7

7

Cons

57

Name

6

Art

___6

6

Cons

191

Name

5

Art

___5

5

Cons

489

Name

4

Art

___4

4

Cons

258

Name

3

Art

___3

3

Cons

711

Name

2

Art

___2

2

Cons

103

Name

1

Art

___1

1

Cons

545

Name

0

Art

___0

0

Nil

Output:

Name

14-r-r-r-r-r

Cons

5

Art

__compute__merge___14-r-r-r-r-l

compute

merge

14-r-r-r-r-l

Name

12-r-r-r-r-r

Cons

50

Art

__compute__merge___12-r-r-r-r-l

compute

merge

12-r-r-r-r-l

Name

6-r-r-r-r-r

Cons

57

Art

__compute__merge___6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

Uneval'd

DCG, post-edit:

compute

tree_of_list

14-l

compute

tree_of_list

14-l

14

compute

tree_of_list

13-l

compute

tree_of_list

13-l

13

compute

tree_of_list

13

compute

tree_of_list

13-r

compute

tree_of_list

13-r

compute

tree_of_list

14

compute

tree_of_list

14-r

compute

tree_of_list

14-r

compute

tree_of_list

12-l

compute

tree_of_list

12-l

12

compute

tree_of_list

12

compute

tree_of_list

12-r

compute

tree_of_list

12-r

compute

tree_of_list

11-l

compute

tree_of_list

11-l

11

compute

tree_of_list

11

compute

tree_of_list

11-r

compute

tree_of_list

11-r

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

tree_of_list

11

compute

11-l

compute

11-l

compute

11-r

compute

11-r

compute

tree_of_list

12

compute

12-l

compute

12-l

compute

12-r

compute

12-r

compute

tree_of_list

14

compute

14-l

compute

14-l

compute

tree_of_list

13

compute

13-l

compute

13-l

compute

13-r

compute

13-r

compute

merge

12-l

compute

14-r

compute

14-r

compute

merge

14-l

compute

merge

14-r-l

compute

merge

14-r-r-l

compute

merge

14-r-r-r-l

compute

merge

14-r-r-r-l

compute

merge

14-r-r-l

compute

merge

14-r-l

compute

merge

14-l

compute

merge

12-r-l

compute

merge

12-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-l

compute

merge

12-r-l

compute

merge

12-l

compute

merge

13-l

compute

merge

13-r-l

compute

merge

6-r-r-r-r-l

DCG, post-compute:

compute

tree_of_list

15-l

compute

tree_of_list

15-l

15

compute

tree_of_list

14-l

compute

tree_of_list

14-l

14

compute

tree_of_list

13-l

compute

tree_of_list

13-l

13

compute

tree_of_list

13

compute

tree_of_list

13-r

compute

tree_of_list

13-r

compute

tree_of_list

14

compute

tree_of_list

14-r

compute

tree_of_list

14-r

compute

tree_of_list

15

compute

tree_of_list

15-r

compute

tree_of_list

15-r

compute

tree_of_list

12-l

compute

tree_of_list

12-l

12

compute

tree_of_list

12

compute

tree_of_list

12-r

compute

tree_of_list

12-r

compute

tree_of_list

11-l

compute

tree_of_list

11-l

11

compute

tree_of_list

11

compute

tree_of_list

11-r

compute

tree_of_list

11-r

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

tree_of_list

11

compute

11-l

compute

11-l

compute

11-r

compute

11-r

compute

tree_of_list

12

compute

12-l

compute

12-l

compute

12-r

compute

12-r

compute

tree_of_list

15

compute

15-l

compute

15-l

compute

tree_of_list

14

compute

14-l

compute

14-l

compute

tree_of_list

13

compute

13-l

compute

13-l

compute

13-r

compute

13-r

compute

merge

12-l

compute

14-r

compute

14-r

compute

merge

14-l

compute

15-r

compute

15-r

compute

merge

14-r-l

compute

merge

14-r-r-l

compute

merge

14-r-r-r-l

compute

merge

14-r-r-r-r-l

compute

merge

14-r-r-r-r-l

compute

merge

14-r-r-r-l

compute

merge

14-r-r-l

compute

merge

14-r-l

compute

merge

14-l

compute

merge

12-r-l

compute

merge

12-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-r-r-l

compute

merge

12-r-r-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-l

compute

merge

12-r-l

compute

merge

12-l

compute

merge

15-l

compute

merge

15-r-l

compute

merge

15-r-r-l

compute

merge

6-r-r-r-r-l

Editor trace:

Alloc(LocFresh)

▣

15

Archivist trace:

Alloc(LocFresh)

◯

compute

tree_of_list

15-l

Force(CompCacheMiss)

compute

tree_of_list

15-l

Force(RefGet)

15

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

14-l

Force(CompCacheHit)

compute

tree_of_list

14-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

14

Alloc(LocExists(DiffContent))

◯

compute

tree_of_list

14-r

Force(CompCacheMiss)

compute

tree_of_list

14-r

Remove

compute

tree_of_list

12-l

Remove

compute

tree_of_list

12-l

Remove

compute

tree_of_list

12

Remove

compute

tree_of_list

12-r

Remove

compute

tree_of_list

12-r

Alloc(LocFresh)

▣

compute

tree_of_list

15

Alloc(LocFresh)

◯

compute

tree_of_list

15-r

Force(CompCacheMiss)

compute

tree_of_list

15-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

12-l

Force(CompCacheHit)

compute

tree_of_list

12-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

12

Dirty

compute

tree_of_list

12

Dirty

compute

11-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

12-r

Force(CompCacheHit)

compute

tree_of_list

12-r

Force(RefGet)

compute

tree_of_list

10

Alloc(LocExists(SameContent))

◯

compute

10-l

Force(CompCacheHit)

compute

10-l

Alloc(LocExists(SameContent))

◯

compute

10-r

Force(CompCacheHit)

compute

10-r

CleanRec

compute

11-r

CleanRec

compute

tree_of_list

12

CleanEval

compute

11-r

Remove

compute

tree_of_list

12

Remove

compute

12-l

Remove

compute

12-l

Remove

compute

12-r

Remove

compute

12-r

Remove

compute

merge

14-r-l

Force(RefGet)

compute

tree_of_list

12

Alloc(LocExists(SameContent))

◯

compute

12-l

Force(CompCacheHit)

compute

12-l

Alloc(LocExists(DiffContent))

◯

compute

12-r

Force(CompCacheMiss)

compute

12-r

Remove

compute

tree_of_list

14

Remove

compute

14-l

Remove

compute

14-l

Remove

compute

14-r

Remove

compute

14-r

Remove

compute

merge

14-l

Force(RefGet)

compute

tree_of_list

15

Alloc(LocFresh)

◯

compute

15-l

Force(CompCacheMiss)

compute

15-l

Force(RefGet)

compute

tree_of_list

14

Alloc(LocExists(SameContent))

◯

compute

14-l

Force(CompCacheHit)

compute

14-l

Alloc(LocExists(SameContent))

◯

compute

14-r

Force(CompCacheHit)

compute

14-r

Alloc(LocExists(SameContent))

◯

compute

merge

14-l

Alloc(LocFresh)

◯

compute

15-r

Force(CompCacheMiss)

compute

15-r

Alloc(LocExists(DiffContent))

◯

compute

merge

14-r-l

Dirty

compute

merge

14-r-l

Dirty

compute

merge

14-r-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

14-r-r-l

Dirty

compute

merge

14-r-r-l

CleanEval

compute

10-r

Remove

compute

tree_of_list

11

Remove

compute

11-l

Remove

compute

11-l

Remove

compute

11-r

Remove

compute

11-r

Remove

compute

merge

14-r-r-l

Force(RefGet)

compute

tree_of_list

11

Alloc(LocExists(SameContent))

◯

compute

11-l

Force(CompCacheHit)

compute

11-l

Alloc(LocExists(SameContent))

◯

compute

11-r

Force(CompCacheHit)

compute

11-r

Alloc(LocExists(DiffContent))

◯

compute

merge

14-r-r-r-l

Alloc(LocFresh)

◯

compute

merge

14-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-r-r-l

Remove

compute

merge

14-r-r-l

Remove

compute

merge

12-r-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-r-l

Remove

compute

merge

14-r-l

Remove

compute

merge

12-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-l

Remove

compute

merge

14-l

Remove

compute

merge

12-r-l

Force(CompCacheHit)

compute

merge

14-l

Alloc(LocExists(DiffContent))

◯

compute

merge

12-r-l

Dirty

compute

merge

12-r-l

Dirty

compute

merge

12-r-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

12-r-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

12-r-r-r-l

Alloc(LocFresh)

◯

compute

merge

12-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

12-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

12-r-r-r-l

Remove

compute

merge

12-r-r-l

Remove

compute

merge

6-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

12-r-r-l

Remove

compute

merge

12-r-l

Remove

compute

merge

13-r-l

Force(CompCacheMiss)

compute

merge

12-r-l

Remove

compute

merge

12-l

Remove

compute

merge

13-l

Force(CompCacheHit)

compute

merge

12-l

Alloc(LocFresh)

◯

compute

merge

15-l

Alloc(LocFresh)

◯

compute

merge

15-r-l

Alloc(LocFresh)

◯

compute

merge

15-r-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

6-r-r-r-r-l

batch name

9

Input:

Cons

417

Name

16

Art

___16

16

Cons

76

Name

15

Art

___15

15

Cons

5

Name

14

Art

___14

14

Cons

117

Name

13

Art

___13

13

Cons

50

Name

12

Art

___12

12

Cons

469

Name

11

Art

___11

11

Cons

304

Name

10

Art

___10

10

Cons

589

Name

9

Art

___9

9

Cons

208

Name

8

Art

___8

8

Cons

458

Name

7

Art

___7

7

Cons

57

Name

6

Art

___6

6

Cons

191

Name

5

Art

___5

5

Cons

489

Name

4

Art

___4

4

Cons

258

Name

3

Art

___3

3

Cons

711

Name

2

Art

___2

2

Cons

103

Name

1

Art

___1

1

Cons

545

Name

0

Art

___0

0

Nil

Output:

Name

14-r-r-r-r-r-r

Cons

5

Art

__compute__merge___14-r-r-r-r-r-l

compute

merge

14-r-r-r-r-r-l

Name

12-r-r-r-r-r-r

Cons

50

Art

__compute__merge___12-r-r-r-r-r-l

compute

merge

12-r-r-r-r-r-l

Name

6-r-r-r-r-r

Cons

57

Art

__compute__merge___6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

Uneval'd

DCG, post-edit:

compute

tree_of_list

15-l

compute

tree_of_list

15-l

15

compute

tree_of_list

14-l

compute

tree_of_list

14-l

14

compute

tree_of_list

13-l

compute

tree_of_list

13-l

13

compute

tree_of_list

13

compute

tree_of_list

13-r

compute

tree_of_list

13-r

compute

tree_of_list

14

compute

tree_of_list

14-r

compute

tree_of_list

14-r

compute

tree_of_list

15

compute

tree_of_list

15-r

compute

tree_of_list

15-r

compute

tree_of_list

12-l

compute

tree_of_list

12-l

12

compute

tree_of_list

12

compute

tree_of_list

12-r

compute

tree_of_list

12-r

compute

tree_of_list

11-l

compute

tree_of_list

11-l

11

compute

tree_of_list

11

compute

tree_of_list

11-r

compute

tree_of_list

11-r

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

tree_of_list

11

compute

11-l

compute

11-l

compute

11-r

compute

11-r

compute

tree_of_list

12

compute

12-l

compute

12-l

compute

12-r

compute

12-r

compute

tree_of_list

15

compute

15-l

compute

15-l

compute

tree_of_list

14

compute

14-l

compute

14-l

compute

tree_of_list

13

compute

13-l

compute

13-l

compute

13-r

compute

13-r

compute

merge

12-l

compute

14-r

compute

14-r

compute

merge

14-l

compute

15-r

compute

15-r

compute

merge

14-r-l

compute

merge

14-r-r-l

compute

merge

14-r-r-r-l

compute

merge

14-r-r-r-r-l

compute

merge

14-r-r-r-r-l

compute

merge

14-r-r-r-l

compute

merge

14-r-r-l

compute

merge

14-r-l

compute

merge

14-l

compute

merge

12-r-l

compute

merge

12-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-r-r-l

compute

merge

12-r-r-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-l

compute

merge

12-r-l

compute

merge

12-l

compute

merge

15-l

compute

merge

15-r-l

compute

merge

15-r-r-l

compute

merge

6-r-r-r-r-l

DCG, post-compute:

compute

tree_of_list

16-l

compute

tree_of_list

16-l

16

compute

tree_of_list

15-l

compute

tree_of_list

15-l

15

compute

tree_of_list

14-l

compute

tree_of_list

14-l

14

compute

tree_of_list

13-l

compute

tree_of_list

13-l

13

compute

tree_of_list

13

compute

tree_of_list

13-r

compute

tree_of_list

13-r

compute

tree_of_list

14

compute

tree_of_list

14-r

compute

tree_of_list

14-r

compute

tree_of_list

15

compute

tree_of_list

15-r

compute

tree_of_list

15-r

compute

tree_of_list

16

compute

tree_of_list

16-r

compute

tree_of_list

16-r

compute

tree_of_list

12-l

compute

tree_of_list

12-l

12

compute

tree_of_list

12

compute

tree_of_list

12-r

compute

tree_of_list

12-r

compute

tree_of_list

11-l

compute

tree_of_list

11-l

11

compute

tree_of_list

11

compute

tree_of_list

11-r

compute

tree_of_list

11-r

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

tree_of_list

11

compute

11-l

compute

11-l

compute

11-r

compute

11-r

compute

tree_of_list

12

compute

12-l

compute

12-l

compute

12-r

compute

12-r

compute

tree_of_list

16

compute

16-l

compute

16-l

compute

tree_of_list

15

compute

15-l

compute

15-l

compute

tree_of_list

14

compute

14-l

compute

14-l

compute

tree_of_list

13

compute

13-l

compute

13-l

compute

13-r

compute

13-r

compute

merge

12-l

compute

14-r

compute

14-r

compute

merge

14-l

compute

15-r

compute

15-r

compute

merge

14-r-l

compute

16-r

compute

16-r

compute

merge

14-r-r-l

compute

merge

14-r-r-r-l

compute

merge

14-r-r-r-r-l

compute

merge

14-r-r-r-r-r-l

compute

merge

14-r-r-r-r-r-l

compute

merge

14-r-r-r-r-l

compute

merge

14-r-r-r-l

compute

merge

14-r-r-l

compute

merge

14-r-l

compute

merge

14-l

compute

merge

12-r-l

compute

merge

12-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-r-r-l

compute

merge

12-r-r-r-r-r-l

compute

merge

12-r-r-r-r-r-l

compute

merge

12-r-r-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-l

compute

merge

12-r-l

compute

merge

12-l

compute

merge

15-l

compute

merge

15-r-l

compute

merge

15-r-r-l

compute

merge

15-r-r-r-l

compute

merge

6-r-r-r-r-l

Editor trace:

Alloc(LocFresh)

▣

16

Archivist trace:

Alloc(LocFresh)

◯

compute

tree_of_list

16-l

Force(CompCacheMiss)

compute

tree_of_list

16-l

Force(RefGet)

16

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

15-l

Force(CompCacheHit)

compute

tree_of_list

15-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

15

Alloc(LocExists(DiffContent))

◯

compute

tree_of_list

15-r

Force(CompCacheMiss)

compute

tree_of_list

15-r

Remove

compute

tree_of_list

12-l

Remove

compute

tree_of_list

12-l

Remove

compute

tree_of_list

12

Remove

compute

tree_of_list

12-r

Remove

compute

tree_of_list

12-r

Alloc(LocFresh)

▣

compute

tree_of_list

16

Alloc(LocFresh)

◯

compute

tree_of_list

16-r

Force(CompCacheMiss)

compute

tree_of_list

16-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

12-l

Force(CompCacheHit)

compute

tree_of_list

12-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

12

Dirty

compute

tree_of_list

12

Dirty

compute

11-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

12-r

Force(CompCacheHit)

compute

tree_of_list

12-r

Force(RefGet)

compute

tree_of_list

10

Alloc(LocExists(SameContent))

◯

compute

10-l

Force(CompCacheHit)

compute

10-l

Alloc(LocExists(SameContent))

◯

compute

10-r

Force(CompCacheHit)

compute

10-r

CleanRec

compute

11-r

CleanRec

compute

tree_of_list

12

CleanEval

compute

11-r

Remove

compute

tree_of_list

12

Remove

compute

12-l

Remove

compute

12-l

Remove

compute

12-r

Remove

compute

12-r

Remove

compute

merge

14-r-r-l

Force(RefGet)

compute

tree_of_list

12

Alloc(LocExists(SameContent))

◯

compute

12-l

Force(CompCacheHit)

compute

12-l

Alloc(LocExists(DiffContent))

◯

compute

12-r

Force(CompCacheMiss)

compute

12-r

Remove

compute

tree_of_list

15

Remove

compute

15-l

Remove

compute

15-l

Remove

compute

15-r

Remove

compute

15-r

Remove

compute

merge

14-r-l

Force(RefGet)

compute

tree_of_list

16

Alloc(LocFresh)

◯

compute

16-l

Force(CompCacheMiss)

compute

16-l

Force(RefGet)

compute

tree_of_list

15

Alloc(LocExists(SameContent))

◯

compute

15-l

Force(CompCacheHit)

compute

15-l

Alloc(LocExists(SameContent))

◯

compute

15-r

Force(CompCacheHit)

compute

15-r

Alloc(LocExists(SameContent))

◯

compute

merge

14-r-l

Alloc(LocFresh)

◯

compute

16-r

Force(CompCacheMiss)

compute

16-r

Alloc(LocExists(DiffContent))

◯

compute

merge

14-r-r-l

Dirty

compute

merge

14-r-r-l

Dirty

compute

merge

14-r-r-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

14-r-r-r-l

Dirty

compute

merge

14-r-r-r-l

CleanEval

compute

10-r

Remove

compute

tree_of_list

11

Remove

compute

11-l

Remove

compute

11-l

Remove

compute

11-r

Remove

compute

11-r

Remove

compute

merge

14-r-r-r-l

Force(RefGet)

compute

tree_of_list

11

Alloc(LocExists(SameContent))

◯

compute

11-l

Force(CompCacheHit)

compute

11-l

Alloc(LocExists(SameContent))

◯

compute

11-r

Force(CompCacheHit)

compute

11-r

Alloc(LocExists(DiffContent))

◯

compute

merge

14-r-r-r-r-l

Alloc(LocFresh)

◯

compute

merge

14-r-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-r-r-r-l

Remove

compute

merge

14-r-r-r-l

Remove

compute

merge

12-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-r-r-l

Remove

compute

merge

14-r-r-l

Remove

compute

merge

12-r-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-r-l

Remove

compute

merge

14-r-l

Remove

compute

merge

12-r-r-l

Force(CompCacheHit)

compute

merge

14-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

12-r-r-l

Dirty

compute

merge

12-r-r-l

Dirty

compute

merge

12-r-r-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

12-r-r-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

12-r-r-r-r-l

Alloc(LocFresh)

◯

compute

merge

12-r-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

12-r-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

12-r-r-r-r-l

Remove

compute

merge

12-r-r-r-l

Remove

compute

merge

6-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

12-r-r-r-l

Remove

compute

merge

12-r-r-l

Remove

compute

merge

15-r-r-l

Force(CompCacheMiss)

compute

merge

12-r-r-l

Remove

compute

merge

12-r-l

Remove

compute

merge

15-r-l

Force(CompCacheHit)

compute

merge

12-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

15-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

15-r-r-l

Alloc(LocFresh)

◯

compute

merge

15-r-r-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

6-r-r-r-r-l

batch name

10

Input:

Cons

49

Name

17

Art

___17

17

Cons

417

Name

16

Art

___16

16

Cons

76

Name

15

Art

___15

15

Cons

5

Name

14

Art

___14

14

Cons

117

Name

13

Art

___13

13

Cons

50

Name

12

Art

___12

12

Cons

469

Name

11

Art

___11

11

Cons

304

Name

10

Art

___10

10

Cons

589

Name

9

Art

___9

9

Cons

208

Name

8

Art

___8

8

Cons

458

Name

7

Art

___7

7

Cons

57

Name

6

Art

___6

6

Cons

191

Name

5

Art

___5

5

Cons

489

Name

4

Art

___4

4

Cons

258

Name

3

Art

___3

3

Cons

711

Name

2

Art

___2

2

Cons

103

Name

1

Art

___1

1

Cons

545

Name

0

Art

___0

0

Nil

Output:

Name

14-r-r-r-r-r-r-r

Cons

5

Art

__compute__merge___14-r-r-r-r-r-r-l

compute

merge

14-r-r-r-r-r-r-l

Name

17-r-r-r-r

Cons

49

Art

__compute__merge___17-r-r-r-l

compute

merge

17-r-r-r-l

Name

12-r-r-r-r-r-r

Cons

50

Art

__compute__merge___12-r-r-r-r-r-l

compute

merge

12-r-r-r-r-r-l

Name

6-r-r-r-r-r

Cons

57

Art

__compute__merge___6-r-r-r-r-l

compute

merge

6-r-r-r-r-l

Uneval'd

DCG, post-edit:

compute

tree_of_list

16-l

compute

tree_of_list

16-l

16

compute

tree_of_list

15-l

compute

tree_of_list

15-l

15

compute

tree_of_list

14-l

compute

tree_of_list

14-l

14

compute

tree_of_list

13-l

compute

tree_of_list

13-l

13

compute

tree_of_list

13

compute

tree_of_list

13-r

compute

tree_of_list

13-r

compute

tree_of_list

14

compute

tree_of_list

14-r

compute

tree_of_list

14-r

compute

tree_of_list

15

compute

tree_of_list

15-r

compute

tree_of_list

15-r

compute

tree_of_list

16

compute

tree_of_list

16-r

compute

tree_of_list

16-r

compute

tree_of_list

12-l

compute

tree_of_list

12-l

12

compute

tree_of_list

12

compute

tree_of_list

12-r

compute

tree_of_list

12-r

compute

tree_of_list

11-l

compute

tree_of_list

11-l

11

compute

tree_of_list

11

compute

tree_of_list

11-r

compute

tree_of_list

11-r

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

tree_of_list

11

compute

11-l

compute

11-l

compute

11-r

compute

11-r

compute

tree_of_list

12

compute

12-l

compute

12-l

compute

12-r

compute

12-r

compute

tree_of_list

16

compute

16-l

compute

16-l

compute

tree_of_list

15

compute

15-l

compute

15-l

compute

tree_of_list

14

compute

14-l

compute

14-l

compute

tree_of_list

13

compute

13-l

compute

13-l

compute

13-r

compute

13-r

compute

merge

12-l

compute

14-r

compute

14-r

compute

merge

14-l

compute

15-r

compute

15-r

compute

merge

14-r-l

compute

16-r

compute

16-r

compute

merge

14-r-r-l

compute

merge

14-r-r-r-l

compute

merge

14-r-r-r-r-l

compute

merge

14-r-r-r-r-r-l

compute

merge

14-r-r-r-r-r-l

compute

merge

14-r-r-r-r-l

compute

merge

14-r-r-r-l

compute

merge

14-r-r-l

compute

merge

14-r-l

compute

merge

14-l

compute

merge

12-r-l

compute

merge

12-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-r-r-l

compute

merge

12-r-r-r-r-r-l

compute

merge

12-r-r-r-r-r-l

compute

merge

12-r-r-r-r-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-l

compute

merge

12-r-l

compute

merge

12-l

compute

merge

15-l

compute

merge

15-r-l

compute

merge

15-r-r-l

compute

merge

15-r-r-r-l

compute

merge

6-r-r-r-r-l

DCG, post-compute:

compute

tree_of_list

17-l

compute

tree_of_list

17-l

17

compute

tree_of_list

16-l

compute

tree_of_list

16-l

16

compute

tree_of_list

15-l

compute

tree_of_list

15-l

15

compute

tree_of_list

14-l

compute

tree_of_list

14-l

14

compute

tree_of_list

13-l

compute

tree_of_list

13-l

13

compute

tree_of_list

13

compute

tree_of_list

13-r

compute

tree_of_list

13-r

compute

tree_of_list

14

compute

tree_of_list

14-r

compute

tree_of_list

14-r

compute

tree_of_list

15

compute

tree_of_list

15-r

compute

tree_of_list

15-r

compute

tree_of_list

16

compute

tree_of_list

16-r

compute

tree_of_list

16-r

compute

tree_of_list

17

compute

tree_of_list

17-r

compute

tree_of_list

17-r

compute

tree_of_list

12-l

compute

tree_of_list

12-l

12

compute

tree_of_list

12

compute

tree_of_list

12-r

compute

tree_of_list

12-r

compute

tree_of_list

11-l

compute

tree_of_list

11-l

11

compute

tree_of_list

11

compute

tree_of_list

11-r

compute

tree_of_list

11-r

compute

tree_of_list

10-l

compute

tree_of_list

10-l

10

compute

tree_of_list

9-l

compute

tree_of_list

9-l

9

compute

tree_of_list

8-l

compute

tree_of_list

8-l

8

compute

tree_of_list

8

compute

tree_of_list

8-r

compute

tree_of_list

8-r

compute

tree_of_list

9

compute

tree_of_list

9-r

compute

tree_of_list

9-r

compute

tree_of_list

7-l

compute

tree_of_list

7-l

7

compute

tree_of_list

6-l

compute

tree_of_list

6-l

6

compute

tree_of_list

6

compute

tree_of_list

6-r

compute

tree_of_list

6-r

compute

tree_of_list

5-l

compute

tree_of_list

5-l

5

compute

tree_of_list

4-l

compute

tree_of_list

4-l

4

compute

tree_of_list

4

compute

tree_of_list

4-r

compute

tree_of_list

4-r

compute

tree_of_list

5

compute

tree_of_list

5-r

compute

tree_of_list

5-r

compute

tree_of_list

7

compute

tree_of_list

7-r

compute

tree_of_list

7-r

compute

tree_of_list

3-l

compute

tree_of_list

3-l

3

compute

tree_of_list

2-l

compute

tree_of_list

2-l

2

compute

tree_of_list

1-l

compute

tree_of_list

1-l

1

compute

tree_of_list

0-l

compute

tree_of_list

0-l

0

compute

tree_of_list

0

compute

tree_of_list

0-r

compute

tree_of_list

0-r

compute

tree_of_list

1

compute

tree_of_list

1-r

compute

tree_of_list

1-r

compute

tree_of_list

2

compute

tree_of_list

2-r

compute

tree_of_list

2-r

compute

tree_of_list

3

compute

tree_of_list

3-r

compute

tree_of_list

3-r

compute

tree_of_list

10

compute

tree_of_list

10-r

compute

tree_of_list

10-r

compute

tree_of_list

10

compute

10-l

compute

10-l

compute

tree_of_list

3

compute

3-l

compute

3-l

compute

tree_of_list

2

compute

2-l

compute

2-l

compute

tree_of_list

1

compute

1-l

compute

1-l

compute

tree_of_list

0

compute

0-l

compute

0-l

compute

0-r

compute

0-r

compute

1-r

compute

1-r

compute

merge

1-l

compute

2-r

compute

2-r

compute

merge

1-r-l

compute

3-r

compute

3-r

compute

tree_of_list

7

compute

7-l

compute

7-l

compute

tree_of_list

5

compute

5-l

compute

5-l

compute

tree_of_list

4

compute

4-l

compute

4-l

compute

4-r

compute

4-r

compute

merge

3-l

compute

5-r

compute

5-r

compute

tree_of_list

6

compute

6-l

compute

6-l

compute

6-r

compute

6-r

compute

merge

6-l

compute

merge

6-r-l

compute

7-r

compute

7-r

compute

tree_of_list

9

compute

9-l

compute

9-l

compute

tree_of_list

8

compute

8-l

compute

8-l

compute

8-r

compute

8-r

compute

merge

8-l

compute

9-r

compute

9-r

compute

merge

8-r-l

compute

merge

6-r-r-l

compute

merge

6-r-r-r-l

compute

10-r

compute

10-r

compute

tree_of_list

11

compute

11-l

compute

11-l

compute

11-r

compute

11-r

compute

tree_of_list

12

compute

12-l

compute

12-l

compute

12-r

compute

12-r

compute

tree_of_list

17

compute

17-l

compute

17-l

compute

tree_of_list

16

compute

16-l

compute

16-l

compute

tree_of_list

15

compute

15-l

compute

15-l

compute

tree_of_list

14

compute

14-l

compute

14-l

compute

tree_of_list

13

compute

13-l

compute

13-l

compute

13-r

compute

13-r

compute

merge

12-l

compute

14-r

compute

14-r

compute

merge

14-l

compute

15-r

compute

15-r

compute

merge

14-r-l

compute

16-r

compute

16-r

compute

merge

14-r-r-l

compute

17-r

compute

17-r

compute

merge

14-r-r-r-l

compute

merge

14-r-r-r-r-l

compute

merge

14-r-r-r-r-r-l

compute

merge

14-r-r-r-r-r-r-l

compute

merge

14-r-r-r-r-r-r-l

compute

merge

14-r-r-r-r-r-l

compute

merge

14-r-r-r-r-l

compute

merge

14-r-r-r-l

compute

merge

14-r-r-l

compute

merge

14-r-l

compute

merge

14-l

compute

merge

12-r-l

compute

merge

12-r-r-l

compute

merge

17-l

compute

merge

17-r-l

compute

merge

17-r-r-l

compute

merge

17-r-r-r-l

compute

merge

17-r-r-r-l

compute

merge

17-r-r-l

compute

merge

17-r-l

compute

merge

17-l

compute

merge

12-r-r-r-l

compute

merge

12-r-r-r-r-l

compute

merge

12-r-r-r-r-r-l

Editor trace:

Alloc(LocFresh)

▣

17

Archivist trace:

Alloc(LocFresh)

◯

compute

tree_of_list

17-l

Force(CompCacheMiss)

compute

tree_of_list

17-l

Force(RefGet)

17

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

16-l

Force(CompCacheHit)

compute

tree_of_list

16-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

16

Alloc(LocExists(DiffContent))

◯

compute

tree_of_list

16-r

Force(CompCacheMiss)

compute

tree_of_list

16-r

Remove

compute

tree_of_list

12-l

Remove

compute

tree_of_list

12-l

Remove

compute

tree_of_list

12

Remove

compute

tree_of_list

12-r

Remove

compute

tree_of_list

12-r

Alloc(LocFresh)

▣

compute

tree_of_list

17

Alloc(LocFresh)

◯

compute

tree_of_list

17-r

Force(CompCacheMiss)

compute

tree_of_list

17-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

12-l

Force(CompCacheHit)

compute

tree_of_list

12-l

Alloc(LocExists(SameContent))

▣

compute

tree_of_list

12

Dirty

compute

tree_of_list

12

Dirty

compute

11-r

Alloc(LocExists(SameContent))

◯

compute

tree_of_list

12-r

Force(CompCacheHit)

compute

tree_of_list

12-r

Force(RefGet)

compute

tree_of_list

10

Alloc(LocExists(SameContent))

◯

compute

10-l

Force(CompCacheHit)

compute

10-l

Alloc(LocExists(SameContent))

◯

compute

10-r

Force(CompCacheHit)

compute

10-r

CleanRec

compute

11-r

CleanRec

compute

tree_of_list

12

CleanEval

compute

11-r

Remove

compute

tree_of_list

12

Remove

compute

12-l

Remove

compute

12-l

Remove

compute

12-r

Remove

compute

12-r

Remove

compute

merge

14-r-r-r-l

Force(RefGet)

compute

tree_of_list

12

Alloc(LocExists(SameContent))

◯

compute

12-l

Force(CompCacheHit)

compute

12-l

Alloc(LocExists(DiffContent))

◯

compute

12-r

Force(CompCacheMiss)

compute

12-r

Remove

compute

tree_of_list

16

Remove

compute

16-l

Remove

compute

16-l

Remove

compute

16-r

Remove

compute

16-r

Remove

compute

merge

14-r-r-l

Force(RefGet)

compute

tree_of_list

17

Alloc(LocFresh)

◯

compute

17-l

Force(CompCacheMiss)

compute

17-l

Force(RefGet)

compute

tree_of_list

16

Alloc(LocExists(SameContent))

◯

compute

16-l

Force(CompCacheHit)

compute

16-l

Alloc(LocExists(SameContent))

◯

compute

16-r

Force(CompCacheHit)

compute

16-r

Alloc(LocExists(SameContent))

◯

compute

merge

14-r-r-l

Alloc(LocFresh)

◯

compute

17-r

Force(CompCacheMiss)

compute

17-r

Alloc(LocExists(DiffContent))

◯

compute

merge

14-r-r-r-l

Dirty

compute

merge

14-r-r-r-l

Dirty

compute

merge

14-r-r-r-r-l

Alloc(LocExists(DiffContent))

◯

compute

merge

14-r-r-r-r-l

Dirty

compute

merge

14-r-r-r-r-l

CleanEval

compute

10-r

Remove

compute

tree_of_list

11

Remove

compute

11-l

Remove

compute

11-l

Remove

compute

11-r

Remove

compute

11-r

Remove

compute

merge

14-r-r-r-r-l

Force(RefGet)

compute

tree_of_list

11

Alloc(LocExists(SameContent))

◯

compute

11-l

Force(CompCacheHit)

compute

11-l

Alloc(LocExists(SameContent))

◯

compute

11-r

Force(CompCacheHit)

compute

11-r

Alloc(LocExists(DiffContent))

◯

compute

merge

14-r-r-r-r-r-l

Alloc(LocFresh)

◯

compute

merge

14-r-r-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-r-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-r-r-r-r-l

Remove

compute

merge

14-r-r-r-r-l

Remove

compute

merge

12-r-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-r-r-r-l

Remove

compute

merge

14-r-r-r-l

Remove

compute

merge

12-r-r-r-r-l

Force(CompCacheMiss)

compute

merge

14-r-r-r-l

Remove

compute

merge

14-r-r-l

Remove

compute

merge

12-r-r-r-l

Force(CompCacheHit)

compute

merge

14-r-r-l

Alloc(LocFresh)

◯

compute

merge

17-l

Alloc(LocFresh)

◯

compute

merge

17-r-l

Alloc(LocFresh)

◯

compute

merge

17-r-r-l

Alloc(LocFresh)

◯

compute

merge

17-r-r-r-l

Force(CompCacheMiss)

compute

merge

17-r-r-r-l

Force(CompCacheMiss)

compute

merge

17-r-r-l

Force(CompCacheMiss)

compute

merge

17-r-l

Force(CompCacheMiss)

compute

merge

17-l

Alloc(LocExists(SameContent))

◯

compute

merge

12-r-r-r-l

Alloc(LocExists(SameContent))

◯

compute

merge

12-r-r-r-r-l

Alloc(LocExists(SameContent))

◯

compute

merge

12-r-r-r-r-r-l