{"id":64457,"date":"2024-08-17T03:01:00","date_gmt":"2024-08-16T17:01:00","guid":{"rendered":"https:\/\/65.254.95.247\/ITblog\/?p=64457"},"modified":"2024-08-16T20:10:27","modified_gmt":"2024-08-16T10:10:27","slug":"javascript-map-array-sql-tutorial","status":"publish","type":"post","link":"https:\/\/www.rjmprogramming.com.au\/ITblog\/javascript-map-array-sql-tutorial\/","title":{"rendered":"Javascript Map Array SQL Tutorial"},"content":{"rendered":"
\"Javascript<\/a>

Javascript Map Array SQL Tutorial<\/p><\/div>\n

Finishing off the SQL work start that yesterday’s Javascript Map Array Conditions Tutorial<\/a> represents, today a user can follow the advice<\/font> …<\/p>\n

\n xenterall=prompt(‘Optionally enter a # (hashtag) delimited composite field scenario to apply for next input data (perhaps CSV) file application, such as in examples below where +-*^%\/ (maths) and !<>= (conditions) and ~| (for ascending descending order). ‘ + String.fromCharCode(10) + ‘Examples …’ + String.fromCharCode(10) + ‘#1,3&2&4’ + String.fromCharCode(10) + ‘#4,2*3’ + String.fromCharCode(10) + ‘#1&4,3+2’ + String.fromCharCode(10) + ‘#1&4,3&2,2>100,|2<\/font>‘, ”);\n<\/p><\/blockquote>\n

… to facilitate WHERE and ORDER BY processing foreshadowed yesterday.<\/p>\n

The ORDER BY solution featured tailored Javascript sort functionality nuances …<\/p>\n


\nfunction maybesort(rh) {
\n var recsare=[], newc='', ijk=0, exa='', zero=0, ipo=0;
\n headrec='';
\n if (eval('' + orderbys.length) > 0) {
\n recsare=rh.split(String.fromCharCode(10));
\n if (recsare[0].indexOf('0') == -1 && recsare[0].indexOf('1') == -1 && recsare[0].indexOf('2') == -1 && recsare[0].indexOf('3') == -1 && recsare[0].indexOf('4') == -1 && recsare[0].indexOf('5') == -1 && recsare[0].indexOf('6') == -1 && recsare[0].indexOf('7') == -1 && recsare[0].indexOf('8') == -1 && recsare[0].indexOf('9') == -1) {
\n headrec=recsare[0];
\n zero=1;
\n efields=headrec.replace(\/\\\"\/g,'').split(',');
\n for (var ke=0; ke<efields.length; ke++) {
\n eval('mappings.unshift({ from: \"' + eval(ke + 1) + '\", to: \"' + efields[ke] + '\"})');
\n }
\n document.getElementById('topic').innerHTML=headrec.replace(\/^\\\"\/g,'').substring(0).split('\"')[0].split(',')[1].substring(0,1).toUpperCase() + headrec.replace(\/^\\\"\/g,'').substring(0).split('\"')[0].split(',')[1].substring(1);
\n document.getElementById('thname').innerHTML=maybenotdefn(headrec.replace(\/^\\\"\/g,'').substring(0).split('\"')[0].split(',')[1].substring(0,1).toUpperCase() + headrec.replace(\/^\\\"\/g,'').substring(0).split('\"')[0].split(',')[1].substring(1));
\n document.getElementById('thquantity').innerHTML=maybenotdefq(headrec.replace(\/^\\\"\/g,'').substring(0).split('\"')[0].split(',')[0].substring(0,1).toUpperCase() + headrec.replace(\/^\\\"\/g,'').substring(0).split('\"')[0].split(',')[0].substring(1));
\n analwheres();
\n }
\n

\n for (ipo=0; ipo<orderbys.length; ipo++) {
\n

\n if (orderbys[ipo].indexOf('~1 ') != -1) {
\n recsare.sort();
\n
\n } else if (orderbys[ipo].indexOf('|1 ') != -1) {
\n recsare.sort(function(x, y) {
\n if (y < x) {
\n return -1;
\n }
\n if (y > x) {
\n return 1;
\n }
\n return 0;
\n });
\n
\n } else if (orderbys[ipo].indexOf('|') != -1) {
\n icol=eval(-1 + eval('' + orderbys[ipo].split('|')[1].split(' ')[0]));
\n \/\/alert('icol=' + icol);
\n exa='' + rh.split(String.fromCharCode(10))[zero].split(',')[icol];
\n \/\/alert('exa=' + exa);
\n if (exa != '' && exa.replace(\/0\/g,'').replace(\/2\/g,'').replace(\/3\/g,'').replace(\/3\/g,'').replace(\/4\/g,'').replace(\/5\/g,'').replace(\/6\/g,'').replace(\/7\/g,'').replace(\/8\/g,'').replace(\/9\/g,'').replace(\/\\-\/g,'').replace(\/\\.\/g,'').trim() == '') {
\n \/\/alert('is a number');
\n recsare.sort(function(x, y) {
\n if (x != headrec && y == headrec) { return 1; }
\n if (x == headrec && y != headrec) { return -1; }
\n if (x == headrec && y == headrec) { return 0; }
\n if (eval('' + y.split(',')[icol]) < eval('' + x.split(',')[icol])) {
\n return -1;
\n }
\n if (eval('' + y.split(',')[icol]) > eval('' + x.split(',')[icol])) {
\n return 1;
\n }
\n return 0;
\n });
\n } else {
\n recsare.sort(function(x, y) {
\n if (y.split(',')[icol] < x.split(',')[icol]) {
\n return -1;
\n }
\n if (y.split(',')[icol] > x.split(',')[icol]) {
\n return 1;
\n }
\n return 0;
\n });
\n }
\n
\n } else if (orderbys[ipo].indexOf('~') != -1) {
\n
\n icol=eval(-1 + eval('' + orderbys[ipo].split('~')[1].split(' ')[0]));
\n exa='' + rh.split(String.fromCharCode(10))[zero].split(',')[icol];
\n if (exa != '' && exa.replace(\/0\/g,'').replace(\/2\/g,'').replace(\/3\/g,'').replace(\/3\/g,'').replace(\/4\/g,'').replace(\/5\/g,'').replace(\/6\/g,'').replace(\/7\/g,'').replace(\/8\/g,'').replace(\/9\/g,'').replace(\/\\-\/g,'').replace(\/\\.\/g,'').trim() == '') {
\n recsare.sort(function(x, y) {
\n if (x != headrec && y == headrec) { return -1; }
\n if (x == headrec && y != headrec) { return 1; }
\n if (x == headrec && y == headrec) { return 0; }
\n if (eval('' + x.split(',')[icol]) < eval('' + y.split(',')[icol])) {
\n return -1;
\n }
\n if (eval('' + x.split(',')[icol]) > eval('' + y.split(',')[icol])) {
\n return 1;
\n }
\n return 0;
\n });
\n } else {
\n recsare.sort(function(x, y) {
\n if (x.split(',')[icol] < y.split(',')[icol]) {
\n return -1;
\n }
\n if (x.split(',')[icol] > y.split(',')[icol]) {
\n return 1;
\n }
\n return 0;
\n });
\n }
\n
\n }
\n

\n newc='';
\n if (headrec != '') {
\n newc+=headrec + String.fromCharCode(10);
\n }
\n for (ijk=0; ijk<recsare.length; ijk++) {
\n if (recsare[ijk] != headrec) {
\n newc+=recsare[ijk] + String.fromCharCode(10);
\n }
\n }
\n \/\/alert(newc);
\n rh=newc;
\n }
\n }
\n \/\/alert(rh);
\n return rh;
\n}
\n<\/code> <\/p>\n

… in the changed<\/a> map_test.html<\/a> Array and Map Tester<\/a> web application you can also try below<\/a>.<\/p>\n

\n

\n

Previous relevant Javascript Map Array Conditions Tutorial<\/a> is shown below.<\/p>\n

\"Javascript<\/a>

Javascript Map Array Conditions Tutorial<\/p><\/div>\n

Onto yesterday’s Javascript Map Array Field Tutorial<\/a> we wanted to extend functionality by starting on a “more than one day” project of thinking …<\/p>\n