yq/pkg/yqlib/operator_delete.go

109 lines
2.7 KiB
Go
Raw Normal View History

2020-11-03 23:48:43 +00:00
package yqlib
2020-10-10 11:42:09 +00:00
import (
2020-10-21 01:54:58 +00:00
"container/list"
2020-12-22 00:45:51 +00:00
"fmt"
2020-10-21 01:54:58 +00:00
2020-11-14 02:38:44 +00:00
yaml "gopkg.in/yaml.v3"
2020-10-10 11:42:09 +00:00
)
2020-10-21 01:54:58 +00:00
func DeleteChildOperator(d *dataTreeNavigator, matchingNodes *list.List, pathNode *PathTreeNode) (*list.List, error) {
2020-10-10 11:42:09 +00:00
2020-12-22 00:45:51 +00:00
nodesToDelete, err := d.GetMatchingNodes(matchingNodes, pathNode.Rhs)
if err != nil {
return nil, err
}
for el := nodesToDelete.Front(); el != nil; el = el.Next() {
2020-10-10 11:42:09 +00:00
candidate := el.Value.(*CandidateNode)
2020-12-22 00:45:51 +00:00
deleteImmediateChildOp := &Operation{
OperationType: DeleteImmediateChild,
Value: candidate.Path[len(candidate.Path)-1],
}
deleteImmediateChildOpNode := &PathTreeNode{
Operation: deleteImmediateChildOp,
Rhs: createTraversalTree(candidate.Path[0 : len(candidate.Path)-1]),
}
_, err := d.GetMatchingNodes(matchingNodes, deleteImmediateChildOpNode)
2020-10-10 11:42:09 +00:00
if err != nil {
return nil, err
}
2020-12-22 00:45:51 +00:00
}
return matchingNodes, nil
}
2020-10-10 11:42:09 +00:00
2020-12-22 00:45:51 +00:00
func DeleteImmediateChildOperator(d *dataTreeNavigator, matchingNodes *list.List, pathNode *PathTreeNode) (*list.List, error) {
parents, err := d.GetMatchingNodes(matchingNodes, pathNode.Rhs)
2020-11-14 02:38:44 +00:00
2020-12-22 00:45:51 +00:00
if err != nil {
return nil, err
}
childPath := pathNode.Operation.Value
log.Debug("childPath to remove %v", childPath)
for el := parents.Front(); el != nil; el = el.Next() {
parent := el.Value.(*CandidateNode)
parentNode := UnwrapDoc(parent.Node)
if parentNode.Kind == yaml.MappingNode {
deleteFromMap(parent, childPath)
} else if parentNode.Kind == yaml.SequenceNode {
deleteFromArray(parent, childPath)
2020-10-11 23:09:13 +00:00
} else {
2020-12-22 00:45:51 +00:00
return nil, fmt.Errorf("Cannot delete nodes from parent of tag %v", parentNode.Tag)
2020-10-10 11:42:09 +00:00
}
2020-12-22 00:45:51 +00:00
2020-10-10 11:42:09 +00:00
}
2020-11-14 02:38:44 +00:00
return matchingNodes, nil
2020-10-10 11:42:09 +00:00
}
2020-12-22 00:45:51 +00:00
func deleteFromMap(candidate *CandidateNode, childPath interface{}) {
2020-10-10 11:42:09 +00:00
log.Debug("deleteFromMap")
2020-11-14 02:38:44 +00:00
node := UnwrapDoc(candidate.Node)
2020-10-10 11:42:09 +00:00
contents := node.Content
newContents := make([]*yaml.Node, 0)
for index := 0; index < len(contents); index = index + 2 {
key := contents[index]
value := contents[index+1]
childCandidate := &CandidateNode{
Node: value,
Document: candidate.Document,
2020-12-25 01:46:08 +00:00
Path: candidate.CreateChildPath(key.Value),
2020-10-10 11:42:09 +00:00
}
2020-11-14 02:38:44 +00:00
2020-12-22 00:45:51 +00:00
shouldDelete := key.Value == childPath
2020-10-10 11:42:09 +00:00
2020-10-13 01:51:37 +00:00
log.Debugf("shouldDelete %v ? %v", childCandidate.GetKey(), shouldDelete)
2020-10-10 11:42:09 +00:00
if !shouldDelete {
newContents = append(newContents, key, value)
}
}
node.Content = newContents
}
2020-12-22 00:45:51 +00:00
func deleteFromArray(candidate *CandidateNode, childPath interface{}) {
2020-10-10 11:42:09 +00:00
log.Debug("deleteFromArray")
2020-11-14 02:38:44 +00:00
node := UnwrapDoc(candidate.Node)
2020-10-10 11:42:09 +00:00
contents := node.Content
newContents := make([]*yaml.Node, 0)
for index := 0; index < len(contents); index = index + 1 {
value := contents[index]
2020-12-22 00:45:51 +00:00
shouldDelete := fmt.Sprintf("%v", index) == fmt.Sprintf("%v", childPath)
2020-10-10 11:42:09 +00:00
if !shouldDelete {
newContents = append(newContents, value)
}
}
node.Content = newContents
}