Changeset 98 for java/main/src/main/java/com/framsticks/core/Path.java

Timestamp:

07/08/13 23:04:56 (11 years ago)

Author:

psniegowski

Message:

HIGHLIGHTS:

• use custom TreeModel?
  • TreeNodes? are now very thin wrappers around actual data
  • use WeakReferences? extensively to make TreeNodes? only shadow the real structure and not sustain it
• remove global Tree listeners
• use IdentityHashMap? were appropriate
• add CompositeParam? interface to AccessInterface?
  • this interface takes into account only CompositeParams? (i.e. ValueParams? that are not PrimitiveParams?)
• make UniqueLists? sort in order of uids
• RemoteTrees? referred to from GUI use SwingDispatcher?
• rework resolving of paths
• add explicit reloading (Ctrl-R)

CHANGELOG:
Get data also on tree expansion.

Use nice framstick icon for empty nodes.

Update panel after reload if it is current.

Add shallow reload procedure.

Cut Gui prefix from several tree classes.

Bring back counter of GuiTreeNode?.

Use IdentityHashMap? were it is more appriopriate.

Remove TreeListener?.

Do not use TreeListener? in GUI.

Minor change.

Done migration to GuiTreeModel?.

BrowserTest? in that version always crashes frams.linux.

Move rendering implementation into GuiAbstractNode?.

Use hand-crafted list in GuiTreeNode?.

Generally, it would be a great place for WeakIdentityHashMap?
(but there is none in Java Collection Framework).

Remove superfluous logging.

Fix bug in GuiTreeNode?.

Use IdentityHashMap? instead of HashMap?.

Improve structure update.

Filter out invalid uids in UniqueListAccess?.

Improve TreeCellRenderer?.

Add filtering in TrackConsole?.

Improve TreeModel?.

More changes.

More improvements.

More changes.

Remove TreeNode?.

Support MetaNode? in the GuiTreeModel?.

Implement more in GuiTreeModel?.

Add CompositeParam? interface to FramsClass? and AccessInterface?.

Allow access by number to UniqueList?.

Add UidComparator?.

Use TreeMap? as a default accessee in unique list.

It keeps order of keys.

Introduce classes to use with new TreeModel?.

Another step.

Migrate from TreeNode? to Node in many places.

Remove some uses of TreeNode? as DefaultMutableTreeNode?.

Remove Path from TreeNode? interface.

Remove Path from TreeNode?.

Add Path recration from node feature.

Reworking TreeCellRenderer?.

Minor change of TreeOperations? interface.

Remove last methods from TreeNode?.

Another minor step.

Do not store reference to TreeAtFrame? in TreeNode?.

Add proxy exceptionHandler to StatusBar?.

Move panels management to TreeAtFrame?.

Store localChanges in the NodeAtFrame?.

More cleanup.

Move name computing to TreeCellRenderer?.

Move tooltip and icon computations to TreeCellRenderer?.

More dispatches removed.

Remove most dispatching from TreeNode?.

TreeNode? does not actually redispatch tasks.

Make Tree embedded in Browser use SwingDispatcher?.

Make lazy binding of Tree with Dispatcher.

Minor changes.

Organizational change in AbstractTree?.

Make AbstractTree? compose from Thread instead of inherit from it.

Make SwingDispatcher? and AtOnceDispatcher? Joinable compatible.

Add ListPanelProvider?.

Improve Controls readonly and enabled handling.

Properly pass ExceptionHandlers? in more places.

Make Tree.get accept ValueParam?.

• This is to allow access number of list elements.

Remove not needed get redirection in ClientAtServer?.

Rename tryResolve to tryGet.

Unify tryResolveAndGet into tryResolve.

Remove resolveTop from Tree interface.

Make Tree.get accept Future<Path>.

Use get to implement resolveTop also in ObjectTree?.

Unify resolveTop and get in RemoteTree?.

Another minor step.

More minor changes in tree operations.

Minor organizational changes.

In RemoteTree? first fetch info for root.

Reworking resolving.

Minor changes.

Make ListAccess? return proxy iterators (instead of creating temporary collection).

Let AccessInterface? return Iterable<Param>.

Improve resolving.

More improvements.

First working completion in ManagedConsole?.

Rename resolve to resolveTop.

This reflects the actuall functionality.

Change semantic of tryResolve and tryResolveAndGet.

File:

• java/main/src/main/java/com/framsticks/core/Path.java (modified) (10 diffs)

java/main/src/main/java/com/framsticks/core/Path.java

@@ -58 +58 @@
         public Path appendParam(CompositeParam param) {
                 assert isResolved();
-                return appendNode(new Node(param, null));
+                return appendNode(new Node(tree, param, null));
         }
 
@@ -99 +99 @@
                 public PathBuilder setLast(Object object) {
                         Node n = nodes.pollLast();
-                        nodes.add(new Node(n.getParam(), object));
+                        nodes.add(new Node(n.getTree(), n.getParam(), object));
                         return this;
                 }
@@ -130 +130 @@
                 }
 
+
                 public PathBuilder resolve(@Nonnull Tree tree, String textual) {
 
@@ -136 +137 @@
                         this.tree = tree;
 
-                        nodes.add(tree.getRoot());
-                        Node current = tree.getRoot();
+                        Node current = tree.getAssignedRoot();
+                        nodes.add(current);
 
                         StringBuilder b = new StringBuilder();
                         Iterator<String> i = splitPath(textual);
                         while (i.hasNext() && current.getObject() != null) {
-                                AccessInterface access = tree.prepareAccess(current.getParam());
-                                if (access == null) {
-                                        break;
-                                }
+                                AccessInterface access = TreeOperations.bindAccess(current);// tree.prepareAccess(current.getParam());
                                 String e = i.next();
                                 Param p = access.getParam(e);
@@ -155 +153 @@
                                 b.append("/").append(e);
                                 access.select(current.getObject());
-                                current = new Node(c, getKnownChild(tree, access, c));
+                                current = new Node(current.getTree(), c, getKnownChild(tree, access, c));
                                 nodes.add(current);
                         }
@@ -218 +216 @@
                 assert Dispatching.isThreadSafe();
                 return this.textual.equals(textual);
+        }
+
+        public final boolean isTheSameTextually(Path path) {
+                assert Dispatching.isThreadSafe();
+                return (tree == path.getTree()) && textual.equals(path.getTextual());
         }
 
@@ -242 +245 @@
                         return Path.build().resolve(tree, "/").finish();
                 }
-                Object child = getKnownChild(tree, TreeOperations.bindAccess(tree, getUnder()), getTop().getParam());
+                Object child = getKnownChild(tree, TreeOperations.bindAccess(getUnder()), getTop().getParam());
                 if (child == null) {
                         return this;
@@ -249 +252 @@
         }
 
-        public boolean matches(Path p) {
-                assert Dispatching.isThreadSafe();
-                assert tree == p.tree;
-                Iterator<Node> a = nodes.iterator();
-                Iterator<Node> b = p.nodes.iterator();
-                while (a.hasNext() && b.hasNext()) {
-                        Node an = a.next();
-                        Node bn = b.next();
-                        if (an.object != bn.object) {
-                                return false;
-                        }
-                }
-                return a.hasNext() == b.hasNext();
-        }
 
         public String getLastElement() {
@@ -278 +267 @@
         }
 
-        public void assureResolved() {
+        public Path assureResolved() {
                 if (!isResolved()) {
                         throw new FramsticksException().msg("path is not resolved").arg("path", this);
                 }
+                return this;
         }
 
@@ -287 +277 @@
                 return Path.build().resolve(tree, textual).finish();
         }
+
+        public boolean isTheSameObjects(Path path) {
+                if (tree != path.getTree()) {
+                        return false;
+                }
+                if (size() != path.size()) {
+                        return false;
+                }
+                if (!getTextual().equals(path.getTextual())) {
+                        return false;
+                }
+                Iterator<Node> a = nodes.iterator();
+                Iterator<Node> b = path.getNodes().iterator();
+                while (a.hasNext()) {
+                        assert b.hasNext();
+                        if (a.next() != b.next()) {
+                                return false;
+                        }
+                }
+                return true;
+        }
+
+
+        // public boolean isEmpty() {
+        //      return nodes.isEmpty();
+        // }
 }