mrandrewmills

function bionicizeText(str) {
    let phrase = str.split(" ");
    let results = [];

    results.push(phrase.map(word => bionicizeWord(word)));

    return results.join(" ");

    function bionicizeWord(w) {
        let strong = document.createElement('strong');

mrandrewmills

function isPrime(thisNum){
    if ( thisNum <= 1 ) 
        return false;

    for ( x = 2; x <= Math.sqrt(thisNum); x++ ){
        if ( thisNum % x == 0 )
            return false;
    }

    return true;

mrandrewmills

function propComparator(sortBy){
	
	return function(a,b){
	
        let fieldsToSortBy = sortBy.split(",");

        for ( x = 0; x < fieldsToSortBy.length; x++ ) {
		
		let results = 0;
		

mrandrewmills

// inspired by Academind's "JavaScript Algorithms Crash Course" 
// see https://www.youtube.com/watch?v=JgWm6sQwS_I for more like this

// Imagine you have a list of items, and each item has a value and a weight associated with it.
items = [
	{ id: "b", val: 6, w: 8 },
	{ id: "a", val: 10, w: 3 },
	{ id: "c", val: 3, w: 3 },
];

mrandrewmills

function titleToggle( currTitle, tmpTitle, msInterval){
    var currTitle = currTitle;
    var tmpTitle = tmpTitle;
    var msInterval = msInterval;
    
    var timerID = -1;

    this.stop = function() {
        if ( timerID != -1) { 
            clearInterval(timerID); 

mrandrewmills

// gets a random number between min and max, inclusive. Source: Mozilla Developer Network
function getRandomIntInclusive(min, max) {
	min = Math.ceil(min);
	max = Math.floor(max);
	return Math.floor(Math.random() * (max - min + 1) + min);
}

// find lucky number, going from 1 to 100, in sequence
function runLowToHighTrial(){
	

mrandrewmills

<!--- change datasource as needed --->
<cfset thisDatasource = "example">

<!--- retrieve and display all table names in order --->
<cfquery name="getAllTableNames" datasource="#thisDatasource#">
  SELECT * FROM INFORMATION_SCHEMA.TABLES WHERE TABLE_TYPE='BASE TABLE'
    ORDER BY Table_Name
</cfquery>
<cfdump var="#getAllTableNames#" label="getAllTableNames" expand="false">

mrandrewmills

javascript: (function () { /* finds current URL in Wayback Machine */ document.location = "https://web.archive.org/web/*/" + document.location; }());

mrandrewmills

var ssnRegExp = new RegExp(/^(?!000|666)[0-8][0-9]{2}-(?!00)[0-9]{2}-(?!0000)[0-9]{4}$/);

// see p. 290 Regular Expressions Cookbook, 2nd Ed., Goyvaerts & Levithan ISBN: 978-1-449-31943-4 for in-depth details

ssnRegExp.test("000-11-1111");
// returns false
ssnRegExp.test("111-11-1111");
// returns true
ssnRegExp.test("666-11-1111");
// returns false

mrandrewmills

function arrangeArrayStructs(arrayToArrange, arrOrder, whichKey){
	var results = [];
	
	arrOrder.forEach( function(item){
		results.push( arrayToArrange.filter( record => record[whichKey] == item ) );
	});

	return results;	
}