Home
last modified time | relevance | path

Searched refs:ranks (Results 1 – 17 of 17) sorted by relevance

/plugin/schulzevote/syntax/
Dvote.php171 $ranks = array();
174 … $ranks[$item] = '<span class="votebar" style="width: ' . (80 / ($rank + 1)) . 'px">&nbsp;</span>';
187 $form->addHTML($ranks[$candy]);
/plugin/bible/bible_douayRheims/
DJoel.txt26 …the wall: the men shall march every one on his way, and they shall not turn aside from their ranks.
DNumbers.txt71 …l be set up, so shall it be taken down. Every one shall march according to their places, and ranks.
402 …10:18. And the sons of Ruben also marched, by their troops and ranks, whose prince was Helisur the…
DMark.txt231 6:40. And they sat down in ranks, by hundreds and by fifties.
D2_Machabees.txt160 …5:3. And horses set in order by ranks, running one against another, with the shakings of shields, …
/plugin/diagramsnet/lib/mxgraph/
DmxClient.js633 …hHierarchyModel.prototype.edgeMapper=null;mxGraphHierarchyModel.prototype.ranks=null;mxGraphHierar… method in mxGraphHierarchyModel
639 …l.prototype.fixRanks=function(){var a=[];this.ranks=[];for(var b=0;b<this.maxRank+1;b++)a[b]=[],th… property
644 …=null;mxSwimlaneModel.prototype.edgeMapper=null;mxSwimlaneModel.prototype.ranks=null;mxSwimlaneMod… method in mxSwimlaneModel
651 …l.prototype.fixRanks=function(){var a=[];this.ranks=[];for(var b=0;b<this.maxRank+1;b++)a[b]=[],th… property
657ranks.length;b++)this.nestedBestRanks[b]=a.ranks[b].slice();for(var c=0,d=this.calculateCrossings(…
658ranks[e],g=0;g<f.length;g++)k=f[g],k.setGeneralPurposeVariable(e,g);if(0==d)break}c=[];d=[];for(b=…
659 …tion.prototype.calculateRankCrossing=function(a,b){for(var c=0,d=b.ranks[a],e=b.ranks[a-1],f=[],g=…
661 … c=!0,d=0;c&&10>d++;)for(var e=1==a%2&&1==d%2,c=!1,f=0;f<b.ranks.length;f++){for(var g=b.ranks[f],…
672 …d assignment debug=======");for(var b=0;b<a.ranks.length;b++){mxLog.write("Rank ",b," : ");for(var…
673ranks.length;d++)for(var e=a.ranks[d],f=0;f<e.length;f++){var g=e[f];g.setX(d,g.getGeneralPurposeV…
[all …]
/plugin/codemirror/dist/modes/
Didl.min.js.map1 …query_wav', 'r_correlate',\n 'r_test', 'radon', 'randomn', 'randomu', 'ranks',\n 'rdpix', 'r…
Dsas.min.js.map1 …ave prt ps pw pwreq qtr quote r ranbin rancau random ranexp rangam range ranks rannor ranpoi rant…
/plugin/diagramsnet/lib/js/
Dviewer.min.js837 …hHierarchyModel.prototype.edgeMapper=null;mxGraphHierarchyModel.prototype.ranks=null;mxGraphHierar… method in mxGraphHierarchyModel
843 …l.prototype.fixRanks=function(){var a=[];this.ranks=[];for(var b=0;b<this.maxRank+1;b++)a[b]=[],th… property
848 …=null;mxSwimlaneModel.prototype.edgeMapper=null;mxSwimlaneModel.prototype.ranks=null;mxSwimlaneMod… method in mxSwimlaneModel
855 …l.prototype.fixRanks=function(){var a=[];this.ranks=[];for(var b=0;b<this.maxRank+1;b++)a[b]=[],th… property
861ranks.length;b++)this.nestedBestRanks[b]=a.ranks[b].slice();for(var c=0,d=this.calculateCrossings(…
862ranks[e],g=0;g<f.length;g++)k=f[g],k.setGeneralPurposeVariable(e,g);if(0==d)break}c=[];d=[];for(b=…
863 …tion.prototype.calculateRankCrossing=function(a,b){for(var c=0,d=b.ranks[a],e=b.ranks[a-1],f=[],g=…
865 … c=!0,d=0;c&&10>d++;)for(var e=1==a%2&&1==d%2,c=!1,f=0;f<b.ranks.length;f++){for(var g=b.ranks[f],…
876 …d assignment debug=======");for(var b=0;b<a.ranks.length;b++){mxLog.write("Rank ",b," : ");for(var…
877ranks.length;d++)for(var e=a.ranks[d],f=0;f<e.length;f++){var g=e[f];g.setX(d,g.getGeneralPurposeV…
[all …]
Dapp.min.js871 …hHierarchyModel.prototype.edgeMapper=null;mxGraphHierarchyModel.prototype.ranks=null;mxGraphHierar… method in mxGraphHierarchyModel
877 …l.prototype.fixRanks=function(){var a=[];this.ranks=[];for(var b=0;b<this.maxRank+1;b++)a[b]=[],th… property
882 …=null;mxSwimlaneModel.prototype.edgeMapper=null;mxSwimlaneModel.prototype.ranks=null;mxSwimlaneMod… method in mxSwimlaneModel
889 …l.prototype.fixRanks=function(){var a=[];this.ranks=[];for(var b=0;b<this.maxRank+1;b++)a[b]=[],th… property
895ranks.length;b++)this.nestedBestRanks[b]=a.ranks[b].slice();for(var c=0,d=this.calculateCrossings(…
896ranks[e],g=0;g<f.length;g++)k=f[g],k.setGeneralPurposeVariable(e,g);if(0==d)break}c=[];d=[];for(b=…
897 …tion.prototype.calculateRankCrossing=function(a,b){for(var c=0,d=b.ranks[a],e=b.ranks[a-1],f=[],g=…
899 … c=!0,d=0;c&&10>d++;)for(var e=1==a%2&&1==d%2,c=!1,f=0;f<b.ranks.length;f++){for(var g=b.ranks[f],…
910 …d assignment debug=======");for(var b=0;b<a.ranks.length;b++){mxLog.write("Rank ",b," : ");for(var…
911ranks.length;d++)for(var e=a.ranks[d],f=0;f<e.length;f++){var g=e[f];g.setX(d,g.getGeneralPurposeV…
[all …]
Dviewer-static.min.js837 …hHierarchyModel.prototype.edgeMapper=null;mxGraphHierarchyModel.prototype.ranks=null;mxGraphHierar… method in mxGraphHierarchyModel
843 …l.prototype.fixRanks=function(){var a=[];this.ranks=[];for(var b=0;b<this.maxRank+1;b++)a[b]=[],th… property
848 …=null;mxSwimlaneModel.prototype.edgeMapper=null;mxSwimlaneModel.prototype.ranks=null;mxSwimlaneMod… method in mxSwimlaneModel
855 …l.prototype.fixRanks=function(){var a=[];this.ranks=[];for(var b=0;b<this.maxRank+1;b++)a[b]=[],th… property
861ranks.length;b++)this.nestedBestRanks[b]=a.ranks[b].slice();for(var c=0,d=this.calculateCrossings(…
862ranks[e],g=0;g<f.length;g++)k=f[g],k.setGeneralPurposeVariable(e,g);if(0==d)break}c=[];d=[];for(b=…
863 …tion.prototype.calculateRankCrossing=function(a,b){for(var c=0,d=b.ranks[a],e=b.ranks[a-1],f=[],g=…
865 … c=!0,d=0;c&&10>d++;)for(var e=1==a%2&&1==d%2,c=!1,f=0;f<b.ranks.length;f++){for(var g=b.ranks[f],…
876 …d assignment debug=======");for(var b=0;b<a.ranks.length;b++){mxLog.write("Rank ",b," : ");for(var…
877ranks.length;d++)for(var e=a.ranks[d],f=0;f<e.length;f++){var g=e[f];g.setX(d,g.getGeneralPurposeV…
[all …]
/plugin/pgn4web/pgn4web/
Dpgn-standard.txt776 by their originating ranks, the originating rank digit of the moving piece is
2040 used to separate data of adjacent ranks.
2180 used to separate data of adjacent ranks.
/plugin/jdraw/lib/
Djgraphx.jarMETA-INF/MANIFEST.MF META-INF/HAMMURAP.SF META-INF/HAMMURAP ...
/plugin/strata/
Dplotly-2.25.2.min.js8ranks;for(n=0;n<u.length;++n)u[n]=-1;for(n=0;n<t.length;++n){var c=r.find(t[n][0]);u[c]<0?(u[c]=l.…
/plugin/dirtylittlehelper/script/
Dmermaid.min.js.map1ranks","relationship","sweepLayerGraphs","layerGraphs","biasRight","cg","lg","sorted","assignOrder…
/plugin/dirtylittlehelper/mermaid/editor/docs/
Dbundle.js.map1ranks while preserving balance for the\n * label's position.\n */\nfunction injectEdgeLabelProxies…
/plugin/subjectindex/plugins/
Dbible_verses.txt17960 …ti·a! For out of the north a smoke is coming, and there is no one getting isolated from his ranks."