mirror of
https://github.com/ii64/sonic.git
synced 2026-06-21 00:46:43 +08:00
8405d84e31
* opt: only skip one value when call Iterator.HasNext() * feat: V_NONE supports Set() and Add() * feat: add node type V_ANY * feat: ast.Node implements `json.Unmarshaler` * fmt: use space instead of tab for indent * feat: node V_ANY cast to Bool()\Int64()\Float64()\String()\Number()\Map()\Array()Interface() * feat: V_NULL supports Set() and Add() Co-authored-by: duanyi.aster <duanyi.aster@bytedance.com>
99 lines
2.6 KiB
Go
99 lines
2.6 KiB
Go
/*
|
|
* Copyright 2021 ByteDance Inc.
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
package ast
|
|
|
|
import (
|
|
`github.com/bytedance/sonic/internal/native/types`
|
|
)
|
|
|
|
type Pair struct {
|
|
Key string
|
|
Value Node
|
|
}
|
|
|
|
// Values returns iterator for array's children traversal
|
|
func (self *Node) Values() (ListIterator, error) {
|
|
if err := self.should(types.V_ARRAY, "an array"); err != nil {
|
|
return ListIterator{}, err
|
|
}
|
|
return ListIterator{Iterator{p: self}}, nil
|
|
}
|
|
|
|
// Properties returns iterator for object's children traversal
|
|
func (self *Node) Properties() (ObjectIterator, error) {
|
|
if err := self.should(types.V_OBJECT, "an object"); err != nil {
|
|
return ObjectIterator{}, err
|
|
}
|
|
return ObjectIterator{Iterator{p: self}}, nil
|
|
}
|
|
|
|
type Iterator struct {
|
|
i int
|
|
p *Node
|
|
}
|
|
|
|
func (self *Iterator) Pos() int {
|
|
return self.i
|
|
}
|
|
|
|
func (self *Iterator) Len() int {
|
|
return self.p.len()
|
|
}
|
|
|
|
// HasNext reports if it is the end of iteration or has error.
|
|
func (self *Iterator) HasNext() bool {
|
|
if !self.p.isLazy() {
|
|
return self.p.Valid() && self.i < self.p.len()
|
|
} else if self.p.t == _V_ARRAY_LAZY {
|
|
return self.p.skipNextNode().Valid()
|
|
} else if self.p.t == _V_OBJECT_LAZY {
|
|
return self.p.skipNextPair().Value.Valid()
|
|
}
|
|
return false
|
|
}
|
|
|
|
// ListIterator is specialized iterator for V_ARRAY
|
|
type ListIterator struct {
|
|
Iterator
|
|
}
|
|
|
|
// ObjectIterator is specialized iterator for V_ARRAY
|
|
type ObjectIterator struct {
|
|
Iterator
|
|
}
|
|
|
|
// Next scans through children of underlying V_ARRAY,
|
|
// copies each child to v, and returns .HasNext().
|
|
func (self *ListIterator) Next(v *Node) bool {
|
|
if !self.HasNext() {
|
|
return false
|
|
} else {
|
|
*v, self.i = *self.p.nodeAt(self.i), self.i + 1
|
|
return true
|
|
}
|
|
}
|
|
|
|
// Next scans through children of underlying V_OBJECT,
|
|
// copies each child to v, and returns .HasNext().
|
|
func (self *ObjectIterator) Next(p *Pair) bool {
|
|
if !self.HasNext() {
|
|
return false
|
|
} else {
|
|
*p, self.i = *self.p.pairAt(self.i), self.i + 1
|
|
return true
|
|
}
|
|
}
|