Help:Transclusion/How Transclusion Works: Difference between revisions

Revision as of 14:55, 1 May 2007

Revision as of 08:13, 11 July 2007

Line 1:

// BST (Binary Search Tree)

== How transclusion works ==

// Total Program Lines - 235

<div style="{{divstylenone}} float:left; width:258px;">

[[Image:Transclusion-simple.png|left]]

</div>

#include <iostream.h>

<div class="boilerplate metadata" id="Template syntax" style="{{divstylegreen}} float: right; width: 35%; "><center><b>Template syntax</b></center>

#include <stdlib.h>

#include <conio.h>

struct tree {

If the source is in the Main article namespace (e.g., "[[Cat]]"), you must put a colon (:) in front of the name, thus: <code><nowiki>{{:Cat}}</nowiki></code>

int num;

If the source is in the Template namespace (e.g., "[[Template:Villagepumppages]]"), just use the name itself, alone, thus: <code><nowiki>{{Villagepumppages}}</nowiki></code>

tree* left;

tree* right;

}nn;

If the source is in any other namespace (e.g., "[[User:Oog]]"), you must use the full name, including the namespace, thus: <code><nowiki>{{User:Oog}}</nowiki></code>

</div>

tree* head = NULL;

To '''transclude''' any '''source''' page (within a single MediaWiki project, such as en:Wikipedia) within another '''target''' page, include the following code:

tree* root;

void main() {

<code><nowiki>{{SOMEPAGE}}</nowiki></code>

int n=0;

Whenever the target page '''A''' with this code is rendered, the engine will include ''in that place'' not the code itself, but the entire content of the source page '''B''', SOMEPAGE.

void create();

{{clear}}

void print();

do {

<div style="{{divstylenone}} float:left; width:544px;">

[[Image:Transclusion-multiple-foo.png|left]]

[[Image:Transclusion-multiple-twit.png|left]]

</div>

clrscr();

{{clear}}

cout<<"\t\t\t\t::::CHOICES::::\n\n";

This would be a pretty neat trick if it only meant that you didn't have to copy-and-paste from one page to another. For example, you might decide to copy a welcome message to every newcomer's Talk page; you could do this with transclusion (though it might not be the best thing to do!).

cout<<"\t 1 - Create\n\n";

But transclusion creates a "live" link between the "template" page and the target page where it appears. When the template is edited, all the other pages change, too.

cout<<"\t 2 - Print\n\n";

cout<<"\t 3 - Exit\n\n";

cout<<"\nYOUR CHOICE IS:\t";

For example, you ''might'' decide to create a (template) page with your mailing address and include that template on not only your page, but all your friends' pages, too. When you move your [[television]] and couch to another apartment, you will ''change'' your address template, and automatically, that ''new information'' will appear on all your friends' pages.

cin>>n;

cout<<"\n\n";

{{clear}}

switch(n) {

case 1: {

cout<<"\t\tCreate ::\n";

create();

cout<<"\n";

getch();

break;

}

case 2: {

cout<<"\t\tPrint ::\n";

print();

cout<<"\n";

getch();

break;

}

default: {

break;

}

}

}

while(n < 3);

}

void create() {

void insertNode(tree*,tree*);

char choice;

if (root == NULL) {

do {

tree* nn;

nn = new tree;

cout<<"\n\nEnter Element :: ";

cin>>nn->num;

if(root == NULL) {

root = nn;

nn->left = NULL;

nn->right = NULL;

}

insertNode(root,nn);

cout<<"\n\tDo You want to enter more Elements y/n :: ";

cin>>choice;

}

while(choice == 'y' || choice == 'Y');

}

else {

cout<<"\n\n\tTree is already created";

}

}

void insertNode(tree* head,tree* nn) {

if(head->num > nn->num) {

if(head->left == NULL) {

head->left = nn;

nn->left = NULL;

nn->right = NULL;

}

else {

insertNode(head->left,nn);

}

}

else if(head->num <= nn->num) {

if(head->right == NULL) {

head->right = nn;

nn->left = NULL;

nn->right = NULL;

}

else {

insertNode(head->right,nn);

}

}

}

void print() {

void printSubTree(tree*,int);

head = root;

int order;

if (head == NULL) {

cout<<"\n\n\tTree is Empty";

}

else {

cout<<"\n\nPre-Order Traversal - 1";

cout<<"\n\nPost-Order Traversal - 2";

cout<<"\n\nIn-Order Traversal - 3";

cout<<"\n\nPrint Tree Structure - 4";

cout<<"\n\nYour Choice :: ";

cin>>order;

printSubTree(head,order);

}

}

void printSubTree(tree* head,int order) {

if(order == 1) {

cout<<" "<<head->num;

if(head->left != NULL) {

printSubTree(head->left,order);

}

if(head->right != NULL) {

printSubTree(head->right,order);

}

}

else if(order == 2) {

if(head->left != NULL) {

printSubTree(head->left,order);

}

if(head->right != NULL) {

printSubTree(head->right,order);

}

cout<<" "<<head->num;

}

else if(order == 3) {

if(head->left != NULL) {

printSubTree(head->left,order);

}

cout<<" "<<head->num;

if(head->right != NULL) {

printSubTree(head->right,order);

}

}

}