Home
last modified time | relevance | path

Searched refs:edges (Results 1 – 25 of 63) sorted by relevance

123

/plugin/combo/vendor/antlr/antlr4-php-runtime/src/Dfa/
H A DDFA.php55 $precedenceState->edges = new \SplFixedArray();
66 * The {@see DFAState::$edges} array for this start state contains outgoing
67 * edges supplying individual start states corresponding to specific
96 if ($this->s0->edges === null) {
97 throw new \RuntimeException('s0.edges cannot be null for a precedence DFA.');
100 if ($precedence < 0 || $precedence >= \count($this->s0->edges)) {
104 return $this->s0->edges[$precedence] ?? null;
126 if ($this->s0->edges === null) {
127 throw new \RuntimeException('Unexpected null edges.');
130 if ($precedence >= $this->s0->edges
[all...]
H A DDFASerializer.php37 $count = $state->edges === null ? 0 : $state->edges->count();
41 $t = $state->edges[$i];
H A DDFAState.php47 * `edges[symbol]` points to target of symbol. Shift up by 1 so (-1)
48 * {@see Token::EOF} maps to `edges[0]`.
52 public $edges; variable in Antlr\\Antlr4\\Runtime\\Dfa\\DFAState
/plugin/diagramsnet/lib/plugins/trees/
H A Dtrees.js99 var edges = graph.getIncomingEdges(cell);
101 if (edges != null && edges.length > 0)
128 if (edges != null && edges.length > 0)
236 cells = cells.concat(edges);
271 for (var j = 0; j < edges.length; j++)
273 mxUtils.remove(edges[j], cells);
339 if (edges.length > 0)
375 if (edges.length > 0)
465 if (edges.length > 0)
807 if (edges != null && edges.length > 0)
[all …]
/plugin/authgooglesheets/vendor/google/apiclient-services/src/CloudIdentity/
H A DMembershipAdjacencyList.php33 public function setEdges($edges) argument
35 $this->edges = $edges;
42 return $this->edges;
/plugin/diagramsnet/lib/js/diagramly/
H A DTrees.js274 if (edges != null && edges.length > 0)
301 if (edges != null && edges.length > 0)
406 cells = cells.concat(edges);
442 for (var j = 0; j < edges.length; j++)
444 mxUtils.remove(edges[j], cells);
511 if (edges.length > 0)
549 if (edges.length > 0)
643 if (edges.length > 0)
901 if (edges.length == 0)
955 for (var i = 0; i < edges.length; i++)
[all …]
H A DEditor.js405 state.edges.length == 0 && graph.isTableCell(state.vertices[0]);
412 state.edges.length == 0 && graph.isTableCell(state.vertices[0]);
466 return state.vertices.length == 1 && state.edges.length == 0;
484 return state.vertices.length == 1 && state.edges.length == 0;
494 return state.vertices.length == 1 && state.edges.length == 0;
505 return state.vertices.length == 1 && state.edges.length == 0;
4534 var edges = sstate.edges;
4541 for (var i = 0; i < edges.length; i++)
5108 if (state.vertices.length == 1 && state.edges.length == 0)
5112 else if (state.vertices.length == 0 && state.edges.length == 1)
[all …]
H A DDiffSync.js36 source: true, target: true, edges: true, geometry: true, style: true,
H A DEditorUi.js12931 var edges = [];
13030 edges.push(JSON.parse(value));
13092 if (edges != null)
13094 for (var e = 0; e < edges.length; e++)
13096 if (lookups[edges[e].to] == null)
13098 lookups[edges[e].to] = {};
13191 for (var e = 0; e < edges.length; e++)
13193 lookups[edges[e].to][cell.getAttribute(edges[e].to)] = cell;
13294 for (var e = 0; e < edges.length; e++)
13296 var edge = edges[e];
/plugin/diagramsnet/lib/plugins/
H A Dexplore.js296 var edges = sourceGraph.getEdges(sourceCell, null, true, true, false, true);
297 var cells = edges;
300 if (cell.startIndex != null || (pageSize > 0 && edges.length > pageSize))
304 cells = edges.slice(Math.max(0, start), Math.min(edges.length, start + pageSize));
336 if (edges.length > (cell.startIndex || 0) + pageSize)
H A Dvoice.js1302 var edges = graph.getAllEdges(graph.getSelectionCells());
1304 if (edges.length > 0)
1306 graph.setSelectionCells(edges);
/plugin/graphgear/
H A Dsyntax.php14 var $edges; variable in syntax_plugin_graphgear
181 foreach($this->edges as $edge){
220 if($from && $to) $this->edges[] = array($from,$to,(array)$opts);
/plugin/diagramsnet/lib/plugins/webcola/
H A DmxWebColaLayout.js76 var edges = this.graph.getEdges(parent, null, true, true, true, true);
79 if (edges.length != 0)
82 for (var i = 0; i < edges.length; i++)
84 var edge = edges[i];
/plugin/jdraw/src/com/mxgraph/examples/swing/
H A DGraphEditor.java.bak86 // Sets the edge template to be used for creating new edges if an edge
425 * type (eg. both vertices or both edges).
457 * A graph that creates new edges from a given template edge.
462 * Holds the edge to be used as a template for inserting new edges.
468 * the middle control point of edges is double clicked (flipped).
476 * Sets the edge template to be used to inserting edges.
574 * new edges.
/plugin/combo/vendor/antlr/antlr4-php-runtime/src/Atn/
H A DLexerATNSimulator.php222 // that already has lots of edges out of it. e.g., .* in comments.
270 if ($s->edges === null || $t < self::MIN_DFA_EDGE || $t > self::MAX_DFA_EDGE) {
274 $target = $s->edges[$t - self::MIN_DFA_EDGE] ?? null;
758 // Only track edges within the DFA bounds
766 if ($from->edges === null) {
768 $from->edges = new \SplFixedArray(self::MAX_DFA_EDGE - self::MIN_DFA_EDGE + 1);
771 $from->edges[$t - self::MIN_DFA_EDGE] = $to; // connect
H A DParserATNSimulator.php173 * decision when setting the {@see DFAState::$edges} field.
185 * It follows the {@see DFAState::$edges} field to new targets. The DFA simulator
186 * will either find {@see DFAState::$edges} to be `null`, to be non-`null` and
187 * `dfa.edges[t]` null, or `dfa.edges[t]` to be non-null. The
190 * simulation. It could also race trying to get `dfa.edges[t]`, but either
627 $edges = $previousD->edges;
629 if ($edges === null || $t + 1 < 0 || $t + 1 >= $edges
[all...]
/plugin/stlviewer/stlviewer/
H A Dstl_viewer.min.js2edges&&o.scene.remove(e.edges),e.edges=null,t)){var i=!1;if(a=a||!1,!e.edges||a){var n=e.mesh.geom…
/plugin/diagramsnet/lib/js/diagramly/graphml/
H A DmxGraphMlCodec.js32 this.edges = [];
35 for (var i = 0; i < this.edges.length; i++)
37 var edgesObj = this.edges[i];
38 var edges = edgesObj.edges;
42 for (var j = 0; j < edges.length; j++)
44 this.importEdge(edges[j], graph, parent, dx, dy);
517 this.edges.push({
518 edges: this.getDirectChildNamedElements(pageElement, mxGraphMlConstants.EDGE),
/plugin/revealjs/css/
H A Dreveal.css386 .reveal .controls[data-controls-layout="edges"] {
391 .reveal .controls[data-controls-layout="edges"] .navigate-left,
392 .reveal .controls[data-controls-layout="edges"] .navigate-right,
393 .reveal .controls[data-controls-layout="edges"] .navigate-up,
394 .reveal .controls[data-controls-layout="edges"] .navigate-down {
397 .reveal .controls[data-controls-layout="edges"] .navigate-left {
401 .reveal .controls[data-controls-layout="edges"] .navigate-right {
405 .reveal .controls[data-controls-layout="edges"] .navigate-up {
409 .reveal .controls[data-controls-layout="edges"] .navigate-down {
/plugin/diagramsnet/lib/js/grapheditor/
H A DMenus.js1095 var edges = [];
1121 edges.push(cell);
1127 'values', values, 'cells', edges));
H A DFormat.js196 return {vertices: [], edges: [], cells: [], x: null, y: null, width: null, height: null,
283 result.edges.push(cell);
1673 if (!ss.containsLabel || ss.edges.length == 0)
1678 if (!ss.containsLabel && ss.edges.length == 0 &&
2328 if (ss.vertices.length > 0 && ss.edges.length > 0)
2690 if (rect.edges.length == 0 && rect.vertices.length == 1 &&
5434 if (ss.edges.length == ss.cells.length)
5555 if (ss.edges.length == ss.cells.length)
5566 if (Graph.lineJumpsEnabled && ss.edges.length > 0 &&
5694 if (Graph.lineJumpsEnabled && ss.edges.length > 0 &&
H A DGraph.js2173 Graph.prototype.getVerticesAndEdges = function(vertices, edges) argument
2176 edges = (edges != null) ? edges : true;
2181 return (vertices && model.isVertex(cell)) || (edges && model.isEdge(cell));
2372 Graph.prototype.getCellAt = function(x, y, parent, vertices, edges, ignoreFn) argument
2388 Graph.prototype.getScaledCellAt = function(x, y, parent, vertices, edges, ignoreFn) argument
2391 edges = (edges != null) ? edges : true;
2410 var result = this.getScaledCellAt(x, y, cell, vertices, edges, ignoreFn);
2416 else if (this.isCellVisible(cell) && (edges && this.model.isEdge(cell) ||
4571 Graph.prototype.selectCells = function(vertices, edges, parent) argument
/plugin/imagecarousel/vendor/slick/
H A DREADME.markdown77 edgeFriction | integer | 0.15 | Resistance when swiping edges of non-infinite carousels
/plugin/diagramsnet/lib/js/orgchart/
H A DOrgChart.Layout.min.js1edges,rect,diff,desiredLeft,desiredRight,verticalSpacer,spacerTop,spacerBottom;for(node.getAssista…
/plugin/dirtylittlehelper/script/
H A Dmermaid.min.js.map1edges.js","webpack://mermaid/./src/dagre-wrapper/index.js","webpack://mermaid/./src/diagrams/class…

123