My material comes from a wide variety of sources. Anywhere from George Carlin, Albert Einstein, to Dan Simmons, or Stephen R. Donaldson.

Philosophy - What It Is

An address Ayn Rand gave to the graduating class of the United States Military Academy at West Point on March 6, 1974.

Vinod Khosla believes that the road to energy independence starts in a cornfield in Nebraska. Wired has the article here.

Last Updated 2009-08-14

v3.0

• Del.icio.us backend
• Counts clicks on links, orders links by click
• New UI. Looks more like idt

v2.3

• newLink() now takes category, name, and URL instead of just category and link

v2.2

• Fixed position error with [more...] menu

v2.1

• Now every link is added through the newLink() function

v2.0

• Created newLink() function which can take category and link
• Create displayLinks() function which will display all links added via newLink()
• You can set a max initial display for number of links per category
• It can dynamicaly handle additional links

v1.1

• The additional links displayed from [more] are now handled through an array list

v1.0

• Added javascript to handle too many links to be displayed, popup from [more...] displays additional the links

v0.3

• UI now looks like XP window

v0.2

• Links in categories, in a line

v0.1

• Created very simple massive link display page by category

I've updated the wiki code a bit tonight. I've added wiki link markup for regular and links to articles in the system.

Also sparce v3.0 has been moved into RC1 along with a UI change. It now counts how many times you have clicked on a link and orders the links by how many clicks they have received.

Code examples of manipulating an array of pointers. #include <stdio.h> #include <stdlib.h> #include <string.h> #define MAXLIST 10 struct ipList { int id; char *name; char *ip; }; struct ipList **getList( void ); void printList( struct ipList **list ); int main( void ) { struct ipList **theList; theList = getList( ); printList( theList ); return 0; } struct ipList **getList( void ) { struct ipList **list; int i; list = malloc( MAXLIST * sizeof( struct ipList * ) ); i = 0; while ( i < MAXLIST ) { list[ i ] = malloc( sizeof( struct ipList ) ); list[ i ]->id = i; list[ i ]->name = "citibank.co.cx"; list[ i ]->ip = "209.249.147.15"; i++; } return ( list ); } void printList( struct ipList **list ) { int i = 0; while ( i < MAXLIST ) { printf( "%s - %s", ( list[ i ]->name ), ( list[ i ]->ip ) ); i++; } }

we can change the function getList slightly:

struct ipList **getList( void ) { static struct ipList *list[ MAXLIST ]; int i; //list = malloc( MAXLIST * sizeof( struct ipList * ) ); i = 0; while ( i < MAXLIST ) { list[ i ] = malloc( sizeof( struct ipList ) ); list[ i ]->id = i; list[ i ]->name = "citibank.co.cx"; list[ i ]->ip = "209.249.147.15"; i++; } return ( list ); }

or we could have the main array created in main like this:

#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAXLIST 10 struct ipList { int id; char name[ 35 ]; char ip[ 15 ]; }; void getList( struct ipList *list[ ] ); struct ipList *makeIP( void ); void printList( struct ipList *list[ ] ); int main( void ) { struct ipList *theList[ MAXLIST ]; getList( theList ); printList( theList ); return 0; } void getList( struct ipList *list[ ] ) { int i = 0; while ( i < MAXLIST ) { list[ i ] = makeIP( ); list[ i ]->id = i; strcpy( ( list[ i ]->name ), "citibank.co.cx" ); strcpy( ( list[ i ]->ip ), "209.249.147.15" ); i++; } } struct ipList *makeIP( void ) { struct ipList *temp; temp = malloc( sizeof( struct ipList ) ); return ( temp ); } void printList( struct ipList *list[ ] ) { int i = 0; while ( i < MAXLIST ) { printf( "%s - %s", ( list[ i ]->name ), ( list[ i ]->ip ) ); i++; } }

Here's a cool report from Gina Trapani over at lifehacker about Yahoo! Open Hack Day '06. It's pretty interesting. You could say Yahoo! Open Hack Day is like Google Code Jam.

Sparce links has been updated to the lasted version. It now uses del.icio.us to populate its links, which pretty much now makes it a UI for del.icio.us. All that's left to do is keeping persistant information about link to count clicks so the links can be ordered by most used.