Package com.extjs.gxt.ui.client.data

Examples of com.extjs.gxt.ui.client.data.TreeModel


   *
   * @param parent the parent model
   * @param child the child model
   */
  public void remove(M parent, M child) {
    TreeModel p = findWrapper(parent);
    TreeModel c = findWrapper(child);
    if (p != null && c != null) {
      remove(p, c, false);
    }
  }
View Full Code Here


   * Removes all the parent's children.
   *
   * @param parent the parent
   */
  public void removeAll(M parent) {
    TreeModel p = findWrapper(parent);
    if (p != null) {
      List<M> children = getChildren(parent);
      for (M m : children) {
        TreeModel child = findWrapper(m);
        if (child != null) {
          remove(p, child, false);
        }
      }
    }
View Full Code Here

        applyFilters(filterProperty);
      } else {
        fireEvent(DataChanged, new TreeStoreEvent(this));
      }
    } else {
      TreeModel wrapper = findWrapper((M) le.parent);
      if (wrapper != null) {
        if (wrapper.getChildren().size() > 0) {
          removeAll((M) le.parent);
        }
        List<TreeModel> insert = new ArrayList<TreeModel>();
        List<M> list = (List<M>) le.getData();
        for (M model : list) {
View Full Code Here

  }

  protected void swapModelInstance(M oldModel, M newModel) {
    super.swapModelInstance(oldModel, newModel);
    if (useKeyProvider != null) {
      TreeModel wrapper = null;
      if (useKeyProvider) {
        wrapper = modelFastMap.get(getKey(oldModel));
      } else {
        wrapper = modelMap.get(oldModel);
      }
      if (wrapper != null) {
        wrapperMap.put(wrapper.<String> get("id"), newModel);
        if (!useKeyProvider && modelMap != null) {
          modelMap.remove(oldModel);
          modelMap.put(newModel, wrapper);
        }
      }
View Full Code Here

      } else {
        modelFastMap = new FastMap<TreeModel>();
        useKeyProvider = true;
      }
    }
    TreeModel wrapper = new BaseTreeModel();
    wrapper.set("id", String.valueOf(counter++));
    if (useKeyProvider) {
      modelFastMap.put(getKey(model), wrapper);
    } else {
      modelMap.put(model, wrapper);
    }
    wrapperMap.put(wrapper.<String> get("id"), model);
    return wrapper;
  }
View Full Code Here

  @SuppressWarnings({"unchecked", "rawtypes"})
  private void doInsert(TreeModel parent, List<TreeModel> children, int index, boolean addChildren, boolean supressEvent) {
    if (parent != null && children != null && children.size() > 0) {
      M modelParent = unwrap(parent);
      for (int i = children.size() - 1; i >= 0; i--) {
        TreeModel child = children.get(i);
        parent.insert(child, index);
        M m = unwrap(child);
        all.add(m);
        registerModel(m);
        if (storeSorter != null) {
          applySort((List) parent.getChildren());
          if (!supressEvent) {
            TreeStoreEvent evt = createStoreEvent();;
            evt.setParent(modelParent);
            evt.setIndex(parent.indexOf(child));
            evt.setChildren(Arrays.asList(m));
            fireEvent(Add, evt);
          }
        }
      }

      if (!supressEvent && storeSorter == null) {
        TreeStoreEvent evt = createStoreEvent();;
        evt.setParent(modelParent);
        evt.setChildren(unwrap(children));
        evt.setIndex(index);
        fireEvent(Add, evt);
      }

      if (addChildren) {
        for (TreeModel sub : children) {
          M model = unwrap(sub);
          if (model instanceof TreeModel) {
            TreeModel treeSub = (TreeModel) model;

            List<M> c = (List) treeSub.getChildren();
            if (c.size() > 0) {
              List<TreeModel> insert = new ArrayList<TreeModel>();
              for (M m : c) {
                insert.add(wrap(m));
              }
View Full Code Here

  }

  private void filterTreeWrap(TreeModel wrap) {
    List<ModelData> children = wrap.getChildren();
    for (int i = 0, len = children.size(); i < len; i++) {
      TreeModel tm = (TreeModel) children.get(i);
      if (isOrDecendantSelected(tm, unwrap(tm))) {
        tm.set("filtered", "false");
      } else {
        tm.set("filtered", "true");
      }
      filterTreeWrap(tm);
    }
  }
View Full Code Here

    if (!isFiltered(model, filterProperty)) {
      return true;
    }
    List<ModelData> children = wrap.getChildren();
    for (int i = 0, len = children.size(); i < len; i++) {
      TreeModel tm = (TreeModel) children.get(i);
      boolean result = isOrDecendantSelected(tm, unwrap(tm));
      if (result) {
        return true;
      }
    }
View Full Code Here

  @SuppressWarnings("rawtypes")
  protected void handleAppendDrop(DNDEvent event, TreeItem item) {
    List sel = event.getData();
    if (sel.size() > 0) {
      if (sel.get(0) instanceof ModelData) {
        TreeModel tm = (TreeModel) sel.get(0);
        ModelData p = item.getModel();
        appendModel(p, tm, item.getItemCount());
      } else {
        for (int i = 0; i < sel.size(); i++) {
          TreeItem ti = (TreeItem) sel.get(i);
View Full Code Here

    return getPrev() instanceof TableOfContentsEntry;
  }

  public TableOfContentsEntry getNext() {
    // try to select next sibling
    TreeModel parent = getParent();
    if(null == parent)
      return null;
   
    boolean foundNext = false;
    for(ModelData entry : parent.getChildren()){
      if(foundNext)
        return (TableOfContentsEntry) entry;
      if(entry == this)
        foundNext = true;
    }
View Full Code Here

TOP

Related Classes of com.extjs.gxt.ui.client.data.TreeModel

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.