d2ir

package

Go to main page

Versions in this module

v0

v0.6.8

Nov 7, 2024

Changes in this version

type Edge

+ func (e *Edge) ImportAST() d2ast.Node

+ func (e *Edge) SetImportAST(node d2ast.Node)

type Field

+ func (f *Field) ImportAST() d2ast.Node

+ func (f *Field) SetImportAST(node d2ast.Node)

+ type Importable interface

+ ImportAST func() d2ast.Node

+ SetImportAST func(d2ast.Node)

type Map

+ func (m *Map) FindBoardRoot(path []string) *Map

+ func (m *Map) ImportAST() d2ast.Node

+ func (m *Map) SetImportAST(node d2ast.Node)

v0.6.7

Sep 28, 2024

Changes in this version

+ func ExpandSubstitution(m, resolved *Map, placeholder *Field)

v0.6.6

Aug 2, 2024

v0.6.5

Apr 17, 2024

v0.6.4

Apr 11, 2024

v0.6.3

Dec 16, 2023

v0.6.2

Dec 7, 2023

v0.6.1

Sep 26, 2023

Changes in this version

+ func ParentShape(n Node) string

type Array

+ func (n *Array) LastPrimaryRef() Reference

type CompileOptions

+ UTF16Pos bool

type Edge

+ func (e *Edge) IDString() string

+ func (e *Edge) LastPrimaryRef() Reference

type EdgeReference

+ Context_ *RefContext

+ DueToGlob_ bool

+ DueToLazyGlob_ bool

+ func (r *EdgeReference) DueToGlob() bool

+ func (r *EdgeReference) DueToLazyGlob() bool

type Field

+ func (f *Field) LastPrimaryRef() Reference

type FieldReference

+ Context_ *RefContext

+ DueToGlob_ bool

+ DueToLazyGlob_ bool

+ func (r *FieldReference) DueToGlob() bool

+ func (r *FieldReference) DueToLazyGlob() bool

type Map

+ func (n *Map) LastPrimaryRef() Reference

type Node

+ LastPrimaryRef func() Reference

type RefContext

+ func (rc *RefContext) Equal(rc2 *RefContext) bool

type Reference

+ Context func() *RefContext

+ DueToGlob func() bool

+ DueToLazyGlob func() bool

type Scalar

+ func (n *Scalar) LastPrimaryRef() Reference

v0.6.0

Jul 31, 2023

Changes in this version

+ func IsVar(n Node) bool

+ func RelIDA(p, n Node) (ida []string)

type Array

+ func (a *Array) AST() d2ast.Node

type Edge

+ func (e *Edge) AST() d2ast.Node

type EdgeID

+ Glob bool

type Field

+ func (f *Field) AST() d2ast.Node

type Map

+ func (m *Map) AST() d2ast.Node

+ func (m *Map) DeleteEdge(eid *EdgeID) *Edge

+ func (m *Map) IsContainer() bool

type Node

+ AST func() d2ast.Node

type RefContext

+ ScopeAST *d2ast.Map

type Scalar

+ func (s *Scalar) AST() d2ast.Node

v0.5.1

Jun 10, 2023

v0.5.0

Jun 9, 2023

Changes in this version

+ type CompileOptions struct

+ FS fs.FS

+ UTF16 bool

v0.4.2

May 2, 2023

Changes in this version

type Map

+ func (m *Map) InClass(key *d2ast.Key) bool

+ func (m *Map) IsClass() bool

v0.4.1

Apr 18, 2023

v0.4.0

Apr 9, 2023

Changes in this version

type Map

+ func RootMap(m *Map) *Map

+ func (m *Map) GetClassMap(name string) *Map

v0.3.0

Mar 30, 2023

v0.2.6

Mar 18, 2023

v0.2.5

Mar 16, 2023

v0.2.4

Mar 7, 2023

Changes in this version

+ func BoardIDA(n Node) (ida []string)

v0.2.2

Feb 28, 2023

Changes in this version

type Array

+ func (a *Array) Equal(n2 Node) bool

type Edge

+ func (e *Edge) Equal(n2 Node) bool

type Field

+ func (f *Field) Equal(n2 Node) bool

type Map

+ func (m *Map) Equal(n2 Node) bool

type Node

+ Equal func(n2 Node) bool

v0.2.1

Feb 24, 2023

v0.2.0

Feb 13, 2023

Changes in this version

+ func IDA(n Node) (ida []string)

+ func OverlayEdge(be, oe *Edge)

+ func OverlayField(bf, of *Field)

+ func OverlayMap(base, overlay *Map)

+ type Array struct

+ Values []Value

+ func (a *Array) Copy(newParent Node) Node

+ func (n *Array) LastPrimaryKey() *d2ast.Key

+ func (n *Array) LastRef() Reference

+ func (n *Array) Map() *Map

+ func (n *Array) Parent() Node

+ func (n *Array) Primary() *Scalar

+ func (n *Array) String() string

+ type BoardKind string

+ const BoardLayer

+ const BoardScenario

+ const BoardStep

+ func NodeBoardKind(n Node) BoardKind

+ type Composite interface

+ type Edge struct

+ ID *EdgeID

+ Map_ *Map

+ Primary_ *Scalar

+ References []*EdgeReference

+ func ParentEdge(n Node) *Edge

+ func (e *Edge) Copy(newParent Node) Node

+ func (e *Edge) LastPrimaryKey() *d2ast.Key

+ func (e *Edge) LastRef() Reference

+ func (n *Edge) Map() *Map

+ func (n *Edge) Parent() Node

+ func (n *Edge) Primary() *Scalar

+ func (n *Edge) String() string

+ type EdgeID struct

+ DstArrow bool

+ DstPath []string

+ Index *int

+ SrcArrow bool

+ SrcPath []string

+ func NewEdgeIDs(k *d2ast.Key) (eida []*EdgeID)

+ func (eid *EdgeID) Copy() *EdgeID

+ func (eid *EdgeID) Match(eid2 *EdgeID) bool

+ type EdgeReference struct

+ Context *RefContext

+ func (er *EdgeReference) AST() d2ast.Node

+ func (er *EdgeReference) Primary() bool

+ type Field struct

+ Composite Composite

+ Name string

+ Primary_ *Scalar

+ References []*FieldReference

+ func ParentField(n Node) *Field

+ func (f *Field) Copy(newParent Node) Node

+ func (f *Field) LastPrimaryKey() *d2ast.Key

+ func (f *Field) LastRef() Reference

+ func (f *Field) Root() bool

+ func (n *Field) Map() *Map

+ func (n *Field) Parent() Node

+ func (n *Field) Primary() *Scalar

+ func (n *Field) String() string

+ type FieldReference struct

+ Context *RefContext

+ KeyPath *d2ast.KeyPath

+ String d2ast.String

+ func (fr *FieldReference) AST() d2ast.Node

+ func (fr *FieldReference) EdgeDest() bool

+ func (fr *FieldReference) InEdge() bool

+ func (fr *FieldReference) KeyPathIndex() int

+ func (fr *FieldReference) Primary() bool

+ type Map struct

+ Edges []*Edge

+ Fields []*Field

+ func Compile(ast *d2ast.Map) (*Map, error)

+ func ParentMap(n Node) *Map

+ func (m *Map) Copy(newParent Node) Node

+ func (m *Map) CopyBase(newParent Node) *Map

+ func (m *Map) CreateEdge(eid *EdgeID, refctx *RefContext) (*Edge, error)

+ func (m *Map) DeleteField(ida ...string) *Field

+ func (m *Map) EdgeCountRecursive() int

+ func (m *Map) EnsureField(kp *d2ast.KeyPath, refctx *RefContext) (*Field, error)

+ func (m *Map) FieldCountRecursive() int

+ func (m *Map) GetEdges(eid *EdgeID) []*Edge

+ func (m *Map) GetField(ida ...string) *Field

+ func (m *Map) Query(idStr string) (Node, error)

+ func (m *Map) QueryAll(idStr string) (na []Node, _ error)

+ func (m *Map) Root() bool

+ func (n *Map) LastPrimaryKey() *d2ast.Key

+ func (n *Map) LastRef() Reference

+ func (n *Map) Map() *Map

+ func (n *Map) Parent() Node

+ func (n *Map) Primary() *Scalar

+ func (n *Map) String() string

+ type Node interface

+ Copy func(newParent Node) Node

+ LastPrimaryKey func() *d2ast.Key

+ LastRef func() Reference

+ Map func() *Map

+ Parent func() Node

+ Primary func() *Scalar

+ func ParentBoard(n Node) Node

+ type RefContext struct

+ Edge *d2ast.Edge

+ Key *d2ast.Key

+ Scope *d2ast.Map

+ ScopeMap *Map

+ func (rc *RefContext) Copy() *RefContext

+ func (rc *RefContext) EdgeIndex() int

+ type Reference interface

+ AST func() d2ast.Node

+ Primary func() bool

+ type Scalar struct

+ Value d2ast.Scalar

+ func (n *Scalar) LastPrimaryKey() *d2ast.Key

+ func (n *Scalar) LastRef() Reference

+ func (n *Scalar) Map() *Map

+ func (n *Scalar) Parent() Node

+ func (n *Scalar) Primary() *Scalar

+ func (n *Scalar) String() string

+ func (s *Scalar) Copy(newParent Node) Node

+ func (s *Scalar) Equal(s2 *Scalar) bool

+ type Value interface

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