forked from yourheropaul/inj
-
Notifications
You must be signed in to change notification settings - Fork 0
/
graph_provide.go
51 lines (38 loc) · 1.31 KB
/
graph_provide.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
package inj
import "reflect"
// Insert zero or more objected into the graph, and then attempt to wire up any unmet
// dependencies in the graph.
//
// As explained in the main documentation (https://godoc.org/github.com/yourheropaul/inj),
// a graph consists of what is essentially a map of types to values. If the same type is
// provided twice with different values, the *last* value will be stored in the graph.
func (g *Graph) Provide(inputs ...interface{}) error {
for _, input := range inputs {
// Get reflection types
mtype, stype := getReflectionTypes(input)
// Assign a node in the graph
n := g.add(mtype)
// Populate the new node
n.Object = input
n.Type = mtype
n.Value = reflect.ValueOf(input)
n.Name = identifier(stype)
// For structs, find dependencies
if stype.Kind() == reflect.Struct {
var basePath = emptyStructPath()
findDependencies(stype, &n.Dependencies, &basePath)
}
}
///////////////////////////////////////////////
// Plug everything together
///////////////////////////////////////////////
g.connect()
///////////////////////////////////////////////
// Store a list of types for speed later on
///////////////////////////////////////////////
g.indexes = make([]reflect.Type, 0)
for typ, _ := range g.nodes {
g.indexes = append(g.indexes, typ)
}
return nil
}