Examples of Tree

Examples of aQute.bnd.service.diff.Tree

107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
            // Skip deltas that have lesser significance than the overall package delta
            if (pkgMemberDiff.getDelta().ordinal() < packageDelta.ordinal())
                continue;

            if (Delta.ADDED == pkgMemberDiff.getDelta()) {
                @SuppressWarnings("unused")
                Tree pkgMember = pkgMemberDiff.getNewer();
                //                markers.addAll(generateAddedTypeMarker(javaProject, pkgMember.getName(), pkgMember.ifAdded()));
            } else if (Delta.REMOVED == pkgMemberDiff.getDelta()) {} else {
                Tree pkgMember = pkgMemberDiff.getOlder();
                if (pkgMember != null && (Type.INTERFACE == pkgMember.getType() || Type.CLASS == pkgMember.getType())) {
                    String className = pkgMember.getName();

                    // Iterate into the class member diffs
                    for (Diff classMemberDiff : pkgMemberDiff.getChildren()) {
                        // Skip deltas that have lesser significance than the overall package delta (again)
                        if (classMemberDiff.getDelta().ordinal() < packageDelta.ordinal())
                            continue;

                        if (Delta.ADDED == classMemberDiff.getDelta()) {
                            Tree classMember = classMemberDiff.getNewer();
                            if (Type.METHOD == classMember.getType())
                                markers.addAll(generateAddedMethodMarker(javaProject, className, classMember.getName(), classMember.ifAdded()));
                        } else if (Delta.REMOVED == classMemberDiff.getDelta()) {
                            Tree classMember = classMemberDiff.getOlder();
                            if (Type.METHOD == classMember.getType()) {
                                markers.addAll(generateRemovedMethodMarker(javaProject, className, classMember.getName(), classMember.ifRemoved()));
                            }
                        }
                    }
                }
            }
View Full Code Here

Examples of bgu.bio.adt.graphs.Tree

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
52
53
54
55
import bgu.bio.algorithms.graphs.hsa.matchers.UnorderedMatcherFactory;

public class TestHSAOnInteger {

  private static void run(String file1, String file2) throws IOException {
    Tree t = buildTree(file1);
    Tree s = buildTree(file2);
    t.toDotFile("/home/milon/1.dot", true);
    s.toDotFile("/home/milon/2.dot", true);

    CostFunction w = new CostFunction() {

      @Override
      public double cost(NodeLabel l1, NodeLabel l2) {
        if (l1.equals(l2)) {
          return -2;
        }

        return Double.POSITIVE_INFINITY;
      }
    };

    TIntArrayList[] alignment = new TIntArrayList[3];

    UnorderedMatcherFactory matcherFactory = new UnorderedMatcherFactory();
    HSA hsa = new HSA(w, matcherFactory,false);

    System.out.println("Cost t-s: " + hsa.computeHSA(t, s, alignment));
    for (int i = 0; i < alignment[0].size(); ++i) {
      System.out.print("(" + alignment[0].get(i) + ","
          + alignment[1].get(i) + "), ");
    }

    System.out.println();
    for (int i = 0; i < alignment[0].size(); ++i) {
      System.out.println("(" + t.getLabel(alignment[0].get(i)) + ","
          + s.getLabel(alignment[1].get(i)) + ") ");
    }
  }
View Full Code Here

Examples of ca.uwo.csd.ai.nlp.common.Tree

31
32
33
34
35
36
37
38
39
40
41
42
       
        if (!(k1 instanceof Tree) || !(k2 instanceof Tree)) {
            throw new IllegalArgumentException("svm_node does not contain tree data.");
        }
       
        Tree t1 = (Tree) k1;
        Tree t2 = (Tree) k2;
       
        List<Tree> nodes1 = getNodes(t1);
        List<Tree> nodes2 = getNodes(t2);
               
        int N1 = Math.min(MAX_NODE, nodes1.size());
View Full Code Here

Examples of cascading.pattern.model.tree.Tree

558
559
560
561
562
563
564
565
566
567
568
  private Pipe handleTreeModel( Pipe tail, TreeModel model )
    {
    ModelSchema modelSchema = createModelSchema( model );

    Tree tree = createTree( model, modelSchema );

    TreeSpec treeSpec = new TreeSpec( modelSchema, tree );

    return create( tail, modelSchema, new TreeFunction( treeSpec ) );
    }
View Full Code Here

Examples of com.caucho.util.Tree

66
67
68
69
70
71
72
73
74
  public NavItem getParent()
  {
    if (tree == null)
      return null;
   
    Tree parent = tree.getParent();

    return parent == null ? null : (NavItem) parent.getData();
  }
View Full Code Here

Examples of com.db4o.foundation.Tree

51
52
53
54
55
56
57
58
59
60
61
 
  public Tree read(int a_size){
      i_size = a_size;
    if(i_size > 0){
      if(i_orderOnRead){
        Tree tree = null;
        for (int i = 0; i < i_size; i++) {
            tree = Tree.add(tree, (Tree)i_template.read(i_bytes));
                }
                return tree;
      }
View Full Code Here

Examples of com.deitel.jhtp6.ch17.Tree

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
public class TreeTest
{
   public static void main( String args[] )
   {
      Tree tree = new Tree();
      int value;
      Random randomNumber = new Random();

      System.out.println( "Inserting the following values: " );

      // insert 10 random integers from 0-99 in tree
      for ( int i = 1; i <= 10; i++ )
      {
         value = randomNumber.nextInt( 100 );
         System.out.print( value + " " );
         tree.insertNode( value );
      } // end for

      System.out.println ( "\n\nPreorder traversal" );
      tree.preorderTraversal(); // perform preorder traversal of tree

      System.out.println ( "\n\nInorder traversal" );
      tree.inorderTraversal(); // perform inorder traversal of tree

      System.out.println ( "\n\nPostorder traversal" );
      tree.postorderTraversal(); // perform postorder traversal of tree
      System.out.println();
   } // end main
View Full Code Here

Examples of com.dotmarketing.beans.Tree

765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
            // parents if
            // not live.
            for (Tree tree : parentTrees) {
              // to keep relation types from parent only if it
              // exists
              Tree newTree = TreeFactory.getTree(tree.getParent(), file.getInode());
              if (!InodeUtils.isSet(newTree.getChild())) {
                newTree.setParent(tree.getParent());
                newTree.setChild(file.getInode());
                newTree.setRelationType(tree.getRelationType());
                newTree.setTreeOrder(0);
                TreeFactory.saveTree(newTree);
              }
            }
            APILocator.getVersionableAPI().setWorking(file);
            if(publish && perAPI.doesUserHavePermission(file, PermissionAPI.PERMISSION_PUBLISH, user))
View Full Code Here

Examples of com.example.types.Tree

12
13
14
15
16
17
18
        Assert.assertEquals((long)0, (long)port.sum_tree(null));
    }

    @Test
    public void test_notset() throws Exception {
        Assert.assertEquals((long)0, (long)port.sum_tree(new Tree()));
    }
View Full Code Here

Examples of com.extjs.gxt.ui.client.widget.tree.Tree

313
314
315
316
317
318
319
320
321
322
323
324
    if (item == null) {
      clearStyles(event);
      return;
    }
    if (event.getDropTarget().component == event.getDragSource().component) {
      Tree source = (Tree) event.getDragSource().component;
      TreeItem sel = source.getSelectedItem();
      List<TreeItem> children = sel.getItems(true);
      if (children.contains(item)) {
        clearStyles(event);
        return;
      }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.