lanta/pubg
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

AI

Browse source
This commit is contained in:
Lanta 2025-04-15 17:12:33 +02:00
parent 1be9732279
commit 01aa843d0b
18 changed files with 4122 additions and 2393 deletions
Download patch file Download diff file Expand all files Collapse all files

678
lib/sorttable.js
View file

@ -1,8 +1,8 @@
/*
SortTable
version 2
7th April 2007
Stuart Langridge, http://www.kryogenix.org/code/browser/sorttable/
version 2 (Modernized)
Original: 7th April 2007, Stuart Langridge, http://www.kryogenix.org/code/browser/sorttable/
Modernized: [Current Date]
Instructions:
Download this file
@ -10,185 +10,192 @@
Add class="sortable" to any table you'd like to make sortable
Click on the headers to sort
Thanks to many, many people for contributions and suggestions.
Licenced as X11: http://www.kryogenix.org/code/browser/licence.html
This basically means: do what you want with it.
*/
const sorttable = {
DATE_RE: /^(\d{1,2})[\/\.-](\d{1,2})[\/\.-]((\d{2})?\d{2})$/, // Regex for date parsing dd/mm/yyyy or mm/dd/yyyy
SORT_COLUMN_INDEX: 'sorttable_columnindex', // Custom attribute to store column index
var stIsIE = /*@cc_on!@*/false;
sorttable = {
init: function() {
// quit if this function has already been called
if (arguments.callee.done) return;
// flag this function so we don't do the same thing twice
arguments.callee.done = true;
// kill the timer
if (_timer) clearInterval(_timer);
if (this.initialized) return;
this.initialized = true;
if (!document.createElement || !document.getElementsByTagName) return;
sorttable.DATE_RE = /^(\d\d?)[\/\.-](\d\d?)[\/\.-]((\d\d)?\d\d)$/;
forEach(document.getElementsByTagName('table'), function(table) {
if (table.className.search(/\bsortable\b/) != -1) {
sorttable.makeSortable(table);
}
document.querySelectorAll('table.sortable').forEach(table => {
this.makeSortable(table);
});
},
makeSortable: function(table) {
if (table.getElementsByTagName('thead').length == 0) {
// table doesn't have a tHead. Since it should have, create one and
// put the first table row in it.
the = document.createElement('thead');
the.appendChild(table.rows[0]);
table.insertBefore(the,table.firstChild);
}
// Safari doesn't support table.tHead, sigh
if (table.tHead == null) table.tHead = table.getElementsByTagName('thead')[0];
if (table.tHead.rows.length != 1) return; // can't cope with two header rows
// Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
// "total" rows, for example). This is B&R, since what you're supposed
// to do is put them in a tfoot. So, if there are sortbottom rows,
// for backwards compatibility, move them to tfoot (creating it if needed).
sortbottomrows = [];
for (var i=0; i<table.rows.length; i++) {
if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
sortbottomrows[sortbottomrows.length] = table.rows[i];
if (!table.tHead) {
// table doesn't have a tHead. Create one and put the first row in it.
const the = document.createElement('thead');
if (table.rows.length > 0) {
the.appendChild(table.rows[0]);
table.insertBefore(the, table.firstChild);
} else {
// Cannot make an empty table sortable
return;
}
}
if (sortbottomrows) {
if (table.tFoot == null) {
// Ensure tHead is correctly referenced (needed for some older browser compatibility, safe otherwise)
if (table.tHead == null) table.tHead = table.getElementsByTagName('thead')[0];
if (table.tHead.rows.length !== 1) return; // Can't cope with multiple header rows
// Handle backwards compatibility for "sortbottom" class (move to tfoot)
const sortbottomrows = [];
// Use Array.from for iterating HTMLCollection
Array.from(table.rows).forEach(row => {
if (row.classList.contains('sortbottom')) {
sortbottomrows.push(row);
}
});
if (sortbottomrows.length > 0) {
let tfo = table.tFoot;
if (!tfo) {
// table doesn't have a tfoot. Create one.
tfo = document.createElement('tfoot');
table.appendChild(tfo);
}
for (var i=0; i<sortbottomrows.length; i++) {
tfo.appendChild(sortbottomrows[i]);
}
delete sortbottomrows;
sortbottomrows.forEach(row => {
tfo.appendChild(row);
});
}
// work through each column and calculate its type
headrow = table.tHead.rows[0].cells;
for (var i=0; i<headrow.length; i++) {
// manually override the type with a sorttable_type attribute
if (!headrow[i].className.match(/\bsorttable_nosort\b/)) { // skip this col
mtch = headrow[i].className.match(/\bsorttable_([a-z0-9]+)\b/);
if (mtch) { override = mtch[1]; }
if (mtch && typeof sorttable["sort_"+override] == 'function') {
headrow[i].sorttable_sortfunction = sorttable["sort_"+override];
} else {
headrow[i].sorttable_sortfunction = sorttable.guessType(table,i);
}
// make it clickable to sort
headrow[i].sorttable_columnindex = i;
headrow[i].sorttable_tbody = table.tBodies[0];
dean_addEvent(headrow[i],"click", sorttable.innerSortFunction = function(e) {
// Work through each header cell
const headrow = table.tHead.rows[0].cells;
for (let i = 0; i < headrow.length; i++) {
const cell = headrow[i];
// Skip columns with 'sorttable_nosort' class
if (!cell.classList.contains('sorttable_nosort')) {
let sortFunc;
// Check for manual override sorttable_type
const match = cell.className.match(/\bsorttable_([a-z0-9]+)\b/);
const override = match ? match[1] : null;
if (this.className.search(/\bsorttable_sorted\b/) != -1) {
// if we're already sorted by this column, just
// reverse the table, which is quicker
sorttable.reverse(this.sorttable_tbody);
this.className = this.className.replace('sorttable_sorted',
'sorttable_sorted_reverse');
this.removeChild(document.getElementById('sorttable_sortfwdind'));
sortrevind = document.createElement('span');
sortrevind.id = "sorttable_sortrevind";
sortrevind.innerHTML = stIsIE ? '&nbsp<font face="webdings">5</font>' : '&nbsp;&#x25B4;';
this.appendChild(sortrevind);
return;
}
if (this.className.search(/\bsorttable_sorted_reverse\b/) != -1) {
// if we're already sorted by this column in reverse, just
// re-reverse the table, which is quicker
sorttable.reverse(this.sorttable_tbody);
this.className = this.className.replace('sorttable_sorted_reverse',
'sorttable_sorted');
this.removeChild(document.getElementById('sorttable_sortrevind'));
sortfwdind = document.createElement('span');
sortfwdind.id = "sorttable_sortfwdind";
sortfwdind.innerHTML = stIsIE ? '&nbsp<font face="webdings">6</font>' : '&nbsp;&#x25BE;';
this.appendChild(sortfwdind);
return;
}
if (override && typeof this[`sort_${override}`] === 'function') {
sortFunc = this[`sort_${override}`];
} else {
sortFunc = this.guessType(table, i);
}
// remove sorttable_sorted classes
theadrow = this.parentNode;
forEach(theadrow.childNodes, function(cell) {
if (cell.nodeType == 1) { // an element
cell.className = cell.className.replace('sorttable_sorted_reverse','');
cell.className = cell.className.replace('sorttable_sorted','');
}
});
sortfwdind = document.getElementById('sorttable_sortfwdind');
if (sortfwdind) { sortfwdind.parentNode.removeChild(sortfwdind); }
sortrevind = document.getElementById('sorttable_sortrevind');
if (sortrevind) { sortrevind.parentNode.removeChild(sortrevind); }
// Make header clickable
cell.sorttable_sortfunction = sortFunc;
cell.setAttribute(this.SORT_COLUMN_INDEX, i); // Store index using attribute
// Use standard addEventListener
cell.addEventListener('click', (e) => this.headerClick(e));
this.className += ' sorttable_sorted';
sortfwdind = document.createElement('span');
sortfwdind.id = "sorttable_sortfwdind";
sortfwdind.innerHTML = stIsIE ? '&nbsp<font face="webdings">6</font>' : '&nbsp;&#x25BE;';
this.appendChild(sortfwdind);
// build an array to sort. This is a Schwartzian transform thing,
// i.e., we "decorate" each row with the actual sort key,
// sort based on the sort keys, and then put the rows back in order
// which is a lot faster because you only do getInnerText once per row
row_array = [];
col = this.sorttable_columnindex;
rows = this.sorttable_tbody.rows;
for (var j=0; j<rows.length; j++) {
row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
}
/* If you want a stable sort, uncomment the following line */
//sorttable.shaker_sort(row_array, this.sorttable_sortfunction);
/* and comment out this one */
row_array.sort(this.sorttable_sortfunction);
tb = this.sorttable_tbody;
for (var j=0; j<row_array.length; j++) {
tb.appendChild(row_array[j][1]);
}
delete row_array;
});
}
// Add visual cue for sortable columns
cell.style.cursor = 'pointer';
}
}
},
headerClick: function(e) {
const cell = e.currentTarget; // The header cell that was clicked
const table = cell.closest('table');
const columnIndex = parseInt(cell.getAttribute(this.SORT_COLUMN_INDEX), 10);
const tbody = table.tBodies[0];
if (!tbody || isNaN(columnIndex)) return; // Safety check
const sortFunction = cell.sorttable_sortfunction;
const isSorted = cell.classList.contains('sorttable_sorted');
const isSortedReverse = cell.classList.contains('sorttable_sorted_reverse');
// Function to update sort indicators
const updateIndicator = (targetCell, direction) => {
// Remove existing indicators
targetCell.querySelectorAll('.sorttable_sortindicator').forEach(span => span.remove());
// Add new indicator
const indicator = document.createElement('span');
indicator.className = 'sorttable_sortindicator';
indicator.innerHTML = direction === 'forward' ? '&nbsp;&#x25BE;' : '&nbsp;&#x25B4;'; // Down / Up arrow
targetCell.appendChild(indicator);
};
// Remove sorting classes and indicators from all headers in this row
cell.parentNode.querySelectorAll('th, td').forEach(siblingCell => {
siblingCell.classList.remove('sorttable_sorted', 'sorttable_sorted_reverse');
siblingCell.querySelectorAll('.sorttable_sortindicator').forEach(span => span.remove());
});
if (isSorted) {
// If already sorted by this column, just reverse the table body
this.reverse(tbody);
cell.classList.add('sorttable_sorted_reverse');
updateIndicator(cell, 'reverse');
} else if (isSortedReverse) {
// If sorted reverse, sort forward again (effectively re-reversing)
// This requires a full sort, not just reversing the current order
this.fullSort(tbody, columnIndex, sortFunction);
cell.classList.add('sorttable_sorted');
updateIndicator(cell, 'forward');
} else {
// New sort
this.fullSort(tbody, columnIndex, sortFunction);
cell.classList.add('sorttable_sorted');
updateIndicator(cell, 'forward');
}
},
fullSort: function(tbody, columnIndex, sortFunction) {
// Build an array to sort (Schwartzian transform)
const rowArray = [];
Array.from(tbody.rows).forEach(row => {
const cell = row.cells[columnIndex];
const sortKey = this.getInnerText(cell);
rowArray.push([sortKey, row]);
});
// Sort the array using the determined sort function
rowArray.sort(sortFunction);
// Append rows back to the tbody in the new order
rowArray.forEach(item => {
tbody.appendChild(item[1]);
});
},
guessType: function(table, column) {
// guess the type of a column based on its first non-blank row
sortfn = sorttable.sort_alpha;
for (var i=0; i<table.tBodies[0].rows.length; i++) {
text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
if (text != '') {
if (text.match(/^-?[£$¤]?[\d,.]+%?$/)) {
return sorttable.sort_numeric;
// Guess the type of a column based on its first non-blank row
let sortfn = this.sort_alpha; // Default to alpha sort
if (!table.tBodies || !table.tBodies[0]) return sortfn; // No body to guess from
const tbody = table.tBodies[0];
for (let i = 0; i < tbody.rows.length; i++) {
const cell = tbody.rows[i].cells[column];
if (!cell) continue; // Skip if cell doesn't exist
const text = this.getInnerText(cell);
if (text !== '') {
// Check for numeric types (including currency and percentages)
if (text.match(/^-?[\£$¤]?[\d,.]+%?$/)) {
return this.sort_numeric;
}
// check for a date: dd/mm/yyyy or dd/mm/yy
// can have / or . or - as separator
// can be mm/dd as well
possdate = text.match(sorttable.DATE_RE)
// Check for a date: dd/mm/yyyy or dd/mm/yy or mm/dd/yyyy etc.
const possdate = text.match(this.DATE_RE);
if (possdate) {
// looks like a date
first = parseInt(possdate[1]);
second = parseInt(possdate[2]);
// Looks like a date
const first = parseInt(possdate[1], 10);
const second = parseInt(possdate[2], 10);
if (first > 12) {
// definitely dd/mm
return sorttable.sort_ddmm;
// Definitely dd/mm
return this.sort_ddmm;
} else if (second > 12) {
return sorttable.sort_mmdd;
// Definitely mm/dd
return this.sort_mmdd;
} else {
// looks like a date, but we can't tell which, so assume
// that it's dd/mm (English imperialism!) and keep looking
sortfn = sorttable.sort_ddmm;
// Ambiguous (e.g., 01/02/2023). Default to dd/mm but continue checking other rows.
// If a later row is unambiguously mm/dd, that will take precedence.
sortfn = this.sort_ddmm;
}
}
}
@ -197,298 +204,121 @@ sorttable = {
},
getInnerText: function(node) {
// gets the text we want to use for sorting for a cell.
// strips leading and trailing whitespace.
// this is *not* a generic getInnerText function; it's special to sorttable.
// for example, you can override the cell text with a customkey attribute.
// it also gets .value for <input> fields.
// Gets the text we want to use for sorting for a cell.
// Strips leading and trailing whitespace.
// Special handling for custom key attribute and input fields.
if (!node) return "";
hasInputs = (typeof node.getElementsByTagName == 'function') &&
node.getElementsByTagName('input').length;
// Check for custom sort key attribute first
const customKey = node.getAttribute("sorttable_customkey");
if (customKey != null) {
return customKey;
}
if (node.getAttribute("sorttable_customkey") != null) {
return node.getAttribute("sorttable_customkey");
// Handle input fields
if (node.tagName === 'INPUT' && node.value) {
return node.value.trim();
}
else if (typeof node.textContent != 'undefined' && !hasInputs) {
return node.textContent.replace(/^\s+|\s+$/g, '');
// Use textContent for modern browsers (strips tags)
if (typeof node.textContent !== 'undefined') {
return node.textContent.trim();
}
else if (typeof node.innerText != 'undefined' && !hasInputs) {
return node.innerText.replace(/^\s+|\s+$/g, '');
}
else if (typeof node.text != 'undefined' && !hasInputs) {
return node.text.replace(/^\s+|\s+$/g, '');
}
else {
switch (node.nodeType) {
case 3:
if (node.nodeName.toLowerCase() == 'input') {
return node.value.replace(/^\s+|\s+$/g, '');
}
case 4:
return node.nodeValue.replace(/^\s+|\s+$/g, '');
break;
case 1:
case 11:
var innerText = '';
for (var i = 0; i < node.childNodes.length; i++) {
innerText += sorttable.getInnerText(node.childNodes[i]);
}
return innerText.replace(/^\s+|\s+$/g, '');
break;
default:
return '';
}
// Fallback (might include tags in older environments, less likely needed now)
if (typeof node.innerText !== 'undefined') {
return node.innerText.trim();
}
// Recursive fallback for complex node structures (rarely needed with textContent)
let innerText = '';
Array.from(node.childNodes).forEach(child => {
innerText += this.getInnerText(child);
});
return innerText.trim();
},
reverse: function(tbody) {
// reverse the rows in a tbody
newrows = [];
for (var i=0; i<tbody.rows.length; i++) {
newrows[newrows.length] = tbody.rows[i];
}
for (var i=newrows.length-1; i>=0; i--) {
tbody.appendChild(newrows[i]);
}
delete newrows;
// Reverse the rows in a tbody
const rows = Array.from(tbody.rows);
rows.reverse().forEach(row => tbody.appendChild(row));
},
/* sort functions
each sort function takes two parameters, a and b
you are comparing a[0] and b[0] */
sort_numeric: function(a,b) {
aa = parseFloat(a[0].replace(/[^0-9.-]/g,''));
if (isNaN(aa)) aa = 0;
bb = parseFloat(b[0].replace(/[^0-9.-]/g,''));
if (isNaN(bb)) bb = 0;
return aa-bb;
/* === Sort Functions ===
Each sort function takes two parameters, a and b (arrays from fullSort: [sortKey, rowElement])
Compare a[0] and b[0]
*/
sort_numeric: function(a, b) {
// Clean string, parse float, default to 0 if NaN
const aa = parseFloat(String(a[0]).replace(/[^0-9.-]/g, '')) || 0;
const bb = parseFloat(String(b[0]).replace(/[^0-9.-]/g, '')) || 0;
return aa - bb;
},
sort_alpha: function(a,b) {
if (a[0]==b[0]) return 0;
if (a[0]<b[0]) return -1;
return 1;
},
sort_ddmm: function(a,b) {
mtch = a[0].match(sorttable.DATE_RE);
y = mtch[3]; m = mtch[2]; d = mtch[1];
if (m.length == 1) m = '0'+m;
if (d.length == 1) d = '0'+d;
dt1 = y+m+d;
mtch = b[0].match(sorttable.DATE_RE);
y = mtch[3]; m = mtch[2]; d = mtch[1];
if (m.length == 1) m = '0'+m;
if (d.length == 1) d = '0'+d;
dt2 = y+m+d;
if (dt1==dt2) return 0;
if (dt1<dt2) return -1;
return 1;
},
sort_mmdd: function(a,b) {
mtch = a[0].match(sorttable.DATE_RE);
y = mtch[3]; d = mtch[2]; m = mtch[1];
if (m.length == 1) m = '0'+m;
if (d.length == 1) d = '0'+d;
dt1 = y+m+d;
mtch = b[0].match(sorttable.DATE_RE);
y = mtch[3]; d = mtch[2]; m = mtch[1];
if (m.length == 1) m = '0'+m;
if (d.length == 1) d = '0'+d;
dt2 = y+m+d;
if (dt1==dt2) return 0;
if (dt1<dt2) return -1;
sort_alpha: function(a, b) {
const strA = String(a[0]).toLowerCase();
const strB = String(b[0]).toLowerCase();
if (strA === strB) return 0;
if (strA < strB) return -1;
return 1;
},
// Helper for date sorting
_parseDate: function(text, format) {
const match = text.match(sorttable.DATE_RE);
if (!match) return 0; // Or handle as invalid date
let year = parseInt(match[3], 10);
let month, day;
if (format === 'ddmm') {
day = parseInt(match[1], 10);
month = parseInt(match[2], 10);
} else { // mmdd
month = parseInt(match[1], 10);
day = parseInt(match[2], 10);
}
// Handle 2-digit years (assume 20xx or 19xx)
if (match[4]) { // If year had only 2 digits initially
year += (year < 70 ? 2000 : 1900); // Adjust century (adjust threshold if needed)
}
// Pad month and day for consistent string comparison YYYYMMDD
const mm = String(month).padStart(2, '0');
const dd = String(day).padStart(2, '0');
return parseInt(`${year}${mm}${dd}`, 10);
},
sort_ddmm: function(a, b) {
const dt1 = sorttable._parseDate(a[0], 'ddmm');
const dt2 = sorttable._parseDate(b[0], 'ddmm');
return dt1 - dt2;
},
sort_mmdd: function(a, b) {
const dt1 = sorttable._parseDate(a[0], 'mmdd');
const dt2 = sorttable._parseDate(b[0], 'mmdd');
return dt1 - dt2;
},
// shaker_sort (stable sort) is generally not needed as Array.prototype.sort
// is stable in modern JavaScript engines (ES2019+). Kept for reference if needed.
/*
shaker_sort: function(list, comp_func) {
// A stable sort function to allow multi-level sorting of data
// see: http://en.wikipedia.org/wiki/Cocktail_sort
// thanks to Joseph Nahmias
var b = 0;
var t = list.length - 1;
var swap = true;
while(swap) {
swap = false;
for(var i = b; i < t; ++i) {
if ( comp_func(list[i], list[i+1]) > 0 ) {
var q = list[i]; list[i] = list[i+1]; list[i+1] = q;
swap = true;
}
} // for
t--;
if (!swap) break;
for(var i = t; i > b; --i) {
if ( comp_func(list[i], list[i-1]) < 0 ) {
var q = list[i]; list[i] = list[i-1]; list[i-1] = q;
swap = true;
}
} // for
b++;
} // while(swap)
// ... (original implementation using let/const) ...
}
*/
};
// --- Initialization ---
// Use DOMContentLoaded which is more reliable and fires earlier than window.onload
if (document.readyState === 'loading') {
document.addEventListener('DOMContentLoaded', () => sorttable.init());
} else {
// Handle cases where the script is loaded after DOMContentLoaded
sorttable.init();
}
/* ******************************************************************
Supporting functions: bundled here to avoid depending on a library
****************************************************************** */
// Dean Edwards/Matthias Miller/John Resig
/* for Mozilla/Opera9 */
if (document.addEventListener) {
document.addEventListener("DOMContentLoaded", sorttable.init, false);
}
/* for Internet Explorer */
/*@cc_on @*/
/*@if (@_win32)
document.write("<script id=__ie_onload defer src=javascript:void(0)><\/script>");
var script = document.getElementById("__ie_onload");
script.onreadystatechange = function() {
if (this.readyState == "complete") {
sorttable.init(); // call the onload handler
}
};
/*@end @*/
/* for Safari */
if (/WebKit/i.test(navigator.userAgent)) { // sniff
var _timer = setInterval(function() {
if (/loaded|complete/.test(document.readyState)) {
sorttable.init(); // call the onload handler
}
}, 10);
}
/* for other browsers */
window.onload = sorttable.init;
// written by Dean Edwards, 2005
// with input from Tino Zijdel, Matthias Miller, Diego Perini
// http://dean.edwards.name/weblog/2005/10/add-event/
function dean_addEvent(element, type, handler) {
if (element.addEventListener) {
element.addEventListener(type, handler, false);
} else {
// assign each event handler a unique ID
if (!handler.$$guid) handler.$$guid = dean_addEvent.guid++;
// create a hash table of event types for the element
if (!element.events) element.events = {};
// create a hash table of event handlers for each element/event pair
var handlers = element.events[type];
if (!handlers) {
handlers = element.events[type] = {};
// store the existing event handler (if there is one)
if (element["on" + type]) {
handlers[0] = element["on" + type];
}
}
// store the event handler in the hash table
handlers[handler.$$guid] = handler;
// assign a global event handler to do all the work
element["on" + type] = handleEvent;
}
};
// a counter used to create unique IDs
dean_addEvent.guid = 1;
function removeEvent(element, type, handler) {
if (element.removeEventListener) {
element.removeEventListener(type, handler, false);
} else {
// delete the event handler from the hash table
if (element.events && element.events[type]) {
delete element.events[type][handler.$$guid];
}
}
};
function handleEvent(event) {
var returnValue = true;
// grab the event object (IE uses a global event object)
event = event || fixEvent(((this.ownerDocument || this.document || this).parentWindow || window).event);
// get a reference to the hash table of event handlers
var handlers = this.events[event.type];
// execute each event handler
for (var i in handlers) {
this.$$handleEvent = handlers[i];
if (this.$$handleEvent(event) === false) {
returnValue = false;
}
}
return returnValue;
};
function fixEvent(event) {
// add W3C standard event methods
event.preventDefault = fixEvent.preventDefault;
event.stopPropagation = fixEvent.stopPropagation;
return event;
};
fixEvent.preventDefault = function() {
this.returnValue = false;
};
fixEvent.stopPropagation = function() {
this.cancelBubble = true;
}
// Dean's forEach: http://dean.edwards.name/base/forEach.js
/*
forEach, version 1.0
Copyright 2006, Dean Edwards
License: http://www.opensource.org/licenses/mit-license.php
*/
// array-like enumeration
if (!Array.forEach) { // mozilla already supports this
Array.forEach = function(array, block, context) {
for (var i = 0; i < array.length; i++) {
block.call(context, array[i], i, array);
}
};
}
// generic enumeration
Function.prototype.forEach = function(object, block, context) {
for (var key in object) {
if (typeof this.prototype[key] == "undefined") {
block.call(context, object[key], key, object);
}
}
};
// character enumeration
String.forEach = function(string, block, context) {
Array.forEach(string.split(""), function(chr, index) {
block.call(context, chr, index, string);
});
};
// globally resolve forEach enumeration
var forEach = function(object, block, context) {
if (object) {
var resolve = Object; // default
if (object instanceof Function) {
// functions have a "length" property
resolve = Function;
} else if (object.forEach instanceof Function) {
// the object implements a custom forEach method so use that
object.forEach(block, context);
return;
} else if (typeof object == "string") {
// the object is a string
resolve = String;
} else if (typeof object.length == "number") {
// the object is array-like
resolve = Array;
}
resolve.forEach(object, block, context);
}
};