Title:String Library (Data Structures)

/*
    FILE : STRING.H
    File contains declaration and definition of functions
        handling string manipulation
    Tools Used :
        Compiler - TCC.EXE ( Turbo )
    Compatibility:
        Compatible to all ANSI standard C++ compiler
    Programmed by : Prince M. Premnath
    Mail : princeatapi@yahoo.co.in
    Date : 12/06/2007
*/


#ifndef _STRING_H
#define _STRING_H


#ifndef _SIZE_T
#define _SIZE_T
    typedef unsigned size_t;
#endif

#ifndef NULL
#define NULL    0
#endif


int     strlen    ( const char * __str );
char*     strcpy    ( char* __dest , const char* __src );
int     strcmp    ( const char* __str1 , const char* __str2 );
char*     strupr    ( char* __str );
char*     strlwr    ( char* __str );
char*     strset    ( char* __str , int ch );
char*     strcat    ( char* __dest , const char* __src );
char*     strchr    ( const char* __str , int __ch );
char*     strdup    ( const char* __str);
char*     strrev    ( char* __str);
int     strncmp    ( const char* __str1 , const char* __str2 , int maxlen);
int     stricmp    ( char* __str1 , char* __str2);
int     indexof ( const char* __str, char __ch);
char*     replace ( char* __str , char __ch1 , char __toch2);
int     whereAt ( char* __str , char __ch);
char    charAt  ( char* __str , int __where);
void    setCharAt( char* __str, int __where , char __ch);


void setCharAt( char* str , int where , char ch)
{
    int i = 0 , l = 0;

    while(*(str + i)){ l++;i++;}
    if( where < l )
        *(str + where ) = ch;
    return -1;
}


int whereAt( char* str , char ch)
{
    int i = 0;
    while( *( str + i++ ) )
    {
        if( *(str + i ) == ch )
            return i;
    }
    return -1;
}

char charAt( char* str , int where)
{
    int i = 0 , l = 0;

    while(*(str + i)){ l++;i++;}
    if( where < l )
        return *(str + where);
    return NULL;
}


char* replace( char* str , char ch1 , char toch2)
{
    char* ptr = str;
    int i = 0;

    while( *(str + i ) )
    {
       if( *( str + i ) == ch1 )
        *( str + i ) = toch2;
       i++;
    }
    return ptr;
}

int indexof( const char* str , char ch)
{
    int i = 0 , index = 0;
    while( *( str + i ) )
    {
        if(*( str + i) == ch)
            return index;
        index++ ; i++;
    }
}

int stricmp( char* str1 ,  char* str2)
{
    return strcmp( strlwr(str1) , strlwr(str2) );
}

int strncmp( const char* str1 , const char* str2 , int maxlen)
{
    int i = 0;
    maxlen += 1;
    while( *( str1 + i ) && --maxlen )
    {
        if( *( str1 + i ) != *( str2 + i ) )
            return *( str1 + i ) - *( str2 + i);
        ++i;
    }
    if( *( str2 + i ) && maxlen )

        return 0 - *( str2 + i );
    else
        return 0;

}

char* strrev( char* str )
{
    char* temp;
    int len = 0 , i = 0;

    while( *( str + i++ ) ) len++;
    i = 0;
    while( *( temp + i++) = *( str + --len) );
    return temp;
}

char* strdup( const char* str)
{
    int len = 0 , i = 0;
    char* buffer;

    while( *( str + i++ ) ) len++;
    buffer = new char[len];

    if(!buffer )
        return NULL;
    i = 0;
    while( *( buffer + i ) = *( str + i ) ) ++i;
    return buffer;
}



char* strchr( const char* str , int ch)
{
    int i = 0;

    while( *(str + i++ ) )
    {
        if( *( str + i ) == ch )
            return (char*) ( str + i );
    }
    return NULL;
}

char* strcat( char* dest , const char* src)
{
    int i = 0 , j = 0;

    while( *(dest + ++i) );
    while( *(dest + i++ ) = *(src + j++) );
    return dest;
}


char* strset( char* str , int ch)
{
    int i = 0;

    while( *(str + i) )
    {
        *(str + i ) = ch;
        ++i;
    }
    return str;
}

char* strupr( char* str )
{
    int i = 0;

    while( *(str + i) )
    {
        if( *(str + i ) >= 97 && *( str + i ) <= 122)
            *(str + i ) = *(str + i ) - 32;
        ++i;

    }
    return str;
}


char* strlwr( char* str)
{
    int i = 0;

    while( *(str + i) )
    {
        if( *(str + i ) >= 65 && *( str + i ) <= 90)
            *(str + i ) = *(str + i ) + 32;
        ++i;
    }
    return str;
}


char* strcpy( char* dest , const char* source )
{
    while(*dest++ = *source++);
    return dest;
}

int strlen( const char* str)
{
    int len = 0;
    while(*str++)
        len++;
    return len;
}


int strcmp( const char* str1 , const char* str2)
{

    int i = 0;

    while( *(str1 + i ) )
    {
        if( *( str1 + i ) != *( str2 + i ))
            return *(str1 + i ) - *( str2 + i);
        ++i;
    }
    if( *(str2 + i ) )

        return 0 - *(str2 + i);
    else
        return 0;

}

#endif


Title:ASP Script to Insert into XML

<%@ LANGUAGE="VBSCRIPT" %>

<%
    response.ContentType = "text/xml"
   
    ' Create an ASP XML parser object
    set xml0 = Server.CreateObject("Chilkat.Xml")

    ' Returns the XML page as a Variant
    set xml = xml0.HttpGet("http://www.xml-parser.com/companies.xml")

    ' Insert a new company
    set companyNode = xml.NewChild("company", "")
    set nameNode = companyNode.NewChild("name", "Apple Computer, Inc.")

    ' Add an attribute to this node.
    nameNode.AddAttribute "Symbol", "AAPL"

    companyNode.NewChild2 "address", "1 Infinite Loop"
    companyNode.NewChild2 "city", "Cupertino"
    companyNode.NewChild2 "state", "CA"
    companyNode.NewChild2 "zip", "95014"
    companyNode.NewChild2 "website", "http:www.apple.com"
    companyNode.NewChild2 "phone", "408-996-1010"

    response.write xml.GetXml()
%>

Computer keyboard shortcut keys(A to Z All Keys)

Keyboard shortcut1)Basic PC shortcut keys
2)F1 - F12 function keys
3)Top 10 keyboard shortcuts
4)Linux / Unix shortcut keys
5)Apple shortcut keys
6)Microsoft Windows shortcuts
7)Microsoft Excel shortcut keys
8)Microsoft Word shortcut keys
9)Internet Explorer shortcut keys
10)Microsoft FrontPage shortcut keys
11)Microsoft Outlook shortcut keys

12)Mozilla Firefox shortcut keys.Click here to full View

Latest Free Internet Trick For Airtel 3G users 

 

 

 


Latest AirTel Operator Trick Hack for Free Internet
[ Download mozilla firefox  http://www.mozilla.org/en-US/products/download.html?product=firefox-12.0&os=win&lang=en-US   / / / Select Host Step1: Open the mozilla firefox .
Step2: Select  tools/ option/Advanced/network.
Step3: Select setting.


















   Step4:select manual proxy configuration and type in HTTP Proxy  type  208.77.23.4 Port =80
















Step5: type in your URL www.fb.me the dialog box wil be appear in the search option search anything you want. Access free Internet free

HOW to Unlock Password Protected Memory Cards Without Formatting
 
Memory Cards are the external storage media that are used to store digital information. Most of the users store music, videos and photos in the memory cards. But some experienced users also stores confidential information, contacts, messages etc in it and sets up the password to protect it from unauthorized access. However if you forget your password then recovering your data can be a nightmare for most users. Even mobile companies don’t provide any software to remove password protection. If you connect the password protected memory card with your computer using USB then it will not show any extra hard drive in your Windows Explorer. The only solution left is to Format the memory card from your mobile phones.
FExplorer 
is freeware third party small utility which will bring sigh of relief to users who forgot their memory card password. FExplorer only works with Nokia s60 first and second Edition phones
How to Unlock Password Protected Memory Cards Without Formatting
§          ==>  First of all, Download FExplorer in to your mobile phone.
§         ==>  Now run FExplorer and go to C: drive first.
§          ==>  Now get into C:\System folder.





§ ==> Search for the mmcstore file name and copy this file into your computer.
§ ==> Now open this file with Notepad in your computer.
§ ==> Now you will be able to see the memory card password in this notepad file.

That’s it! Yet there is no such method to unlock memory card password of latest Nokia s60 series, E-series and N-series mobile phones without formatting. If you have any solution for these mobiles please feel free to mention in comments.