##
## static content
##
-static: htdocs/javascript@VERSION
+static: htdocs/javascript/core.js htdocs/javascript@VERSION
+
+htdocs/javascript/core.js:
+ cd htdocs/javascript/ && ln -s ../../core/htdocs/javascript/core.js
%@VERSION: % Makefile ChangeLog
cd $< && rm -f $(VERSION) && ln -sf . $(VERSION)
}
$this->addJsLink('jquery.js');
$this->addJsLink('overlib.js');
- $this->addJsLink('wiki.js');
+ $this->addJsLink('core.js');
$this->addJsLink('xorg.js');
$this->setTitle('Les associations polytechniciennes');
}
$this->addJsLink('jquery.js');
$this->addJsLink('overlib.js');
$this->addJsLink('secure_hash.js');
- $this->addJsLink('sha1.js');
- $this->addJsLink('wiki.js');
+ $this->addJsLink('core.js');
$this->addJsLink('xorg.js');
$this->setTitle('le site des élèves et anciens élèves de l\'École polytechnique');
if (S::logged() && S::user()->checkPerms('admin')) {
-Subproject commit d57eed5e4f3e05e4987e3db755f78d5d2c91d9bf
+Subproject commit 819c6139e64956914003d1212d5c9f82332793e2
-/***************************************************************************\r
- * Copyright (C) 2003-2011 Polytechnique.org *\r
- * http://opensource.polytechnique.org/ *\r
- * *\r
- * This program is free software; you can redistribute it and/or modify *\r
- * it under the terms of the GNU General Public License as published by *\r
- * the Free Software Foundation; either version 2 of the License, or *\r
- * (at your option) any later version. *\r
- * *\r
- * This program is distributed in the hope that it will be useful, *\r
- * but WITHOUT ANY WARRANTY; without even the implied warranty of *\r
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\r
- * GNU General Public License for more details. *\r
- * *\r
- * You should have received a copy of the GNU General Public License *\r
- * along with this program; if not, write to the Free Software *\r
- * Foundation, Inc., *\r
- * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *\r
- ***************************************************************************/\r
-\r
-function hash_encrypt(a) {\r
- return hex_sha1(a);\r
-}\r
-\r
-var hexa_h = "0123456789abcdef";\r
-\r
-function dechex(a) {\r
- return hexa_h.charAt(a);\r
-}\r
-\r
-function hexdec(a) {\r
- return hexa_h.indexOf(a);\r
-}\r
-\r
-function hash_xor(a, b) {\r
- var c,i,j,k;\r
- c = "";\r
- i = a.length;\r
- j = b.length;\r
- if (i < j) {\r
- var d;\r
- d = a; a = b; b = d;\r
- k = i; i = j; j = k;\r
- }\r
- for (k = 0; k < j; k++)\r
- c += dechex(hexdec(a.charAt(k)) ^ hexdec(b.charAt(k)));\r
- for (; k < i; k++)\r
- c += a.charAt(k);\r
- return c;\r
-}\r
+/***************************************************************************
+ * Copyright (C) 2003-2011 Polytechnique.org *
+ * http://opensource.polytechnique.org/ *
+ * *
+ * This program is free software; you can redistribute it and/or modify *
+ * it under the terms of the GNU General Public License as published by *
+ * the Free Software Foundation; either version 2 of the License, or *
+ * (at your option) any later version. *
+ * *
+ * This program is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
+ * GNU General Public License for more details. *
+ * *
+ * You should have received a copy of the GNU General Public License *
+ * along with this program; if not, write to the Free Software *
+ * Foundation, Inc., *
+ * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *
+ ***************************************************************************/
+
+/* {{{ SHA1 Implementation */
+
+/*
+ * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined
+ * in FIPS PUB 180-1
+ * Version 2.1a Copyright Paul Johnston 2000 - 2002.
+ * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
+ * Distributed under the BSD License
+ * See http://pajhome.org.uk/crypt/md5 for details.
+ */
+
+/*
+ * Configurable variables. You may need to tweak these to be compatible with
+ * the server-side, but the defaults work in most cases.
+ */
+var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
+var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */
+var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
+
+/*
+ * These are the functions you'll usually want to call
+ * They take string arguments and return either hex or base-64 encoded strings
+ */
+function hex_sha1(s){return binb2hex(core_sha1(str2binb(s),s.length * chrsz));}
+function b64_sha1(s){return binb2b64(core_sha1(str2binb(s),s.length * chrsz));}
+function str_sha1(s){return binb2str(core_sha1(str2binb(s),s.length * chrsz));}
+function hex_hmac_sha1(key, data){ return binb2hex(core_hmac_sha1(key, data));}
+function b64_hmac_sha1(key, data){ return binb2b64(core_hmac_sha1(key, data));}
+function str_hmac_sha1(key, data){ return binb2str(core_hmac_sha1(key, data));}
+
+/*
+ * Perform a simple self-test to see if the VM is working
+ */
+function sha1_vm_test()
+{
+ return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
+}
+
+/*
+ * Calculate the SHA-1 of an array of big-endian words, and a bit length
+ */
+function core_sha1(x, len)
+{
+ /* append padding */
+ x[len >> 5] |= 0x80 << (24 - len % 32);
+ x[((len + 64 >> 9) << 4) + 15] = len;
+
+ var w = Array(80);
+ var a = 1732584193;
+ var b = -271733879;
+ var c = -1732584194;
+ var d = 271733878;
+ var e = -1009589776;
+
+ for(var i = 0; i < x.length; i += 16)
+ {
+ var olda = a;
+ var oldb = b;
+ var oldc = c;
+ var oldd = d;
+ var olde = e;
+
+ for(var j = 0; j < 80; j++)
+ {
+ if(j < 16) w[j] = x[i + j];
+ else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);
+ var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)),
+ safe_add(safe_add(e, w[j]), sha1_kt(j)));
+ e = d;
+ d = c;
+ c = rol(b, 30);
+ b = a;
+ a = t;
+ }
+
+ a = safe_add(a, olda);
+ b = safe_add(b, oldb);
+ c = safe_add(c, oldc);
+ d = safe_add(d, oldd);
+ e = safe_add(e, olde);
+ }
+ return Array(a, b, c, d, e);
+
+}
+
+/*
+ * Perform the appropriate triplet combination function for the current
+ * iteration
+ */
+function sha1_ft(t, b, c, d)
+{
+ if(t < 20) return (b & c) | ((~b) & d);
+ if(t < 40) return b ^ c ^ d;
+ if(t < 60) return (b & c) | (b & d) | (c & d);
+ return b ^ c ^ d;
+}
+
+/*
+ * Determine the appropriate additive constant for the current iteration
+ */
+function sha1_kt(t)
+{
+ return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 :
+ (t < 60) ? -1894007588 : -899497514;
+}
+
+/*
+ * Calculate the HMAC-SHA1 of a key and some data
+ */
+function core_hmac_sha1(key, data)
+{
+ var bkey = str2binb(key);
+ if(bkey.length > 16) bkey = core_sha1(bkey, key.length * chrsz);
+
+ var ipad = Array(16), opad = Array(16);
+ for(var i = 0; i < 16; i++)
+ {
+ ipad[i] = bkey[i] ^ 0x36363636;
+ opad[i] = bkey[i] ^ 0x5C5C5C5C;
+ }
+
+ var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz);
+ return core_sha1(opad.concat(hash), 512 + 160);
+}
+
+/*
+ * Add integers, wrapping at 2^32. This uses 16-bit operations internally
+ * to work around bugs in some JS interpreters.
+ */
+function safe_add(x, y)
+{
+ var lsw = (x & 0xFFFF) + (y & 0xFFFF);
+ var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
+ return (msw << 16) | (lsw & 0xFFFF);
+}
+
+/*
+ * Bitwise rotate a 32-bit number to the left.
+ */
+function rol(num, cnt)
+{
+ return (num << cnt) | (num >>> (32 - cnt));
+}
+
+/*
+ * Convert an 8-bit or 16-bit string to an array of big-endian words
+ * In 8-bit function, characters >255 have their hi-byte silently ignored.
+ */
+function str2binb(str)
+{
+ var bin = Array();
+ var mask = (1 << chrsz) - 1;
+ for(var i = 0; i < str.length * chrsz; i += chrsz)
+ bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32);
+ return bin;
+}
+
+/*
+ * Convert an array of big-endian words to a string
+ */
+function binb2str(bin)
+{
+ var str = "";
+ var mask = (1 << chrsz) - 1;
+ for(var i = 0; i < bin.length * 32; i += chrsz)
+ str += String.fromCharCode((bin[i>>5] >>> (32 - chrsz - i%32)) & mask);
+ return str;
+}
+
+/*
+ * Convert an array of big-endian words to a hex string.
+ */
+function binb2hex(binarray)
+{
+ var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
+ var str = "";
+ for(var i = 0; i < binarray.length * 4; i++)
+ {
+ str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) +
+ hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8 )) & 0xF);
+ }
+ return str;
+}
+
+/*
+ * Convert an array of big-endian words to a base-64 string
+ */
+function binb2b64(binarray)
+{
+ var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+ var str = "";
+ for(var i = 0; i < binarray.length * 4; i += 3)
+ {
+ var triplet = (((binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16)
+ | (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 )
+ | ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF);
+ for(var j = 0; j < 4; j++)
+ {
+ if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
+ else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
+ }
+ }
+ return str;
+}
+
+/* }}} */
+
+function hash_encrypt(a) {
+ return hex_sha1(a);
+}
+
+var hexa_h = "0123456789abcdef";
+
+function dechex(a) {
+ return hexa_h.charAt(a);
+}
+
+function hexdec(a) {
+ return hexa_h.indexOf(a);
+}
+
+function hash_xor(a, b) {
+ var c,i,j,k;
+ c = "";
+ i = a.length;
+ j = b.length;
+ if (i < j) {
+ var d;
+ d = a; a = b; b = d;
+ k = i; i = j; j = k;
+ }
+ for (k = 0; k < j; k++)
+ c += dechex(hexdec(a.charAt(k)) ^ hexdec(b.charAt(k)));
+ for (; k < i; k++)
+ c += a.charAt(k);
+ return c;
+}
// vim:set et sw=4 sts=4 sws=4 foldmethod=marker enc=utf-8:
+++ /dev/null
-/*\r
- * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined\r
- * in FIPS PUB 180-1\r
- * Version 2.1a Copyright Paul Johnston 2000 - 2002.\r
- * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\r
- * Distributed under the BSD License\r
- * See http://pajhome.org.uk/crypt/md5 for details.\r
- */\r
-\r
-/*\r
- * Configurable variables. You may need to tweak these to be compatible with\r
- * the server-side, but the defaults work in most cases.\r
- */\r
-var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */\r
-var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */\r
-var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */\r
-\r
-/*\r
- * These are the functions you'll usually want to call\r
- * They take string arguments and return either hex or base-64 encoded strings\r
- */\r
-function hex_sha1(s){return binb2hex(core_sha1(str2binb(s),s.length * chrsz));}\r
-function b64_sha1(s){return binb2b64(core_sha1(str2binb(s),s.length * chrsz));}\r
-function str_sha1(s){return binb2str(core_sha1(str2binb(s),s.length * chrsz));}\r
-function hex_hmac_sha1(key, data){ return binb2hex(core_hmac_sha1(key, data));}\r
-function b64_hmac_sha1(key, data){ return binb2b64(core_hmac_sha1(key, data));}\r
-function str_hmac_sha1(key, data){ return binb2str(core_hmac_sha1(key, data));}\r
-\r
-/*\r
- * Perform a simple self-test to see if the VM is working\r
- */\r
-function sha1_vm_test()\r
-{\r
- return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";\r
-}\r
-\r
-/*\r
- * Calculate the SHA-1 of an array of big-endian words, and a bit length\r
- */\r
-function core_sha1(x, len)\r
-{\r
- /* append padding */\r
- x[len >> 5] |= 0x80 << (24 - len % 32);\r
- x[((len + 64 >> 9) << 4) + 15] = len;\r
-\r
- var w = Array(80);\r
- var a = 1732584193;\r
- var b = -271733879;\r
- var c = -1732584194;\r
- var d = 271733878;\r
- var e = -1009589776;\r
-\r
- for(var i = 0; i < x.length; i += 16)\r
- {\r
- var olda = a;\r
- var oldb = b;\r
- var oldc = c;\r
- var oldd = d;\r
- var olde = e;\r
-\r
- for(var j = 0; j < 80; j++)\r
- {\r
- if(j < 16) w[j] = x[i + j];\r
- else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);\r
- var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)),\r
- safe_add(safe_add(e, w[j]), sha1_kt(j)));\r
- e = d;\r
- d = c;\r
- c = rol(b, 30);\r
- b = a;\r
- a = t;\r
- }\r
-\r
- a = safe_add(a, olda);\r
- b = safe_add(b, oldb);\r
- c = safe_add(c, oldc);\r
- d = safe_add(d, oldd);\r
- e = safe_add(e, olde);\r
- }\r
- return Array(a, b, c, d, e);\r
-\r
-}\r
-\r
-/*\r
- * Perform the appropriate triplet combination function for the current\r
- * iteration\r
- */\r
-function sha1_ft(t, b, c, d)\r
-{\r
- if(t < 20) return (b & c) | ((~b) & d);\r
- if(t < 40) return b ^ c ^ d;\r
- if(t < 60) return (b & c) | (b & d) | (c & d);\r
- return b ^ c ^ d;\r
-}\r
-\r
-/*\r
- * Determine the appropriate additive constant for the current iteration\r
- */\r
-function sha1_kt(t)\r
-{\r
- return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 :\r
- (t < 60) ? -1894007588 : -899497514;\r
-}\r
-\r
-/*\r
- * Calculate the HMAC-SHA1 of a key and some data\r
- */\r
-function core_hmac_sha1(key, data)\r
-{\r
- var bkey = str2binb(key);\r
- if(bkey.length > 16) bkey = core_sha1(bkey, key.length * chrsz);\r
-\r
- var ipad = Array(16), opad = Array(16);\r
- for(var i = 0; i < 16; i++)\r
- {\r
- ipad[i] = bkey[i] ^ 0x36363636;\r
- opad[i] = bkey[i] ^ 0x5C5C5C5C;\r
- }\r
-\r
- var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz);\r
- return core_sha1(opad.concat(hash), 512 + 160);\r
-}\r
-\r
-/*\r
- * Add integers, wrapping at 2^32. This uses 16-bit operations internally\r
- * to work around bugs in some JS interpreters.\r
- */\r
-function safe_add(x, y)\r
-{\r
- var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r
- var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r
- return (msw << 16) | (lsw & 0xFFFF);\r
-}\r
-\r
-/*\r
- * Bitwise rotate a 32-bit number to the left.\r
- */\r
-function rol(num, cnt)\r
-{\r
- return (num << cnt) | (num >>> (32 - cnt));\r
-}\r
-\r
-/*\r
- * Convert an 8-bit or 16-bit string to an array of big-endian words\r
- * In 8-bit function, characters >255 have their hi-byte silently ignored.\r
- */\r
-function str2binb(str)\r
-{\r
- var bin = Array();\r
- var mask = (1 << chrsz) - 1;\r
- for(var i = 0; i < str.length * chrsz; i += chrsz)\r
- bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32);\r
- return bin;\r
-}\r
-\r
-/*\r
- * Convert an array of big-endian words to a string\r
- */\r
-function binb2str(bin)\r
-{\r
- var str = "";\r
- var mask = (1 << chrsz) - 1;\r
- for(var i = 0; i < bin.length * 32; i += chrsz)\r
- str += String.fromCharCode((bin[i>>5] >>> (32 - chrsz - i%32)) & mask);\r
- return str;\r
-}\r
-\r
-/*\r
- * Convert an array of big-endian words to a hex string.\r
- */\r
-function binb2hex(binarray)\r
-{\r
- var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";\r
- var str = "";\r
- for(var i = 0; i < binarray.length * 4; i++)\r
- {\r
- str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) +\r
- hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8 )) & 0xF);\r
- }\r
- return str;\r
-}\r
-\r
-/*\r
- * Convert an array of big-endian words to a base-64 string\r
- */\r
-function binb2b64(binarray)\r
-{\r
- var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";\r
- var str = "";\r
- for(var i = 0; i < binarray.length * 4; i += 3)\r
- {\r
- var triplet = (((binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16)\r
- | (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 )\r
- | ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF);\r
- for(var j = 0; j < 4; j++)\r
- {\r
- if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;\r
- else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);\r
- }\r
- }\r
- return str;\r
-}\r
-// vim:set et sw=4 sts=4 sws=4 foldmethod=marker enc=utf-8:
+++ /dev/null
-/***************************************************************************
- * Copyright (C) 2003-2011 Polytechnique.org *
- * http://opensource.polytechnique.org/ *
- * *
- * This program is free software; you can redistribute it and/or modify *
- * it under the terms of the GNU General Public License as published by *
- * the Free Software Foundation; either version 2 of the License, or *
- * (at your option) any later version. *
- * *
- * This program is distributed in the hope that it will be useful, *
- * but WITHOUT ANY WARRANTY; without even the implied warranty of *
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
- * GNU General Public License for more details. *
- * *
- * You should have received a copy of the GNU General Public License *
- * along with this program; if not, write to the Free Software *
- * Foundation, Inc., *
- * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *
- ***************************************************************************/
-
-
-Nix = {
- map: null,
- convert: function(a) {
- Nix.init();
- var s = '';
- for (i = 0; i < a.length ; i++) {
- var b = a.charAt(i);
- s += ((b >= 'A' && b <= 'Z') || (b >= 'a' && b <= 'z') ? Nix.map[b] : b);
- }
- return s;
- },
- init: function() {
- if (Nix.map != null)
- return;
- var map = new Array();
- var s='abcdefghijklmnopqrstuvwxyz';
- for (i = 0; i < s.length; i++)
- map[s.charAt(i)] = s.charAt((i+13)%26);
- for (i=0; i<s.length; i++)map[s.charAt(i).toUpperCase()] = s.charAt((i+13)%26).toUpperCase();
- Nix.map = map;
- },
- decode: function(a) {
- document.write(Nix.convert(a));
- }
-}
-
-// vim:set et sw=4 sts=4 sws=4 foldmethod=marker enc=utf-8:
}
// }}}
-// {{{ dynpost()
-
-function dynpost(action, values)
-{
- var form = document.createElement('form');
- form.action = action;
- form.method = 'post';
-
- $('body').get(0).appendChild(form);
-
- for (var k in values) {
- var input = document.createElement('input');
- input.type = 'hidden';
- input.name = k;
- input.value = values[k];
- form.appendChild(input);
- }
-
- form.submit();
-}
-
-
-function dynpostkv(action, k, v)
-{
- var dict = {};
- dict[k] = v;
- dynpost(action, dict);
-}
-
-// }}}
-// {{{ function RegExp.escape()
-
-RegExp.escape = function(text) {
- if (!arguments.callee.sRE) {
- var specials = [
- '/', '.', '*', '+', '?', '|',
- '(', ')', '[', ']', '{', '}',
- '\\', '^' , '$'
- ];
- arguments.callee.sRE = new RegExp(
- '(\\' + specials.join('|\\') + ')', 'g'
- );
- }
- return text.replace(arguments.callee.sRE, '\\$1');
-}
-
-// }}}
/***************************************************************************
* POPUP THINGS
}
// }}}
-// {{{ jQuery object extension
-
-(function($) {
- /* Add new functions to jQuery namesapce */
- $.extend({
- /* The goal of the following functions is to provide an AJAX API that
- * take a different callback in case of HTTP success code (2XX) and in
- * other cases.
- */
-
- xajax: function(source, method, data, onSuccess, onError, type) {
- /* Shift argument */
- if ($.isFunction(data)) {
- type = type || onError;
- onError = onSuccess;
- onSuccess = data;
- data = null;
- }
- if (onError != null && !$.isFunction(onError)) {
- type = type || onError;
- onError = null;
- }
-
- function ajaxHandler(data, textStatus, xhr) {
- if (textStatus == 'success') {
- if (onSuccess) {
- onSuccess(data, textStatus, xhr);
- }
- } else if (textStatus == 'error') {
- if (onError) {
- onError(data, textStatus, xhr);
- } else {
- alert("Une error s'est produite lors du traitement de la requête.\n"
- + "Ta session a peut-être expiré");
- }
- }
- }
- return $.ajax({
- url: source,
- type: method,
- success: ajaxHandler,
- data : data,
- dataType: type
- });
- },
-
- xget: function(source, data, onSuccess, onError, type) {
- return $.xajax(source, 'GET', data, onSuccess, onError, type);
- },
-
- xgetJSON: function(source, data, onSuccess, onError) {
- return $.xget(source, data, onSuccess, onError, 'json');
- },
-
- xgetScript: function(source, onSuccess, onError) {
- return $.xget(source, null, onSuccess, onError, 'script');
- },
-
- xgetText: function(source, data, onSuccess, onError) {
- return $.xget(source, data, onSuccess, onError, 'text');
- },
-
- xpost: function(source, data, onSuccess, onError, type) {
- return $.xajax(source, 'POST', data, onSuccess, onError, type);
- },
-
- closeOnEsc: function() {
- return $(window).keydown(function (e) {
- if (e.keyCode == 27) {
- window.close();
- }
- });
- }
- });
-
- /* Add new functions to jQuery objects */
- $.fn.extend({
- tmpMessage: function(message, success) {
- if (success) {
- this.html("<img src='images/icons/wand.gif' alt='' /> " + message)
- .css('color', 'green');
- } else {
- this.html("<img src='images/icons/error.gif' alt='' /> " + message)
- .css('color', 'red');
- }
- return this.css('fontWeight', 'bold')
- .show()
- .delay(1000)
- .fadeOut(500);
- },
-
- updateHtml: function(source, callback) {
- var elements = this;
- function handler(data) {
- elements.html(data);
- if (callback) {
- callback(data);
- }
- }
- $.xget(source, handler, 'text');
- return this;
- },
-
- successMessage: function(source, message) {
- var elements = this;
- $.xget(source, function() {
- elements.tmpMessage(message, true);
- });
- return this;
- },
-
- wiki: function(text, withTitle) {
- if (text == '') {
- return this.html('');
- }
- var url = 'wiki_preview';
- if (!withTitle) {
- url += '/notitile';
- }
- var $this = this;
- $.post(url, { text: text },
- function (data) {
- $this.html(data);
- }, 'text');
- return this;
- },
-
- popWin: function(w, h) {
- return this.click(function() {
- window.open(this.href, '_blank',
- 'toolbar=0,location=0,directories=0,status=0,'
- +'menubar=0,scrollbars=1,resizable=1,'
- +'width='+w+',height='+h);
- return false;
- });
- }
- });
-})(jQuery);
-
-// }}}
-// {{{ preview wiki
-
-function previewWiki(idFrom, idTo, withTitle, idShow)
-{
- $('#' + idTo).wiki($('#' + idFrom).val(), withTitle);
- if (idShow != null) {
- $('#' + idShow).show();
- }
-}
-
-// }}}
// {{{ send test email
function sendTestEmail(token, hruid)
} else {
// Register custom Banana links and tabs
if (!Banana::$profile['autoup']) {
- Banana::$page->registerAction('<a href=\'javascript:dynpostkv("'
+ Banana::$page->registerAction('<a href=\'javascript:$.dynPost("'
. $platal->path . '", "updateall", ' . time() . ')\'>'
. 'Marquer tous les messages comme lus'
. '</a>', array('forums', 'thread', 'message'));
<tr>
<td class="skigauche">
<input type="radio" name="newskin" value="{$skin.id}" {if $skin_id eq $skin.id}checked="checked"{/if}
- onclick="dynpostkv('prefs/skin', 'newskin', {$skin.id})" />
+ onclick="$.dynPost('prefs/skin', 'newskin', {$skin.id})" />
</td>
<td class="skimilieu">
<strong>{$skin.name}</strong>
modifier
{icon name=date_edit title="Édition de l'événement"}</a>]
- [<a href="javascript:dynpostkv('{$platal->pl_self()}?token={xsrf_token}',{if !$archive}'archive'{else}'unarchive'{/if},{$e.eid})">
+ [<a href="javascript:$.dynPost('{$platal->pl_self()}?token={xsrf_token}',{if !$archive}'archive'{else}'unarchive'{/if},{$e.eid})">
{if !$archive}
archiver
{icon name=package_add title="Archivage"}</a>]
{icon name=package_delete title="Désarchivage"}</a>]
{/if}
- [<a href="javascript:dynpostkv('{$platal->ns}events?token={xsrf_token}','del',{$e.eid})"
+ [<a href="javascript:$.dynPost('{$platal->ns}events?token={xsrf_token}','del',{$e.eid})"
onclick="return confirm('Supprimer l\'événement effacera la liste des inscrits et des paiements.\n Es-tu sûr de vouloir supprimer l\'événement ?')">
supprimer
{icon name=delete title='Suppression'}</a>]
projects / platal.git / commitdiff