feat:(uniast) add more RelationType (#36)

* feat: add more relations on node graph

* AddRelation

* feat: add relation Groups

* fix

* update Uniast to v0.1.1

* add version const

Author: AsterDY

docs/uniast-zh.md

@@ -1,4 +1,4 @@
-# Universal Abstract-Syntax-Tree Specification (v0.1.0)
+# Universal Abstract-Syntax-Tree Specification (v0.1.1)
 
 Universal Abstract-Syntax-Tree 是 ABCoder 建立的一种LLM亲和、语言无关的代码上下文数据结构，表示某个仓库代码的统一抽象语法树。收集了语言实体（函数、类型、常（变）量）的 定义 及其 相互依赖关系，用于后续的 AI 理解、coding-workflow 开发。
 
@@ -526,6 +526,16 @@ Universal Abstract-Syntax-Tree 是 ABCoder 建立的一种LLM亲和、语言无
 
 - Content：定义代码，如 `var A int = 1 `
 
+- Dependencies：复杂变量声明体中依赖的其他节点，如 
+```go
+var x = getx(y db.Data) int {
+    return y + model.Var2
+}
+```
+中的 `db.Data` 和 `model.Var2`
+
+- Groups: 同组定义， 如 Go 中的 `const( A=1, B=2, C=3)`，Groups 为 `[C=3, B=2]`（假设A为变量自身）
+
 
 ### Graph
 
@@ -570,7 +580,12 @@ Universal Abstract-Syntax-Tree 是 ABCoder 建立的一种LLM亲和、语言无
             "Name": "InitDefaultManager",
             "Line": 3
         }
-    ]
+    ],
+    "Dependencies": [],
+    "References": [],
+    "Implements": [],
+    "Inherits": [],
+    "Groups": []
 }
 ```
 
@@ -623,9 +638,7 @@ const (
 
 #### Relation
 
-用于存储两个节点之间的关系。
-
-
+用于存储两个节点之间的关系。示例如下：
 ```
 {
     "Kind": "Dependency",
@@ -638,7 +651,14 @@ const (
 }
 ```
 
-- Kind： 关系类型，目前包括 Dependency 和 Reference，分别表示依赖和引用。
+- Kind： 关系类型，目前包括：
+  - Dependency：依赖关系，如函数调用、变量引用等
+
+  - Implement：实现关系，如接口方法实现等
+
+  - Inherit：继承关系，如结构体字段等
+
+  - Group：同组定义，如 Go 中的 `const( A=1; B=2; C=3)`
 
 
 - ModPath: 模块路径，见【Identity】介绍

lang/golang/parser/file.go

@@ -58,16 +58,34 @@ func (p *GoParser) parseFile(ctx *fileContext, f *ast.File) error {
 				for _, spec := range decl.Specs {
 					vspec, ok := spec.(*ast.ValueSpec)
 					if ok {
-						_, firstVal = p.parseVar(ctx, vspec, false, nil, firstVal, doc)
+						_, _, firstVal = p.parseVar(ctx, vspec, false, nil, firstVal, doc)
 					}
 				}
 			case token.CONST:
-				var firstType *Identity
-				var firstVal *float64
+				var curType *Identity
+				var curVal *float64
+				var vars []*Var
+				var v *Var
 				for _, spec := range decl.Specs {
 					vspec, ok := spec.(*ast.ValueSpec)
 					if ok {
-						firstType, firstVal = p.parseVar(ctx, vspec, true, firstType, firstVal, doc)
+						curType, v, curVal = p.parseVar(ctx, vspec, true, curType, curVal, doc)
+						if v != nil {
+							vars = append(vars, v)
+						}
+					}
+				}
+				if len(vars) > 1 {
+					// exclude self and add other vars to Var.Groups
+					for i, v := range vars {
+						gps := make([]Identity, 0, len(vars)-1)
+						for j, v2 := range vars {
+							if i == j {
+								continue
+							}
+							gps = append(gps, v2.Identity)
+						}
+						v.Groups = gps
 					}
 				}
 			}
@@ -87,9 +105,10 @@ func (p *GoParser) newVar(mod string, pkg string, name string, isConst bool) *Va
 	return p.repo.SetVar(ret.Identity, ret)
 }
 
-func (p *GoParser) parseVar(ctx *fileContext, vspec *ast.ValueSpec, isConst bool, lastType *Identity, lastValue *float64, doc *ast.CommentGroup) (*Identity, *float64) {
+func (p *GoParser) parseVar(ctx *fileContext, vspec *ast.ValueSpec, isConst bool, lastType *Identity, lastValue *float64, doc *ast.CommentGroup) (*Identity, *Var, *float64) {
 	var typ *Identity
 	var val *ast.Expr
+	var v *Var
 	for i, name := range vspec.Names {
 		if name.Name == "_" {
 			// igore anonymous var
@@ -98,7 +117,7 @@ func (p *GoParser) parseVar(ctx *fileContext, vspec *ast.ValueSpec, isConst bool
 		if vspec.Values != nil {
 			val = &vspec.Values[i]
 		}
-		v := p.newVar(ctx.module.Name, ctx.pkgPath, name.Name, isConst)
+		v = p.newVar(ctx.module.Name, ctx.pkgPath, name.Name, isConst)
 		v.FileLine = ctx.FileLine(vspec)
 		if vspec.Type != nil {
 			ti := ctx.GetTypeInfo(vspec.Type)
@@ -198,7 +217,7 @@ func (p *GoParser) parseVar(ctx *fileContext, vspec *ast.ValueSpec, isConst bool
 
 		typ = v.Type
 	}
-	return typ, lastValue
+	return typ, v, lastValue
 }
 
 // newFunc allocate a function in the repo
@@ -552,7 +571,10 @@ func (p *GoParser) parseInterface(ctx *fileContext, name *ast.Ident, decl *ast.I
 	if obj := ctx.pkgTypeInfo.Defs[name]; obj != nil {
 		if named, ok := obj.Type().(*types.Named); ok {
 			iface := named.Underlying().(*types.Interface)
-			p.interfaces[iface] = st.Identity
+			// exclude empty interface
+			if !iface.Empty() {
+				p.interfaces[iface] = st.Identity
+			}
 		}
 	}
 

lang/parse.go

@@ -86,6 +86,8 @@ func Parse(ctx context.Context, uri string, args ParseOptions) ([]byte, error) {
 		repo.Name = args.RepoID
 	}
 
+	repo.ASTVersion = uniast.Version
+
 	out, err := json.Marshal(repo)
 	if err != nil {
 		log.Error("Failed to marshal repository: %v\n", err)

lang/uniast/ast.go

@@ -71,9 +71,10 @@ type NodeGraph map[string]*Node
 
 // Repository
 type Repository struct {
-	Name    string             `json:"id"` // module name
-	Modules map[string]*Module // module name => module
-	Graph   NodeGraph          // node id => node
+	Name       string             `json:"id"` // module name
+	Modules    map[string]*Module // module name => module
+	Graph      NodeGraph          // node id => node
+	ASTVersion string
 }
 
 func (r Repository) ID() string {
@@ -92,9 +93,10 @@ func (r Repository) InternalModules() []*Module {
 
 func NewRepository(name string) Repository {
 	ret := Repository{
-		Name:    name,
-		Modules: map[string]*Module{},
-		Graph:   map[string]*Node{},
+		Name:       name,
+		Modules:    map[string]*Module{},
+		Graph:      map[string]*Node{},
+		ASTVersion: Version,
 	}
 	return ret
 }
@@ -519,10 +521,10 @@ type Type struct {
 	FileLine
 	Content string // struct declaration content
 
-	// field type (not include basic types), type name => type id
+	// field type, type name => type id
 	SubStruct []Dependency `json:",omitempty"`
 
-	// inline field type (not include basic types)
+	// inherit field type
 	InlineStruct []Dependency `json:",omitempty"`
 
 	// methods defined on the Struct, not including inlined type's method
@@ -547,6 +549,8 @@ type Var struct {
 	Type         *Identity `json:",omitempty"`
 	Content      string
 	Dependencies []Dependency `json:",omitempty"`
+	// Groups means the var is a group of vars, like Enum in Go
+	Groups []Identity `json:",omitempty"`
 
 	CompressData *string `json:"compress_data,omitempty"`
 }

lang/uniast/node.go

@@ -82,19 +82,42 @@ func (r *Repository) SetNode(id Identity, typ NodeType) *Node {
 
 func calOffset(ref, dep FileLine) int {
 	refLine := dep.Line - ref.Line
-	if refLine < 0 {
-		return -1
+	if refLine <= 0 {
+		return 0
 	}
 	return refLine
 }
 
-func (r *Repository) AddRelation(node *Node, dep Identity, depFl FileLine) {
+func (r *Repository) AddRelation(node *Node, dep Identity, depFl FileLine, kinds ...RelationKind) {
 	line := calOffset(node.FileLine(), depFl)
-	node.Dependencies = InsertRelation(node.Dependencies, Relation{
-		Identity: dep,
-		Kind:     DEPENDENCY,
-		Line:     line,
-	})
+	for _, kind := range kinds {
+		if kind == DEPENDENCY {
+			node.Dependencies = InsertRelation(node.Dependencies, Relation{
+				Identity: dep,
+				Kind:     DEPENDENCY,
+				Line:     line,
+			})
+		} else if kind == IMPLEMENT {
+			node.Implements = InsertRelation(node.Implements, Relation{
+				Identity: dep,
+				Kind:     IMPLEMENT,
+				Line:     line,
+			})
+		} else if kind == INHERIT {
+			node.Inherits = InsertRelation(node.Inherits, Relation{
+				Identity: dep,
+				Kind:     INHERIT,
+				Line:     line,
+			})
+		} else if kind == GROUP {
+			node.Groups = InsertRelation(node.Groups, Relation{
+				Identity: dep,
+				Kind:     GROUP,
+				Line:     line,
+			})
+		}
+	}
+
 	key := dep.Full()
 	nd, ok := r.Graph[key]
 	if !ok {
@@ -104,11 +127,16 @@ func (r *Repository) AddRelation(node *Node, dep Identity, depFl FileLine) {
 		}
 		r.Graph[key] = nd
 	}
-	nd.References = InsertRelation(nd.References, Relation{
-		Identity: node.Identity,
-		Kind:     REFERENCE,
-		Line:     line,
-	})
+	for _, kind := range kinds {
+		if kind == DEPENDENCY {
+			nd.References = InsertRelation(nd.References, Relation{
+				Identity: node.Identity,
+				Kind:     DEPENDENCY,
+				Line:     line,
+			})
+		}
+	}
+
 	if f := r.GetFunction(dep); f != nil {
 		nd.Type = FUNC
 	} else if t := r.GetType(dep); t != nil {
@@ -137,36 +165,46 @@ func (r *Repository) BuildGraph() error {
 			for _, f := range pkg.Functions {
 				n := r.SetNode(f.Identity, FUNC)
 				for _, dep := range f.FunctionCalls {
-					r.AddRelation(n, dep.Identity, dep.FileLine)
+					r.AddRelation(n, dep.Identity, dep.FileLine, DEPENDENCY)
 				}
 				for _, dep := range f.MethodCalls {
-					r.AddRelation(n, dep.Identity, dep.FileLine)
+					r.AddRelation(n, dep.Identity, dep.FileLine, DEPENDENCY)
 				}
 				for _, dep := range f.Types {
-					r.AddRelation(n, dep.Identity, dep.FileLine)
+					r.AddRelation(n, dep.Identity, dep.FileLine, DEPENDENCY)
 				}
+				// NOTICE: We regard the receiver of a method as a dependency of the method
 				if f.Receiver != nil {
-					r.AddRelation(n, f.Receiver.Type, n.FileLine())
+					r.AddRelation(n, f.Receiver.Type, n.FileLine(), DEPENDENCY)
 				}
 				for _, dep := range f.GlobalVars {
-					r.AddRelation(n, dep.Identity, dep.FileLine)
+					r.AddRelation(n, dep.Identity, dep.FileLine, DEPENDENCY)
 				}
 			}
 
 			for _, t := range pkg.Types {
 				n := r.SetNode(t.Identity, TYPE)
 				for _, dep := range t.SubStruct {
-					r.AddRelation(n, dep.Identity, dep.FileLine)
+					r.AddRelation(n, dep.Identity, dep.FileLine, DEPENDENCY)
 				}
 				for _, dep := range t.InlineStruct {
-					r.AddRelation(n, dep.Identity, dep.FileLine)
+					r.AddRelation(n, dep.Identity, dep.FileLine, INHERIT)
+				}
+				for _, dep := range t.Implements {
+					r.AddRelation(n, dep, n.FileLine(), IMPLEMENT)
 				}
 			}
 
 			for _, v := range pkg.Vars {
 				n := r.SetNode(v.Identity, VAR)
 				if v.Type != nil {
-					r.AddRelation(n, *v.Type, v.FileLine)
+					r.AddRelation(n, *v.Type, v.FileLine, DEPENDENCY)
+				}
+				for _, dep := range v.Dependencies {
+					r.AddRelation(n, dep.Identity, dep.FileLine, DEPENDENCY)
+				}
+				for _, dep := range v.Groups {
+					r.AddRelation(n, dep, n.FileLine(), GROUP)
 				}
 			}
 		}
@@ -180,8 +218,12 @@ type RelationKind string
 const (
 	// DEPENDENCY: the target node is a dependency of the current node
 	DEPENDENCY RelationKind = "Dependency"
-	// REFERENCE: the target node is a reference of the current node
-	REFERENCE RelationKind = "Reference"
+	// IMPLEMENT: the target node is implemented by  the current node
+	IMPLEMENT RelationKind = "Implement"
+	// INHERIT: the target node is inherited by the current node
+	INHERIT RelationKind = "Inherit"
+	// GROUPT: the target is in same definition group of nodes, like `const(a=1,b=2)`
+	GROUP RelationKind = "Group"
 )
 
 // Relation between two nodes
@@ -191,7 +233,7 @@ type Relation struct {
 	// target node
 	Identity
 	// start line-offset of the target token related to the current node's codes
-	Line int
+	Line int `json:",omitempty"`
 	// information about this relation
 	Desc *string `json:",omitempty"`
 	// related codes representing this relation, comming from current node's codes
@@ -273,9 +315,15 @@ type Node struct {
 	// Node Type, must be one of FUNC, TYPE, VAR
 	Type NodeType
 	// other nodes that  depends on this node
-	Dependencies []Relation
-	// other nodes that reference this node
-	References []Relation
+	Dependencies []Relation `json:",omitempty"`
+	// other nodes that references this node
+	References []Relation `json:",omitempty"`
+	// other nodes this node implements
+	Implements []Relation `json:",omitempty"`
+	// other nodes this node inherits
+	Inherits []Relation `json:",omitempty"`
+	// other nodes in the same definition group
+	Groups []Relation `json:",omitempty"`
 	// the repo that this node belongs to
 	Repo *Repository `json:"-"`
 }

lang/uniast/version.go

@@ -0,0 +1,19 @@
+/**
+ * Copyright 2025 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
+ *
+ *     https://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 uniast
+
+const Version = "v0.1.1"