Home
last modified time | relevance | path

Searched refs:ranker (Results 1 – 6 of 6) sorted by relevance

/plugin/sphinxsearch-was/
H A Dsphinxapi.php698 function SetRankingMode($ranker) argument
700 assert($ranker == SPH_RANK_PROXIMITY_BM25
701 || $ranker == SPH_RANK_BM25
702 || $ranker == SPH_RANK_NONE
703 || $ranker == SPH_RANK_WORDCOUNT
704 || $ranker == SPH_RANK_PROXIMITY);
705 $this->_ranker = $ranker;
/plugin/sphinxsearch/
Dsphinxapi.php732 function SetRankingMode ( $ranker ) argument
734 assert ( $ranker==SPH_RANK_PROXIMITY_BM25
735 || $ranker==SPH_RANK_BM25
736 || $ranker==SPH_RANK_NONE
737 || $ranker==SPH_RANK_WORDCOUNT
738 || $ranker==SPH_RANK_PROXIMITY );
739 $this->_ranker = $ranker;
/plugin/dirtylittlehelper/mermaid/editor/
Dbundle.js273 …ranker:"tight-tree",ranksep:p?1:i.edgeLengthFactor,nodeSep:p?1:50,isMultiGraph:!0}):g.setGraph({ra… property
403 …61).longestPath,r=n(413),o=n(787);e.exports=function(e){switch(e.graph().ranker){case"network-simp…
426 …62).longestPath,r=n(421),o=n(826);e.exports=function(e){switch(e.graph().ranker){case"network-simp…
/plugin/dirtylittlehelper/mermaid/editor/docs/
Dbundle.js273 …ranker:"tight-tree",ranksep:p?1:i.edgeLengthFactor,nodeSep:p?1:50,isMultiGraph:!0}):g.setGraph({ra… property
403 …61).longestPath,r=n(413),o=n(787);e.exports=function(e){switch(e.graph().ranker){case"network-simp…
426 …62).longestPath,r=n(421),o=n(826);e.exports=function(e){switch(e.graph().ranker){case"network-simp…
Dbundle.js.map1 …ranker\", \"rankdir\", \"align\"];\nvar nodeNumAttrs = [\"width\", \"height\"];\nvar nodeDefaults …
/plugin/dirtylittlehelper/script/
Dmermaid.min.js.map1 …ranker","networkSimplexRanker","tightTreeRanker","longestPathRanker","initRank","initLowLimValues"…