| /plugin/diagramsnet/lib/resources/ |
| H A D | dia_ru.txt | 584 …n \n {1}\n \n Загрузить эти модули сейчас?\n \n ПРИМЕЧАНИЕ: Разрешайте запуск плагинов только если…
|
| H A D | dia_bg.txt | 584 …n \n {1}\n \n Искате ли да заредите тези плъгин(и) сега?\n \n ЗАБЕЛЕЖКА : Пускайте плъгините само …
|
| /plugin/codemirror/dist/modes/ |
| H A D | soy.min.js | 1 …n(a,b){var c;if(a.match(/[[]/)){b.soyState.push("list-literal");b.context=new m(b.context,"list-li… function
|
| H A D | modelica.min.js | 1 …n(a,b){var c=false,d;while((d=a.next())!=null){if(d=='"'&&!c){b.tokenize=null;b.sol=false;break}c=… function
|
| /plugin/sequencediagram/bower_components/js-sequence-diagrams/dist/ |
| H A D | sequence-diagram.js | 572 less: function(n) {
573 this.unput(this.match.slice(n));
667 var n = this.conditionStack.length - 1;
668 return n > 0 ? this.conditionStack.pop() : this.conditionStack[0];
675 topState: function(n) {
676 …return n = this.conditionStack.length - 1 - Math.abs(n || 0), n >= 0 ? this.conditionStack[n] : "I…
751 …n]+)/i, /^(?:\s+)/i, /^(?:#[^\r\n]*)/i, /^(?:participant\b)/i, /^(?:left of\b)/i, /^(?:right of\b)…
|
| H A D | sequence-diagram-raphael-min.js | 6 …n){this.unput(this.match.slice(n))},pastInput:function(){var past=this.matched.substr(0,this.match…
7 …,-56,93,-54v27,3,49,40,43,80v24,-2,66,-55,124,-53v11,14,28,23,27,54",w:368},n:{d:"121,-136v37,6,62…
|
| /plugin/datatables/assets/datatables.net-plugins/features/deepLink/ |
| H A D | dataTables.deepLink.min.js | |
| /plugin/codeprettify/code-prettify/src/ |
| H A D | lang-dart.js | 34 [PR['PR_PLAIN'], /^[\t\n\r \xA0]+/, null, '\t\n\r \xA0']
|
| /plugin/querychangelog/lang/fr/ |
| H A D | querychangelog.txt | 9 :!: La génération peut prendre **très** longtemps si elle est
|
| /plugin/move/lang/en/ |
| H A D | tree.txt | 3 This interface allows you to rearrange your wiki's namespaces, pages and media files via Drag'n'Drop.
|
| /plugin/diagramsnet/lib/math/extensions/ |
| H A D | toMathML.js | 19 …n=(this.data[0]&&this.data[0].data.length>1);var p=this.type,k=this.toMathMLattributes();var j=[],…
|
| /plugin/reliwa/ |
| H A D | syntax.php | 59 $this->Lexer->addSpecialPattern('<reliwa ?[^>\n]*/>',$mode,'plugin_reliwa');
|
| /plugin/tokenbucketauth/lang/fr/ |
| H A D | banned.txt | 6 Si vous n'avez rien fait de mal, vous pouvez être l'innocente victime d'une
|
| /plugin/toursprung/ |
| H A D | syntax.php | 55 $this->Lexer->addSpecialPattern('<toursprung ?[^>\n]*/>',$mode,'plugin_toursprung');
|
| /plugin/publish/lang/sk/ |
| H A D | mailchangetext.txt | 1 Vo vašej DokuWiki sa nachádza nový návrh. Detaily:
|
| /plugin/diagramsnet/lib/WEB-INF/lib/ |
| H A D | commons-io-2.4.jar | META-INF/
META-INF/MANIFEST.MF
org/
org/apache/
org/ ... |
| /plugin/wysiwyg/fckeditor/editor/dialog/fck_spellerpages/spellerpages/ |
| H A D | wordWindow.js | 218 function printForHtml( n ) { argument
219 return n ; // by FredCK
|
| /plugin/fckg/fckeditor/editor/dialog/fck_spellerpages/spellerpages/ |
| H A D | wordWindow.js | 218 function printForHtml( n ) { argument
219 return n ; // by FredCK
|
| /plugin/fedauth/Auth/OpenID/ |
| H A D | MDB2Store.php | 113 $n = $this->create_nonce_table();
116 if (!$n || !$a) {
|
| /plugin/authgoogle/ |
| H A D | auth.php | 204 if (preg_match("/@([^@ ]+)$/is", $email, $n)) {
205 if ($m[1] == $n[1]) return true;
|
| /plugin/davcard/action/ |
| H A D | ajax.php | 254 $replace_match = '/^.*<DC.*>.*$(?:\r\n|\n)?/m';
|
| /plugin/farmer/lang/fr/ |
| H A D | tab_new_help.txt | |
| /plugin/openid/Auth/OpenID/ |
| H A D | MDB2Store.php | 113 $n = $this->create_nonce_table();
116 if (!$n || !$a) {
|
| /plugin/callflow/ |
| H A D | raphael.js | 193 e = e.n;
326 for (key in e.n) if (e.n[has](key) && e.n[key].f) {
336 for (key in e.n) if (e.n[has](key) && e.n[key].f) {
4413 return n * n * ((s + 1) * n - s);
4416 n = n - 1;
4418 return n * n * ((s + 1) * n + s) + 1;
4421 if (n == !!n) {
4431 l = s * n * n;
4435 l = s * n * n + .75;
4439 l = s * n * n + .9375;
[all …]
|
| /plugin/advrack/ |
| H A D | raphael.js | 193 e = e.n;
326 for (key in e.n) if (e.n[has](key) && e.n[key].f) {
336 for (key in e.n) if (e.n[has](key) && e.n[key].f) {
4413 return n * n * ((s + 1) * n - s);
4416 n = n - 1;
4418 return n * n * ((s + 1) * n + s) + 1;
4421 if (n == !!n) {
4431 l = s * n * n;
4435 l = s * n * n + .75;
4439 l = s * n * n + .9375;
[all …]
|