type golang.org/x/tools/go/ast/edge.Kind
16 uses
golang.org/x/tools/go/ast/edge (current package)
edge.go#L16: type Kind uint8
edge.go#L19: func (k Kind) String() string {
edge.go#L28: func (k Kind) NodeType() reflect.Type { return fieldInfos[k].nodeType }
edge.go#L31: func (k Kind) FieldName() string { return fieldInfos[k].name }
edge.go#L34: func (k Kind) FieldType() reflect.Type { return fieldInfos[k].fieldType }
edge.go#L39: func (k Kind) Get(n ast.Node, idx int) ast.Node {
edge.go#L58: Invalid Kind = iota // for nodes at the root of the traversal
golang.org/x/tools/go/ast/inspector
cursor.go#L239: func (c Cursor) ParentEdge() (edge.Kind, int) {
cursor.go#L249: func (c Cursor) ParentEdgeKind() edge.Kind {
cursor.go#L268: func (c Cursor) ChildAt(k edge.Kind, idx int) Cursor {
inspector.go#L59: func packEdgeKindAndIndex(ek edge.Kind, index int) int32 {
inspector.go#L65: func unpackEdgeKindAndIndex(x int32) (edge.Kind, int) {
inspector.go#L69: return edge.Kind(x & 0x7f), int(x>>7) - 1
inspector.go#L265: func (v *visitor) push(ek edge.Kind, eindex int, node ast.Node) {
walk.go#L19: func walkList[N ast.Node](v *visitor, ek edge.Kind, list []N) {
walk.go#L25: func walk(v *visitor, ek edge.Kind, index int, node ast.Node) {