      """
      cdef public object name
      cdef public object data
      cdef public object key2row
      cdef public object _unset
  
      def __init__(self, *, shape=None, data=None, keys=None, name=None):
          """Create a new vector store.
  
          shape (tuple): Size of the table, as (# entries, # columns)
 
</s> remove             if row in self._unset:
                self._unset.remove(row)
 </s> add             if self._unset.count(row):
                self._unset.erase(self._unset.find(row)) </s> remove         return len(self._unset) == 0
 </s> add         return self._unset.size() == 0 </s> remove         if i in self._unset:
            self._unset.remove(i)
 </s> add         if self._unset.count(i):
            self._unset.erase(self._unset.find(i)) </s> remove             if row not in self._unset:
 </s> add             if not self._unset.count(row):
    cdef cppset[int] _unset
      """
      cdef public object name
      cdef public object data
      cdef public object key2row
    cdef cppset[int] _unset
  
      def __init__(self, *, shape=None, data=None, keys=None, name=None):
          """Create a new vector store.
  
          shape (tuple): Size of the table, as (# entries, # columns)
keep keep keep keep replace keep keep keep keep keep
 [2032] - Changed python set to cpp stl set (#2170)

Changed python set to cpp stl set #2032 

## Description

Changed python set to cpp stl set. CPP stl set works better due to the logarithmic run time of its methods. Finding minimum in the cpp set is done in constant time as opposed to the worst case linear runtime of python set. Operations such as find,count,insert,delete are also done in either constant and logarithmic time thus making cpp set a better option to manage vectors.
Reference : http://www.cplusplus.com/reference/set/set/

### Types of change
Enhancement for `Vectors` for faster initialising of word vectors(fasttext) 
spacy/vectors.pyx