Changeset 1691 for XIOS/dev/dev_trunk_omp/inputs/vis2.html

Timestamp:

09/02/19 17:51:20 (5 years ago)

Author:

yushan

Message:

Generic_testcase : add one folder for testing 3D fields.

File:

• XIOS/dev/dev_trunk_omp/inputs/vis2.html (modified) (10 diffs)

XIOS/dev/dev_trunk_omp/inputs/vis2.html

@@ -70 +70 @@
 
     <script type="text/javascript">
+
         //######################################################################################################
         $(document).ready(function() {
@@ -88 +89 @@
                 if (node.class == 5) //temporal filter
                 {
+                    // disable all parents
+                    node.hidden = true;
+                    console.log("node.id = ", node.id, "hidden = ", node.hidden);
+                    nodes.update(node);
+
+                    var connectedEdgeArray = edges.get(network.getConnectedEdges(node.id));
+                    for (j = 0; j < connectedEdgeArray.length; j++) {
+                        var edge = connectedEdgeArray[j];
+                        if (edge.to == node.id) {
+                            edge.hidden = true;
+                        }
+
+                    }
+                    edges.update(connectedEdgeArray);
+
+                    var allNode = nodes.get(allParentsNode);
+                    for (i = 0; i < allNode.length; i++) {
+                        var node = allNode[i];
+                        node.hidden = true;
+                    }
+                    nodes.update(allNode);
+
+                    for (i = 0; i < allNode.length; i++) {
+                        var node = allNode[i];
+
+                        var cNodes = nodes.get(network.getConnectedNodes(node.id, 'to'));
+                        for (j = 0; j < cNodes.length; j++) {
+                            var cnode = cNodes[j];
+
+                            if (cnode.hidden != true) {
+                                node.hidden = false;
+                                nodes.update(node);
+                                break;
+                            }
+                        }
+                    }
+                    nodes.update(allNode);
+
+                    node = nodes.get(nodeSelected);
+                    node.hidden = false;
+                    console.log("node.id = ", node.id, "hidden = ", node.hidden);
+                    nodes.update(node);
+
+                    allNode = nodes.get();
+                    nodes.update(allNode);
+
+
+
+                    // enable last input
                     var inputnodes = network.getConnectedNodes(node.id, 'from');
                     var repere = 0;
@@ -578 +628 @@
                 }
                 nodes.update(connectedChild);
-            });
-
-
-
-            //===========================================================
-            $('#enableAllChild').on('click', function() {
-                console.log("enableAllChild: ", allChildNode);
-
-                var node = nodes.get(nodeSelected);
-                node.hidden = false;
-                console.log("node.id = ", node.id, "hidden = ", node.hidden);
-                nodes.update(node);
-
                 var connectedEdgeArray = edges.get(network.getConnectedEdges(node.id));
                 for (j = 0; j < connectedEdgeArray.length; j++) {
@@ -600 +637 @@
                 }
                 edges.update(connectedEdgeArray);
+
+            });
+
+
+
+            //===========================================================
+            $('#enableAllChild').on('click', function() {
+                console.log("enableAllChild: ", allChildNode);
+
+                var node = nodes.get(nodeSelected);
+                node.hidden = false;
+                console.log("node.id = ", node.id, "hidden = ", node.hidden);
+                nodes.update(node);
+
+                var connectedEdgeArray = edges.get(network.getConnectedEdges(node.id));
+                for (j = 0; j < connectedEdgeArray.length; j++) {
+                    var edge = connectedEdgeArray[j];
+                    if (edge.from == node.id) {
+                        edge.hidden = false;
+                    }
+
+                }
+                edges.update(connectedEdgeArray);
+
+                var edgesforupdate = [];
+                var count=0;
 
 
@@ -630 +693 @@
                         }
                     }
-                }
-
-                nodes.update(allNode);
+                    var decendentEdges = edges.get(network.getConnectedEdges(node.id)); 
+                    for (j = 0; j < decendentEdges.length; j++) {
+                        if (decendentEdges[j].from == node.id) {
+                            edgesforupdate[count] = decendentEdges[j];
+
+                            edgesforupdate[count].hidden = false;
+                            count++;
+                        }
+                    }
+                }
+
+                nodes.update(allNode);
+                edges.update(edgesforupdate);
 
                 allNode = nodes.get();
                 nodes.update(allNode);
+
+                
 
             });
@@ -657 +732 @@
                 edges.update(connectedEdgeArray);
 
+                var edgesforupdate = [];
+                var count=0;
+
                 var allNode = nodes.get(allChildNode);
                 for (i = 0; i < allNode.length; i++) {
@@ -670 +748 @@
                     for (j = 0; j < pNodes.length; j++) {
                         var pnode = pNodes[j];
-                        // console.log("node.id = ", node.id, "node.hidden = ", node.hidden, "pnode.id=", pnode.id, "pnode.hidden = ", pnode.hidden);
 
                         if (pnode.hidden != true) {
@@ -678 +755 @@
                         }
                     }
-                    // console.log("node.id = ", node.id, "node.hidden = ", node.hidden);
-                }
-                nodes.update(allNode);
+                    var decendentEdges = edges.get(network.getConnectedEdges(node.id)); 
+                    for (j = 0; j < decendentEdges.length; j++) {
+                        if (decendentEdges[j].from == node.id) {
+                            edgesforupdate[count] = decendentEdges[j];
+
+                            edgesforupdate[count].hidden = true;
+                            count++;
+                        }
+                    }
+                }
+                nodes.update(allNode);
+                edges.update(edgesforupdate);
 
                 node = nodes.get(nodeSelected);
@@ -897 +983 @@
                                         enabled: true,
                                         direction: "LR",
-                                        sortMethod: "direct",
+                                        sortMethod: "directed",
                                         levelSeparation: 300,
                                         nodeSpacing: 80,
@@ -1065 +1151 @@
 
             <button type="button" class="btn btn-success" id="lastTemporal">Enable last temporal input</button>
-            <button type="button" class="btn btn-success" id="showGraph">Show subgraph (and hide other)</button>
+            <button type="button" class="btn btn-success" id="showGraph">Show subgraph (and hide other)</button>