This file contains hidden or 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
| (Aqua/E)macs deficiencies: | |
| - working across files (projects) | |
| - searching for strings in project | |
| - opening other files in project | |
| - viewing files, opened or not | |
| - tabs | |
| - cannot be reordered | |
| - cannot be torn off or reparented | |
| - vast over-use of control key | |
| - poor file browsing |
This file contains hidden or 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
| #!/usr/bin/env python2.6 | |
| ## MacPorts needless dependency cleaning. Edit 'keep' first!!! | |
| # | |
| ## requires python >= 2.6! | |
| # | |
| ## Vincent Fiano <ynniv@ynniv.com> | |
| # FIXME: the packages that you care about go here! | |
| keep = ['libidl', 'graphviz', 'bash-completion'] |
This file contains hidden or 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
| /* in MyListItemView.js */ | |
| MyListItemView = SC.ListItemView.design({ | |
| }); | |
| /* */ | |
| kasesView: SC.ScrollView.design({ | |
| hasHorizontalScroller: NO, | |
| classNames: "kasesView", | |
| layout: { top: 60, bottom: 0, left: 0, right: 0 }, | |
This file contains hidden or 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 intersection(a, b) { | |
| var shorter = a, longer = b, hash = {}; | |
| if (a.length > b.length) { shorter = b; longer = a; } | |
| for (var i in shorter) { var o = shorter[i]; hash[o] = 1; } | |
| var collisions = []; | |
| for (var i in longer) { | |
| var o = longer[i]; | |
| if (hash[o] == 1) collisions.push(o); | |
| } | |
| return collisions; |
NewerOlder