suyiiyii/yq
1
0
Fork 0
mirror of https://github.com/mikefarah/yq.git synced 2025-01-30 19:25:39 +00:00
Code Issues Packages Projects Releases Wiki Activity

wip

Browse Source
This commit is contained in:
Mike Farah 2023-04-08 21:42:46 +10:00
parent e4dd94248b
commit 4696d11bbc
2 changed files with 75 additions and 78 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

48
pkg/yqlib/operator_anchors_aliases.go
View File

@ -18,7 +18,7 @@ func assignAliasOperator(d *dataTreeNavigator, context Context, expressionNode *
return Context{}, err return Context{}, err
} }
if rhs.MatchingNodes.Front() != nil { if rhs.MatchingNodes.Front() != nil {
aliasName = rhs.MatchingNodes.Front().Value.(*CandidateNode).Node.Value aliasName = rhs.MatchingNodes.Front().Value.(*CandidateNode).Value
} }
} }
@ -38,13 +38,13 @@ func assignAliasOperator(d *dataTreeNavigator, context Context, expressionNode *
return Context{}, err return Context{}, err
} }
if rhs.MatchingNodes.Front() != nil { if rhs.MatchingNodes.Front() != nil {
aliasName = rhs.MatchingNodes.Front().Value.(*CandidateNode).Node.Value aliasName = rhs.MatchingNodes.Front().Value.(*CandidateNode).Value
} }
} }
if aliasName != "" { if aliasName != "" {
candidate.Node.Kind = yaml.AliasNode candidate.Kind = AliasNode
candidate.Node.Value = aliasName candidate.Value = aliasName
} }
} }
return context, nil return context, nil
@ -56,8 +56,7 @@ func getAliasOperator(d *dataTreeNavigator, context Context, expressionNode *Exp
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() { for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
candidate := el.Value.(*CandidateNode) candidate := el.Value.(*CandidateNode)
node := &yaml.Node{Kind: yaml.ScalarNode, Value: candidate.Node.Value, Tag: "!!str"} result := candidate.CreateReplacement(ScalarNode, "!!str", candidate.Value)
result := candidate.CreateReplacement(node)
results.PushBack(result) results.PushBack(result)
} }
return context.ChildContext(results), nil return context.ChildContext(results), nil
@ -75,7 +74,7 @@ func assignAnchorOperator(d *dataTreeNavigator, context Context, expressionNode
} }
if rhs.MatchingNodes.Front() != nil { if rhs.MatchingNodes.Front() != nil {
anchorName = rhs.MatchingNodes.Front().Value.(*CandidateNode).Node.Value anchorName = rhs.MatchingNodes.Front().Value.(*CandidateNode).Value
} }
} }
@ -96,11 +95,11 @@ func assignAnchorOperator(d *dataTreeNavigator, context Context, expressionNode
} }
if rhs.MatchingNodes.Front() != nil { if rhs.MatchingNodes.Front() != nil {
anchorName = rhs.MatchingNodes.Front().Value.(*CandidateNode).Node.Value anchorName = rhs.MatchingNodes.Front().Value.(*CandidateNode).Value
} }
} }
candidate.Node.Anchor = anchorName candidate.Anchor = anchorName
} }
return context, nil return context, nil
} }
@ -111,9 +110,8 @@ func getAnchorOperator(d *dataTreeNavigator, context Context, expressionNode *Ex
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() { for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
candidate := el.Value.(*CandidateNode) candidate := el.Value.(*CandidateNode)
anchor := candidate.Node.Anchor anchor := candidate.Anchor
node := &yaml.Node{Kind: yaml.ScalarNode, Value: anchor, Tag: "!!str"} result := candidate.CreateReplacement(ScalarNode, "!!str", anchor)
result := candidate.CreateReplacement(node)
results.PushBack(result) results.PushBack(result)
} }
return context.ChildContext(results), nil return context.ChildContext(results), nil
@ -131,7 +129,7 @@ func explodeOperator(d *dataTreeNavigator, context Context, expressionNode *Expr
return Context{}, err return Context{}, err
} }
for childEl := rhs.MatchingNodes.Front(); childEl != nil; childEl = childEl.Next() { for childEl := rhs.MatchingNodes.Front(); childEl != nil; childEl = childEl.Next() {
err = explodeNode(childEl.Value.(*CandidateNode).Node, context) err = explodeNode(childEl.Value.(*CandidateNode), context)
if err != nil { if err != nil {
return Context{}, err return Context{}, err
} }
@ -142,7 +140,7 @@ func explodeOperator(d *dataTreeNavigator, context Context, expressionNode *Expr
return context, nil return context, nil
} }
func reconstructAliasedMap(node *yaml.Node, context Context) error { func reconstructAliasedMap(node *CandidateNode, context Context) error {
var newContent = list.New() var newContent = list.New()
// can I short cut here by prechecking if there's an anchor in the map? // can I short cut here by prechecking if there's an anchor in the map?
// no it needs to recurse in overrideEntry. // no it needs to recurse in overrideEntry.
@ -157,7 +155,7 @@ func reconstructAliasedMap(node *yaml.Node, context Context) error {
return err return err
} }
} else { } else {
if valueNode.Kind == yaml.SequenceNode { if valueNode.Kind == SequenceNode {
log.Debugf("an alias merge list!") log.Debugf("an alias merge list!")
for index := len(valueNode.Content) - 1; index >= 0; index = index - 1 { for index := len(valueNode.Content) - 1; index >= 0; index = index - 1 {
aliasNode := valueNode.Content[index] aliasNode := valueNode.Content[index]
@ -175,19 +173,19 @@ func reconstructAliasedMap(node *yaml.Node, context Context) error {
} }
} }
} }
node.Content = make([]*yaml.Node, newContent.Len()) node.Content = make([]*CandidateNode, newContent.Len())
index := 0 index := 0
for newEl := newContent.Front(); newEl != nil; newEl = newEl.Next() { for newEl := newContent.Front(); newEl != nil; newEl = newEl.Next() {
node.Content[index] = newEl.Value.(*yaml.Node) node.Content[index] = newEl.Value.(*CandidateNode)
index++ index++
} }
return nil return nil
} }
func explodeNode(node *yaml.Node, context Context) error { func explodeNode(node *CandidateNode, context Context) error {
node.Anchor = "" node.Anchor = ""
switch node.Kind { switch node.Kind {
case yaml.SequenceNode, yaml.DocumentNode: case SequenceNode, DocumentNode:
for index, contentNode := range node.Content { for index, contentNode := range node.Content {
log.Debugf("exploding index %v", index) log.Debugf("exploding index %v", index)
errorInContent := explodeNode(contentNode, context) errorInContent := explodeNode(contentNode, context)
@ -196,18 +194,18 @@ func explodeNode(node *yaml.Node, context Context) error {
} }
} }
return nil return nil
case yaml.AliasNode: case AliasNode:
log.Debugf("its an alias!") log.Debugf("its an alias!")
if node.Alias != nil { if node.Alias != nil {
node.Kind = node.Alias.Kind node.Kind = node.Alias.Kind
node.Style = node.Alias.Style node.Style = node.Alias.Style
node.Tag = node.Alias.Tag node.Tag = node.Alias.Tag
node.Content = deepCloneContent(node.Alias.Content) node.Content = node.CopyChildren()
node.Value = node.Alias.Value node.Value = node.Alias.Value
node.Alias = nil node.Alias = nil
} }
return nil return nil
case yaml.MappingNode: case MappingNode:
// //check the map has an alias in it // //check the map has an alias in it
hasAlias := false hasAlias := false
for index := 0; index < len(node.Content); index = index + 2 { for index := 0; index < len(node.Content); index = index + 2 {
@ -241,11 +239,11 @@ func explodeNode(node *yaml.Node, context Context) error {
} }
} }
func applyAlias(node *yaml.Node, alias *yaml.Node, aliasIndex int, newContent Context) error { func applyAlias(node *CandidateNode, alias *CandidateNode, aliasIndex int, newContent Context) error {
if alias == nil { if alias == nil {
return nil return nil
} }
if alias.Kind != yaml.MappingNode { if alias.Kind != MappingNode {
return fmt.Errorf("merge anchor only supports maps, got %v instead", alias.Tag) return fmt.Errorf("merge anchor only supports maps, got %v instead", alias.Tag)
} }
for index := 0; index < len(alias.Content); index = index + 2 { for index := 0; index < len(alias.Content); index = index + 2 {
@ -260,7 +258,7 @@ func applyAlias(node *yaml.Node, alias *yaml.Node, aliasIndex int, newContent Co
return nil return nil
} }
func overrideEntry(node *yaml.Node, key *yaml.Node, value *yaml.Node, startIndex int, newContent Context) error { func overrideEntry(node *CandidateNode, key *CandidateNode, value *CandidateNode, startIndex int, newContent Context) error {
err := explodeNode(value, newContent) err := explodeNode(value, newContent)

105
pkg/yqlib/operator_strings.go
View File

@ -5,8 +5,6 @@ import (
"fmt" "fmt"
"regexp" "regexp"
"strings" "strings"
"gopkg.in/yaml.v3"
) )
type changeCasePrefs struct { type changeCasePrefs struct {
@ -18,15 +16,15 @@ func trimSpaceOperator(d *dataTreeNavigator, context Context, expressionNode *Ex
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() { for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
candidate := el.Value.(*CandidateNode) candidate := el.Value.(*CandidateNode)
node := unwrapDoc(candidate.Node) node := candidate.unwrapDocument()
if guessTagFromCustomType(node) != "!!str" { if node.guessTagFromCustomType() != "!!str" {
return Context{}, fmt.Errorf("cannot trim %v, can only operate on strings. ", node.Tag) return Context{}, fmt.Errorf("cannot trim %v, can only operate on strings. ", node.Tag)
} }
newStringNode := &yaml.Node{Kind: yaml.ScalarNode, Tag: node.Tag, Style: node.Style} newStringNode := candidate.CreateReplacement(ScalarNode, node.Tag, strings.TrimSpace(node.Value))
newStringNode.Value = strings.TrimSpace(node.Value) newStringNode.Style = node.Style
results.PushBack(candidate.CreateReplacement(newStringNode)) results.PushBack(newStringNode)
} }
@ -40,19 +38,21 @@ func changeCaseOperator(d *dataTreeNavigator, context Context, expressionNode *E
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() { for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
candidate := el.Value.(*CandidateNode) candidate := el.Value.(*CandidateNode)
node := unwrapDoc(candidate.Node) node := candidate.unwrapDocument()
if guessTagFromCustomType(node) != "!!str" { if node.guessTagFromCustomType() != "!!str" {
return Context{}, fmt.Errorf("cannot change case with %v, can only operate on strings. ", node.Tag) return Context{}, fmt.Errorf("cannot change case with %v, can only operate on strings. ", node.Tag)
} }
newStringNode := &yaml.Node{Kind: yaml.ScalarNode, Tag: node.Tag, Style: node.Style} value := ""
if prefs.ToUpperCase { if prefs.ToUpperCase {
newStringNode.Value = strings.ToUpper(node.Value) value = strings.ToUpper(node.Value)
} else { } else {
newStringNode.Value = strings.ToLower(node.Value) value = strings.ToLower(node.Value)
} }
results.PushBack(candidate.CreateReplacement(newStringNode)) newStringNode := candidate.CreateReplacement(ScalarNode, node.Tag, value)
newStringNode.Style = node.Style
results.PushBack(newStringNode)
} }
@ -69,7 +69,7 @@ func getSubstituteParameters(d *dataTreeNavigator, block *ExpressionNode, contex
return "", "", err return "", "", err
} }
if regExNodes.MatchingNodes.Front() != nil { if regExNodes.MatchingNodes.Front() != nil {
regEx = regExNodes.MatchingNodes.Front().Value.(*CandidateNode).Node.Value regEx = regExNodes.MatchingNodes.Front().Value.(*CandidateNode).Value
} }
log.Debug("regEx %v", regEx) log.Debug("regEx %v", regEx)
@ -79,15 +79,15 @@ func getSubstituteParameters(d *dataTreeNavigator, block *ExpressionNode, contex
return "", "", err return "", "", err
} }
if replacementNodes.MatchingNodes.Front() != nil { if replacementNodes.MatchingNodes.Front() != nil {
replacementText = replacementNodes.MatchingNodes.Front().Value.(*CandidateNode).Node.Value replacementText = replacementNodes.MatchingNodes.Front().Value.(*CandidateNode).Value
} }
return regEx, replacementText, nil return regEx, replacementText, nil
} }
func substitute(original string, regex *regexp.Regexp, replacement string) *yaml.Node { func substitute(original string, regex *regexp.Regexp, replacement string) (Kind, string, string) {
replacedString := regex.ReplaceAllString(original, replacement) replacedString := regex.ReplaceAllString(original, replacement)
return &yaml.Node{Kind: yaml.ScalarNode, Value: replacedString, Tag: "!!str"} return ScalarNode, "!!str", replacedString
} }
func substituteStringOperator(d *dataTreeNavigator, context Context, expressionNode *ExpressionNode) (Context, error) { func substituteStringOperator(d *dataTreeNavigator, context Context, expressionNode *ExpressionNode) (Context, error) {
@ -111,14 +111,13 @@ func substituteStringOperator(d *dataTreeNavigator, context Context, expressionN
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() { for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
candidate := el.Value.(*CandidateNode) candidate := el.Value.(*CandidateNode)
node := unwrapDoc(candidate.Node) node := candidate.unwrapDocument()
if guessTagFromCustomType(node) != "!!str" { if node.guessTagFromCustomType() != "!!str" {
return Context{}, fmt.Errorf("cannot substitute with %v, can only substitute strings. Hint: Most often you'll want to use '|=' over '=' for this operation", node.Tag) return Context{}, fmt.Errorf("cannot substitute with %v, can only substitute strings. Hint: Most often you'll want to use '|=' over '=' for this operation", node.Tag)
} }
targetNode := substitute(node.Value, regEx, replacementText) result := candidate.CreateReplacement(substitute(node.Value, regEx, replacementText))
result := candidate.CreateReplacement(targetNode)
results.PushBack(result) results.PushBack(result)
} }
@ -126,7 +125,7 @@ func substituteStringOperator(d *dataTreeNavigator, context Context, expressionN
} }
func addMatch(original []*yaml.Node, match string, offset int, name string) []*yaml.Node { func addMatch(original []*CandidateNode, match string, offset int, name string) []*CandidateNode {
newContent := append(original, newContent := append(original,
createScalarNode("string", "string")) createScalarNode("string", "string"))
@ -188,21 +187,21 @@ func match(matchPrefs matchPreferences, regEx *regexp.Regexp, candidate *Candida
} }
for i, matches := range allMatches { for i, matches := range allMatches {
capturesListNode := &yaml.Node{Kind: yaml.SequenceNode} capturesListNode := &CandidateNode{Kind: SequenceNode}
match, submatches := matches[0], matches[1:] match, submatches := matches[0], matches[1:]
for j, submatch := range submatches { for j, submatch := range submatches {
captureNode := &yaml.Node{Kind: yaml.MappingNode} captureNode := &CandidateNode{Kind: MappingNode}
captureNode.Content = addMatch(captureNode.Content, submatch, allIndices[i][2+j*2], subNames[j+1]) captureNode.Content = addMatch(captureNode.Content, submatch, allIndices[i][2+j*2], subNames[j+1])
capturesListNode.Content = append(capturesListNode.Content, captureNode) capturesListNode.Content = append(capturesListNode.Content, captureNode)
} }
node := &yaml.Node{Kind: yaml.MappingNode} node := candidate.CreateReplacement(MappingNode, "!!map", "")
node.Content = addMatch(node.Content, match, allIndices[i][0], "") node.Content = addMatch(node.Content, match, allIndices[i][0], "")
node.Content = append(node.Content, node.Content = append(node.Content,
createScalarNode("captures", "captures"), createScalarNode("captures", "captures"),
capturesListNode, capturesListNode,
) )
results.PushBack(candidate.CreateReplacement(node)) results.PushBack(node)
} }
@ -219,7 +218,7 @@ func capture(matchPrefs matchPreferences, regEx *regexp.Regexp, candidate *Candi
} }
for i, matches := range allMatches { for i, matches := range allMatches {
capturesNode := &yaml.Node{Kind: yaml.MappingNode} capturesNode := candidate.CreateReplacement(MappingNode, "!!map", "")
_, submatches := matches[0], matches[1:] _, submatches := matches[0], matches[1:]
for j, submatch := range submatches { for j, submatch := range submatches {
@ -239,7 +238,7 @@ func capture(matchPrefs matchPreferences, regEx *regexp.Regexp, candidate *Candi
} }
} }
results.PushBack(candidate.CreateReplacement(capturesNode)) results.PushBack(capturesNode)
} }
@ -260,7 +259,7 @@ func extractMatchArguments(d *dataTreeNavigator, context Context, expressionNode
} }
paramText := "" paramText := ""
if replacementNodes.MatchingNodes.Front() != nil { if replacementNodes.MatchingNodes.Front() != nil {
paramText = replacementNodes.MatchingNodes.Front().Value.(*CandidateNode).Node.Value paramText = replacementNodes.MatchingNodes.Front().Value.(*CandidateNode).Value
} }
if strings.Contains(paramText, "g") { if strings.Contains(paramText, "g") {
paramText = strings.ReplaceAll(paramText, "g", "") paramText = strings.ReplaceAll(paramText, "g", "")
@ -281,7 +280,7 @@ func extractMatchArguments(d *dataTreeNavigator, context Context, expressionNode
log.Debug(NodesToString(regExNodes.MatchingNodes)) log.Debug(NodesToString(regExNodes.MatchingNodes))
regExStr := "" regExStr := ""
if regExNodes.MatchingNodes.Front() != nil { if regExNodes.MatchingNodes.Front() != nil {
regExStr = regExNodes.MatchingNodes.Front().Value.(*CandidateNode).Node.Value regExStr = regExNodes.MatchingNodes.Front().Value.(*CandidateNode).Value
} }
log.Debug("regEx %v", regExStr) log.Debug("regEx %v", regExStr)
regEx, err := regexp.Compile(regExStr) regEx, err := regexp.Compile(regExStr)
@ -298,9 +297,9 @@ func matchOperator(d *dataTreeNavigator, context Context, expressionNode *Expres
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() { for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
candidate := el.Value.(*CandidateNode) candidate := el.Value.(*CandidateNode)
node := unwrapDoc(candidate.Node) node := candidate.unwrapDocument()
if guessTagFromCustomType(node) != "!!str" { if node.guessTagFromCustomType() != "!!str" {
return Context{}, fmt.Errorf("cannot match with %v, can only match strings. Hint: Most often you'll want to use '|=' over '=' for this operation", node.Tag) return Context{}, fmt.Errorf("cannot match with %v, can only match strings. Hint: Most often you'll want to use '|=' over '=' for this operation", node.Tag)
} }
@ -320,9 +319,9 @@ func captureOperator(d *dataTreeNavigator, context Context, expressionNode *Expr
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() { for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
candidate := el.Value.(*CandidateNode) candidate := el.Value.(*CandidateNode)
node := unwrapDoc(candidate.Node) node := candidate.unwrapDocument()
if guessTagFromCustomType(node) != "!!str" { if node.guessTagFromCustomType() != "!!str" {
return Context{}, fmt.Errorf("cannot match with %v, can only match strings. Hint: Most often you'll want to use '|=' over '=' for this operation", node.Tag) return Context{}, fmt.Errorf("cannot match with %v, can only match strings. Hint: Most often you'll want to use '|=' over '=' for this operation", node.Tag)
} }
capture(matchPrefs, regEx, candidate, node.Value, results) capture(matchPrefs, regEx, candidate, node.Value, results)
@ -342,9 +341,9 @@ func testOperator(d *dataTreeNavigator, context Context, expressionNode *Express
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() { for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
candidate := el.Value.(*CandidateNode) candidate := el.Value.(*CandidateNode)
node := unwrapDoc(candidate.Node) node := candidate.unwrapDocument()
if guessTagFromCustomType(node) != "!!str" { if node.guessTagFromCustomType() != "!!str" {
return Context{}, fmt.Errorf("cannot match with %v, can only match strings. Hint: Most often you'll want to use '|=' over '=' for this operation", node.Tag) return Context{}, fmt.Errorf("cannot match with %v, can only match strings. Hint: Most often you'll want to use '|=' over '=' for this operation", node.Tag)
} }
matches := regEx.FindStringSubmatch(node.Value) matches := regEx.FindStringSubmatch(node.Value)
@ -364,26 +363,25 @@ func joinStringOperator(d *dataTreeNavigator, context Context, expressionNode *E
return Context{}, err return Context{}, err
} }
if rhs.MatchingNodes.Front() != nil { if rhs.MatchingNodes.Front() != nil {
joinStr = rhs.MatchingNodes.Front().Value.(*CandidateNode).Node.Value joinStr = rhs.MatchingNodes.Front().Value.(*CandidateNode).Value
} }
var results = list.New() var results = list.New()
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() { for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
candidate := el.Value.(*CandidateNode) candidate := el.Value.(*CandidateNode)
node := unwrapDoc(candidate.Node) node := candidate.unwrapDocument()
if node.Kind != yaml.SequenceNode { if node.Kind != SequenceNode {
return Context{}, fmt.Errorf("cannot join with %v, can only join arrays of scalars", node.Tag) return Context{}, fmt.Errorf("cannot join with %v, can only join arrays of scalars", node.Tag)
} }
targetNode := join(node.Content, joinStr) result := candidate.CreateReplacement(join(node.Content, joinStr))
result := candidate.CreateReplacement(targetNode)
results.PushBack(result) results.PushBack(result)
} }
return context.ChildContext(results), nil return context.ChildContext(results), nil
} }
func join(content []*yaml.Node, joinStr string) *yaml.Node { func join(content []*CandidateNode, joinStr string) (Kind, string, string) {
var stringsToJoin []string var stringsToJoin []string
for _, node := range content { for _, node := range content {
str := node.Value str := node.Value
@ -393,7 +391,7 @@ func join(content []*yaml.Node, joinStr string) *yaml.Node {
stringsToJoin = append(stringsToJoin, str) stringsToJoin = append(stringsToJoin, str)
} }
return &yaml.Node{Kind: yaml.ScalarNode, Value: strings.Join(stringsToJoin, joinStr), Tag: "!!str"} return ScalarNode, "!!str", strings.Join(stringsToJoin, joinStr)
} }
func splitStringOperator(d *dataTreeNavigator, context Context, expressionNode *ExpressionNode) (Context, error) { func splitStringOperator(d *dataTreeNavigator, context Context, expressionNode *ExpressionNode) (Context, error) {
@ -405,41 +403,42 @@ func splitStringOperator(d *dataTreeNavigator, context Context, expressionNode *
return Context{}, err return Context{}, err
} }
if rhs.MatchingNodes.Front() != nil { if rhs.MatchingNodes.Front() != nil {
splitStr = rhs.MatchingNodes.Front().Value.(*CandidateNode).Node.Value splitStr = rhs.MatchingNodes.Front().Value.(*CandidateNode).Value
} }
var results = list.New() var results = list.New()
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() { for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
candidate := el.Value.(*CandidateNode) candidate := el.Value.(*CandidateNode)
node := unwrapDoc(candidate.Node) node := candidate.unwrapDocument()
if node.Tag == "!!null" { if node.Tag == "!!null" {
continue continue
} }
if guessTagFromCustomType(node) != "!!str" { if node.guessTagFromCustomType() != "!!str" {
return Context{}, fmt.Errorf("Cannot split %v, can only split strings", node.Tag) return Context{}, fmt.Errorf("Cannot split %v, can only split strings", node.Tag)
} }
targetNode := split(node.Value, splitStr) kind, tag, content := split(node.Value, splitStr)
result := candidate.CreateReplacement(targetNode) result := candidate.CreateReplacement(kind, tag, "")
result.Content = content
results.PushBack(result) results.PushBack(result)
} }
return context.ChildContext(results), nil return context.ChildContext(results), nil
} }
func split(value string, spltStr string) *yaml.Node { func split(value string, spltStr string) (Kind, string, []*CandidateNode) {
var contents []*yaml.Node var contents []*CandidateNode
if value != "" { if value != "" {
log.Debug("going to spltStr[%v]", spltStr) log.Debug("going to spltStr[%v]", spltStr)
var newStrings = strings.Split(value, spltStr) var newStrings = strings.Split(value, spltStr)
contents = make([]*yaml.Node, len(newStrings)) contents = make([]*CandidateNode, len(newStrings))
for index, str := range newStrings { for index, str := range newStrings {
contents[index] = &yaml.Node{Kind: yaml.ScalarNode, Tag: "!!str", Value: str} contents[index] = &CandidateNode{Kind: ScalarNode, Tag: "!!str", Value: str}
} }
} }
return &yaml.Node{Kind: yaml.SequenceNode, Tag: "!!seq", Content: contents} return SequenceNode, "!!seq", contents
} }