Home
last modified time | relevance | path

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

123

/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/bible/bible_douayRheims/
H A DExodus.txt750 …28:7. It shall have the two edges joined in the top on both sides, that they may be closed togethe…
/plugin/bpmnio/vendor/bpmn-js/
H A DCHANGELOG.md876 * `FIX`: correctly auto-place from boundary events attached to host edges ([#788](https://github.co…
/plugin/bpmnioeditor/vendor/bpmnio-js/
H A Dbpmn-modeler.development.js42770 edges = asEdges(oldBounds);
42773 var referencePoint = getReferencePoint(labelMid, edges);
/plugin/c3chart/assets/
H A Dd3.min.js2 …(i=0;i<g;++i)(o=v_[i])&&(o.halfedges.length||delete v_[i])}(u,a,c,s)}this.edges=__,this.cells=v_,d…
/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/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/davcal/fullcalendar-3.10.5/
H A Dfullcalendar.less500 /* spacing between events and edges */
/plugin/diagramsnet/lib/js/
H A Dapp.min.js865 …edges=a;this.ids=[];for(var b=0;b<a.length;b++)this.ids.push(mxObjectIdentity.get(a[b]))}mxGraphHi… method in mxGraphHierarchyEdge
869 …hyEdge.prototype.getCoreCell=function(){return null!=this.edges&&0<this.edges.length?this.edges[0]…
924 (p=1,null!=n.edges?p=n.edges.length:mxLog.warn("edge.edges is null"),n.width=(p-1)*this.parallelEdg…
932 …edges.length,q++,g.push(t[u])}else f+=r.edges.length,q++,g.push(r)}e.width>(f+1)*this.prefHozEdgeS…
934 …_EAST||this.orientation==mxConstants.DIRECTION_SOUTH,m=0;m<a.edges.length;m++){var n=a.edges[m],p=…
964 …el,c;for(c in b.edgeMapper)for(var d=b.edgeMapper[c],e=0;e<d.edges.length;e++)a.push(d.edges[e]);a…
1022 …edges?0:this.edges.length};mxCell.prototype.getEdgeIndex=function(a){return mxUtils.indexOf(this.e…
1023 …edges||a.getTerminal(!b)!=this||0>mxUtils.indexOf(this.edges,a))&&(null==this.edges&&(this.edges=[…
10454 …edges.length&&f.isTableCell(b.vertices[0])}},{name:"rowspan",dispName:"Rowspan",type:"int",min:1,d…
10461 …edges.length?b.vertices[0]:null,d=c.editorUi.editor.graph;return null!=f&&(d.isSwimlane(f)||0<d.mo…
[all …]
H A Dextensions.min.js1574 …is.nodesMap={},this.edges=[],this.importGraph(d,b,b.getDefaultParent()),q=0;q<this.edges.length;q+…
1587 …=k.parent;for(k=0;k<q.length;k++)this.importNode(q[k],m,e,d,b);this.edges.push({edges:this.getDire…
1705 …edges=cw,this.cells=ow,aw=sw=cw=ow=null}fw.prototype={constructor:fw,polygons:function(){var t=thi…
1728 …edges(),(function(n){var r=e.edge(n.v,n.w)||{weight:0,minlen:1},i=t.edge(n);e.setEdge(n.v,n.w,{wei… method in a
H A Dviewer-static.min.js831 …edges=a;this.ids=[];for(var b=0;b<a.length;b++)this.ids.push(mxObjectIdentity.get(a[b]))}mxGraphHi… method in mxGraphHierarchyEdge
835 …hyEdge.prototype.getCoreCell=function(){return null!=this.edges&&0<this.edges.length?this.edges[0]…
890 (p=1,null!=n.edges?p=n.edges.length:mxLog.warn("edge.edges is null"),n.width=(p-1)*this.parallelEdg…
898 …edges.length,q++,g.push(t[u])}else f+=r.edges.length,q++,g.push(r)}e.width>(f+1)*this.prefHozEdgeS…
900 …_EAST||this.orientation==mxConstants.DIRECTION_SOUTH,m=0;m<a.edges.length;m++){var n=a.edges[m],p=…
930 …el,c;for(c in b.edgeMapper)for(var d=b.edgeMapper[c],e=0;e<d.edges.length;e++)a.push(d.edges[e]);a…
988 …edges?0:this.edges.length};mxCell.prototype.getEdgeIndex=function(a){return mxUtils.indexOf(this.e…
989 …edges||a.getTerminal(!b)!=this||0>mxUtils.indexOf(this.edges,a))&&(null==this.edges&&(this.edges=[…
3122 …edges.length&&c.isTableCell(b.vertices[0])}},{name:"rowspan",dispName:"Rowspan",type:"int",min:1,d…
3129 …edges.length?b.vertices[0]:null,f=d.editorUi.editor.graph;return null!=c&&(f.isSwimlane(c)||0<f.mo…
[all …]
H A Dviewer.min.js831 …edges=a;this.ids=[];for(var b=0;b<a.length;b++)this.ids.push(mxObjectIdentity.get(a[b]))}mxGraphHi… method in mxGraphHierarchyEdge
835 …hyEdge.prototype.getCoreCell=function(){return null!=this.edges&&0<this.edges.length?this.edges[0]…
890 (p=1,null!=n.edges?p=n.edges.length:mxLog.warn("edge.edges is null"),n.width=(p-1)*this.parallelEdg…
898 …edges.length,q++,g.push(t[u])}else f+=r.edges.length,q++,g.push(r)}e.width>(f+1)*this.prefHozEdgeS…
900 …_EAST||this.orientation==mxConstants.DIRECTION_SOUTH,m=0;m<a.edges.length;m++){var n=a.edges[m],p=…
930 …el,c;for(c in b.edgeMapper)for(var d=b.edgeMapper[c],e=0;e<d.edges.length;e++)a.push(d.edges[e]);a…
988 …edges?0:this.edges.length};mxCell.prototype.getEdgeIndex=function(a){return mxUtils.indexOf(this.e…
989 …edges||a.getTerminal(!b)!=this||0>mxUtils.indexOf(this.edges,a))&&(null==this.edges&&(this.edges=[…
3122 …edges.length&&c.isTableCell(b.vertices[0])}},{name:"rowspan",dispName:"Rowspan",type:"int",min:1,d…
3129 …edges.length?b.vertices[0]:null,f=d.editorUi.editor.graph;return null!=c&&(f.isSwimlane(c)||0<f.mo…
[all …]
/plugin/diagramsnet/lib/js/diagramly/
H A DDiffSync.js36 source: true, target: true, edges: true, geometry: true, style: true,
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 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];
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 …]
/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/diagramsnet/lib/js/grapheditor/
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
H A DMenus.js1095 var edges = [];
1121 edges.push(cell);
1127 'values', values, 'cells', edges));
/plugin/diagramsnet/lib/js/mermaid/
H A Dmermaid.min.js6 …edges=cw,this.cells=ow,aw=sw=cw=ow=null}fw.prototype={constructor:fw,polygons:function(){var t=thi…
29 …edges(),(function(n){var r=e.edge(n.v,n.w)||{weight:0,minlen:1},i=t.edge(n);e.setEdge(n.v,n.w,{wei… property in t.exports.write.e
/plugin/diagramsnet/lib/js/orgchart/
H A DOrgChart.Layout.min.js1 …edges,rect,diff,desiredLeft,desiredRight,verticalSpacer,spacerTop,spacerBottom;for(node.getAssista…

123