Steps for complicated pre-loading:

1. The actual movie starts on the 3rd frame. The 1st frame is for the preloader. The 2nd frame is for loading the codes and stuff

2. To set the 2nd frame as the part to load the bulks, set Publish Settings>Flash>Settings>Export Frame for Classes, set it to 2.

3. Set the linkage of library symbols to not load on first frame.

4. Create a preloader graphics and put it into the first frame.

5. Add actionscript in to the main timeline.

this.onEnterFrame = function()
{
var amount:Number = this.getBytesLoaded()/this.getBytesTotal() * 100;
preloader._xscale = amount;

if(amount == 100)
{
preloader._alpha-=5;
if(preloader._alpha < 0)
{
this.gotoAndPlay(3);
delete this.onEnterFrame;
}
}
}

Turns out that thing that pops up when you right click a movie is called a ContextMenu. So an easy way to disable it is to hide them by using hideBuiltInItems();

An item in the ContextMenu is called a ContextMenuItem.

The 1^st parameter is the label of that item. The 2^nd is what function it calls if the item was clicked.

function deadClick () {

}

We just create an empty function for it. If we want to make the menu item more useful make it call a function that does something cool.

function gotoMySite () {

getURL(“http://codeanginamo.blogspot.com/&#8221;, “_top”);

}

You can add items into a menu by pushing it into the customItems stack of the ContextMenu.

Then we attach it into the main timeline:

_root.menu = myMenu;

/*#include headers here */

struct list_el {
int val;
struct list_el * next;
};

typedef struct list_el Item;

Item *list, *tail; //references to the linked list

int main() {

int i;
Item *curr;
int array[] = {1, 24,3,412,125,6,74,228,9, 10};

/*initialize the list*/
list = (struct Item*)malloc(sizeof(Item));
list->next=NULL; // this is important to
list->val = 0; // avoid wierd looking variables occupying our list

tail = list;

/*populate the list*/
for(i = 0; i
{
addToList(array[i]);
}

curr = list;
while(curr->next != NULL)
{
printf(“%d -> “, curr->val);
curr = curr->next;
}
printf(“%dn”, tail->val); //the tail isn’t really printed coz a tail triggers the loop to end
}

addToList(int value)
{
Item *curr;

if(tail == list && tail->val == NULL) //if the list is empty
{
tail->val = value; //create the head, since it’s the only element
tail->next = NULL; //it is also the tail
}
else
{
if(curr = (struct Item*)malloc(sizeof(Item)))
{
curr->val = value; //create a new node
curr->next = NULL; //new node becomes the tail — essentially, coz it doesn’t have anything after it
tail->next = curr; //the old tail links with the new node, so essentially it’s no longer a tail
tail = curr; //the new node is now formally a tail
}
else
{
printf(“nOut of memory errorn”);
system(‘pause’);
}
}
}