Home
last modified time | relevance | path

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

123

/plugin/combo/vendor/antlr/antlr4-php-runtime/src/Dfa/
H A DDFA.php55 $precedenceState->edges = new \SplFixedArray();
96 if ($this->s0->edges === null) {
100 if ($precedence < 0 || $precedence >= \count($this->s0->edges)) {
104 return $this->s0->edges[$precedence] ?? null;
126 if ($this->s0->edges === null) {
130 if ($precedence >= $this->s0->edges->count()) {
131 $this->s0->edges->setSize($precedence + 1);
137 $this->s0->edges[$precedence] = $startState;
H A DDFASerializer.php37 $count = $state->edges === null ? 0 : $state->edges->count();
41 $t = $state->edges[$i];
H A DDFAState.php52 public $edges; variable in Antlr\\Antlr4\\Runtime\\Dfa\\DFAState
/plugin/diagramsnet/lib/plugins/trees/
Dtrees.js99 var edges = graph.getIncomingEdges(cell);
101 if (edges != null && edges.length > 0)
103 var sib = graph.getOutgoingEdges(graph.model.getTerminal(edges[0], true));
126 var edges = graph.getIncomingEdges(cell);
128 if (edges != null && edges.length > 0)
130 graph.setSelectionCell(graph.model.getTerminal(edges[0], true));
235 var edges = graph.getIncomingEdges(cells[i]);
236 cells = cells.concat(edges);
269 var edges = graph.getIncomingEdges(state.cell);
271 for (var j = 0; j < edges.length; j++)
[all …]
/plugin/authgooglesheets/vendor/google/apiclient-services/src/CloudIdentity/
DMembershipAdjacencyList.php33 public function setEdges($edges) argument
35 $this->edges = $edges;
42 return $this->edges;
/plugin/diagramsnet/lib/js/diagramly/
DTrees.js272 var edges = graph.getIncomingTreeEdges(cell);
274 if (edges != null && edges.length > 0)
276 var sib = graph.getOutgoingTreeEdges(graph.model.getTerminal(edges[0], true));
299 var edges = graph.getIncomingTreeEdges(cell);
301 if (edges != null && edges.length > 0)
303 graph.setSelectionCell(graph.model.getTerminal(edges[0], true));
405 var edges = graph.getIncomingTreeEdges(cells[i]);
406 cells = cells.concat(edges);
440 var edges = graph.getIncomingTreeEdges(state.cell);
442 for (var j = 0; j < edges.length; j++)
[all …]
DEditor.js405 state.edges.length == 0 && graph.isTableCell(state.vertices[0]);
412 state.edges.length == 0 && graph.isTableCell(state.vertices[0]);
417 … var cell = (state.vertices.length == 1 && state.edges.length == 0) ? state.vertices[0] : null;
426 return state.vertices.length == 1 && state.edges.length == 0 &&
431 … var cell = (state.vertices.length == 1 && state.edges.length == 0) ? state.vertices[0] : null;
440 return state.vertices.length == 1 && state.edges.length == 0 &&
460 … var cell = (state.vertices.length == 1 && state.edges.length == 0) ? state.vertices[0] : null;
466 return state.vertices.length == 1 && state.edges.length == 0;
484 return state.vertices.length == 1 && state.edges.length == 0;
488 … var cell = (state.vertices.length == 1 && state.edges.length == 0) ? state.vertices[0] : null;
[all …]
DDiffSync.js36 source: true, target: true, edges: true, geometry: true, style: true,
/plugin/diagramsnet/lib/plugins/
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)
Dvoice.js1302 var edges = graph.getAllEdges(graph.getSelectionCells());
1304 if (edges.length > 0)
1306 graph.setSelectionCells(edges);
/plugin/graphgear/
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/
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/
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.php270 if ($s->edges === null || $t < self::MIN_DFA_EDGE || $t > self::MAX_DFA_EDGE) {
274 $target = $s->edges[$t - self::MIN_DFA_EDGE] ?? null;
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.php627 $edges = $previousD->edges;
629 if ($edges === null || $t + 1 < 0 || $t + 1 >= $edges->count()) {
633 return $edges[$t + 1];
2355 if ($from->edges === null) {
2356 $from->edges = new \SplFixedArray($this->atn->maxTokenType + 1 + 1);
2359 $from->edges[$t + 1] = $to;
/plugin/diagrams/
H A Dall.less43 // fix for sometimes missing edges
/plugin/stlviewer/stlviewer/
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/
DmxGraphMlCodec.js32 this.edges = []; property
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), property
/plugin/revealjs/css/
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/minecraftrecipe/
Dstyle.css65 image-rendering: crisp-edges;
/plugin/diagramsnet/lib/js/grapheditor/
DMenus.js1095 var edges = [];
1121 edges.push(cell);
1127 'values', values, 'cells', edges));
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 &&
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/
DREADME.markdown77 edgeFriction | integer | 0.15 | Resistance when swiping edges of non-infinite carousels
/plugin/mermaid/
H A Dmermaid.min.js464 …is.edges.push(l);else throw new Error(`Edge limit exceeded. ${this.edges.length} edges found, but …
466 Initialize mermaid with maxEdges set to a higher number to allow more edges.
468 …linkStyle are between 0 and ${this.edges.length-1}. (Help: Ensure that the index is within the ran… property
816edges[e.tokenTypeIdx]}function m$e(t,e,r){let n=new u1,i=[];for(let s of t.elements){if(r.is(s.alt…
1208 …ypeEnd:s?"":"requirement_arrow",look:e.look};n.push(l),a++}return{nodes:r,edges:n,other:{},config:…
1976edges:o(function(e){return this.filter(function(r){return r.isEdge()}).filter(e)},"edges"),byGroup…
2180edges=[],this.graphManager=d,m!=null&&p!=null?this.rect=new a(p.x,p.y,m.width,m.height):this.rect=…
2213 …mise.all(r.children.map((a,s)=>rye(t,e,a,n<0?s:n,i)))}function wet(t,e){e.edges().map((r,n)=>{let …
2552edges:[],registeredIds:{},config:G2e,dataStructures:void 0,elements:{}})),Dnt=o(()=>{vr.reset(),kr…
2583edges=[],this.graphManager=d,m!=null&&p!=null?this.rect=new a(p.x,p.y,m.width,m.height):this.rect=…
[all …]

123