def save(self, doc):
        if doc.id:
            return self.update(doc)
        else:
            return self.insert(doc)
def linear_search(lst,size,value):
    i = 0
    while i < size:
        if lst[i] == value:
            return i
        i = i + 1
    return -1