if (window.console && window.console.firebug) {
//Firebug is enabled
}
var words = ["andreas", "john", "grech", "janica", "buhagiar"]; var numbers = [5, 2, 8, 666, 42, 13]; console.log(words.sort()); console.log(numbers.sort());
["andreas", "buhagiar", "grech", "janica", "john"] [13, 2, 42, 5, 666, 8]
var numbers = [5, 2, 8, 666, 42, 13];
var ascNumSort = function (a, b) {
return a - b;
};
var ns = numbers.sort(ascNumSort);
console.log(ns);
var people = [
{name: "Andreas", height: 5.4},
{name: "Janica", height: 4.3},
{name: "Cameron", height: 5.8},
{name: "Richard", height: 5.4},
{name: "Ryan", height: 4.5}
];
var sortedPeople = people.sort(function (p1, p2) {
return p2.height - p1.height;
});
console.log(sortedPeople);
/*Result:
[
Object name=Cameron height=5.8,
Object name=Andreas height=5.4,
Object name=Richard height=5.4,
Object name=Ryan height=4.5,
Object name=Janica height=4.3
]
*/
//Function by takes a member name string and an
//optional minor comparison function and returns
//a comparison function that can be used to sort an
//array of objects that contain that member. The
//minor comparison function is used to break ties
//when the o[name] and p[name] are equal
var by = function (name, minor) {
return function (o, p) {
var a, b;
if (typeof o === 'object' && typeof p === 'object' && o && p) {
a = o[name];
b = p[name];
if (a === b) {
return typeof minor === 'function' ? minor(o, p) : o;
}
if (typeof a === typeof b) {
return a < b ? -1 : 1;
}
return typeof a < typeof b ? -1 : 1;
} else {
throw {
name: 'Error',
message: 'Expected an object when sorting by ' + name
};
}
}
};
var people = [
{name: "Andreas", height: 5.4},
{name: "Janica", height: 4.3},
{name: "Tony", height: 5.8},
{name: "Richard", height: 5.4},
{name: "Ryan", height: 4.5},
{name: "Cameron", height: 5.8}
];
console.log(people.sort(by('height')));
/*Result:
[
Object name=Janica height=4.3, Object name=Ryan height=4.5,
Object name=Andreas height=5.4, Object name=Richard height=5.4,
Object name=Tony height=5.8, Object name=Cameron height=5.8
]
*/
console.log(people.sort(by('height', by('name'))));
/*Result:
[
Object name=Janica height=4.3, Object name=Ryan height=4.5,
Object name=Andreas height=5.4, Object name=Richard height=5.4,
Object name=Cameron height=5.8, Object name=Tony height=5.8
]
*/
int main () {
float fl = 7.2;
int n = (int) fl; // (int) makes an explicit cast
//n is now 7
}
int main () {
float fl = 7.2;
int n = fl; //now the C compiler is internally coercing the operator to an integer
//n is now 7
}
//Using the equality operator (==) true == 1; //true, because the boolean value true is converted to 1 and then compared "2" == 2 //true, because 2 is converted to "2" and then compared //Using the identity operator (===) true === 1 //false "2" === 2 // false
'' == '0' //false 0 == '' //true 0 == '0' //true false == 'false' //true false == '0' //true false == undefined //false false == null //false null == undefined //true ' \t\r\n ' == 0 //true
var x = new String('hello');
var y = 'hello';
console.log(x === y); //shows false
console.log(x == y); //shows true
console.log(typeof x); // 'object' console.log(typeof y); // 'string'
<b:section class="sidebar" id="sidebar" preferred="yes">
<b:widget id='Label99' locked='false' title='Labels' type='Label'>
<b:includable id='main'>
<b:if cond='data:title'>
<h2><data:title/></h2>
</b:if>
<div class='widget-content'>
<script src='http://halotemplates.s3.amazonaws.com/wp-cumulus-example/swfobject.js' type='text/javascript'/>
<div id='flashcontent'>Blogumulus by <a href='http://www.roytanck.com/'>Roy Tanck</a> and <a href='http://www.bloggerbuster.com'>Amanda Fazani</a></div>
<script type='text/javascript'>
var so = new SWFObject("http://halotemplates.s3.amazonaws.com/wp-cumulus-example/tagcloud.swf", "tagcloud", "240", "300", "7", "#ffffff");
// uncomment next line to enable transparency
//so.addParam("wmode", "transparent");
so.addVariable("tcolor", "0x333333");
so.addVariable("mode", "tags");
so.addVariable("distr", "true");
so.addVariable("tspeed", "100");
so.addVariable("tagcloud", "<tags><b:loop values='data:labels' var='label'><a expr:href='data:label.url' style='12'><data:label.name/></a></b:loop></tags>");
so.addParam("allowScriptAccess", "always");
so.write("flashcontent");
</script>
<b:include name='quickedit'/>
</div>
</b:includable>
</b:widget>
var so = new SWFObject("http://halotemplates.s3.amazonaws.com/wp-cumulus-example/tagcloud.swf", "tagcloud", "240", "300", "7", "#ffffff");
so.addVariable("tcolor", "0x333333");
var blogmusic = function () {
var lastContainerDone = 0;
return function (music) {
var musiccount = music.length,
blogmusic = $(".blogmusic").eq(lastContainerDone++),
header = $("<div/>").addClass("header");
header.append("<center>What I was listening to</center>");
var musiclist = $("<div/>").addClass("musiclist");
for (var i = 0; i & lt; musiccount; i += 1) {
var song = music[i];
var listing = $("<div/>").addClass("listing");
var songname = $("<span/>").addClass("songname").html('<a href="' + (song.link || '#') + '" target="_blank">"' + song.name + '"</a>');
var artist = $("<span/>").addClass("artist").html('- ' + song.artist);
listing.append(songname);
listing.append(artist);
musiclist.append(listing);
}
blogmusic.html(header);
blogmusic.append(musiclist);
};
} ();
<div class="blogmusic">
<script>
blogmusic([
{
artist : 'Jerry Lee Lewis',
name : 'Whole Lotta Shakin\'',
link : 'http://listen.grooveshark.com/#/song/Whole_Lotta_Shakin/6325468'
}
]);
</script>
</div>
var arr = ['a','b','c','d','e']; delete arr[2]; //arr is now ['a', 'b', undefined, 'd', 'e']
var arr = ['a','b','c','d','e']; arr.splice(2, 1); //arr is now ['a', 'b', 'd', 'e']
var f = function () { };
var pf = f; // passing a direct reference to the function f
pf(); //invoking the function f
var f = function (arg1, arg2) { };
var pf = f(4, 5); // you can't do that, because that invoke f and put
// it's result into pf, instead of a reference to f
pf();
var f = function (pars) { };
var pf = function (pars) {
f(pars);
};
pf(200);
var partial = function (func /*, 0..n args */) {
var args = Array.prototype.slice.call(arguments, 1);
return function () {
var allArguments = args.concat(Array.prototype.slice.call(arguments));
return func.apply(this, allArguments);
};
};
var f = function (pars) { };
var pf = partial(f, 200);
pf(/* you can add more arguments */); //invokes f with the previously
//added arguments (in this case, 200);
partial(f, 200);
var f = function () {
alert('Function 1');
};
var pf = f;
f = function () {
alert('Function 2');
};
pf();
But everyone should keep in mind that extending the Object prototype in JavaScript is a big NO-NO
var square = function () { };
var box = new square();
box.height = 55; //Adding a custom property to the box instance
var anotherBox = new square(); alert(anotherBox.height) ; //alerts 'undefined' (not 0)
var square = function () { };
square.prototype.height = 0;
//Now, every instance of square will have a height object
var box = new square();
box.height = 55;
var anotherBox = new square();
alert(anotherBox.height) //alerts 0
Object.prototype.myCustomProperty = 200;
var square = function () { };
alert(square.myCustomProperty); // 200 is alerted
Object.prototype.myCustomProperty = 200;
var box = { width: 200, height: 500 };
var props = "";
for (var p in box) {
props += p + "\n";
}
alert(props);
Object.prototype.myCustomProperty = 200;
var box = { width: 200, height: 500 };
var props = "";
for (var p in box) {
if (box.hasOwnProperty(p)) {
props += p + "\n";
}
}
alert(props);
Keypad Pin | Arduino Pin |
|---|---|
1 | 7 |
2 | 5 |
3 | 8 |
4 | 2 |
5 | 6 |
6 | 3 |
7 | 4 |
#include <Keypad.h>
const byte ROWS = 4; //four rows
const byte COLS = 3; //three columns
char keys[ROWS][COLS] = {
{
'1','2','3' }
,
{
'4','5','6' }
,
{
'7','8','9' }
,
{
'*','0','#' }
};
//The below numbers correspond to the Arduino Pins
byte rowPins[ROWS] = {5, 4, 3, 2}; //connect to the row pinouts of the keypad
byte colPins[COLS] = {8, 7, 6}; //connect to the column pinouts of the keypad
Keypad keypad = Keypad( makeKeymap(keys), rowPins, colPins, ROWS, COLS );
char key = keypad.getKey();
<script src="konami.js"></script>
konamiCode(function () {
alert('You entered the code!');
}).start();
var konami = konamiCode(function () {
alert('You entered the code!');
}).start();
//...
konami.stop(); // <== stop listening
konamiCode([38, 40, 37, 39, 52, 53], function () {
alert('You entered the code!');
}).start();
/*
* Konami Code in Javascript
* Andreas Grech
* http://blog.dreasgrech.com
* v 1.1 (20091119)
Keycodes for the Konami Code
UP : 38
DOWN : 40
LEFT : 37
RIGHT : 39
B : 66
A : 65
*/
var konamiCode = function(combination, callback) {
var lastCorrectInput = - 1,
isActive = 0,
o = {};
if (typeof combination === "function") {
callback = combination;
}
if (Object.prototype.toString.call(combination) !== "[object Array]") {
combination = [38, 38, 40, 40, 37, 39, 37, 39, 66, 65];
}
o.start = function() {
if (isActive) {
return;
}
isActive = 1;
document.onkeyup = function(e) {
var code;
if (!isActive) {
return;
}
code = window.event ? window.event.keyCode: e.which;
if (combination[++lastCorrectInput] === code) {
if (lastCorrectInput === combination.length - 1) {
if (callback && typeof(callback) === "function") {
callback();
}
}
return;
}
lastCorrectInput = - 1;
};
return o;
};
o.stop = function() {
isActive = 0;
return o;
};
return o;
};
var is_array = function (value) {
return value &&
typeof value === 'object' &&
typeof value.length === 'number' &&
typeof value.splice === 'function' &&
!(value.propertyIsEnumerable('length'));
};
var is_array = function (value) {
return Object.prototype.toString.call(value) === '[object Array]';
};
// native prototype overloaded, some js libraries extends them
Object.prototype.toString= function(){
return '[object Array]';
}
function isArray ( obj ) {
return Object.prototype.toString.call(obj) === '[object Array]';
}
var a = {};
alert(isArray(a)); // returns true, expecting false;
int f(int *arr, int n) {
int i;
arr = malloc( n * sizeof (*arr));
for (i = 0; i < n; ++i, ++arr) {
*arr = i;
}
arr -= i;
printf("Second element (from function) : %d\n", *(arr + 1));
return 0;
}
int main()
{
int *arr;
f(arr, 5);
printf("Second element (from caller) : %d", *(arr + 1));
free(arr);
return 0;
}
Second element (from function) : 1 Second element (from caller) : 1032044593
int f(int **arr, int n) { //arr is now a pointer to a pointer to int
int i;
int *temp = malloc(n * sizeof **arr); //declare and malloc temporary space
for (i = 0; i < n; ++i, ++temp) {
*temp = i;
}
temp -= i;
*arr = temp; //Assign the value of the inputted location to the temporary one created earlier on
printf("Second element (from function) : %d\n", *(temp + 1));
return 0;
}
int main()
{
int *arr;
f(&arr, 5); //The address of the pointer is now passed, not the pointer itself
printf("Second element (from caller) : %d", *(arr + 1));
free(arr);
return;
}
Second element (from function) : 1 Second element (from caller) : 1
int main()
{
int nums[] = {1,2,3,4,5};
printf("Outside: %d\n",sizeof(nums) / sizeof(*nums));
f(nums);
return 0;
}
int f(int nums[]) {
printf("Inside: %d\n",sizeof(nums) / sizeof(*nums));
}
Outside: 5 Inside: 1As you can see from the above output, when the calculation is done in the scope where the array was initialized, the correct output is displayed; but when it is passed to a function, the calculation fails!
/*
* ShowSlow v1.1 - jQuery plugin
*
* Copyright (c) 2009-2010 Andreas Grech
*
* Dual licensed under the MIT and GPL licenses:
* http://www.opensource.org/licenses/mit-license.php
* http://www.gnu.org/licenses/gpl.html
*
* http://blog.dreasgrech.com
*/
(function($) {
$.fn.showSlow = function(options) {
var opts = $.extend({}, $.fn.showSlow.defaults, options),
elementCounter = 0,
$elements = this,
isStopped = 0,
isPaused = 0,
callbackExecuted = 0,
executeCallback = function(val) {
if (typeof opts.callback == "function") {
callbackExecuted = 1;
opts.callback(getValues());
}
},
getValues = function() {
return {
elementsDone: elementCounter
};
},
showNextDiv = function($element) {
if (isPaused || isStopped) {
return;
}
if (!$element.length) {
executeCallback();
return;
}
$element.slideDown(opts.slideTime, function() {
setTimeout(function() {
showNextDiv($elements.eq(elementCounter++));
},
opts.displayTime);
});
};
return {
start: function() {
if (isStopped || elementCounter < $elements.length) {
$elements.css("display", "none");
elementCounter = 0;
} else if (isPaused) {
elementCounter -= 1;
}
isStopped = 0;
isPaused = 0;
callbackExecuted = 0;
showNextDiv($elements.eq(elementCounter++));
},
stop: function() {
isStopped = 1;
if (!callbackExecuted) {
executeCallback();
}
return elementCounter; //return the number of elements displayed before stopped
},
pause: function() {
isPaused = 1;
}
};
};
$.fn.showSlow.defaults = {
slideTime: 1000,
displayTime: 500
};
})(jQuery);
y(ank) - copy d(elete) - delete c(hange) - change p(aste) - put from buffer after cursor o(pen) - start a new line i(nsert) - insert before current character a(fter) - insert after current character w(ord) - moves to beginning of next word b(ack) - moves to beginning of current word or prior word e(end) - moves to end of current word or next word f(ind) - moves to a character on the current line movement keys you just need to learn: h,j,k,l ^ - beginning of text on a line $ - end of text on a line 0 - first position on line most commands can be prefaced with numeric modifiers. 2w - means move 2 words 5h - means move 5 charcters to the left 3k - means move 3 lines up 3fs - means move to the 3rd letter s folling the cursor modification commands (d,c,y) need to know how much to work on. dd - delete a line into memory yy - yank a line into memory cc - change the whole line c$ - change from current position to the end c2w - change the text spanning the next 2 words 3dd - delete 3 lines d2f. - delete to the second period. . - means redo the last modification command. / - searches for text, and then n(ext) will go the next found occurance. N will go prior. ? - searches backwards through the document.
mygcd :: Int -> Int -> Int mygcd n m | m == 0 = n | otherwise = mygcd m (mod n m) mylcm :: Int -> Int -> Int mylcm n m = div (n * m) (mygcd n m)
#include <stdio.h>
int gcd(int x, int y);
int lcm(int x, int y);
int main()
{
int x = 156;
int y = 156;
int g = gcd(x,y);
int l = lcm(x,y);
printf("GCD (%d, %d) : %d\n", x,y,g);
printf("LCM (%d, %d) : %d\n", x,y,l);
}
int gcd(int x, int y) {
/*;
a = qb + r, 0 <= r < b
a => dividend, q => quotient, b => divisor, r => remainder
*/
if (x == y) {
return x /*or y*/;
}
int dividend = x, divisor = y, remainder = 0, quotient = 0;
do {
remainder = dividend % divisor;
quotient = dividend / divisor;
if(remainder) {
dividend = divisor;
divisor = remainder;
}
}
while(remainder);
return divisor;
}
int lcm(int x, int y) {
/*
lcm(x,y) = (x * y) / gcd(x,y)
*/
return x == y ? x /*or y*/ : (x * y) / gcd(x,y);
}
--Given a tuple with a fibonacci pair, this function returns another tuple with --the next two numbers in the sequence fibStep :: (Int, Int) -> (Int, Int) fibStep (u,v) = (v, u + v)
--The Definition for the Fibonacci pair fibPair :: Int -> (Int, Int) fibPair n | n == 0 = (0,1) | otherwise = fibStep (fibPair (n - 1))
--Pass the output of the fibPair function to Haskell's fst function, --which returns the first item in the given tuple fastFib :: Int -> Int fastFib = fst . fibPair
msizap.exe G!
Reference: http://www.theexperienceblog.com/2009/05/16/how-to-clean-out-windowsinstaller-folder-correctly/
