Basic Vector Implementation


template <typename T>
myvector {
T *array;
int size;
        typedef T* Iterator;

public:
myvector()
{
size =0;
}
myvector(int s)
{
array = new T[s];
size = s;
}
  myvector(int s, T val)
{
array = new T[s];

for(int i=0;i<s;i++)
array[i] = val;
                }
               
                myvector(const myvector &obj1)
                {
                     size = obj1.size;
                     array = new T[obj1.size];                      
                     for(int i=0;i<obj1.size;i++)
                        arr[i]=obj1.array[i];
                                     
                }

               myvector& operator=(const myvector &obj1)
                {
    delete []array;
    size = obj1.size;
                     array = new T[obj1.size];                      
                     for(int i=0;i<obj1.size;i++)
                        arr[i]=obj1.array[i];
                      return this
                }

                 T& operator[](cons int ind)
                 {
                     return array[ind];  
                 }
                ~myvector()
                 {
                   delete []array;
                 }

push_back(T data)
{
                  T* tmp=new T[size+1];
  for(int i=0; i<size;i++)
{
         tmp[i]=array[i];
}
tmp[size]=data
delete []array;
array = tmp;
size++;                            
}
                pop_back()                      
                {
size--;                            

               T* tmp = new T[size];
  for(int i=0; i<size;i++)
{
tmp[i] = array[i];
}
delete []array;
array = tmp;

                }
 
              Iterator begin()
              {
                 return array;
              }

              Iterator end()
              {
                 return array[size];
              }     
}

Comments

Post a Comment

Popular posts from this blog

STL Questions

1. Sorting a vector of custom objects     a)Using operator()         struct MyStruct {             int key;             std::string str;             MyStruct(int k, int s) : key(k), str(s) {}         };         struct less_than{             inline bool operator()(const MyStruct &s1, const MyStruct &b)             {                 return s1.key<s2.key;             }         };         std::vector<MyStruct> vec;         vec.push_back(MyStruct(4, "a")); ...
Read more

Producer Consumer problem using mutex

  #include<stdio.h> #include<pthread.h> #include<stdlib.h>   // Max buffer size user for producing #define buff_sz 10   // buffer index would be the current index volatile int buff_idx = -1; // buffer used to produce item volatile char *buff = NULL;;   // Initialization and declaration of muetxt and condition variables pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER; pthread_cond_t buff_not_full = PTHREAD_COND_INITIALIZER; pthread_cond_t buff_not_empty = PTHREAD_COND_INITIALIZER;   // Consumer thread void *Consumer() {          while (1)          {                  // Taking lock to avoid race condition                  pthread_mutex_ lock(&m...
Read more

Adapter Design Pattern

Image
This is one of structural design pattern. The adapter pattern is a design pattern that is used to allow two incompatible types to communicate. Example: In one user database system all information regarding user info like name, phone number, emailid, address etc are stored. But to call the user all information is not required, only user name & phone number is sufficient. In this case we can create a new class adapter. This class will provide only those information which is required and hide unrequired information. class User {     string name;     string phonenumber;     string emailId;     string address;     public:         User(string na, string ph, string email, string addr)         {             name = na;             phonenumber = ph; ...
Read more