mirror of
https://github.com/TheAlgorithms/C.git
synced 2026-09-23 23:44:56 +00:00
formatting source-code for b388e4a309
This commit is contained in:
@@ -1,7 +1,7 @@
|
||||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include "dynamic_array.h"
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
dynamic_array_t *init_dynamic_array()
|
||||
{
|
||||
@@ -14,8 +14,10 @@ dynamic_array_t *init_dynamic_array()
|
||||
|
||||
void *add(dynamic_array_t *da, const void *value)
|
||||
{
|
||||
if (da->size >= da->capacity) {
|
||||
void **newItems = realloc(da->items, (da->capacity <<= 1) * sizeof(void **));
|
||||
if (da->size >= da->capacity)
|
||||
{
|
||||
void **newItems =
|
||||
realloc(da->items, (da->capacity <<= 1) * sizeof(void **));
|
||||
free(da->items);
|
||||
|
||||
da->items = newItems;
|
||||
@@ -52,7 +54,8 @@ void delete (dynamic_array_t *da, const unsigned index)
|
||||
if (!contains(da->size, index))
|
||||
return;
|
||||
|
||||
for (unsigned i = index; i < da->size; i++) {
|
||||
for (unsigned i = index; i < da->size; i++)
|
||||
{
|
||||
da->items[i] = da->items[i + 1];
|
||||
}
|
||||
|
||||
|
||||
@@ -3,7 +3,8 @@
|
||||
#define DEFAULT_CAPACITY 1 << 4
|
||||
#define INDEX_OUT_OF_BOUNDS NULL
|
||||
|
||||
typedef struct dynamic_array {
|
||||
typedef struct dynamic_array
|
||||
{
|
||||
void **items;
|
||||
unsigned size;
|
||||
unsigned capacity;
|
||||
|
||||
@@ -6,7 +6,8 @@ int main()
|
||||
{
|
||||
dynamic_array_t *da = init_dynamic_array();
|
||||
|
||||
for (int i = 1; i <= 50; i++) {
|
||||
for (int i = 1; i <= 50; i++)
|
||||
{
|
||||
add(da, &i);
|
||||
}
|
||||
|
||||
@@ -22,7 +23,8 @@ int main()
|
||||
|
||||
add(da, &another_value);
|
||||
|
||||
for (int i = 0; i < da->size; i++) {
|
||||
for (int i = 0; i < da->size; i++)
|
||||
{
|
||||
printf("value %d\n", *(int *)get(da, i));
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user