Package com.google.devtools.depan.model

Examples of com.google.devtools.depan.model.RelationshipSetAdapter

726
727
728
729
730
731
732
733
734
735
736
737
   * recursively.
   */
  public void createPathMatcherModel(boolean isRecursive) {
    String setName = getSelectedRelationshipSet().getName();
    PathExpression pathExpressionModel = new PathExpression();
    RelationshipSetAdapter setAdapterFromPicker =
        new RelationshipSetAdapter(setName, getRelationShips(),
            SourcePluginRegistry.getRelations());
    pathExpressionModel.addPathMatcher(
        new PathMatcherTerm(setAdapterFromPicker, isRecursive, false));
    pathMatcherModel = pathExpressionModel;
  }
View Full Code Here
179
180
181
182
183
184
185
186
      testModel = new GraphModel();
      nodeArray = TestUtils.buildComplete(
          testModel, size, SampleRelation.sampleRelation);
      nodeSet = TestUtils.toSet(nodeArray);

      countSet = new RelationshipSetAdapter("count");
      countSet.addRelation(SampleRelation.sampleRelation, forward, reverse);
    }
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
61
   */
  public void testPathMatcherTermIsRecursive() {
    MultipleDirectedRelationFinder finder =
        new MultipleDirectedRelationFinder();
    // set the recursiveness to true
    RelationshipSetAdapter setAdapter =
        new RelationshipSetAdapter("Temporary", finder, relations);
    PathMatcherTerm term = new PathMatcherTerm(setAdapter, true, false);

    assertTrue("This PathMatcherTerm has to be recursive",
        term.isRecursive());

View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
83
84
85
    MultipleDirectedRelationFinder original =
        new MultipleDirectedRelationFinder();

    original.addRelation(MockRelation.CALL, true, false);

    RelationshipSetAdapter relSetAdapter =
        new RelationshipSetAdapter("Temporary", original, relations);

    assertFalse("Must not match backward",
        relSetAdapter.matchBackward(MockRelation.CALL));

    assertTrue("Must match forward",
        relSetAdapter.matchForward(MockRelation.CALL));
  }
View Full Code Here
126
127
128
129
130
131
132
133
134
135
   */
  public void testRelationshipSetMatcherGetDisplayName() {
    String name = "Containers";
    MultipleDirectedRelationFinder multipleFinder =
        new MultipleDirectedRelationFinder();
    RelationshipSetAdapter setAdapter =
        new RelationshipSetAdapter(name, multipleFinder, relations);

    assertEquals(name, setAdapter.getDisplayName());
  }
View Full Code Here
145
146
147
148
149
150
151
152
153
154
155
156
        new MultipleDirectedRelationFinder();

    finder.addRelation(MockRelation.DIRECTORY, true, false);

    // non-recursive
    RelationshipSetAdapter setAdapter =
        new RelationshipSetAdapter("Temporary", finder, relations);
    PathMatcherTerm term = new PathMatcherTerm(setAdapter, false, false);

    Collection<GraphNode> output = term.getPathMatcher().nextMatch(graph,
        buildSingleSet(nodes[0]));
View Full Code Here
186
187
188
189
190
191
192
193
194
195
196
197
        new MultipleDirectedRelationFinder();

    finder.addRelation(MockRelation.DIRECTORY, true, false);

    // make it recursive
    RelationshipSetAdapter relSetAdapter =
        new RelationshipSetAdapter("Temporary", finder, relations);
    PathMatcherTerm term = new PathMatcherTerm(relSetAdapter, true, false);

    PathExpression pathExp = new PathExpression();
    pathExp.addPathMatcher(term);
View Full Code Here
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
    if (twoFiltersInFirstMatcher) {
      finder.addRelation(MockRelation.DIRECTORY, true, false);
    }

    RelationshipSetAdapter setAdapter =
        new RelationshipSetAdapter("Temporary", finder, relations);
    term = new PathMatcherTerm(setAdapter, recursive, false);
    pathExpression.addPathMatcher(term);

    finder = new MultipleDirectedRelationFinder();
    finder.addRelation(MockRelation.CLASS, true, false);
    // cumulative!
    setAdapter = new RelationshipSetAdapter("Temporary", finder, relations);
    term = new PathMatcherTerm(setAdapter, recursive, cumulativeSecondMatcher);
    pathExpression.addPathMatcher(term);
    return pathExpression;
  }
View Full Code Here
262
263
264
265
266
267
268
269
270
271
272
  /**
   * @param text create a new set with the given name.
   */
  protected void createSet(String text) {
    RelationshipSet set = new RelationshipSetAdapter(text);
    sets.add(set);
    setsContentProvider.add(set);

    setDirtyState(true);
  }
View Full Code Here
396
397
398
399
400
401
402
403
404
405
406
407
   */
  private void appendSelection() {
    String setName = relationshipPicker.getSelectedRelationshipSet().getName();
    MultipleDirectedRelationFinder finder =
        relationshipPicker.getRelationShips();
    RelationshipSetAdapter setAdapterFromPicker =
        new RelationshipSetAdapter(setName, finder,
            SourcePluginRegistry.getRelations());
    boolean isRecursive = recursive.getSelection();
    boolean isCumulative = cumulative.getSelection();
    PathMatcherTerm termToAppend =
        new PathMatcherTerm(setAdapterFromPicker, isRecursive, isCumulative);
View Full Code Here
TOP

Related Classes of com.google.devtools.depan.model.RelationshipSetAdapter

  • com.google.devtools.depan.eclipse.editors.NamedRelationshipEditor
  • com.google.devtools.depan.eclipse.utils.RelationshipPicker
  • com.google.devtools.depan.eclipse.views.tools.PathExpressionEditorTool
  • com.google.devtools.depan.filters.FilterTest
  • com.google.devtools.depan.filters.RelationCountMatcherTest$TestData
  • com.google.devtools.depan.graph.api.DirectedRelation
    • 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.