projects / platal.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
history | raw | HEAD
Kill is_IE.
[platal.git] / htdocs / javascript / xorg.js
1 /***************************************************************************
2 * Copyright (C) 2003-2011 Polytechnique.org *
3 * http://opensource.polytechnique.org/ *
4 * *
5 * This program is free software; you can redistribute it and/or modify *
6 * it under the terms of the GNU General Public License as published by *
7 * the Free Software Foundation; either version 2 of the License, or *
8 * (at your option) any later version. *
9 * *
10 * This program is distributed in the hope that it will be useful, *
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13 * GNU General Public License for more details. *
14 * *
15 * You should have received a copy of the GNU General Public License *
16 * along with this program; if not, write to the Free Software *
17 * Foundation, Inc., *
18 * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *
19 ***************************************************************************/
20
21 // {{{ function getNow()
22 var days = ['Dimanche', 'Lundi', 'Mardi', 'Mercredi', 'Jeudi', 'Vendredi', 'Samedi'];
23 var months = ['janvier', 'février', 'mars', 'avril', 'mai', 'juin', 'juillet',
24 'août', 'septembre', 'octobre', 'novembre', 'décembre'];
25
26 function getNow() {
27 var dt = new Date();
28 var dy = dt.getDay();
29 var mh = dt.getMonth();
30 var wd = dt.getDate();
31 var yr = dt.getYear();
32 var hr = dt.getHours();
33 var mi = dt.getMinutes();
34 var se = dt.getSeconds();
35
36 if (yr<1000) {
37 yr += 1900;
38 }
39 if (mi < 10) {
40 mi = '0' + mi;
41 }
42 if (se < 10) {
43 se = '0' + se;
44 }
45
46 $(".date-heure").html(days[dy] + ' ' + wd + ' ' + months[mh] + ' ' + yr + '<br />'
47 + hr + ':' + mi + ':' + se);
48 }
49
50 // }}}
51 // {{{ Search Engine
52
53 function canAddSearchEngine()
54 {
55 if (((typeof window.sidebar === "object") && $.isFunction(window.sidebar.addSearchEngine))
56 || ((typeof window.external === "object") && $.isFunction(window.external.AddSearchProvider))) {
57 return true;
58 }
59 return false;
60 }
61
62 function addSearchEngine()
63 {
64 var searchURI = "http://www.polytechnique.org/xorg.opensearch.xml";
65 if ((typeof window.sidebar === "object") && $.isFunction(window.sidebar.addSearchEngine)) {
66 window.sidebar.addSearchEngine(
67 searchURI,
68 "http://www.polytechnique.org/images/xorg.png",
69 "Annuaire Polytechnique.org",
70 "Academic");
71 } else {
72 try {
73 window.external.AddSearchProvider(searchURI);
74 } catch(e) {
75 alert("Impossible d'installer la barre de recherche");
76 }
77 }
78 }
79
80 // }}}
81
82 /***************************************************************************
83 * POPUP THINGS
84 */
85
86 // {{{ function goodiesPopup()
87
88 (function($) {
89 var goodies = {
90 ical: {
91 default_title: 'Calendrier iCal',
92 sites: [
93 {url_prefix: '',
94 img: 'images/icons/calendar_view_day.gif',
95 title: 'Calendrier iCal'},
96 {url_prefix: 'http://www.google.com/calendar/render?cid=',
97 img: 'images/goodies/add-google-calendar.gif',
98 title: 'Ajouter à Google Calendar'},
99 {url_prefix: 'https://www.google.com/calendar/hosted/polytechnique.org/render?cid=',
100 img: 'images/goodies/add-google-calendar.gif',
101 title: 'Ajouter à Google Apps / Calendar'}
102 ]
103 },
104
105 rss: {
106 default_title: 'Fils RSS',
107 sites: [
108 {url_prefix: '',
109 img: 'images/icons/feed.gif',
110 title: 'Fil rss'},
111 {url_prefix: 'http://fusion.google.com/add?feedurl=',
112 img: 'images/goodies/add-google.gif',
113 alt: 'Add to Google',
114 title: 'Ajouter à iGoogle/Google Reader'},
115 {url_prefix: 'http://www.netvibes.com/subscribe.php?url=',
116 img: 'images/goodies/add-netvibes.gif',
117 title: 'Ajouter à Netvibes'},
118 {url_prefix: 'http://add.my.yahoo.com/content?.intl=fr&url=',
119 img: 'images/goodies/add-yahoo.gif',
120 alt: 'Add to My Yahoo!',
121 title: 'Ajouter à My Yahoo!'}
122 ]
123 }
124 };
125
126 $.fn.extend({
127 goodiesPopup: function goodiesPopup(type) {
128 var text = '<div style="text-align: center; line-height: 2.2">';
129 var site;
130 var entry;
131 var s_alt;
132 var s_img;
133 var s_title;
134 var s_url;
135
136 for (site in goodies[type].sites) {
137 entry = goodies[type].sites[site];
138 s_alt = entry.alt || "";
139 s_img = entry.img;
140 s_title = entry.title || "";
141 s_url = entry.url_prefix.length > 0 ? entry.url_prefix + escape(this.href) : this.href;
142
143 text += '<a href="' + s_url + '"><img src="' + s_img + '" title="' + s_title + '" alt="' + s_alt + '"></a><br />';
144 }
145 text += '<a href="https://www.polytechnique.org/Xorg/Goodies">Plus de bonus</a> ...</div>';
146
147 return this.overlib({
148 text: text,
149 caption: this.attr('title') || goodies.default_title,
150 close_text: 'Fermer',
151 delay: 800,
152 sticky: true,
153 width: 150
154 });
155 }
156 });
157 }(jQuery));
158
159 // }}}
160 // {{{ function auto_links()
161
162 function auto_links() {
163 var url = document.URL;
164 var fqdn = url.replace(/^https?:\/\/([^\/]*)\/.*$/,'$1');
165 var light = url.indexOf('display=light') > url.indexOf('?');
166 var resource_page = url.contains('rss') || url.contains('ical');
167
168 $("a,link").each(function(i) {
169 var node = $(this);
170 var href = this.href;
171 var matches;
172 var rss;
173 var ical;
174
175 if(!href || node.hasClass('xdx')
176 || href.startsWith('mailto:') || href.startsWith('javascript:')) {
177 return;
178 }
179 if ((!href.contains(fqdn) && !this.className.contains('popup')) || node.hasClass('popup')) {
180 node.click(function () {
181 window.open(href);
182 return false;
183 });
184 }
185 if (href.contains(fqdn) && light) {
186 href = href.replace(/([^\#\?]*)\??([^\#]*)(\#.*)?/, "$1?display=light&$2$3");
187 this.href = href;
188 }
189 rss = href.contains('rss');
190 ical = href.contains('ical');
191 if (rss || ical) {
192 if (!href.startsWith('http')) {
193 href = 'http://' + fqdn + '/' + href;
194 }
195 }
196 if (this.nodeName.toLowerCase() === 'a' && !resource_page) {
197 if (rss && !href.contains('prefs/rss') && (href.contains('xml') || href.contains('hash'))) {
198 node.goodiesPopup('rss');
199 } else if (ical) {
200 node.goodiesPopup('ical');
201 }
202 }
203 matches = /^popup_([0-9]*)x([0-9]*)$/.exec(this.className);
204 if (matches) {
205 node.popWin(matches[1], matches[2]);
206 }
207 });
208 $('.popup2').popWin(840, 600);
209 $('.popup3').popWin(640, 800);
210 }
211
212
213 // }}}
214
215 /***************************************************************************
216 * Password check
217 */
218
219 // {{{ function checkPassword
220
221 /* {{{ SHA1 Implementation */
222
223 /*
224 * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined
225 * in FIPS PUB 180-1
226 * Version 2.1a Copyright Paul Johnston 2000 - 2002.
227 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
228 * Distributed under the BSD License
229 * See http://pajhome.org.uk/crypt/md5 for details.
230 */
231
232 /*
233 * Configurable variables. You may need to tweak these to be compatible with
234 * the server-side, but the defaults work in most cases.
235 */
236 var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
237 var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */
238 var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
239
240 /*
241 * These are the functions you'll usually want to call
242 * They take string arguments and return either hex or base-64 encoded strings
243 */
244 function hex_sha1(s){return binb2hex(core_sha1(str2binb(s),s.length * chrsz));}
245 function b64_sha1(s){return binb2b64(core_sha1(str2binb(s),s.length * chrsz));}
246 function str_sha1(s){return binb2str(core_sha1(str2binb(s),s.length * chrsz));}
247 function hex_hmac_sha1(key, data){ return binb2hex(core_hmac_sha1(key, data));}
248 function b64_hmac_sha1(key, data){ return binb2b64(core_hmac_sha1(key, data));}
249 function str_hmac_sha1(key, data){ return binb2str(core_hmac_sha1(key, data));}
250
251 /*
252 * Perform a simple self-test to see if the VM is working
253 */
254 function sha1_vm_test()
255 {
256 return hex_sha1("abc") === "a9993e364706816aba3e25717850c26c9cd0d89d";
257 }
258
259 /*
260 * Calculate the SHA-1 of an array of big-endian words, and a bit length
261 */
262 function core_sha1(x, len)
263 {
264 var w, a, b, c, d, e;
265 var olda, oldb, oldc, oldd, olde;
266 var i, j, t;
267
268 /* append padding */
269 x[len >> 5] |= 0x80 << (24 - len % 32);
270 x[((len + 64 >> 9) << 4) + 15] = len;
271
272 w = Array(80);
273 a = 1732584193;
274 b = -271733879;
275 c = -1732584194;
276 d = 271733878;
277 e = -1009589776;
278
279 for(i = 0; i < x.length; i += 16)
280 {
281 olda = a;
282 oldb = b;
283 oldc = c;
284 oldd = d;
285 olde = e;
286
287 for(j = 0; j < 80; j++)
288 {
289 if(j < 16) w[j] = x[i + j];
290 else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);
291 t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)),
292 safe_add(safe_add(e, w[j]), sha1_kt(j)));
293 e = d;
294 d = c;
295 c = rol(b, 30);
296 b = a;
297 a = t;
298 }
299
300 a = safe_add(a, olda);
301 b = safe_add(b, oldb);
302 c = safe_add(c, oldc);
303 d = safe_add(d, oldd);
304 e = safe_add(e, olde);
305 }
306 return Array(a, b, c, d, e);
307
308 }
309
310 /*
311 * Perform the appropriate triplet combination function for the current
312 * iteration
313 */
314 function sha1_ft(t, b, c, d)
315 {
316 if(t < 20) return (b & c) | ((~b) & d);
317 if(t < 40) return b ^ c ^ d;
318 if(t < 60) return (b & c) | (b & d) | (c & d);
319 return b ^ c ^ d;
320 }
321
322 /*
323 * Determine the appropriate additive constant for the current iteration
324 */
325 function sha1_kt(t)
326 {
327 return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 :
328 (t < 60) ? -1894007588 : -899497514;
329 }
330
331 /*
332 * Calculate the HMAC-SHA1 of a key and some data
333 */
334 function core_hmac_sha1(key, data)
335 {
336 var bkey = str2binb(key);
337 var i, ipad, opad;
338 var hash;
339
340 if(bkey.length > 16) bkey = core_sha1(bkey, key.length * chrsz);
341
342 ipad = Array(16);
343 opad = Array(16);
344 for(i = 0; i < 16; i++)
345 {
346 ipad[i] = bkey[i] ^ 0x36363636;
347 opad[i] = bkey[i] ^ 0x5C5C5C5C;
348 }
349
350 hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz);
351 return core_sha1(opad.concat(hash), 512 + 160);
352 }
353
354 /*
355 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
356 * to work around bugs in some JS interpreters.
357 */
358 function safe_add(x, y)
359 {
360 var lsw = (x & 0xFFFF) + (y & 0xFFFF);
361 var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
362 return (msw << 16) | (lsw & 0xFFFF);
363 }
364
365 /*
366 * Bitwise rotate a 32-bit number to the left.
367 */
368 function rol(num, cnt)
369 {
370 return (num << cnt) | (num >>> (32 - cnt));
371 }
372
373 /*
374 * Convert an 8-bit or 16-bit string to an array of big-endian words
375 * In 8-bit function, characters >255 have their hi-byte silently ignored.
376 */
377 function str2binb(str)
378 {
379 var bin = Array();
380 var mask = (1 << chrsz) - 1;
381 var i;
382 for(i = 0; i < str.length * chrsz; i += chrsz)
383 bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32);
384 return bin;
385 }
386
387 /*
388 * Convert an array of big-endian words to a string
389 */
390 function binb2str(bin)
391 {
392 var str = "";
393 var mask = (1 << chrsz) - 1;
394 var i;
395 for(i = 0; i < bin.length * 32; i += chrsz)
396 str += String.fromCharCode((bin[i>>5] >>> (32 - chrsz - i%32)) & mask);
397 return str;
398 }
399
400 /*
401 * Convert an array of big-endian words to a hex string.
402 */
403 function binb2hex(binarray)
404 {
405 var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
406 var str = "";
407 var i;
408 for(i = 0; i < binarray.length * 4; i++)
409 {
410 str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) +
411 hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8 )) & 0xF);
412 }
413 return str;
414 }
415
416 /*
417 * Convert an array of big-endian words to a base-64 string
418 */
419 function binb2b64(binarray)
420 {
421 var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
422 var str = "";
423 var i, j, triplet;
424 for(i = 0; i < binarray.length * 4; i += 3)
425 {
426 triplet = (((binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16)
427 | (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 )
428 | ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF);
429 for(j = 0; j < 4; j++)
430 {
431 if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
432 else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
433 }
434 }
435 return str;
436 }
437
438 /* }}} */
439
440 function hash_encrypt(a) {
441 return hex_sha1(a);
442 }
443
444 var hexa_h = "0123456789abcdef";
445
446 function dechex(a) {
447 return hexa_h.charAt(a);
448 }
449
450 function hexdec(a) {
451 return hexa_h.indexOf(a);
452 }
453
454 function hash_xor(a, b) {
455 var c,i,j,k,d;
456 c = "";
457 i = a.length;
458 j = b.length;
459 if (i < j) {
460 d = a; a = b; b = d;
461 k = i; i = j; j = k;
462 }
463 for (k = 0; k < j; k++) {
464 c += dechex(hexdec(a.charAt(k)) ^ hexdec(b.charAt(k)));
465 }
466 for (; k < i; k++) {
467 c += a.charAt(k);
468 }
469 return c;
470 }
471
472
473 function getType(c) {
474 if (c >= 'a' && c <= 'z') {
475 return 1;
476 } else if (c >= 'A' && c <= 'Z') {
477 return 2;
478 } else if (c >= '0' && c <= '9') {
479 return 3;
480 } else {
481 return 4;
482 }
483 }
484
485 function differentTypes(password) {
486 var prev = 0;
487 var type;
488
489 for (i = 0 ; i < password.length ; ++i) {
490 type = getType(password.charAt(i));
491 if (prev !== 0 && prev !== type) {
492 return true;
493 }
494 prev = type;
495 }
496 return false;
497 }
498
499 function passwordStrength(password) {
500 var prop = 0;
501 var prev = 0;
502 var firstType = true;
503 var types = Array(0, 0, 0, 0, 0);
504 var type;
505
506 for (i = 0 ; i < password.length ; ++i) {
507 type = getType(password.charAt(i));
508 if (prev !== 0 && prev !== type) {
509 prop += 5;
510 firstType = false;
511 }
512 prop += i;
513 if (types[type] === 0 && !firstType) {
514 prop += 15;
515 }
516 types[type]++;
517 prev = type;
518 }
519 if (password.length < 6) {
520 prop *= 0.75;
521 }
522 if (firstType) {
523 prop *= 0.75;
524 }
525 if (prop > 100) {
526 prop = 100;
527 } else if (prop < 0) {
528 prop = 0;
529 }
530
531 return prop;
532 }
533
534 function checkPassword(box, okLabel) {
535 var password = box.value;
536 var prop = passwordStrength(password);
537 var submitButton;
538
539 if (prop >= 60) {
540 color = "#4f4";
541 bgcolor = "#050";
542 ok = true;
543 } else if (prop >= 35) {
544 color = "#ff4";
545 bgcolor = "#750";
546 ok = true;
547 } else {
548 color = "#f20";
549 bgcolor = "#700";
550 ok = false;
551 }
552 $("#passwords_measure")
553 .stop()
554 .animate({ width: prop + "%",
555 backgroundColor: color
556 }, 750)
557 .parent().stop()
558 .animate({ backgroundColor: bgcolor }, 750);
559 submitButton = $(":submit[name='" + passwordprompt_submit + "']");
560 if (ok && password.length >= 6 && differentTypes(password)) {
561 submitButton.attr("value", okLabel);
562 submitButton.removeAttr("disabled");
563 } else {
564 submitButton.attr("value", "Mot de passe trop faible");
565 submitButton.attr("disabled", "disabled");
566 }
567 }
568
569 function hashResponse(password1, password2, hasConfirmation) {
570 var pw1 = $('[name=' + password1 + ']').val();
571 var pw2;
572
573 if (hasConfirmation) {
574 pw2 = $('[name=' + password2 + ']').val();
575 if (pw1 !== pw2) {
576 alert("\nErreur : les deux champs ne sont pas identiques !");
577 return false;
578 }
579 $('[name=' + password2 + ']').val('');
580 } else if (pw1 === '********') {
581 return true;
582 }
583
584 if (pw1.length < 6) {
585 alert("\nErreur : le nouveau mot de passe doit faire au moins 6 caractères !");
586 return false;
587 }
588 if (!differentTypes(pw1)) {
589 alert ("\nErreur : le nouveau mot de passe doit comporter au moins deux types de caractères parmi les suivants : lettres minuscules, lettres majuscules, chiffres, caractères spéciaux.");
590 return false;
591 }
592
593 alert("Le mot de passe que tu as rentré va être chiffré avant de nous parvenir par Internet ! Ainsi il ne circulera pas en clair.");
594 $('[name=' + password1 + ']').val('');
595 $('[name=pwhash]').val(hash_encrypt(pw1));
596 return true;
597 }
598
599 function correctUserName() {
600 var u = document.forms.login.username;
601 var mots;
602
603 // login with no space
604 if (!u.value.contains(' ')) {
605 return true;
606 }
607 mots = u.value.split(' ');
608 // jean paul.du pont -> jean-paul.du-pont
609 if (u.value.contains('.')) {
610 u.value = mots.join('-');
611 return true;
612 }
613 // jean dupont -> jean.dupont
614 if (mots.length === 2) {
615 u.value = mots[0] + "." + mots[1];
616 return true;
617 }
618 // jean dupont 2001 -> jean.dupont.2001
619 if (mots.length === 3 && mots[2] > 1920 && mots[2] < 3000) {
620 u.value = mots.join('.');
621 return true;
622 }
623 // jean de la vallee -> jean.de-la-vallee
624 if (mots[1].toUpperCase() === 'DE') {
625 u.value = mots[0] + "." + mots.join('-').substr(mots[0].length+1);
626 return true;
627 }
628 // jean paul dupont -> jean-paul.dupont
629 if (mots.length === 3 && mots[0].toUpperCase() === 'JEAN') {
630 u.value = mots[0] + "-" + mots[1] + "." + mots[2];
631 return true;
632 }
633
634 alert('Ton email ne doit pas contenir de blanc.\nLe format standard est\n\nprenom.nom.promotion\n\nSi ton nom ou ton prenom est composé,\nsépare les mots par des -');
635
636 return false;
637 }
638
639 function doChallengeResponse() {
640 var new_pass, old_pass, str;
641
642 if (!correctUserName()) {
643 return false;
644 }
645
646 new_pass = hash_encrypt(document.forms.login.password.value);
647 old_pass = hash_encrypt(document.forms.login.password.value.substr(0, 10));
648
649 str = document.forms.login.username.value + ":" +
650 new_pass + ":" +
651 document.forms.loginsub.challenge.value;
652
653 document.forms.loginsub.response.value = hash_encrypt(str);
654 if (new_pass !== old_pass) {
655 document.forms.loginsub.xorpass.value = hash_xor(new_pass, old_pass);
656 }
657 document.forms.loginsub.username.value = document.forms.login.username.value;
658 document.forms.loginsub.remember.value = document.forms.login.remember.checked;
659 document.forms.loginsub.domain.value = document.forms.login.domain.value;
660 document.forms.login.password.value = "";
661 document.forms.loginsub.submit();
662 }
663
664 function doChallengeResponseLogged() {
665 var str = document.forms.loginsub.username.value + ":" +
666 hash_encrypt(document.forms.login.password.value) + ":" +
667 document.forms.loginsub.challenge.value;
668
669 document.forms.loginsub.response.value = hash_encrypt(str);
670 document.forms.loginsub.remember.value = document.forms.login.remember.checked;
671 document.forms.login.password.value = "";
672 document.forms.loginsub.submit();
673 }
674
675 // }}}
676 // {{{ send test email
677
678 function sendTestEmail(token, hruid)
679 {
680 var url = 'emails/test';
681 var msg = "Un email a été envoyé avec succès";
682 if (hruid) {
683 url += '/' + hruid;
684 msg += " sur l'adresse de " + hruid + ".";
685 } else {
686 msg += " sur ton addresse.";
687 }
688 $('#mail_sent').successMessage($url + '?token=' + token, msg);
689 return false;
690 }
691
692 // }}}
693
694
695 /***************************************************************************
696 * Overlib made simple
697 */
698
699 (function($) {
700 $.fn.extend({
701 overlib: function(text, width, height) {
702 var args = [ ];
703 var key;
704
705 if (typeof text === 'string') {
706 args.push(text);
707 if (width) {
708 args.push(width);
709 }
710 if (height) {
711 args.push(height);
712 }
713 } else {
714 for (key in text) {
715 switch (key) {
716 case 'text':
717 args.unshift(text[key]);
718 break;
719 case 'caption':
720 args.push(CAPTION, text[key]);
721 break;
722 case 'close_text':
723 args.push(CLOSETEXT, text[key]);
724 break;
725 case 'delay':
726 args.push(DELAY, text[key]);
727 break;
728 case 'sticky':
729 if (text[key]) {
730 args.push(STICKY);
731 }
732 break;
733 case 'width':
734 args.push(WIDTH, text[key]);
735 break;
736 case 'height':
737 args.push(HEIGHT, text[key]);
738 break;
739 }
740 }
741 }
742 return this
743 .mouseover(function () {
744 return overlib.apply(null, args);
745 })
746 .mouseout(nd);
747 }
748 });
749 }(jQuery));
750
751
752 /***************************************************************************
753 * The real OnLoad
754 */
755
756 $(function() {
757 auto_links();
758 getNow();
759 setInterval(getNow, 1000);
760 $("#quick")
761 .focus(function() {
762 if ($(this).val() === 'Recherche dans l\'annuaire') {
763 $(this).val('');
764 }
765 $("#quick_button").show();
766 })
767 .blur(function() {
768 $("#quick_button").hide();
769 });
770 $("#quick_button").click(function() {
771 if ($("#quick").val() === 'Recherche dans l\'annuaire'
772 || $("#quick").val() === '') {
773 return false;
774 }
775 return true;
776 });
777 });
778
779 // vim:set et sw=4 sts=4 sws=4 foldmethod=marker enc=utf-8:
plat/al