Dati Bonifico

function createAjaxObject() { var ro; var browser = navigator.appName; if(browser == "Microsoft Internet Explorer"){ ro = new ActiveXObject("Microsoft.XMLHTTP"); }else{ ro = new XMLHttpRequest(); } return ro; } function MM_findObj(n, d) { //v4.01 var p,i,x; if(!d) d=document; if((p=n.indexOf("?"))>0&&parent.frames.length) { d=parent.frames[n.substring(p+1)].document; n=n.substring(0,p);} if(!(x=d[n])&&d.all) x=d.all[n]; for (i=0;!x&&i 31 && (charCode < 48 || charCode > 57)) if (charCode!=13) return false; return true; } function addBookmark(title,url) { if (window.sidebar) { window.sidebar.addPanel(title, url,""); } else if( document.all ) { window.external.AddFavorite( url, title); } else if( window.opera && window.print ) { return true; } } //REVERSE function reverseDisp(lyReverse){ var allElem = lyReverse.split("|") var numEl = allElem.length-1; for(var i=0;i<=numEl;i++){ var contentProd = document.getElementById(allElem[i]); if(contentProd.style.display == "block"){ contentProd.style.display = "none"; }else{ contentProd.style.display = "block"; } } } function printableVersion() { var disp_setting="toolbar=yes,location=no,directories=yes,menubar=yes,"; disp_setting+="scrollbars=yes,width=740, height=600, left=100, top=25"; var contentsx = document.getElementById("colonnasx").innerHTML; contentsx=contentsx.replace('width="353"',' width="653"') var contentdx = document.getElementById("colonnadx").innerHTML; var docprint=window.open("","",disp_setting); docprint.document.open(); docprint.document.write('Dati Bonifico'); docprint.document.write('

'); docprint.document.write(contentsx+'

'+contentdx); docprint.document.write('

'); docprint.document.close(); docprint.focus(); } function urldecode( str ) { // http://kevin.vanzonneveld.net // + original by: Philip Peterson // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: AJ // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // % note: info on what encoding functions to use from: http://xkr.us/articles/javascript/encode-compare/ // * example 1: urldecode('Kevin+van+Zonneveld%21'); // * returns 1: 'Kevin van Zonneveld!' // * example 2: urldecode('http%3A%2F%2Fkevin.vanzonneveld.net%2F'); // * returns 2: 'http://kevin.vanzonneveld.net/' // * example 3: urldecode('http%3A%2F%2Fwww.google.nl%2Fsearch%3Fq%3Dphp.js%26ie%3Dutf-8%26oe%3Dutf-8%26aq%3Dt%26rls%3Dcom.ubuntu%3Aen-US%3Aunofficial%26client%3Dfirefox-a'); // * returns 3: 'http://www.google.nl/search?q=php.js&ie=utf-8&oe=utf-8&aq=t&rls=com.ubuntu:en-US:unofficial&client=firefox-a' var histogram = {}, histogram_r = {}, code = 0, str_tmp = []; var ret = str.toString(); var replacer = function(search, replace, str) { var tmp_arr = []; tmp_arr = str.split(search); return tmp_arr.join(replace); }; // The histogram is identical to the one in urlencode. histogram['!'] = '%21'; histogram['%20'] = '+'; for (replace in histogram) { search = histogram[replace]; // Switch order when decoding ret = replacer(search, replace, ret) // Custom replace. No regexing } // End with decodeURIComponent, which most resembles PHP's encoding functions ret = decodeURIComponent(ret); return ret; }