Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
N
nebula
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
exchain
nebula
Commits
a70402e7
Unverified
Commit
a70402e7
authored
Sep 11, 2023
by
OptimismBot
Committed by
GitHub
Sep 11, 2023
Browse files
Options
Browse Files
Download
Plain Diff
Merge pull request #7174 from ethereum-optimism/aj/position-immutable
op-challenger: Make Position actually immutable
parents
f6834953
6f2822be
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
22 additions
and
24 deletions
+22
-24
position.go
op-challenger/game/fault/types/position.go
+22
-24
No files found.
op-challenger/game/fault/types/position.go
View file @
a70402e7
...
...
@@ -18,31 +18,33 @@ func NewPositionFromGIndex(x uint64) Position {
return
NewPosition
(
depth
,
int
(
indexAtDepth
))
}
func
(
p
*
Position
)
Depth
()
int
{
func
(
p
Position
)
Depth
()
int
{
return
p
.
depth
}
func
(
p
*
Position
)
IndexAtDepth
()
int
{
func
(
p
Position
)
IndexAtDepth
()
int
{
return
p
.
indexAtDepth
}
func
(
p
*
Position
)
IsRootPosition
()
bool
{
func
(
p
Position
)
IsRootPosition
()
bool
{
return
p
.
depth
==
0
&&
p
.
indexAtDepth
==
0
}
// TraceIndex calculates the what the index of the claim value would be inside the trace.
// It is equivalent to going right until the final depth has been reached.
func
(
p
*
Position
)
TraceIndex
(
maxDepth
int
)
uint64
{
func
(
p
Position
)
TraceIndex
(
maxDepth
int
)
uint64
{
// When we go right, we do a shift left and set the bottom bit to be 1.
// To do this in a single step, do all the shifts at once & or in all 1s for the bottom bits.
rd
:=
maxDepth
-
p
.
depth
return
uint64
(
p
.
indexAtDepth
<<
rd
|
((
1
<<
rd
)
-
1
))
}
// move goes to the left or right child.
func
(
p
*
Position
)
move
(
right
bool
)
{
p
.
depth
++
p
.
indexAtDepth
=
(
p
.
indexAtDepth
<<
1
)
|
boolToInt
(
right
)
// move returns a new position at the left or right child.
func
(
p
Position
)
move
(
right
bool
)
Position
{
return
Position
{
depth
:
p
.
depth
+
1
,
indexAtDepth
:
(
p
.
indexAtDepth
<<
1
)
|
boolToInt
(
right
),
}
}
func
boolToInt
(
b
bool
)
int
{
...
...
@@ -53,33 +55,29 @@ func boolToInt(b bool) int {
}
}
// parent moves up to the parent.
func
(
p
*
Position
)
parent
()
{
p
.
depth
--
p
.
indexAtDepth
=
p
.
indexAtDepth
>>
1
// parent return a new position that is the parent of this Position.
func
(
p
Position
)
parent
()
Position
{
return
Position
{
depth
:
p
.
depth
-
1
,
indexAtDepth
:
p
.
indexAtDepth
>>
1
,
}
}
// Attack creates a new position which is the attack position of this one.
func
(
p
*
Position
)
Attack
()
Position
{
p2
:=
NewPosition
(
p
.
depth
,
p
.
indexAtDepth
)
p2
.
move
(
false
)
return
p2
func
(
p
Position
)
Attack
()
Position
{
return
p
.
move
(
false
)
}
// Defend creates a new position which is the defend position of this one.
func
(
p
*
Position
)
Defend
()
Position
{
p2
:=
NewPosition
(
p
.
depth
,
p
.
indexAtDepth
)
p2
.
parent
()
p2
.
move
(
true
)
p2
.
move
(
false
)
return
p2
func
(
p
Position
)
Defend
()
Position
{
return
p
.
parent
()
.
move
(
true
)
.
move
(
false
)
}
func
(
p
*
Position
)
Print
(
maxDepth
int
)
{
func
(
p
Position
)
Print
(
maxDepth
int
)
{
fmt
.
Printf
(
"GIN: %4b
\t
Trace Position is %4b
\t
Trace Depth is: %d
\t
Trace Index is: %d
\n
"
,
p
.
ToGIndex
(),
p
.
indexAtDepth
,
p
.
depth
,
p
.
TraceIndex
(
maxDepth
))
}
func
(
p
*
Position
)
ToGIndex
()
uint64
{
func
(
p
Position
)
ToGIndex
()
uint64
{
return
uint64
(
1
<<
p
.
depth
|
p
.
indexAtDepth
)
}
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment