computationalgraph

package
v0.0.4 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Oct 14, 2023 License: Apache-2.0 Imports: 1 Imported by: 0

Documentation

Overview

Package computationalgraph

I. Introduction

Package computationalgraph is used to traverse an AST and build a graph of the simplified computation of the AST.

II. Usage

Graphs yielded by this package can then be traversed to check e.g. that a di.Value is not used before being set.

III. Notes

  • We can recursively traverse an AST to build the graph

  • How do we mark/recognize that a func argument has a reference to a di.Value

  • What if a di.Value is an attribute of a struct? We should be able to mark the struct as a holder of a reference to a di.Value

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type Assignment

type Assignment struct{}

type AssociatedFuncCall

type AssociatedFuncCall struct {
	Meta astutil.Meta

	Args                []FuncArgs
	AssociatedFuncIdent astutil.Ident
}

type ForLoop

type ForLoop struct {
	Meta astutil.Meta
}

type FuncArgs

type FuncArgs struct{}

type FuncCall

type FuncCall struct {
	Meta astutil.Meta

	FuncIdent astutil.Ident
	Args      []FuncArgs
}

type IfBranch

type IfBranch struct {
	Meta astutil.Meta
}

type Struct

type Struct struct {
	Ident astutil.Ident

	Attr []StructAttr
}

type StructAttr

type StructAttr struct {
}

type SwitchBranch

type SwitchBranch struct {
	Meta astutil.Meta
}

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL