Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
W
wendelin.core
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Labels
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Commits
Open sidebar
Kirill Smelkov
wendelin.core
Commits
ee5f54cc
Commit
ee5f54cc
authored
May 15, 2021
by
Kirill Smelkov
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
.
parent
a43403a6
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
7 additions
and
3 deletions
+7
-3
wcfs/pptreesubset.go
wcfs/pptreesubset.go
+7
-3
No files found.
wcfs/pptreesubset.go
View file @
ee5f54cc
...
...
@@ -30,7 +30,11 @@ const debugPPSet = false
// PPTreeSubSet represents PP-connected subset of tree node objects.
//
// where PP(node) maps node to {node, node.parent, leaf.parent,parent, ...} up
// It is
//
// PP(xleafs)
//
// where PP(node) maps node to {node, node.parent, node.parent,parent, ...} up
// to top root from where the node is reached.
//
// The nodes in the set are represented by their Oid.
...
...
@@ -42,7 +46,7 @@ const debugPPSet = false
// Usual set operations are provided: Union, Difference and Intersection.
//
// Nodes can be added into the set via AddPath. Path is reverse operation - it
// returns path to tree node given
node
oid.
// returns path to tree node given
its
oid.
//
// Every node in the set comes with .parent pointer.
//
...
...
@@ -365,7 +369,7 @@ func (orig PPTreeSubSet) Clone() PPTreeSubSet {
return
klon
}
// Equal returns whether
a == b
.
// Equal returns whether
A == B
.
func
(
A
PPTreeSubSet
)
Equal
(
B
PPTreeSubSet
)
bool
{
if
len
(
A
)
!=
len
(
B
)
{
return
false
...
...
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