r2009 - trunk/wpi/js

[martijn....@bigcat.unimaas.nl]

Author: ariutta
Date: Fri Oct 20 02:05:16 2017
New Revision: 2009

Log:
Required by DiffViewer

Added:
trunk/wpi/js/querystring-parameters.js

Added: trunk/wpi/js/querystring-parameters.js
==============================================================================
--- (empty file)
+++ trunk/wpi/js/querystring-parameters.js Fri Oct 20 02:05:16 2017
@@ -0,0 +1,82 @@
+// see http://stackoverflow.com/questions/901115/how-can-i-get-query-string-values-in-javascript/23401756#23401756
+
+var getQueryStringKey = function(key) {
+ return getQueryStringAsObject()[key];
+};
+
+var getQueryStringAsObject = function() {
+ var b;
+ var cv;
+ var e;
+ var k;
+ var ma;
+ var sk;
+ var v;
+ var r = {};
+ var d = function(v) {
+ //# d(ecode) the v(alue)
+ return decodeURIComponent(v).replace(/\+/g, ' ');
+ };
+ var q = window.location.search.substring(1);
+ var s = /([^&;=]+)=?([^&;]*)/g //# original regex that does not allow for ; as a delimiter: /([^&=]+)=?([^&]*)/g;
+
+ //# ma(make array) out of the v(alue)
+ ma = function(v) {
+ //# If the passed v(alue) hasn't been setup as an object
+ if (typeof v !== 'object') {
+ //# Grab the cv(current value) then setup the v(alue) as an object
+ cv = v;
+ v = {};
+ v.length = 0;
+
+ //# If there was a cv(current value), .push it into the new v(alue)'s array
+ //# NOTE: This may or may not be 100% logical to do... but it's better than loosing the original value
+ if (cv) { Array.prototype.push.call(v, cv); }
+ }
+
+ return v;
+ };
+
+ //# While we still have key-value e(ntries) from the q(uerystring) via the s(earch regex)...
+ while (e) { //# while((e = s.exec(q)) !== null) {
+ e = s.exec(q);
+ //# Collect the open b(racket) location (if any) then set the d(ecoded) v(alue) from the above split key-value e(ntry)
+ b = e[1].indexOf('[');
+ v = d(e[2]);
+
+ //# As long as this is NOT a hash[]-style key-value e(ntry)
+ if (b < 0) { //# b == "-1"
+ //# d(ecode) the simple k(ey)
+ k = d(e[1]);
+
+ //# If the k(ey) already exists
+ if (r[k]) {
+ //# ma(make array) out of the k(ey) then .push the v(alue) into the k(ey)'s array in the r(eturn value)
+ r[k] = ma(r[k]);
+ Array.prototype.push.call(r[k], v);
+ } else {
+ //# Else this is a new k(ey), so just add the k(ey)/v(alue) into the r(eturn value)
+ r[k] = v;
+ }
+ } else {
+ //# Else we've got ourselves a hash[]-style key-value e(ntry)
+ //# Collect the d(ecoded) k(ey) and the d(ecoded) sk(sub-key) based on the b(racket) locations
+ k = d(e[1].slice(0, b));
+ sk = d(e[1].slice(b + 1, e[1].indexOf(']', b)));
+
+ //# ma(make array) out of the k(ey)
+ r[k] = ma(r[k]);
+
+ //# If we have a sk(sub-key), plug the v(alue) into it
+ if (sk) {
+ r[k][sk] = v;
+ } else {
+ //# Else .push the v(alue) into the k(ey)'s array
+ Array.prototype.push.call(r[k], v);
+ }
+ }
+ }
+
+ //# Return the r(eturn value)
+ return r;
+};