Package com.tensegrity.wpalo.client.ui.mvc.fasttree

Examples of com.tensegrity.wpalo.client.ui.mvc.fasttree.FastMSTreeItem

84
85
86
87
88
89
90
91
92
93
94
                  parents.put(tn, item);
                }
                item.setModel(tn);
                HasFastMSTreeItems parentItem = tree;
                if (tn.getParent() != null) {
                  FastMSTreeItem pItem = parents.get(tn.getParent());
                  if (pItem != null) {
                    parentItem = pItem;
                  }
                }
                parentItem.fastAddItem(item);
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
              ((XElementNode) xObj).setAxisHierarchyId(hierarchyId, viewId);
            } else {
              name = xObj.getName();
            }

            FastMSTreeItem item = new FastMSTreeItem(image + name) {
              public void ensureChildren() {
                loadChildren(this, getModel());
              }
            };
            if (kids.get(index).hasChildren()) {
              item.becomeInteriorNode();
            }
            item.setModel(kids.get(index));
            parentItem.addItem(item);
            if (item.getParentItem() != null &&
                item.getParentItem().getModel() != null) {
              item.getParentItem().getModel().addChild(kids.get(index));
            }
            index++;
            if (item.getParentItem() != null) {
              if (item.getParentItem().getFinishHandler() != null && index >= kids.size()) {
                item.getParentItem().getFinishHandler().onSuccess(null);
              }             
            }
            if (index >= kids.size()) {
              LoadEvent le = new LoadEvent(null, parentNode);
              tree.loaded(le);
View Full Code Here
239
240
241
242
243
244
245
246
247
248
249
250
251
      String[] paths) {
    XObjectModel model = wrap(node);
    if (paths != null && paths.length > pathCounter) {
      model.set("filterPath", paths[pathCounter++]);
    }
    FastMSTreeItem item = new FastMSTreeItem();
    item.setXObjectModel(model);
    item.setHTML(getTreeItemText(node));
//    dragController.makeDraggable(item.getHtml(), item.getHtml());
    if (parent == null)
      tree.addItem(item);
    else
      parent.getItem().addItem(item);
View Full Code Here
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
    final LinkedHashSet<FastMSTreeItem> curSel = tree.getSelectedItems();
    final HashMap<Integer, XObjectModel> nodeMap = new HashMap<Integer, XObjectModel>();
    final LinkedHashSet<FastMSTreeItem> roots = new LinkedHashSet<FastMSTreeItem>();
    XObjectModel selRoot = null;
    if (curSel != null && curSel.size() >= 1) {
      FastMSTreeItem selected = curSel.iterator().next();
      selRoot = selected.getXObjectModel();
      roots.add(selected);
    }
    // TreeStore <XObjectModel> store = treeBinder.getTreeStore();
    final XObjectModel selectedRoot = selRoot;
    DeferredCommand.addCommand(new IncrementalCommand() {
      private int index = 0;
      private final int size = nodes.size();
     
      public boolean execute() {
        TreeNode node = nodes.get(index);
        XObjectModel parent = determineParent(nodeMap, node);
        XObjectModel xObjModel = wrap(node.getXObject());
        if (node.get("filterPath") != null) {
          xObjModel.set("filterPath", node.get("filterPath"));
        } else {
          xObjModel.remove("filterPath");
        }
        FastMSTreeItem item = new FastMSTreeItem();   
        item.setVisible(true);
        item.setXObjectModel(xObjModel);
        if (node.getXObject() instanceof XElementNode) {
          item.setHTML(getTreeItemText((XElementNode) node.getXObject()));
        } else {
          item.setText(node.getXObject().getName());
        }
        xObjModel.setItem(item);
        if (parent == null) {
          if (selectedRoot == null) {
            tree.addItem(item);
            DOM.scrollIntoView(item.getElement());
            roots.add(item);
          } else {
            selectedRoot.getItem().addItem(item);
          }
        } else {
View Full Code Here
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
        selection.add(it);
      }
      if (!selection.isEmpty()) {
        Iterator<FastMSTreeItem> it = selection.iterator();
        while (it.hasNext()) {
          FastMSTreeItem treeItem = it.next();
          if (treeItem.getParentItem() == null) {
            tree.removeItem(treeItem);
          } else {
            treeItem.getParentItem().removeItem(treeItem);
          }
        }
      }
    } catch (Throwable t) {
      t.printStackTrace();
View Full Code Here
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
  public final void moveUpSelection() {
    LinkedHashSet<FastMSTreeItem> selection = tree.getSelectedItems();
    if (!selection.isEmpty()) {
      for (FastMSTreeItem item : selection) {
        FastMSTreeItem parent = item.getParentItem();
        boolean result;
        if (parent == null) {
          result = tree.moveItemUp(item);
        } else {
          result = parent.moveItemUp(item);
        }
        if (!result) {
          break;
        }
      }
View Full Code Here
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
  public final void moveDownSelection() {
    ArrayList <FastMSTreeItem> selection = new ArrayList <FastMSTreeItem> (tree.getSelectedItems());
    if (!selection.isEmpty()) {
      int n = selection.size();
      for (int i = n - 1; i >= 0; i--) {
        FastMSTreeItem item = selection.get(i);
        FastMSTreeItem parent = item.getParentItem();
        boolean result;
        if (parent == null) {
          result = tree.moveItemDown(item);
        } else {
          result = parent.moveItemDown(item);
        }
        if (!result) {
          break;
        }
      }
View Full Code Here
459
460
461
462
463
464
465
466
//    });
    return tree;
  }
 
  public final void traverse(FastMSTreeItemVisitor visitor) {
    FastMSTreeItem root = tree.getRoot();
    traverse(root.getChildren(), null, visitor);
  }
View Full Code Here
635
636
637
638
639
640
641
642
643
644
645
646
    ((Workbench)Registry.get(Workbench.ID)).showWaitCursor(constants.selectingChildren());
    Filter f = new DefaultFilter() {
      private final HashSet <FastMSTreeItem> selPar = new HashSet<FastMSTreeItem>();
     
      public boolean filter(FastMSTreeItem item) {       
        FastMSTreeItem par = item.getParentItem();
        if (par != null && par.isOpen() && (par.isSelected() || selPar.contains(par))) {
          selPar.add(item);
          select(item, true);
        }
        return true;
      }
View Full Code Here
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
//        selectionModel.deselect(item);
//    }
  }
 
  private final void traverse(final TreeNode node, final Filter filter) {
    final FastMSTreeItem item = tree.getItem(node);
    if(item == null || filter == null)
      return;
    if (filter.filter(item)) {     
      boolean doTraverse = true;
      if (filter.shouldExpand(item)) {
        if (tree instanceof LoDHierarchyTree) {
          if (!item.isOpen() && !item.hasBeenOpened()) {
            doTraverse = false;
            item.setFinishHandler(new AsyncCallback<Void>() {
              public void onFailure(Throwable arg0) {
                item.setFinishHandler(null);
              }
             
              public void onSuccess(Void arg0) {
                item.setFinishHandler(null);
                for (TreeNode child : node.getChildren()) {
                  if (filter.traverseChild(child)) {
                    traverse(child, filter);
                  }
                }
              }
            });
          }
        }
        item.setState(true, true);
      }   
      if (doTraverse) {
        for (TreeNode child : node.getChildren()) {
          if (filter.traverseChild(child)) {
            traverse(child, filter);
View Full Code Here
TOP

Related Classes of com.tensegrity.wpalo.client.ui.mvc.fasttree.FastMSTreeItem

  • com.google.gwt.user.client.Element
  • com.google.gwt.user.client.ui.HTML
  • com.google.gwt.user.client.ui.Widget
  • com.tensegrity.wpalo.client.ui.mvc.cubeview.DnDHierarchyTree
  • com.tensegrity.wpalo.client.ui.mvc.cubeview.FullHierarchyTree
  • com.tensegrity.wpalo.client.ui.mvc.cubeview.HierarchyTree
  • com.tensegrity.wpalo.client.ui.mvc.cubeview.LoDHierarchyTree
  • com.tensegrity.wpalo.client.ui.mvc.cubeview.TreeNodeSelector
    • 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.