Commit ee5f54cc authored by Kirill Smelkov's avatar Kirill Smelkov

.

parent a43403a6
...@@ -30,7 +30,11 @@ const debugPPSet = false ...@@ -30,7 +30,11 @@ const debugPPSet = false
// PPTreeSubSet represents PP-connected subset of tree node objects. // 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. // to top root from where the node is reached.
// //
// The nodes in the set are represented by their Oid. // The nodes in the set are represented by their Oid.
...@@ -42,7 +46,7 @@ const debugPPSet = false ...@@ -42,7 +46,7 @@ const debugPPSet = false
// Usual set operations are provided: Union, Difference and Intersection. // Usual set operations are provided: Union, Difference and Intersection.
// //
// Nodes can be added into the set via AddPath. Path is reverse operation - it // 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. // Every node in the set comes with .parent pointer.
// //
...@@ -365,7 +369,7 @@ func (orig PPTreeSubSet) Clone() PPTreeSubSet { ...@@ -365,7 +369,7 @@ func (orig PPTreeSubSet) Clone() PPTreeSubSet {
return klon return klon
} }
// Equal returns whether a == b. // Equal returns whether A == B.
func (A PPTreeSubSet) Equal(B PPTreeSubSet) bool { func (A PPTreeSubSet) Equal(B PPTreeSubSet) bool {
if len(A) != len(B) { if len(A) != len(B) {
return false return false
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment