StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
4694555
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
2
CommunityOwnedDate
CreationDate
2011-01-14T18:29:06.603
FavoriteCount
0
LastActivityDate
2014-07-13T19:18:16.010
LastEditDate
2014-07-13T19:18:16.010
LastEditorUserId
168288
OwnerUserId
168288
ParentId
4694401
PostTypeId
2
Score
24
ViewCount
0
LastEditorDisplayName
text
Body
A lot of C projects end up implementing a vector-like API. Dynamic arrays are such a common need, that it's nice to abstract away the memory management as much as possible. A typical C implementation might look something like: <pre><code>typedef struct dynamic_array_struct { int* data; size_t capacity; /* total capacity */ size_t size; /* number of elements in vector */ } vector; </code></pre> Then they would have various API function calls which operate on the <code>vector</code>: <pre><code>int vector_init(vector* v, size_t init_capacity) { v->data = malloc(init_capacity * sizeof(int)); if (!v->data) return -1; v->size = 0; v->capacity = init_capacity; return 0; /* success */ } </code></pre> Then of course, you need functions for <code>push_back</code>, <code>insert</code>, <code>resize</code>, etc, which would call <code>realloc</code> if <code>size</code> exceeds <code>capacity</code>. <pre><code>vector_resize(vector* v, size_t new_size); vector_push_back(vector* v, int element); </code></pre> Usually, when a reallocation is needed, <code>capacity</code> is doubled to avoid reallocating all the time. This is usually the same strategy employed internally by <code>std::vector</code>, except typically <code>std::vector</code> won't call <code>realloc</code> because of C++ object construction/destruction. Rather, <code>std::vector</code> might allocate a new buffer, and then copy construct/move construct the objects (using placement <code>new</code>) into the new buffer. An actual vector implementation in C might use <code>void*</code> pointers as elements rather than <code>int</code>, so the code is more generic. Anyway, this sort of thing is implemented in a lot of C projects. See <a href="http://codingrecipes.com/implementation-of-a-vector-data-structure-in-c">http://codingrecipes.com/implementation-of-a-vector-data-structure-in-c</a> for an example vector implementation in C.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POHow to replicate vector in c?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USCharles Salvia
UserOwnerUserId
1. USCharles Salvia
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
3. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.