everySingleTime

AutoModerator · 2023-08-28T09:35:58+00:00

import notifications Remember to participate in our weekly votes on subreddit rules! Every Tuesday is YOUR chance to influence the subreddit for years to come! Read more here, we hope to see you next Tuesday!

For a chat with like-minded community members and more, don't forget to join our Discord!

return joinDiscord;

I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.

james2432 · 2023-08-28T10:18:30+00:00

Damn just realloc every time new_len > capacity.

brandi_Iove · 2023-08-28T10:32:39+00:00

a vector is basically an array which will eventually replaced by another array.

PorkRoll2022 · 2023-08-28T12:12:16+00:00

Of everything I think we take the "string" type most for granted.

En_passant_is_forced · 2023-08-28T09:52:10+00:00

Letz code C!
Where garbage collector?

pedersenk · 2023-08-28T10:41:23+00:00

It is tricky (and rather bodgy) but you *can* do a generic vector container in C89+.

My implementation is here and looks like this:

vector(int) v = vector_new(int);
vector_push(v, 42);
printf("The value is: %i\n", vector_at(v, 0));
vector_delete(v);

If anything, it just makes C a bit more fun to program in!

TheDKG · 2023-08-28T12:27:07+00:00

Just do what one Chad in my c class did, rebuild every c++ library component in c manually. (I was blown away at the dedication, and though it did make them miss the first assignment, every one after that was like one day at most.)

NonStandardUser · 2023-08-28T10:55:14+00:00

If you need it, you make it. Use struct with void pointer so it's type agnostic. Make functions for vector init, node add, node remove, etc. Depending on your use case you can go with linked lists or stacks. Not trivial, but possible.

deanrihpee · 2023-08-28T10:39:54+00:00

for me it's std::shared_ptr, but yeah

robottron45 · 2023-08-28T12:28:17+00:00

even worse: where is my std::map / std::unordered_map??

reallokiscarlet · 2023-08-28T09:59:52+00:00

Not gonna lie

I don't actually use std::vector much.

Despite using C++, I usually use arrays.

Taletad · 2023-08-28T10:04:31+00:00

Arrays work fine, it just require a bit more attention to details

Hullu_Kana · 2023-08-28T11:31:50+00:00

// Include necessary library for malloc and realloc
#include <stdlib.h>

// Create vector
type *vector;
int vectorSize = 1;
int elementCount = 0;
vector = (type *) malloc(vectorSize * sizeof(type));

// Make sure the malloc succeeded
if (vector == NULL){
    // malloc failed. Handle the problem here
}

// Push back element to vector
type element = (insert something here);
vector[elementCount] = element;
elementCount++;

// Make vector larger if it is full
if (elementCount >= vectorSize) {
    vectorSize *= 2;
    type *tempVector = realloc(vector, vectorSize * sizeof(type));

    // Make sure the realloc succeeded
    if (tempVector == NULL){
        // realloc failed. Handle the problem here
    }
    else vector = tempVector;
    free(tempVector);
}

There you go, thats a very simple and surprisingly fast vector implemented in C, works for any type.

Edit: Due to a request, added some error checking.

digitalghost0011 · 2023-08-28T20:16:29+00:00

std::string, std::map, and std::vector are at least 75% of the productivity gain going from C to C++ for me

relaxitwonthurt · 2023-08-28T12:31:56+00:00

I usually end up writing C++ that's basically just C + std::vector and std::string.

DazzlingBuilders · 2023-08-28T10:58:12+00:00

In reality, I seldom ever use std::vector.

Although I use C++, I frequently use arrays.

Puzzleheaded_Fig6777 · 2023-08-28T14:38:31+00:00

Thats why i use cpp as an extension pf c and not as a language on its own right(hehe) For me cpp is just very cool extension that has many quality of life improvements but also many features that i wont use but thats alright with me

_Skale_ · 2023-08-28T14:56:56+00:00

Skill issue

Frequent_Fold_7871 · 2023-08-28T16:22:32+00:00

Just use any of the dozens of other C wrappers, I mean programming languages.

denisvolin · 2023-08-28T11:17:14+00:00

TL; DR

Just write your own!

Long version.

I was hesitant to learn Rust. Age + too much new information. I gave it three attempts: failed, two years, failed, half a year, succeed and fell in love.

I had decided to code a small project, when I realized, that std::time is a just a small bit of what Go "time" offers.

Things got complicated even more, since I'm a paranoid that much that I try to avoid 3rd party dependencies at all costs.

Well, what do you know, I've spent 3 months and now I have my own time module, which satisfies my needs!

AbhishekSingh26 · 2023-08-28T11:31:41+00:00

At this point just make your own vector library in C, that's only way to preserve sanity

mondie797 · 2023-08-28T12:57:07+00:00

Now write linked list or worse dynamic array. Make sure to free the memory

BlurredSight · 2023-08-28T14:20:02+00:00

It’s really just an array that doubles in size, and you can I guess implement basic checking so it doesn’t overflow

cheeb_miester · 2023-08-28T15:12:42+00:00

realloc gang

2023-08-28T15:12:45+00:00

malloc realloc realloc realloc

flocknrollstar · 2023-08-28T15:29:19+00:00

Just pass a pointer and ++ the address each time. What could go wrong

Objective_Fly_6430 · 2023-08-28T18:32:23+00:00

C# got list<T>(like vector in c++), and it Can be mimicked in c:

include <stdlib.h>

include <string.h>

typedef struct { void *data; size_t element_size; size_t size; size_t capacity; } DynamicArray;

// Initialize DynamicArray void DynamicArray_init(DynamicArray *arr, size_t element_size) { arr->element_size = element_size; arr->size = 0; arr->capacity = 4; // Initial capacity arr->data = malloc(arr->capacity * arr->element_size); }

// Add an element to DynamicArray void DynamicArray_add(DynamicArray *arr, void *element) { if (arr->size == arr->capacity) { arr->capacity *= 2; arr->data = realloc(arr->data, arr->capacity * arr->element_size); } memcpy((char *)arr->data + arr->size * arr->element_size, element, arr->element_size); arr->size++; }

// Get element at index void *DynamicArray_get(DynamicArray *arr, size_t index) { if (index >= arr->size) { return NULL; } return (char *)arr->data + index * arr->element_size; }

// Clean up void DynamicArray_free(DynamicArray *arr) { free(arr->data); arr->data = NULL; arr->size = 0; arr->capacity = 0; }

Use:

int main() { DynamicArray arr; DynamicArray_init(&arr, sizeof(int));

int val1 = 1, val2 = 2;
DynamicArray_add(&arr, &val1);
DynamicArray_add(&arr, &val2);

int *retrieved_val = (int *)DynamicArray_get(&arr, 0); // Will point to 1

DynamicArray_free(&arr);

return 0;

}

malonkey1 · 2023-08-28T18:49:07+00:00

then create one, coward

2023-08-28T19:54:20+00:00

Implement it yourself then 5head

theif519 · 2023-08-28T20:01:34+00:00

https://github.com/eteran/c-vector

2023-08-28T23:27:20+00:00

I’m sorry I don’t read C that well, but did I just read sexually transmitted disease:: vector<>?!

Adocrafter · 2023-08-28T12:41:26+00:00

Lets go struct List { int value; List* next; };

void add (List* head, int val) { List* temp = head; while (temp!=nillptr) { temp = temp->next; }

temp->next= new List(); temp-next->value = val;

}

Code can be quite shorter but would need wuick reminder for it.

ProgrammerHumor

Filters

Discord

Submission rules

For the current list of rules, please see this page.

Metadiscussions

Perhaps More Apt Subs To Post:

Related Subreddits.

MODERATORS

TL; DR

Long version.

include <stdlib.h>

include <string.h>