Home
last modified time | relevance | path

Searched refs:n (Results 1276 – 1300 of 2191) sorted by path

1...<<51525354555657585960>>...88

/plugin/fckg/fckeditor/editor/js/
H A Dfckeditorcode_ie.js50 …CKDomTools.GetNextSourceNode(D);}while (E&&E!=D){if (E.nodeType!=3||!/^[ \t\n]*$/.test(E.nodeValue…
51 …n=B.charAt(i+1);if (n=='\r'){i++;n=B.charAt(i+1);};if (n=='\n'){i++;if (F) E.push(H);E.push(G);F=1…
60 …butes=function(A,B,C,D){var E=B.attributes,bHasStyle;for (var n=0;n<E.length;n++){var F=E[n];if (F…
/plugin/fckg/fckeditor/editor/plugins/geshi/
H A Dfckplugin.js212 if (n.nodeType==3 && isWhite(n)){
213 ws.push(n)
215 findWhite(n);
228 if(n.style[prop]) return n.style[prop];
229 var s = n.currentStyle || n.ownerDocument.defaultView.getComputedStyle(n, null);
231 if(!s[prop]) return "LI,P,TR".indexOf(n.tagName) > -1 ? "block" : n.style[prop];
237 var isBlock = function(n){ argument
243 var recurse = function(n){ argument
248 t += n.innerHTML
253 var s = sty(n, "display");
[all …]
/plugin/fckg/fckeditor/editor/plugins/range/
H A Dfckplugin.js40 parent.replaceChild(df,n);
57 this.replaceStack.push({ df:f, parent: n.parentNode, replace: n });
65 if(n.nodeType == 3) data += n.data;
111 parent.replaceChild(df,n);
128 this.replaceStack.push({ df:f, parent: n.parentNode, replace: n });
136 if(n.nodeType == 3) data += n.data;
219 if(n.nodeType == 3) {
267 this.replaceStack.push({ df:df, parent: n.parentNode, replace: n });
275 var kids = n.childNodes;
288 if(n.nodeType == 3) {
[all …]
/plugin/fckg/fckeditor/editor/plugins/signature/
H A Dfckplugin.js24 FCKInsertSignature.numbersToTwoDigits = function(n) { argument
25 if(n < 10) n = '0' + n;
26 return(n);
/plugin/fckg/scripts/
H A Dscript-cmpr.js1 …n,r=[],s=m;r.last=function(){return this[this.length-1]};while(m){q=true;if(!r.last()||!g[r.last()… variable
/plugin/fedauth/Auth/OpenID/
H A DBigMath.php96 $n = $this->init(0);
105 $n = $this->mul($n, pow(2, 8));
106 $n = $this->add($n, $byte);
109 return $n;
173 $n = $this->binaryToLong($bytes);
175 } while ($this->cmp($n, $duplicate) < 0);
177 return $this->mod($n, $stop);
H A DCryptUtil.php98 $n = ord(Auth_OpenID_CryptUtil::getBytes(1));
99 } while ($n < $duplicate);
101 $n %= $popsize;
102 $str .= $population[$n];
H A DMDB2Store.php113 $n = $this->create_nonce_table();
116 if (!$n || !$a) {
H A DSQLStore.php289 $n = $this->create_nonce_table();
293 if ($n && $a) {
H A DURINorm.php73 list($m, $n) = $pair;
74 $parts[] = sprintf("%s-%s", chr($m), chr($n));
/plugin/fedauth/Auth/Yadis/
H A DXML.php174 $n = array();
175 return $n;
179 $n = array();
180 return $n;
263 $n = array();
266 return $n;
270 $n[] = $result->item($i);
273 return $n;
H A DYadis.php275 foreach ($names as $n) {
276 if (strtolower($name) == strtolower($n)) {
/plugin/fetchmedia/lib/
H A Dbundle.js1 …n(e){if(r[e])return r[e].exports;var i=r[e]={i:e,l:!1,exports:{}};return t[e].call(i.exports,i,i.e… function
/plugin/ffindr/
H A Dffindr.php151 $renderer->doc .= "</tr>\n";
/plugin/findologicxmlexport/vendor/hoa/compiler/Llk/Sampler/
H A DUniform.php105 if (null === $rule && -1 === $n) {
107 $n = $this->getLength();
113 if (0 === $n || 0 === $computed) {
180 if (null === $rule || -1 === $n) {
186 if (isset($this->_data[$ruleName][$n])) {
190 $this->_data[$ruleName][$n] = ['n' => 0];
202 $n
204 $this->_data[$ruleName][$n]['Γ'] = [];
228 $y = $n;
230 $y = min($n, $y);
[all …]
/plugin/findologicxmlexport/vendor/hoa/compiler/
H A DREADME.md245 echo $i, ' => ', $data, "\n";
/plugin/findologicxmlexport/vendor/hoa/file/Link/
H A DReadWrite.php348 if (false === $n = strpos($line, "\n")) {
352 ++$n;
354 return $this->write(substr($line, 0, $n), $n);
H A DWrite.php215 if (false === $n = strpos($line, "\n")) {
219 ++$n;
221 return $this->write(substr($line, 0, $n), $n);
/plugin/findologicxmlexport/vendor/hoa/file/
H A DReadWrite.php347 if (false === $n = strpos($line, "\n")) {
351 ++$n;
353 return $this->write(substr($line, 0, $n), $n);
H A DWrite.php216 if (false === $n = strpos($line, "\n")) {
220 ++$n;
222 return $this->write(substr($line, 0, $n), $n);
/plugin/findologicxmlexport/vendor/hoa/file/Temporary/
H A DReadWrite.php348 if (false === $n = strpos($line, "\n")) {
352 ++$n;
354 return $this->write(substr($line, 0, $n), $n);
H A DWrite.php216 if (false === $n = strpos($line, "\n")) {
220 ++$n;
222 return $this->write(substr($line, 0, $n), $n);
/plugin/findologicxmlexport/vendor/hoa/iterator/
H A DREADME.md146 `Hoa\Iterator\Limit` allows to iterate *n* elements of an iterator starting from
186 `Hoa\Iterator\Repeater` allows to repeat an iterator *n* times.
193 echo "\n";
265 echo $iterators['one'], ' | ', $iterators['two'], "\n";
319 echo $value->getFilename(), "\n";
344 echo $value->getFilename(), "\n";
370 echo "\n";
H A DRepeater.php83 * @param int $n Repeat $n-times.
87 public function __construct(\Traversable $iterator, $n, $body = null) argument
89 if (0 >= $n) {
93 $n
102 $this->_n = $n;
/plugin/findologicxmlexport/vendor/hoa/math/Combinatorics/Combination/
H A DCombination.php57 * @param int $n n.
63 public static function Γ($n, $k, $withoutZero = false) argument
65 if (0 === $n) {
72 $o = array_fill(0, $n, 0);
75 while ($k != $o[$i = $n - 1]) {

1...<<51525354555657585960>>...88