C++ (Cpp) SeqList_Capacity Examples

Example #1

File: SeqList.c Project: JhonChan/DataStructure

int SeqList_Insert(SeqList* list, SeqListNode* node, int pos)
{
    if (list == NULL||node == NULL) return -1;
    TSeqList *tmp = (TSeqList *)list;
    if (pos < 0 || pos > SeqList_Length(tmp) || SeqList_Length(tmp) >= SeqList_Capacity(tmp)) return -2;
    int i;
    for (i = SeqList_Length(tmp); i > pos; i --) {
        tmp->node[i] = tmp->node[i-1];
    }
    tmp->node[i] = node;
    tmp->length++;
    return 0;
}

Example #2

File: SeqQueue.c Project: JasonDean-1/ACM-DataStruct-Algorithms

int SeqQueue_Capacity(SeqQueue* queue) // O(1)
{
    return SeqList_Capacity(queue);
}