blocks|key|3726489|text|您的示例数组包含(void*)类型的项。它包含指针。您似乎希望它可以容纳任意类型。在本例中为int。您是想存储插入数据的副本，还是简单地存储调用者给您的指针？|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3726490|不久前，我想为我正在编写的一个游戏提供类似于简单数组的行为，于是我想出了xrlist。一段时间后，我想要存储它们并随机访问它们，所以我想到了xrhash。|offset|length|3726491|xrlist和xrhash存储用户提供的指针，并期望所有元素具有相同的类型(xrhash有一个hashcode和比较回调函数)|3726492|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/inorton/xrlist|1|https://github.com/inorton/xrhash^0|0|10|6|0|1Y|6|1|0|0^^$0|@$1|2|3|4|5|6|7|R|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|S|8|@]|9|@$D|T|E|U|1|V]|$D|W|E|X|1|Y]]|A|$]]|$1|F|3|G|5|6|7|Z|8|@]|9|@]|A|$]]|$1|H|3|-4|5|6|7|10|8|@]|9|@]|A|$]]]|I|$J|$5|K|L|M|A|$N|O]]|P|$5|K|L|M|A|$N|Q]]]]

Your example array holds items of type (void*). It holds pointers. You seem to be wanting it to hold arbitrary types. In this case and int. Do you want to store copies of inserted data or to simply store pointers given to you by the caller?

A while ago I wanted simple array like behavour for a game I was writing and came up with <a href="https://github.com/inorton/xrlist" rel="nofollow">xrlist</a>. A while later I wanted to store them and randomly access them so came up with <a href="https://github.com/inorton/xrhash" rel="nofollow">xrhash</a>.

xrlist and xrhash store user supplied pointers and expect all elements to be of the same type (xrhash has a hashcode and comparison callback function )

blocks|key|35094|text|在开始时分配一小块内存(可能是用来容纳联合)，然后推回元素，直到填满它，这样可能会更好。然后是realloc，或者分配一个两倍大小的数组，然后复制所有内容。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|35095|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

You might be better served allocating a small chunk of memory (perhaps to hold unions) in the beginning, and pushing back elements until you fill it up. Then either realloc, or allocate an array twice the size and copy everything over.

blocks|key|3726535|text|如果您提供一个push_back_c_array()版本来复制所提供的值，这是可能的。为此，您将需要一个额外的参数，用于指定值的大小：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3726536|push_back_c_array(c_array*+arr,+void*+val,+unsigned+int+size);|code-block|syntax|javascript|3726537|在堆中为新值分配内存，然后执行memcpy。但在此之后，您需要重新分配它。因此，您需要记住哪些值是由您分配的，哪些值是由调用者分配的。相当下流..。所以，如果你这样做了-总是这样做，并在你的函数的文档中描述这个约定。|3726538|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

It is possible, if you provide a version of push_back_c_array() that will copy the value provided. For this you'll need an extra argument, that specifies the size of the value:

<pre><code>push_back_c_array(c_array* arr, void* val, unsigned int size);
</code></pre>

You allocate memory in heap for the new value and then do memcpy. But after that you'll need to deallocate it back. So, you'll need to remember, which values are allocated by you, and which ones - by the caller. Rather nasty... So, if you do that - do that always, and describe this convention in the documenation to your function.

blocks|key|2177991|text|你举了一个例子，只要你使用整数或任何其他与a=5大小相同的类型，whit就应该可以工作。泛型数组的用户将希望推送结构，就像您的一样。但是，大元素不能/不应该通过值传递，但它的指针应该传递。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2177992|使用泛型和no+no+on+sizeof(int)会给用户带来一些额外的工作。我认为最好的解决方案是在函数中传递分配的指针(void*)，无论谁想要取出这个元素，都应该释放()这个结构。|2177993|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|F|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|G|8|@]|9|@]|A|$]]|$1|D|3|-4|5|6|7|H|8|@]|9|@]|A|$]]]|E|$]]

you example whit a=5 should work as long as you will use integers or any other type that has same size as int. User of generic array will want to push structs, just like your. But, big elements can not/should not should not be passed by value, but its pointer should be passed.

using generic and no being bounded on sizeof(int) bring some extra effort from user. I think that best solution is that you pass allocated pointer (void*) in function and whoever wants to take this element out, should free() this struct.

I am writing a dynamic array in C.

<pre><code>typedef struct __c_array {
 void**_elem;
 int cur_size;
 int capacity;
}c_array;
</code></pre>

My Interface look like this:

<pre><code>extern void push_back_c_array ( c_array*, void *);
</code></pre>

Now user will have to allocate memory for the element to be pushed into the array . Is there any way to avoid this using void *.

I want use this to do following 

<pre><code>int a = 5;
push_back_c_array ( &lt;ARRAY_PTR&gt;, a );
</code></pre>

Is this possible.

Generic programming in C Question

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我正在用C编写一个动态数组。typedef struct __c_array {    void**_elem;    int  cur_size;    int  capacity;}c_array;我的界面如下所示：extern void push_back_c_array ( c_array*, void *);...

问C语言中的泛型编程问题
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问C语言中的泛型编程问题EN