Exemplos de LSQ_GetElementByIndex em C++ (Cpp)

Exemplo n.º 1

Arquivo: avl_tree.c Projeto: msporyshev/data_structures

extern void LSQ_DeleteElement(LSQ_HandleT handle, LSQ_IntegerIndexT key) 
{
	AVLTreeT *tree = (AVLTreeT *)handle;
	TreeNodeT *node = NULL, *parent = NULL;
	IteratorT * iter = (IteratorT *)LSQ_GetElementByIndex(handle, key);
    int new_key;
    if (!LSQ_IsIteratorDereferencable(iter))
        return;

    parent = iter->node->parent;
    if (iter->node->l_child == NULL && iter->node->r_child == NULL)
        replaceNode(tree, iter->node, NULL);
    else if (iter->node->l_child != NULL && iter->node->r_child != NULL)
    {
        node = successor(iter->node);
        new_key = node->key;
        iter->node->value = node->value;
        LSQ_DeleteElement(handle, node->key);
        iter->node->key = new_key;
        return;
    }
    else if (iter->node->l_child != NULL)
        replaceNode(tree, iter->node, iter->node->l_child);
    else if (iter->node->r_child != NULL)
        replaceNode(tree, iter->node, iter->node->r_child);
    free(iter->node);
    tree->size--;
	restoreBalance(tree, parent, BT_AFTER_DELETE);
}

Exemplo n.º 2

Arquivo: lsq_tests.c Projeto: Taller/Rhonda

/* Test moving on list with GetElementByIndex */
void test7(void)
{
    int i, j;
    srand ( time(NULL) );

//    print_LSQ(handleAll);
    printf("Testing GetElementByIndex");
    for(i = 0; i < MAX_TEST_ATTEMPTS; i++)
    {
        j = rand() % LSQ_GetSize(handleAll);
//        printf("\ni = %d \t j = %d \t size = %d", i , j, LSQ_GetSize(handleAll));
        LSQ_IteratorT iter = LSQ_GetElementByIndex(handleAll, j);
        assert( iter != NULL);
//        printf("\nFound = %d \t Expecting = %d \t", *LSQ_DereferenceIterator(iter), all[j]);
        assert( *LSQ_DereferenceIterator(iter) == all[j]);
        assert( *LSQ_DereferenceIterator(iter) != MAX_ELEMENT_VALUE + 1);

        LSQ_DestroyIterator(iter);
    }
    printf("\t\t ---\t OK \n");

}

Exemplo n.º 3

Arquivo: linear_sequence.c Projeto: khomyakov42/C

/* Функция, возвращающая итератор, ссылающийся на последний элемент контейнера */
LSQ_IteratorT LSQ_GetPastRearElement(LSQ_HandleT handle){
	if(handle == NULL)
		return(LSQ_HandleInvalid);
	return(LSQ_GetElementByIndex(handle, SEQ(handle)->size));
}

Exemplo n.º 4

Arquivo: linear_sequence.c Projeto: khomyakov42/C

/* Функция, возвращающая итератор, ссылающийся на первый элемент контейнера */
LSQ_IteratorT LSQ_GetFrontElement(LSQ_HandleT handle){
	return(LSQ_GetElementByIndex(handle, 0));
}

Exemplo n.º 5

Arquivo: linear_sequence_dyn_arrays.c Projeto: msporyshev/data_structures

extern void LSQ_InsertFrontElement(LSQ_HandleT handle, LSQ_BaseTypeT element)
{
    LSQ_IteratorT iterator = LSQ_GetElementByIndex(handle, 0);
    LSQ_InsertElementBeforeGiven(iterator, element);
    LSQ_DestroyIterator(iterator);
}

Exemplo n.º 6

Arquivo: linear_sequence_dyn_arrays.c Projeto: msporyshev/data_structures

extern LSQ_IteratorT LSQ_GetPastRearElement(LSQ_HandleT handle)
{
	return IS_HANDLE_INVALID(handle) ? LSQ_HandleInvalid : LSQ_GetElementByIndex(handle, ((ArrayDataT *)handle)->logical_size);
}

Exemplo n.º 7

Arquivo: static_arrays.c Projeto: twigil/loulou

LSQ_IteratorT LSQ_GetPastRearElement(LSQ_HandleT handle)
{
    return LSQ_GetElementByIndex(handle, LSQ_GetSize(handle));
}

Exemplo n.º 8

Arquivo: static_arrays.c Projeto: twigil/loulou

void LSQ_DeleteRearElement(LSQ_HandleT handle)
{
    _iterator *iter = LSQ_GetElementByIndex(handle, LSQ_GetSize(handle) - 1);
    LSQ_DeleteGivenElement(iter);
    LSQ_DestroyIterator(iter);
}