Package org.olat.core.util.tree

Examples of org.olat.core.util.tree.Visitor

130
131
132
133
134
135
136
137
138
139
140
          }
          insertParent.insert(moveCopyFrom, insertPos);

          moveCopyFrom.setDirty(true);
          //mark subtree as dirty
          TreeVisitor tv = new TreeVisitor( new Visitor() {
            public void visit(INode node) {
              CourseEditorTreeNode cetn = (CourseEditorTreeNode)node;
              cetn.setDirty(true);
            }
          },moveCopyFrom,true);
View Full Code Here
202
203
204
205
206
207
208
209
210
211
212
    CourseEditorTreeNode rootNode = (CourseEditorTreeNode) editorModel.getRootNode();
    final List<CourseNode> nodes = new ArrayList<CourseNode>();
    // visitor class: takes all assessable nodes if not the exclude node and
    // puts
    // them into the nodes list
    Visitor visitor = new Visitor() {
      public void visit(INode node) {
        CourseEditorTreeNode editorNode = (CourseEditorTreeNode) node;
        CourseNode courseNode = editorModel.getCourseNode(node.getIdent());
        if (!editorNode.isDeleted() && (courseNode != excludeNode)) {
          if(checkIfNodeIsAssessable(courseNode)) {
View Full Code Here
303
304
305
306
307
308
309
310
311
312
313
    FileUtils.copyDirToDir(getIsolatedCourseFolder().getBasefile(), exportDirectory);
    // export any node data
    File fExportedDataDir = new File(exportDirectory, EXPORTED_DATA_FOLDERNAME);
    fExportedDataDir.mkdirs();
    log.info("exportToFilesystem: exporting course "+this+": exporting all nodes...");
    Visitor visitor = new NodeExportVisitor(fExportedDataDir, this);
    TreeVisitor tv = new TreeVisitor(visitor, getEditorTreeModel().getRootNode(), true);
    tv.visitAll();
    log.info("exportToFilesystem: exporting course "+this+": exporting all nodes...done.");
   
    //OLAT-5368: do intermediate commit to avoid transaction timeout
View Full Code Here
171
172
173
174
175
176
177
178
179
180
181
    /*
     * the tree is visited and the book keeping lists are filled. the visitor
     * itself does not delete or modify neither runstructure nor editor tree
     * model. The whole complexity of published is encapsulated in the visitor.
     */
    Visitor nodePublishV = new NodePublishVisitor(editorRoot, nodesIdsToPublish, existingCourseRun);
    TreeVisitor tv = new TreeVisitor(nodePublishV, editorRoot, visitChildrenFirst);
    tv.visitAll();
    /*
     *
     */
 
View Full Code Here
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
   */
  private Map<String, List<String>> checkReferencesFor(TreeNode tn) {
    final CourseEditorTreeModel cetm = CourseFactory.getCourseEditSession(ores.getResourceableId()).getEditorTreeModel();
     //create a list of all nodes in the selected subtree
    final Set<String> allSubTreeids = new HashSet<String>();
    TreeVisitor tv = new TreeVisitor(new Visitor() {
      public void visit(INode node) {
        allSubTreeids.add(node.getIdent());
      }
    }, tn, true);
    tv.visitAll();
     //find all references pointing from outside the subtree into the subtree or
     //on the subtree root node.
    final Map<String, List<String>> allRefs = new HashMap<String, List<String>>();
    tv = new TreeVisitor(new Visitor() {
      public void visit(INode node) {
        List referencingNodes = euce.getCourseEditorEnv().getReferencingNodeIdsFor(node.getIdent());
        // subtract the inner nodes. This allows to delete a whole subtree if
        // only references residing completly inside the subtree are active.
        referencingNodes.removeAll(allSubTreeids);
View Full Code Here
254
255
256
257
258
259
260
261
262
263
264
     */
    String currentNodeWas = currentCourseNodeId;
    // reset all
    softRefs = new HashMap();
    nodeRefs = new HashMap<String, Set<String>>();
    Visitor v = new CollectConditionExpressionsVisitor();
    (new TreeVisitor(v, cetm.getRootNode(), true)).visitAll();
    for (Iterator iter = softRefs.keySet().iterator(); iter.hasNext();) {
      String nodeId = (String) iter.next();
      List conditionExprs = (List) softRefs.get(nodeId);
      for (int i = 0; i < conditionExprs.size(); i++) {
View Full Code Here
432
433
434
435
436
437
438
439
440
441
442
    DirectedGraph dg = new DefaultDirectedGraph();
    DirectedEdgeFactory def = new EdgeFactories.DirectedEdgeFactory();
    /*
     * add the course structure as directed graph, where
     */
    Visitor v = new Convert2DGVisitor(dg);
    (new TreeVisitor(v, cetm.getRootNode(), true)).visitAll();
    /*
     * iterate over nodeRefs, add each not existing node id as vertex, for each
     * key - child relation add an edge to the directed graph.
     */
 
View Full Code Here
359
360
361
362
363
364
365
366
367
368
369
    for (Iterator iter = refs.iterator(); iter.hasNext();) {
      ReferenceImpl ref = (ReferenceImpl) iter.next();
      refM.delete(ref);
    }
    // call cleanupOnDelet for nodes
    Visitor visitor = new NodeDeletionVisitor(course);
    TreeVisitor tv = new TreeVisitor(visitor, course.getRunStructure().getRootNode(), true);
    tv.visitAll();
    // delete assessment notifications
    CourseNode cn = course.getRunStructure().getRootNode();
    CourseEnvironment ce = course.getCourseEnvironment();
View Full Code Here
782
783
784
785
786
787
788
789
790
791
792
    String result = ScoreAccountingHelper.createCourseResultsOverviewTable(users, nodes, course, locale);
    String fileName = ExportUtil.createFileNameWithTimeStamp(course.getCourseTitle(), "xls");
    ExportUtil.writeContentToFile(fileName, result, exportDirectory, charset);
   
    // archive all nodes content
    Visitor archiveV = new NodeArchiveVisitor(locale, course, exportDirectory, charset);
    TreeVisitor tv = new TreeVisitor(archiveV, course.getRunStructure().getRootNode(), true);
    tv.visitAll();
    // archive all course log files
    //OLATadmin gets all logfiles independent of the visibility configuration   
    boolean isOresOwner = (oresRights.length > 0)?oresRights[0]:false;
View Full Code Here
967
968
969
970
971
972
973
974
975
976
977
    if (isRestrictedEdit()) {
      Set keys = history.keySet();
      /*
       *
       */
      Visitor v = new Visitor() {
        /*
         * a history key is built as follows
         * sectionkey+"/"+itemkey+"/"+questionkey+"/"+responsekey
         */
        String sectionKey = null;
View Full Code Here
TOP

Related Classes of org.olat.core.util.tree.Visitor

  • org.olat.course.assessment.AssessmentHelper
  • org.olat.course.CourseFactory
  • org.olat.course.CourseUpgrade
  • org.olat.course.editor.CourseEditorEnvImpl
  • org.olat.course.editor.EditorMainController
  • org.olat.course.editor.MoveCopySubtreeController
  • org.olat.course.editor.PublishProcess
  • org.olat.course.PersistingCourseImpl
  • org.olat.ims.qti.editor.QTIEditorMainController
    • 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.