1 files changed, 11 insertions, 11 deletions
diff --git a/vendor/github.com/bytedance/sonic/ast/node.go b/vendor/github.com/bytedance/sonic/ast/node.go
index 9637659b1..ac6d22808 100644
--- a/vendor/github.com/bytedance/sonic/ast/node.go
+++ b/vendor/github.com/bytedance/sonic/ast/node.go
@@ -852,29 +852,29 @@ func (self *Node) IndexPair(idx int) *Pair {
 }
 
 func (self *Node) indexOrGet(idx int, key string) (*Node, int) {
-	if err := self.should(types.V_OBJECT, "an object"); err != nil {
-		return unwrapError(err), idx
-	}
+    if err := self.should(types.V_OBJECT, "an object"); err != nil {
+        return unwrapError(err), idx
+    }
 
-	pr := self.skipIndexPair(idx)
-	if pr != nil && pr.Key == key {
-		return &pr.Value, idx
-	}
+    pr := self.skipIndexPair(idx)
+    if pr != nil && pr.Key == key {
+        return &pr.Value, idx
+    }
 
-	return self.skipKey(key)
+    return self.skipKey(key)
 }
 
 // IndexOrGet firstly use idx to index a value and check if its key matches
 // If not, then use the key to search value
 func (self *Node) IndexOrGet(idx int, key string) *Node {
-	node, _ := self.indexOrGet(idx, key)
-	return node
+    node, _ := self.indexOrGet(idx, key)
+    return node
 }
 
 // IndexOrGetWithIdx attempts to retrieve a node by index and key, returning the node and its correct index.
 // If the key does not match at the given index, it searches by key and returns the node with its updated index.
 func (self *Node) IndexOrGetWithIdx(idx int, key string) (*Node, int) {
-	return self.indexOrGet(idx, key)
+    return self.indexOrGet(idx, key)
 }
 
 /** Generic Value Converters **/