This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function shouldDecrement(current, target, length) { | |
var directDist, decrementDist; | |
directDist = target - current; | |
decrementDist = length - target + current; | |
if (Math.abs(directDist) < decrementDist) | |
if (directDist > 0) | |
return false; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
~/Development/ObjFW/objfw% make TEST_LAUNCHER=gdb tests | |
Entering directory src. | |
Entering directory exceptions. | |
Leaving directory exceptions. | |
Leaving directory src. | |
Entering directory tests. | |
Entering directory plugin. | |
Leaving directory plugin. | |
GNU gdb 6.3.50-20050815 (Apple version gdb-1705) (Fri Jul 1 10:50:06 UTC 2011) | |
Copyright 2004 Free Software Foundation, Inc. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
~/Development/ObjFW/objfw% make | |
Entering directory src. | |
Entering directory exceptions. | |
Leaving directory exceptions. | |
Leaving directory src. | |
Entering directory utils. | |
Leaving directory utils. | |
Entering directory tests. | |
Entering directory plugin. | |
Leaving directory plugin. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function spreadsheetHeaderArray(length) { | |
var i, result = [], characters = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']; | |
for (i = 0; i < length; i += 1) { | |
result[i] = (i > 25) ? result[i - 26] + characters[i % 26] : characters[i % 26]; | |
} | |
return result; | |
} |
NewerOlder