sunnypilot v2026.002.000
version: sunnypilot v2026.002.000 (staging) date: 2026-07-21T07:44:02 master commit: 2c334ede443d7391d27575af8c854a095ba702a8
This commit is contained in:
commit
de77c89cf6
3995 files changed
+1260688
No files matched your search
+3
@@ -0,0 +1,3 @@
|
||||
var dagre=(()=>{var R=(e,r)=>()=>(r||e((r={exports:{}}).exports,r),r.exports);var A=R((Di,pe)=>{var tt=(()=>{var e=Object.defineProperty,r=Object.getOwnPropertyNames,t=(T,j,q)=>j in T?e(T,j,{enumerable:!0,configurable:!0,writable:!0,value:q}):T[j]=q,n=(T,j)=>function(){return j||(0,T[r(T)[0]])((j={exports:{}}).exports,j),j.exports},i=(T,j,q)=>t(T,typeof j!="symbol"?j+"":j,q),a=n({"lib/graph.js"(T,j){"use strict";var q="\0",w="\0",_="",p=class{constructor(l){i(this,"_isDirected",!0),i(this,"_isMultigraph",!1),i(this,"_isCompound",!1),i(this,"_label"),i(this,"_defaultNodeLabelFn",()=>{}),i(this,"_defaultEdgeLabelFn",()=>{}),i(this,"_nodes",{}),i(this,"_in",{}),i(this,"_preds",{}),i(this,"_out",{}),i(this,"_sucs",{}),i(this,"_edgeObjs",{}),i(this,"_edgeLabels",{}),i(this,"_nodeCount",0),i(this,"_edgeCount",0),i(this,"_parent"),i(this,"_children"),l&&(this._isDirected=Object.hasOwn(l,"directed")?l.directed:!0,this._isMultigraph=Object.hasOwn(l,"multigraph")?l.multigraph:!1,this._isCompound=Object.hasOwn(l,"compound")?l.compound:!1),this._isCompound&&(this._parent={},this._children={},this._children[w]={})}isDirected(){return this._isDirected}isMultigraph(){return this._isMultigraph}isCompound(){return this._isCompound}setGraph(l){return this._label=l,this}graph(){return this._label}setDefaultNodeLabel(l){return this._defaultNodeLabelFn=l,typeof l!="function"&&(this._defaultNodeLabelFn=()=>l),this}nodeCount(){return this._nodeCount}nodes(){return Object.keys(this._nodes)}sources(){var l=this;return this.nodes().filter(h=>Object.keys(l._in[h]).length===0)}sinks(){var l=this;return this.nodes().filter(h=>Object.keys(l._out[h]).length===0)}setNodes(l,h){var E=arguments,k=this;return l.forEach(function(y){E.length>1?k.setNode(y,h):k.setNode(y)}),this}setNode(l,h){return Object.hasOwn(this._nodes,l)?(arguments.length>1&&(this._nodes[l]=h),this):(this._nodes[l]=arguments.length>1?h:this._defaultNodeLabelFn(l),this._isCompound&&(this._parent[l]=w,this._children[l]={},this._children[w][l]=!0),this._in[l]={},this._preds[l]={},this._out[l]={},this._sucs[l]={},++this._nodeCount,this)}node(l){return this._nodes[l]}hasNode(l){return Object.hasOwn(this._nodes,l)}removeNode(l){var h=this;if(Object.hasOwn(this._nodes,l)){var E=k=>h.removeEdge(h._edgeObjs[k]);delete this._nodes[l],this._isCompound&&(this._removeFromParentsChildList(l),delete this._parent[l],this.children(l).forEach(function(k){h.setParent(k)}),delete this._children[l]),Object.keys(this._in[l]).forEach(E),delete this._in[l],delete this._preds[l],Object.keys(this._out[l]).forEach(E),delete this._out[l],delete this._sucs[l],--this._nodeCount}return this}setParent(l,h){if(!this._isCompound)throw new Error("Cannot set parent in a non-compound graph");if(h===void 0)h=w;else{h+="";for(var E=h;E!==void 0;E=this.parent(E))if(E===l)throw new Error("Setting "+h+" as parent of "+l+" would create a cycle");this.setNode(h)}return this.setNode(l),this._removeFromParentsChildList(l),this._parent[l]=h,this._children[h][l]=!0,this}_removeFromParentsChildList(l){delete this._children[this._parent[l]][l]}parent(l){if(this._isCompound){var h=this._parent[l];if(h!==w)return h}}children(l=w){if(this._isCompound){var h=this._children[l];if(h)return Object.keys(h)}else{if(l===w)return this.nodes();if(this.hasNode(l))return[]}}predecessors(l){var h=this._preds[l];if(h)return Object.keys(h)}successors(l){var h=this._sucs[l];if(h)return Object.keys(h)}neighbors(l){var h=this.predecessors(l);if(h){let k=new Set(h);for(var E of this.successors(l))k.add(E);return Array.from(k.values())}}isLeaf(l){var h;return this.isDirected()?h=this.successors(l):h=this.neighbors(l),h.length===0}filterNodes(l){var h=new this.constructor({directed:this._isDirected,multigraph:this._isMultigraph,compound:this._isCompound});h.setGraph(this.graph());var E=this;Object.entries(this._nodes).forEach(function([O,I]){l(O)&&h.setNode(O,I)}),Object.values(this._edgeObjs).forEach(function(O){h.hasNode(O.v)&&h.hasNode(O.w)&&h.setEdge(O,E.edge(O))});var k={};function y(O){var I=E.parent(O);if(I===void 0||h.hasNode(I))return k[O]=I,I;if(I in k)return k[I];for(var L=[O,I],F=I;;){if(F=E.parent(F),F===void 0||h.hasNode(F)){for(var U=0;U<L.length;U++)k[L[U]]=F;return F}else if(F in k){for(var ce=k[F],$=0;$<L.length;$++)k[L[$]]=ce;return ce}L.push(F)}}return this._isCompound&&h.nodes().forEach(O=>h.setParent(O,y(O))),h}setDefaultEdgeLabel(l){return this._defaultEdgeLabelFn=l,typeof l!="function"&&(this._defaultEdgeLabelFn=()=>l),this}edgeCount(){return this._edgeCount}edges(){return Object.values(this._edgeObjs)}setPath(l,h){var E=this,k=arguments;return l.reduce(function(y,O){return k.length>1?E.setEdge(y,O,h):E.setEdge(y,O),O}),this}setEdge(){var l,h,E,k,y=!1,O=arguments[0];typeof O=="object"&&O!==null&&"v"in O?(l=O.v,h=O.w,E=O.name,arguments.length===2&&(k=arguments[1],y=!0)):(l=O,h=arguments[1],E=arguments[3],arguments.length>2&&(k=arguments[2],y=!0)),l=""+l,h=""+h,E!==void 0&&(E=""+E);var I=g(this._isDirected,l,h,E);if(ObjLine truncated
|
||||
/*! For license information please see dagre.min.js.LEGAL.txt */
|
||||
//# sourceMappingURL=dagre.min.js.map
|
||||
Reference in new issue
Block a user