Package com.google.gwt.inject.rebind.binding

Examples of com.google.gwt.inject.rebind.binding.Dependency

116
117
118
119
120
121
122
123
    addImplicitBinding(untargettedBinding);
    return null;
  }

  private void addImplicitBinding(Element sourceElement) {
    bindingsCollection.addDependency(new Dependency(Dependency.GINJECTOR, targetKey,
        Context.forElement(sourceElement).toString()));
  }
View Full Code Here
636
637
638
639
640
641
642
       
    replayAndResolve(tree.childLL, required(Dependency.GINJECTOR, foo()));
  }
   
  private Dependency required(Key<?> source, Key<?> key) {
    return new Dependency(source, key, SOURCE);
  }
View Full Code Here
640
641
642
643
644
645
646
  private Dependency required(Key<?> source, Key<?> key) {
    return new Dependency(source, key, SOURCE);
  }
 
  private Dependency optional(Key<?> source, Key<?> key) {
    return new Dependency(source, key, true, false, SOURCE);
  }
View Full Code Here
644
645
646
647
648
649
650
  private Dependency optional(Key<?> source, Key<?> key) {
    return new Dependency(source, key, true, false, SOURCE);
  }
 
  private Dependency requiredLazy(Key<?> source, Key<?> key) {
    return new Dependency(source, key, false, true, SOURCE);
  }
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
    origin = control.createMock(GinjectorBindings.class);
  }
 
  public void testFindAnyPath() throws Exception {
    DependencyGraph graph = new DependencyGraph.Builder(origin)
        .addEdge(new Dependency(Dependency.GINJECTOR, foo(), SOURCE))
        .addEdge(new Dependency(foo(), bar(), SOURCE))
        .addEdge(new Dependency(bar(), baz(), SOURCE))
        .build();
    control.replay();
    assertEquals(
        TestUtils.dependencyList(
            new Dependency(Dependency.GINJECTOR, foo(), SOURCE),
            new Dependency(foo(), bar(), SOURCE),
            new Dependency(bar(), baz(), SOURCE)),
        new PathFinder().onGraph(graph)
            .addRoots(Dependency.GINJECTOR)
            .addDestinations(baz()).findShortestPath());
    control.verify();
  }
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
    control.verify();
  }
 
  public void testFindShortestPath() throws Exception {
    DependencyGraph graph = new DependencyGraph.Builder(origin)
        .addEdge(new Dependency(Dependency.GINJECTOR, foo(), SOURCE))
        .addEdge(new Dependency(foo(), bar(), SOURCE))
        .addEdge(new Dependency(bar(), baz(), SOURCE))
        .addEdge(new Dependency(foo(), baz(), SOURCE)) // we should use the "shortcut" to baz
        .build();
    control.replay();
    assertEquals(
        TestUtils.dependencyList(
            new Dependency(Dependency.GINJECTOR, foo(), SOURCE),
            new Dependency(foo(), baz(), SOURCE)),
        new PathFinder().onGraph(graph)
            .addRoots(Dependency.GINJECTOR)
            .addDestinations(baz()).findShortestPath());
    control.verify();
  }
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
    control.verify();
  }
 
  public void testFindShortestPath_MultipleDestinations() throws Exception {
    DependencyGraph graph = new DependencyGraph.Builder(origin)
        .addEdge(new Dependency(Dependency.GINJECTOR, foo(), SOURCE))
        .addEdge(new Dependency(foo(), bar(), SOURCE))
        .addEdge(new Dependency(bar(), baz(), SOURCE))
        .build();
    control.replay();
    assertEquals(
        TestUtils.dependencyList(
            new Dependency(Dependency.GINJECTOR, foo(), SOURCE),
            new Dependency(foo(), bar(), SOURCE)),
        new PathFinder().onGraph(graph)
            .addRoots(Dependency.GINJECTOR)
            .addDestinations(baz(), bar()).findShortestPath());
    control.verify();
  }
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
    control.verify();
  }
 
  public void testPathInUnresolved() throws Exception {
    DependencyGraph graph = new DependencyGraph.Builder(origin)
        .addEdge(new Dependency(Dependency.GINJECTOR, foo(), SOURCE))
        .addEdge(new Dependency(Dependency.GINJECTOR, baz(), SOURCE))
        .addEdge(new Dependency(foo(), bar(), SOURCE))
        .addEdge(new Dependency(bar(), baz(), SOURCE))
        .addEdge(new Dependency(foo(), baz(), SOURCE))
        .build();
    control.replay();
    assertEquals(
        TestUtils.dependencyList(
            new Dependency(Dependency.GINJECTOR, baz(), SOURCE)),
        new PathFinder().onGraph(graph)
            .addRoots(Dependency.GINJECTOR)
            .addDestinations(baz()).findShortestPath());
    control.verify();
  }
View Full Code Here
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
    control.verify();
  }
 
  public void testRequiredPath_OptionalInPath() throws Exception {
    DependencyGraph graph = new DependencyGraph.Builder(origin)
        .addEdge(new Dependency(Dependency.GINJECTOR, foo(), SOURCE))
        .addEdge(new Dependency(foo(), bar(), SOURCE))
        .addEdge(new Dependency(bar(), baz(), SOURCE))
        .addEdge(new Dependency(foo(), baz(), true, false, SOURCE)) // avoid optional short-cut
        .build();
    control.replay();
    assertEquals(
        TestUtils.dependencyList(
            new Dependency(Dependency.GINJECTOR, foo(), SOURCE),
            new Dependency(foo(), bar(), SOURCE),
            new Dependency(bar(), baz(), SOURCE)),
        new PathFinder().onGraph(graph)
            .addRoots(Dependency.GINJECTOR)
            .addDestinations(baz())
            .withOnlyRequiredEdges(true).findShortestPath());
    control.verify();
View Full Code Here
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
    control.verify();
  }
 
  public void testRequiredPath_OptionalInUnresolved() throws Exception {
    DependencyGraph graph = new DependencyGraph.Builder(origin)
        .addEdge(new Dependency(Dependency.GINJECTOR, foo(), SOURCE))
        .addEdge(new Dependency(Dependency.GINJECTOR, baz(), true, false, SOURCE))
        .addEdge(new Dependency(foo(), bar(), SOURCE))
        .addEdge(new Dependency(bar(), baz(), SOURCE))
        .build();
    control.replay();
    assertEquals(
        TestUtils.dependencyList(
            new Dependency(Dependency.GINJECTOR, foo(), SOURCE),
            new Dependency(foo(), bar(), SOURCE),
            new Dependency(bar(), baz(), SOURCE)),
        new PathFinder().onGraph(graph)
            .addRoots(Dependency.GINJECTOR)
            .addDestinations(baz())
            .withOnlyRequiredEdges(true).findShortestPath());
    control.verify();
View Full Code Here
TOP

Related Classes of com.google.gwt.inject.rebind.binding.Dependency

  • com.google.gwt.inject.rebind.GinjectorBindings
  • com.google.gwt.inject.rebind.GuiceBindingVisitor
  • com.google.gwt.inject.rebind.resolution.BindingInstallerTest
  • com.google.gwt.inject.rebind.resolution.BindingPositionerTest
  • com.google.gwt.inject.rebind.resolution.BindingResolverTest
  • com.google.gwt.inject.rebind.resolution.DependencyExplorerTest
  • com.google.gwt.inject.rebind.resolution.EagerCycleFinder
  • com.google.gwt.inject.rebind.resolution.EagerCycleFinderTest
  • com.google.gwt.inject.rebind.resolution.PathFinder
  • com.google.gwt.inject.rebind.resolution.PathFinderTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.