ctl -- C Template Library
  It contain some useful objects, functions, macros about some data
  structure. 

Compile:
  Type "make" and it will create "lib/libctl.a", "obj/$.o" where $
  means all the objects.
       By the way, you can type "make test" to compile a test file
  which name is "test/test.c", and the results are "test/test_slib"
  and "test/test_dlib".  Both of them are executive file. To run
  one of them, you will be shown a simple example about how to use
  the objects and functions in this project -- "C Template Library".

Target/goal:
  -utility:
     This object contain some useful functions,  constants and types.                                            
       Enums:                                              
         ErrorType    contain kinds of errors.             
                                                           
       Structures:                                         
                                                           
       Types:                                              
         uint         unsigned int                         
         pchar        char*                                
         ppchar       char**                               
         pvoid        void*                                
         ppvoid       void**                               
         cchar        const char                           
         pcchar       (const char)*                        
         ppcchar      (const char)**                       
         cvoid        const void                           
         pcvoid       (cosnt void)*                        
         ppcvoid      (const void)**                       
                                                           
      Type transform:                                      
        Char(), pChar(), ppChar()                          
        Void(), pVoid(), ppVoid()                          
        cChar(), pcChar(), ppcChar()                       
        cVoid(), pcVoid(), ppcVoid()                       
                                                           
      Functions:                                           
         ctl_malloc   like malloc(), but will exit on error
         ctl_realloc  like realloc(), but will exit on erro
         ctl_die      print some message and exit()        
         ctl_swap     swap two elements with given type    
                                                           

  -vector:
     This object is an array with dynamic table size.       
     methods:                                               
       init(addr of the vector, size per entry, size)       
          The vector's type depends on what user want to    
          store. For example: if you want an array for int, 
          you should  decleare like "int* v",  and call the 
          init() like this "init(&v,  sizeof(int), 5)", and 
          it will initalize an array with 5 elements.       
                                                            
       free(addr of the vector)                             
          Free the memory  the vector use. Yous should call 
          it when you don't need the container.             
                                                            
                                                            
       getSize(addr of the vector)                          
          Return the number of elements.                    
                                                            
       getEntrySize(addr of the vector)                     
          Return the size per entry, it dependent on what   
          type of data you store in the container.          
                                                            
       getEntry(addr of the vector, index)                  
          Return a const pointer which point to the entry   
          with the index you give.                          
                                                            
                                                            
       setSize(addr of the vector, new_size)                
          Resize the table to new_size. Note that it won't  
          initalize the newly element if you increase size. 
                                                            
       setEntry(addr of the vector, index, data)            
          Let the element with index you give be data.      
                                                            
                                                            
       addBack(addr of the vector, data)                    
          Add an element which contain data at the back of  
          the vector.                                       
                                                            
       delBack(addr of the vector)                          
          Remove the last element of the vector.            
                                                            
       addFront(addr of the vector, data)  !! UNFINISHED !! 
          Add an element which contain data at the front of 
          the vector.                                       
                                                            
       delFront(addr of the vector)        !! UNFINISHED !! 
          Remove the first element of the vector.           
                                                            
                                                            
       cat(addr of the v1, addr of the v2)                  
          Concatenate the vector2 to the back of vector1.   
                                                            
       copy(addr of the v1, addr of the v2)                 
          Let the contain in the v1 be the one in the v2    
                                                            
       replace(addr of the v1, a, b, addr of the v2, x, y)  
          If b == 0, it will insert v2[x ... x+y-1] into    
                                    the place between v[a]  
                                    and v[a-1]              
          If y >= 0, it will replace v1[a ... a+b-1]        
                                  to v2[x ... x+y-1]        
          If y <  0, it will replace v1[a ... a+b-1]        
                                  to v2[x-y-1 ... x] with   
                     reverse order.                         
                                                        
  -list:
  -stack:
  -queue:
  -dequeue:
  -heap:
  -map:
  -hash:



                                                  --cathook, cat_leopard