-
Notifications
You must be signed in to change notification settings - Fork 15
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
9 changed files
with
932 additions
and
149 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,3 +1,4 @@ | ||
| module github.com/freeconf/yang | ||
|
|
||
| go 1.20 | ||
| require github.com/clbanning/mxj/v2 v2.5.7 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,2 @@ | ||
| github.com/clbanning/mxj/v2 v2.5.7 h1:7q5lvUpaPF/WOkqgIDiwjBJaznaLCCBd78pi8ZyAnE0= | ||
| github.com/clbanning/mxj/v2 v2.5.7/go.mod h1:hNiWqW14h+kc+MdF9C6/YoRfjEJoR3ou6tn/Qo+ve2s= |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,169 @@ | ||
| package nodeutil | ||
|
|
||
| import ( | ||
| "errors" | ||
| "fmt" | ||
| "io" | ||
|
|
||
| "github.com/freeconf/yang/node" | ||
| "github.com/freeconf/yang/val" | ||
|
|
||
| "github.com/freeconf/yang/meta" | ||
| ) | ||
|
|
||
| type Decoder interface { | ||
| Decode() (map[string]interface{}, error) | ||
| } | ||
|
|
||
| type Rdr struct { | ||
| decoder Decoder | ||
| In io.Reader | ||
| values map[string]interface{} | ||
| } | ||
|
|
||
| func (self *Rdr) Node() node.Node { | ||
| var err error | ||
| if self.values == nil { | ||
| self.values, err = self.decoder.Decode() | ||
| if err != nil { | ||
| return node.ErrorNode{Err: err} | ||
| } | ||
| } | ||
| return ContainerReader(self.values) | ||
| } | ||
|
|
||
| func (self *Rdr) Decode() (map[string]interface{}, error) { | ||
| return nil, nil | ||
| } | ||
|
|
||
| func leafOrLeafListReader(m meta.Leafable, data interface{}) (v val.Value, err error) { | ||
| return node.NewValue(m.Type(), data) | ||
| } | ||
|
|
||
| func ListReader(list []interface{}) node.Node { | ||
| s := &Basic{} | ||
| s.OnNext = func(r node.ListRequest) (next node.Node, key []val.Value, err error) { | ||
| key = r.Key | ||
| if r.New { | ||
| panic("Cannot write to reader") | ||
| } | ||
| if len(r.Key) > 0 { | ||
| if r.First { | ||
| keyFields := r.Meta.KeyMeta() | ||
| for i := 0; i < len(list); i++ { | ||
| candidate := list[i].(map[string]interface{}) | ||
| if KeyMatches(keyFields, candidate, key) { | ||
| return ContainerReader(candidate), r.Key, nil | ||
| } | ||
| } | ||
| } | ||
| } else { | ||
| if r.Row < len(list) { | ||
| container := list[r.Row].(map[string]interface{}) | ||
| if len(r.Meta.KeyMeta()) > 0 { | ||
| keyData := make([]interface{}, len(r.Meta.KeyMeta())) | ||
| for i, kmeta := range r.Meta.KeyMeta() { | ||
| // Key may legitimately not exist when inserting new data | ||
| keyData[i] = fqkGetOrNil(kmeta, container) | ||
| } | ||
| if key, err = node.NewValues(r.Meta.KeyMeta(), keyData...); err != nil { | ||
| return nil, nil, err | ||
| } | ||
| } | ||
| return ContainerReader(container), key, nil | ||
| } | ||
| } | ||
| return nil, nil, nil | ||
| } | ||
| return s | ||
| } | ||
|
|
||
| func fqkGetOrNil(m meta.Definition, container map[string]interface{}) interface{} { | ||
| v, _ := fqkGet(m, container) | ||
| return v | ||
| } | ||
|
|
||
| func fqkGet(m meta.Definition, container map[string]interface{}) (interface{}, bool) { | ||
| v, found := container[m.Ident()] | ||
| if !found { | ||
| mod := meta.OriginalModule(m) | ||
| v, found = container[fmt.Sprintf("%s:%s", mod.Ident(), m.Ident())] | ||
| } | ||
| return v, found | ||
| } | ||
|
|
||
| func ContainerReader(container map[string]interface{}) node.Node { | ||
| s := &Basic{} | ||
| var divertedList node.Node | ||
| s.OnChoose = func(state *node.Selection, choice *meta.Choice) (m *meta.ChoiceCase, err error) { | ||
| // go thru each case and if there are any properties in the data that are not | ||
| // part of the meta, that disqualifies that case and we move onto next case | ||
| // until one case aligns with data. If no cases align then input in inconclusive | ||
| // i.e. non-discriminating and we should error out. | ||
| for _, kase := range choice.Cases() { | ||
| for _, prop := range kase.DataDefinitions() { | ||
| if _, found := fqkGet(prop, container); found { | ||
| return kase, nil | ||
| } | ||
| // just because you didn't find a property doesnt | ||
| // mean it's invalid, it's only if you don't find any | ||
| // of the properties of a case | ||
| } | ||
| } | ||
| // just because you didn't find any properties of any cases doesn't | ||
| // mean it's invalid, just that *none* of the cases are there. | ||
| return nil, nil | ||
| } | ||
| s.OnChild = func(r node.ChildRequest) (child node.Node, e error) { | ||
| if r.New { | ||
| panic("Cannot write to reader") | ||
| } | ||
| if value, found := fqkGet(r.Meta, container); found { | ||
| if meta.IsList(r.Meta) { | ||
| list, ok := value.([]interface{}) | ||
| if !ok { | ||
| // With XML a list with one element will be of type map[string]interface{} and not []interface{} | ||
| return ListReader([]interface{}{value.(map[string]interface{})}), nil | ||
| } else { | ||
| return ListReader(list), nil | ||
| } | ||
| } | ||
| return ContainerReader(value.(map[string]interface{})), nil | ||
| } | ||
| return | ||
| } | ||
| s.OnField = func(r node.FieldRequest, hnd *node.ValueHandle) (err error) { | ||
| if r.Write { | ||
| panic("Cannot write to reader") | ||
| } | ||
| if val, found := fqkGet(r.Meta, container); found { | ||
| hnd.Val, err = leafOrLeafListReader(r.Meta, val) | ||
| } | ||
| return | ||
| } | ||
| s.OnNext = func(r node.ListRequest) (node.Node, []val.Value, error) { | ||
| if divertedList != nil { | ||
| return nil, nil, nil | ||
| } | ||
| // divert to list handler | ||
| foundValues, found := fqkGet(r.Meta, container) | ||
| list, ok := foundValues.([]interface{}) | ||
| if len(container) != 1 || !found || !ok { | ||
| msg := fmt.Sprintf("Expected { %s: [] }", r.Meta.Ident()) | ||
| return nil, nil, errors.New(msg) | ||
| } | ||
| divertedList = ListReader(list) | ||
| s.OnNext = divertedList.Next | ||
| return divertedList.Next(r) | ||
| } | ||
| return s | ||
| } | ||
|
|
||
| func KeyMatches(keyFields []meta.Leafable, candidate map[string]interface{}, key []val.Value) bool { | ||
| for i, field := range keyFields { | ||
| if fqkGetOrNil(field, candidate) != key[i].String() { | ||
| return false | ||
| } | ||
| } | ||
| return true | ||
| } |
Oops, something went wrong.