Package com.cedarsoft.commons.struct

Examples of com.cedarsoft.commons.struct.Node

114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
   * @param path the path
   * @return the node
   */
  @NotNull
  public Node getNode( @NotNull Path path ) {
    Node current = getRootNode();
    for ( String element : path.getElements() ) {
      try {
        current = findChild( current, element );
      } catch ( ChildNotFoundException ignore ) {
        DefaultNode created = new DefaultNode( element );
        current.addChild( created );
        current = created;
      }
    }
    return current;
  }
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
58
59
  public Node findNode( @Nonnull Class<? extends Page> pageClass ) {
    Queue<Node> queue = new ArrayDeque<Node>();
    queue.add( rootNode );

    while ( !queue.isEmpty() ) {
      Node current = queue.poll();
      if ( pageClass.equals( current.getLookup().lookup( Class.class ) ) ) {
        return current;
      }
      queue.addAll( current.getChildren() );
    }
    throw new IllegalArgumentException( "No Node found for " + pageClass );
  }
View Full Code Here
28
29
30
31
32
33
34
35
36
37
    model.addChild( new DefaultNode( "button2", Lookups.singletonLookup( Action.class, new GroupButtonAction( "button2" ) ) ) );
    model.addChild( new DefaultNode( "button3", Lookups.dynamicLookup( new GroupButtonAction( "button3" ), new MyBasicGroupButtonPresenter() ) ) );
    model.addChild( new DefaultNode( "button4", Lookups.singletonLookup( Action.class, new GroupButtonAction( "button4" ) ) ) );


    Node child = model.getChildren().get( 3 );
    if ( child.getLookup().lookup( Action.class ) == null ) {
      throw new IllegalStateException( "uups" );
    }
  }
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
57
58
  public Node findNode( @NotNull Class<? extends Page> pageClass ) {
    Queue<Node> queue = new ArrayDeque<Node>();
    queue.add( rootNode );

    while ( !queue.isEmpty() ) {
      Node current = queue.poll();
      if ( pageClass.equals( current.getLookup().lookup( Class.class ) ) ) {
        return current;
      }
      queue.addAll( current.getChildren() );
    }
    throw new IllegalArgumentException( "No Node found for " + pageClass );
  }
View Full Code Here
30
31
32
33
34
35
36
37
38
39
40
41
42
  public Node findNode( @NotNull Class<? extends Page> pageClass ) {
    Queue<Node> queue = new ArrayDeque<Node>();
    queue.add( rootNode );

    while ( !queue.isEmpty() ) {
      Node current = queue.poll();
      if ( pageClass.equals( current.getLookup().lookup( Class.class ) ) ) {
        return current;
      }
      queue.addAll( current.getChildren() );
    }
    throw new IllegalArgumentException( "No Node found for " + pageClass );
  }
View Full Code Here
143
144
145
146
147
148
149
150
151
152
153
    }

    for ( File dir : listDirsSorted( currentDir ) ) {
      String name = dir.getName();

      Node child = nodeFactory.createNode( name, Lookups.dynamicLookup( dir, node ) );
      node.addChild( child );

      parse( child, dir, nodeFactory, maxDepth - 1 );
    }
  }
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
  public Node findNode( @NotNull Path path ) throws ChildNotFoundException {
    if ( !path.isAbsolute() ) {
      throw new IllegalArgumentException( "Path must be absolute to be resolved within the repository" );
    }

    Node current = getRootNode();
    for ( String element : path.getElements() ) {
      current = findChild( current, element );
    }
    return current;
  }
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
   * @param path the path
   * @return the node
   */
  @NotNull
  public Node getNode( @NotNull Path path ) {
    Node current = getRootNode();
    for ( String element : path.getElements() ) {
      try {
        current = findChild( current, element );
      } catch ( ChildNotFoundException ignore ) {
        DefaultNode created = new DefaultNode( element );
        current.addChild( created );
        current = created;
      }
    }
    return current;
  }
View Full Code Here
143
144
145
146
147
148
149
150
151
152
153
    }

    for ( File dir : listDirsSorted( currentDir ) ) {
      String name = dir.getName();

      Node child = nodeFactory.createNode( name, Lookups.dynamicLookup( dir, node ) );
      node.addChild( child );

      parse( child, dir, nodeFactory, maxDepth - 1 );
    }
  }
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
  public Node findNode( @NotNull Path path ) throws ChildNotFoundException {
    if ( !path.isAbsolute() ) {
      throw new IllegalArgumentException( "Path must be absolute to be resolved within the repository" );
    }

    Node current = getRootNode();
    for ( String element : path.getElements() ) {
      current = findChild( current, element );
    }
    return current;
  }
View Full Code Here
TOP

Related Classes of com.cedarsoft.commons.struct.Node

  • com.cedarsoft.commons.repository.Repository
  • com.cedarsoft.commons.struct.io.DirRepresenter
  • com.cedarsoft.presenter.demo.TwoFramesDemo
  • com.cedarsoft.wicket.breadcrumb.PageStructure
    • 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.