Home
last modified time | relevance | path

Searched refs:roots (Results 1 – 25 of 48) sorted by last modified time

12

/plugin/aichat/vendor/mehrab-wj/tiktoken-php/data/
H A Dvocab.bpe23529 Ġgrass roots
/plugin/xlsx2dw/packages/xlsx/
H A Dxlsx.mjs24199 throw new Error("Document has multiple roots");
/plugin/elasticsearch/vendor/elasticsearch/elasticsearch/
H A DLICENSE-LGPL187 (For example, a function in a library to compute square roots has
192 root function must still compute square roots.)
/plugin/ckgedit/ckeditor/
H A DLICENSE.md539 (For example, a function in a library to compute square roots has
544 root function must still compute square roots.)
/plugin/diagramsnet/lib/plugins/webcola/
H A Dcola.min.js2 …roots=[],d)this.initModulesFromGroup(d);else{this.roots.push(new j);for(var f=0;f<a;++f)this.roots…
/plugin/diagramsnet/lib/js/
H A Dviewer-static.min.js841 …k=function(){var a=[];if(null!=this.roots)for(var b=0;b<this.roots.length;b++){var c=this.vertexMa…
843 …Rank+1;b++)a[b]=[],this.ranks[b]=a[b];var c=null;if(null!=this.roots)for(var d=this.roots,c=[],b=0…
852 …roup=[];var a=[],b={};if(null!=this.roots)for(var c=0;c<this.roots.length;c++){var d=this.vertexMa…
855 …Rank+1;b++)a[b]=[],this.ranks[b]=a[b];var c=null;if(null!=this.roots)for(var d=this.roots,c=[],b=0…
871 …lues(),d={},e=0;e<c.length;e++)d[c[e].id]=c[e];c=null;if(null!=a.roots)for(var f=a.roots,c=[],e=0;…
907 …();var b=mxUtils.clone(a.vertexMapper,null,!0),c=null;if(null!=a.roots)for(var d=a.roots,c=[],e=0;…
913 b[f]):1)&&c.isVertex(b[f])&&e.push(b[f]);this.roots=e}c.beginUpdate();try{this.run(a),this.resizePa…
918 …roots&&null!=a){var d={};this.filterDescendants(a,d);this.roots=[];var e=!0,f;for(f in d)if(null!=…
919 …;for(f in k)d.push(k[f]);this.model=new mxGraphHierarchyModel(this,d,this.roots,a,this.tightenToSo…
937 …roots=[];var e=!0,f;for(f in d)if(null!=d[f]){e=!1;break}for(var g=0;!e&&g<this.swimlanes.length;)…
[all …]
H A Dviewer.min.js841 …k=function(){var a=[];if(null!=this.roots)for(var b=0;b<this.roots.length;b++){var c=this.vertexMa…
843 …Rank+1;b++)a[b]=[],this.ranks[b]=a[b];var c=null;if(null!=this.roots)for(var d=this.roots,c=[],b=0…
852 …roup=[];var a=[],b={};if(null!=this.roots)for(var c=0;c<this.roots.length;c++){var d=this.vertexMa…
855 …Rank+1;b++)a[b]=[],this.ranks[b]=a[b];var c=null;if(null!=this.roots)for(var d=this.roots,c=[],b=0…
871 …lues(),d={},e=0;e<c.length;e++)d[c[e].id]=c[e];c=null;if(null!=a.roots)for(var f=a.roots,c=[],e=0;…
907 …();var b=mxUtils.clone(a.vertexMapper,null,!0),c=null;if(null!=a.roots)for(var d=a.roots,c=[],e=0;…
913 b[f]):1)&&c.isVertex(b[f])&&e.push(b[f]);this.roots=e}c.beginUpdate();try{this.run(a),this.resizePa…
918 …roots&&null!=a){var d={};this.filterDescendants(a,d);this.roots=[];var e=!0,f;for(f in d)if(null!=…
919 …;for(f in k)d.push(k[f]);this.model=new mxGraphHierarchyModel(this,d,this.roots,a,this.tightenToSo…
937 …roots=[];var e=!0,f;for(f in d)if(null!=d[f]){e=!1;break}for(var g=0;!e&&g<this.swimlanes.length;)…
[all …]
H A Dapp.min.js875 …k=function(){var a=[];if(null!=this.roots)for(var b=0;b<this.roots.length;b++){var c=this.vertexMa…
877 …Rank+1;b++)a[b]=[],this.ranks[b]=a[b];var c=null;if(null!=this.roots)for(var d=this.roots,c=[],b=0…
886 …roup=[];var a=[],b={};if(null!=this.roots)for(var c=0;c<this.roots.length;c++){var d=this.vertexMa…
889 …Rank+1;b++)a[b]=[],this.ranks[b]=a[b];var c=null;if(null!=this.roots)for(var d=this.roots,c=[],b=0…
905 …lues(),d={},e=0;e<c.length;e++)d[c[e].id]=c[e];c=null;if(null!=a.roots)for(var f=a.roots,c=[],e=0;…
941 …();var b=mxUtils.clone(a.vertexMapper,null,!0),c=null;if(null!=a.roots)for(var d=a.roots,c=[],e=0;…
947 b[f]):1)&&c.isVertex(b[f])&&e.push(b[f]);this.roots=e}c.beginUpdate();try{this.run(a),this.resizePa…
952 …roots&&null!=a){var d={};this.filterDescendants(a,d);this.roots=[];var e=!0,f;for(f in d)if(null!=…
953 …;for(f in k)d.push(k[f]);this.model=new mxGraphHierarchyModel(this,d,this.roots,a,this.tightenToSo…
971 …roots=[];var e=!0,f;for(f in d)if(null!=d[f]){e=!1;break}for(var g=0;!e&&g<this.swimlanes.length;)…
[all …]
/plugin/diagramsnet/lib/js/diagramly/
H A DEditorUi.js13291 var roots = cells.slice();
13386 mxUtils.remove((edge.invert) ? realCell : ref, roots);
13488 (layout == 'auto' && select.length == 2 * cells.length - 1 && roots.length == 1))
13500 treeLayout.execute(graph.getDefaultParent(), (roots.length > 0) ? roots[0] : null);
13506 (layout == 'auto' && roots.length == 1))
H A DMenus.js1755 var roots = doc.getElementsByTagName('root');
1757 for (var i = 0; i < roots.length; i++)
1759 checkModel(roots[i]);
/plugin/diagramsnet/lib/mxgraph/
H A DmxClient.js637 …k=function(){var a=[];if(null!=this.roots)for(var b=0;b<this.roots.length;b++){var c=this.vertexMa…
639 …Rank+1;b++)a[b]=[],this.ranks[b]=a[b];var c=null;if(null!=this.roots)for(var d=this.roots,c=[],b=0…
648 …roup=[];var a=[],b={};if(null!=this.roots)for(var c=0;c<this.roots.length;c++){var d=this.vertexMa…
651 …Rank+1;b++)a[b]=[],this.ranks[b]=a[b];var c=null;if(null!=this.roots)for(var d=this.roots,c=[],b=0…
667 …lues(),d={},e=0;e<c.length;e++)d[c[e].id]=c[e];c=null;if(null!=a.roots)for(var f=a.roots,c=[],e=0;…
703 …();var b=mxUtils.clone(a.vertexMapper,null,!0),c=null;if(null!=a.roots)for(var d=a.roots,c=[],e=0;…
709 b[f]):1)&&c.isVertex(b[f])&&e.push(b[f]);this.roots=e}c.beginUpdate();try{this.run(a),this.resizePa…
714 …roots&&null!=a){var d={};this.filterDescendants(a,d);this.roots=[];var e=!0,f;for(f in d)if(null!=…
715 …;for(f in k)d.push(k[f]);this.model=new mxGraphHierarchyModel(this,d,this.roots,a,this.tightenToSo…
733 …roots=[];var e=!0,f;for(f in d)if(null!=d[f]){e=!1;break}for(var g=0;!e&&g<this.swimlanes.length;)…
[all …]
/plugin/diagramsnet/lib/js/grapheditor/
H A DMenus.js343 var roots = null;
354 roots = graph.findTreeRoots(tmp);
357 if (roots != null && roots.length > 0)
359 tmp = roots[0];
382 var roots = null;
393 roots = graph.findTreeRoots(tmp);
396 if (roots != null && roots.length > 0)
398 tmp = roots[0];
421 var roots = null;
435 if (roots != null && roots.length > 0)
[all …]
/plugin/dirtylittlehelper/mermaid/editor/docs/
H A D5.5.js1 …command:t})}}))})),function(e,t){var i="data-",r={};r[i]=i+'$1="$2"',n&&n.roots.forEach((function(…
H A Dbundle.js.map1 …roots\");\n root = node;\n } else {\n parent = nodeByKey[keyPrefix + nodeId];\n…
H A D3.3.js.map1 …roots: htmlDocument.children,\n findNodeBefore: htmlDocument.findNodeBefore.bind(htmlDocume…
H A Dbundle.js426 …roots(){const e=[];for(let t of this._nodes.values())0===t.outgoing.size&&e.push(t);return e}inser…
/plugin/dirtylittlehelper/mermaid/editor/
H A Dbundle.js426 …roots(){const e=[];for(let t of this._nodes.values())0===t.outgoing.size&&e.push(t);return e}inser…
/plugin/dirtylittlehelper/script/
H A Dmermaid.min.js.map1 …ull || !(nodeId += \"\")) {\n if (root) throw new Error(\"multiple roots\");\n root …
/plugin/jplayer/vendor/happyworm/jplayer/lib/aurora/
H A Daac.js793 this.roots = generateFFTTableShort(64);
797 this.roots = generateFFTTableLong(512);
801 this.roots = generateFFTTableShort(60);
805 this.roots = generateFFTTableLong(480);
877 roots = this.roots;
947 rootRe = roots[km][0],
948 rootIm = roots[km][imOffset],
/plugin/jplayer/vendor/kriswallsmith/assetic/src/Assetic/Factory/
H A DAssetFactory.php412 * @param array $roots An array of root directories
416 private static function findRootDir($path, array $roots) argument
418 foreach ($roots as $root) {
/plugin/pdfjs/pdfjs/build/
H A Dpdf.js.map1 …roots.\n var first = (a + d) / 2;\n var second = Math.sqrt((a + d) * (a + d) - 4 * (a * d - …
H A Dpdf.worker.js.map1 …roots.\n var first = (a + d) / 2;\n var second = Math.sqrt((a + d) * (a + d) - 4 * (a * d - …
/plugin/findologicxmlexport/vendor/hoa/protocol/
H A DREADME.md96 We see that there is 3 “sub-roots”:
/plugin/ckgdoku/ckeditor/
H A DLICENSE.md539 (For example, a function in a library to compute square roots has
544 root function must still compute square roots.)
/plugin/fckg/fckeditor/
H A Dlicense.txt497 (For example, a function in a library to compute square roots has
502 root function must still compute square roots.)

12