Package mindnotes.shared.model

Examples of mindnotes.shared.model.Node

330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
   *            parent</c> is not a root node, <c>loc</c> is ignored and
   *            parent node location is used.
   */
  private Node addChild(Node node, NodeLocation loc) {

    Node child = new Node();
    child.setText("New node");
    if (node.getNodeLocation() == NodeLocation.ROOT) {
      child.setNodeLocation(loc);
    } else {
      child.setNodeLocation(node.getNodeLocation());
    }

    node.addChildNode(child);

    _mindMapView.holdLayout();
View Full Code Here
349
350
351
352
353
354
355
356
357
358
359
360
361
    return child;

  }

  private Node insertChild(Node parent, Node current, boolean above) {
    Node child = new Node();
    child.setText("New node");
    child.setNodeLocation(current.getNodeLocation());

    if (above) {
      parent.insertBefore(child, current);
    } else {
      parent.insertAfter(child, current);
View Full Code Here
675
676
677
678
679
680
681
682
683
684
685
  public void setCurrentNode(Node node) {
    setCurrentNode(node, false);
  }

  private void setCurrentNode(Node node, boolean enterTextMode) {
    Node oldCurrentNode = _selection.getCurrentNode();
    _mindMapView.holdLayout();
    // check if the new current node is different from the last one
    if (oldCurrentNode != node) {
      // update old current node ui
      if (oldCurrentNode != null) {
View Full Code Here
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
      @Override
      public void execute() {
        final MindMap mm = new MindMap();
        _currentMapKey = null;
        mm.setTitle("New Untitled Mind Map");
        Node n = new Node();
        n.setText("New Mind Map");
        Node n1 = new Node();
        n1.setText("A bubble");
        n1.setNodeLocation(NodeLocation.LEFT);
        Node n2 = new Node();
        n2.setText("Another bubble");
        n2.setNodeLocation(NodeLocation.RIGHT);
        n.addChildNode(n1);
        n.addChildNode(n2);
        mm.setRootNode(n);
        setMindMap(mm);
        _isDirty = false;
View Full Code Here
797
798
799
800
801
802
803
804
805
    _mindMapView.setTitle(title);
  }

  public void copy() {
    /* take note that copy (contrary to paste or cut) is not undoable*/
    Node n = new Node();
    _selection.getCurrentNode().copyTo(n);
    _clipboard.setCurrentNode(n);
  }
View Full Code Here
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
   * its children or its parent.
   *
   * @param where
   */
  private void navigateToSide(NodeLocation where) {
    Node n = _selection.getCurrentNode();
    if (n.getNodeLocation() == where) {
      // we are going deeper into children, f.e. moving left from a node
      // that is on the left
      if (n.getChildCount() <= 0)
        return;
      setCurrentNode(n.getChildren().iterator().next());

    } else if (n.getNodeLocation() == NodeLocation.ROOT) {
      // moving from the root, which has no parent and children in either
      // direction
      if (n.getChildCount() <= 0)
        return;
      for (Node child : n.getChildren()) {
        if (child.getNodeLocation() == where) {
          setCurrentNode(child);
          return;
        }
      }
    } else {
      // moving towards the parent (moving right on left-sided node)
      setCurrentNode(n.getParent());
    }

  }
View Full Code Here
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
    }

  }

  public void navigateUp() {
    Node n = _selection.getCurrentNode();
    if (n.getNodeLocation() == NodeLocation.ROOT)
      return;
    Node parent = n.getParent();
    int index = parent.getChildren().indexOf(n);
    if (index > 0) {

      // search siblings for the first sibling after current node that is
      // on the same side
      for (int i = index - 1; i >= 0; i--) {
        Node candidate = parent.getChildren().get(i);
        if (candidate.getNodeLocation() == n.getNodeLocation()) {
          setCurrentNode(candidate);
          return;
        }

      }
View Full Code Here
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
      }
    }
  }

  public void navigateDown() {
    Node n = _selection.getCurrentNode();
    if (n.getNodeLocation() == NodeLocation.ROOT)
      return;
    Node parent = n.getParent();
    int index = parent.getChildren().indexOf(n);
    if (index < parent.getChildCount() - 1) {

      // search siblings for the first sibling after current node that is
      // on the same side
      for (int i = index + 1; i < parent.getChildCount(); i++) {
        Node candidate = parent.getChildren().get(i);
        if (candidate.getNodeLocation() == n.getNodeLocation()) {
          setCurrentNode(candidate);
          return;
        }

      }
View Full Code Here
121
122
123
124
125
126
127
128
129
130
131
      _above = above;
    }

    @Override
    public boolean doAction() {
      Node current = _selection.getCurrentNode();
      _createdNode = insertChild(current.getParent(), current, _above);

      setCurrentNode(_createdNode);
      return true;
    }
View Full Code Here
12
13
14
15
16
17
18
19
20
21
22
23
public class PersistenceTest extends GWTTestCase {

  public void testBasicMap() {
    MindMap m = new MindMap();
    m.getRootNode().addChildNode(new Node());
    m.getRootNode().addChildNode(new Node());
    Node n = new Node();
    m.getRootNode().addChildNode(n);
    m.getRootNode().addChildNode(n);
    roundtrip(m);
  }
View Full Code Here
TOP

Related Classes of mindnotes.shared.model.Node

  • mindnotes.client.BasicModelTest
  • mindnotes.client.PersistenceTest
  • mindnotes.client.presentation.MindMapEditor
  • mindnotes.client.presentation.MindMapEditor$AddSiblingAction
    • 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.