NodeFromNodePb Create a node from pb
(n *NodePb)
| 2038 | |
| 2039 | // NodeFromNodePb Create a node from pb |
| 2040 | func NodeFromNodePb(n *NodePb) Node { |
| 2041 | if n == nil { |
| 2042 | return nil |
| 2043 | } |
| 2044 | switch { |
| 2045 | case n.Bn != nil: |
| 2046 | var bn *BinaryNode |
| 2047 | return bn.FromPB(n) |
| 2048 | case n.Booln != nil: |
| 2049 | var bn *BooleanNode |
| 2050 | return bn.FromPB(n) |
| 2051 | case n.Un != nil: |
| 2052 | var un *UnaryNode |
| 2053 | return un.FromPB(n) |
| 2054 | case n.Fn != nil: |
| 2055 | var fn *FuncNode |
| 2056 | return fn.FromPB(n) |
| 2057 | case n.Tn != nil: |
| 2058 | var tn *TriNode |
| 2059 | return tn.FromPB(n) |
| 2060 | case n.An != nil: |
| 2061 | var an *ArrayNode |
| 2062 | return an.FromPB(n) |
| 2063 | case n.Nn != nil: |
| 2064 | var nn *NumberNode |
| 2065 | return nn.FromPB(n) |
| 2066 | case n.Vn != nil: |
| 2067 | var vn *ValueNode |
| 2068 | return vn.FromPB(n) |
| 2069 | case n.In != nil: |
| 2070 | var in *IdentityNode |
| 2071 | return in.FromPB(n) |
| 2072 | case n.Sn != nil: |
| 2073 | var sn *StringNode |
| 2074 | return sn.FromPB(n) |
| 2075 | case n.Incn != nil: |
| 2076 | var in *IncludeNode |
| 2077 | return in.FromPB(n) |
| 2078 | case n.Niln != nil: |
| 2079 | return &NullNode{} |
| 2080 | } |
| 2081 | return nil |
| 2082 | } |
| 2083 | func NodesFromNodesPbPtr(pb []*NodePb) []Node { |
| 2084 | nodes := make([]Node, len(pb)) |
| 2085 | for i, pbn := range pb { |
no test coverage detected