How to create function polymorphism in C

本文介绍如何在C语言中实现函数多态性,通过使用联合体和函数指针来处理不同数据类型间的加法运算,从而避免重复代码并保持高效执行速度。

It is possible to create C programs that simulate object-oriented methods. In this page, I will explain why it is sometimes desirable to do so, and then I will illustrate how to create polymorphism in C.

Why go to all this trouble?

There are already many high-level, easy-to-use languages out there with full object-oriented capabilities, including polymorphism. Why insist on doing this in C?

I am working on a communications systems simulator that is used, among other things, to estimate the complexity of different communication algorithms. It is able to do so at quite a low-level, keeping count of every operation required.

At one point, I found myself needing to execute the same algorithm, but with different data types. For instance, I wanted to compare performance when using floating-point versus fixed-point numbers. I hated the idea of maintaining several, almost identical versions of the different algorithms. We're talking a few thousand lines of code here.

This is the point where, in many situations, one switches to a language that is able to run the same code on several different data types — in other words, a language that supports polymorphism.

I had one main reason to do persist in using C, though: execution speed. It is not unusual for the simulator to take a few days to complete a test case, on modern hardware. I didn't want to think about extending this time any further. In my experience, C produces the fastest code of any language (excepting, maybe, carefully optimized assembler).

Another reason was just the plain challenge of doing it. It was an opportunity to learn more about C. For example, I had never needed to use function pointers before. Also, I believe that the ultimate test of whether you understand a high-level programming concept is to implement it in C.

How to go to all this trouble

OK, on to the technical details.

My main objective was to be able to tell the program which data type to use, without having to recompile. This type is selected once, when the program is invoked. I don't need to change the type once the program has started.

This simplifies the problem a bit, but more general polymorphism is easy to create with one or two simple additions to the main idea I'll describe.

I'll show how to create a polymorphic function to add two numbers. The numbers can both be either int or double. We start by creating a new data type that can hold either an integer or a double.

Example: Composite data type
typedef union
{
double floatpt;
int integer;
} number;

A union is just like a struct, except that it can hold only one element at a time. The memory required by the union is that of the largest data type it can hold.

Now we create two functions to add numbers. Both operate on variables of type number, but one uses the int part and the other the double part.

Example: Two add functions
number add_floatpt(number x, number y)
{
number result;

result.floatpt = x.floatpt + y.floatpt;
return result;
}

number add_integer(number x, number y)
{
number result;

result.integer = x.integer + y.integer;
return result;
}

As can be seen, both functions take and return arguments of type number. Internally, one of them assumes the union contains an int, and the other assumes it contains a double. In each function, we use the built-in overloading of the + operator.

Now we're ready to create our polymorphic add function. What we'll do is create a function pointer, that points to add_floatpt or to add_integer.

Example: Function pointer
/* pointer to function
* function "add" will show polymorphism */

number (* add)(number, number) = NULL;

if( sel == 1 ) {
add = &add_floatpt;
}
else {
add = &add_integer;
}

Here we use a variable named sel to decide whether add will point to add_floatpt or to add_integer. In this example, this is done once when the program starts. It can just as easily be done each time add is called, although it is a bit messier.

Now, the rest of the program can happily go about its way, calling add whenever it needs to perform an addition, completely oblivious to the underlying data types.

Below I present a full example, with comments.

Example: Full source code
/* This program shows how to create a form of function polymorphism
* using the C language
*
* The technique shown is nowhere near as powerful as what C++ or other OO
* languages provide, but is useful for some applications.
*
* Compilation:
* First, save the program as poly.c; then
* compile with: gcc -o poly poly.c
*
* Usage:
* The program takes three arguments:
* poly TYPE X Y
*
* TYPE: if equal to 1, then X and Y are taken as floating point numbers,
* otherwise, X and Y are taken as integers
*
* X, Y : two numbers of the type specified by TYPE
*
* The program will output the addition of X and Y.
*
* Examples:
*
* $ ./poly 1 2.0 3.0
* Result = 5.00000
*
* $ ./poly 2 2 3
* Result = 5
*
* */

#include <stdlib.h>

/* all quantities used by the program will be of type "number"
* (a union is used to save memory) */
typedef union
{
double floatpt;
int integer;
} number;

/* the next two functions are used to add numbers. Each function knows how to
* add a different type */
number add_floatpt(number x, number y)
{
number result;

result.floatpt = x.floatpt + y.floatpt;
return result;
}

number add_integer(number x, number y)
{
number result;

result.integer = x.integer + y.integer;
return result;
}

/* the next two functions are used to print the result. Each function knows how
* to print a different type */
void print_floatpt( number x )
{
printf( "Result = %1.5f/n", x.floatpt );
}

void print_integer( number x )
{
printf( "Result = %d/n", x.integer );
}

int main( int argc, char *argv[] )
{
int sel;
number x, y, result;

/* pointers to functions.
* functions "add" and "print" will show polymorphism */
number (* add)(number, number) = NULL;
void (* print)(number) = NULL;

sel = atoi( argv[1] );

/* make "add" and "print" point to the function of the correct type.
* note that the option to use integers or floating-point values
* is set at run time; there is no need to recompile. */
if( sel == 1 ) {
add = &add_floatpt;
print = &print_floatpt;
x.floatpt = atof( argv[2] );
y.floatpt = atof( argv[3] );

}
else {
add = &add_integer;
print = &print_integer;
x.integer = atoi( argv[2] );
y.integer = atoi( argv[3] );
}

/* from this point forward, "add" and "print" can be used as
* polymorphic functions. As long as the program does all its
* calculations using the "number" type, it doesn't care about
* whether the underlying types are integers or floating point
* numbers */
result = add( x, y );
print( result );

return 0;
}

I hope you find this explanation about creating function polymorphism in C clear and useful. I'd love to hear your comments or suggestions.

Contact

Please don't hesitate to contact me at this email address:

Miguel Bazdresch

This page was last updated on: 2006-05-04 (revision 0.1)

 
**项目概述:** 本资源提供了一套采用Vue.js与JavaScript技术栈构建的古籍文献文字检测与识别系统的完整源代码及相关项目文档。当前系统版本为`v4.0+`,基于`vue-cli`脚手架工具开发。 **环境配置与运行指引:** 1. **获取项目文件**后,进入项目主目录。 2. 执行依赖安装命令: ```bash npm install ``` 若网络环境导致安装缓慢,可通过指定镜像源加速: ```bash npm install --registry=https://registry.npm.taobao.org ``` 3. 启动本地开发服务器: ```bash npm run dev ``` 启动后,可在浏览器中查看运行效果。 **构建与部署:** - 生成测试环境产物: ```bash npm run build:stage ``` - 生成生产环境优化版本: ```bash npm run build:prod ``` **辅助操作命令:** - 预览构建后效果: ```bash npm run preview ``` - 结合资源分析报告预览: ```bash npm run preview -- --report ``` - 代码质量检查与自动修复: ```bash npm run lint npm run lint -- --fix ``` **适用说明:** 本系统代码经过完整功能验证,运行稳定可靠。适用于计算机科学、人工智能、电子信息工程等相关专业的高校师生、研究人员及开发人员,可用于学术研究、课程实践、毕业设计或项目原型开发。使用者可在现有基础上进行功能扩展或定制修改,以满足特定应用场景需求。 资源来源于网络分享,仅用于学习交流使用,请勿用于商业,如有侵权请联系我删除!
【EI复现】基于阶梯碳交易的含P2G-CCS耦合和燃气掺氢的虚拟电厂优化调度(Matlab代码实现)内容概要:本文介绍了基于阶梯碳交易机制的虚拟电厂优化调度模型,重点研究了包含P2G-CCS(电转气-碳捕集与封存)耦合技术和燃气掺氢技术的综合能源系统在Matlab平台上的仿真与代码实现。该模型充分考虑碳排放约束与阶梯式碳交易成本,通过优化虚拟电厂内部多种能源设备的协同运行,提升能源利用效率并降低碳排放。文中详细阐述了系统架构、数学建模、目标函数构建(涵盖经济性与环保性)、约束条件处理及求解方法,并依托YALMIP工具包调用求解器进行实例验证,实现了科研级复现。此外,文档附带网盘资源链接,提供完整代码与相关资料支持进一步学习与拓展。; 适合人群:具备一定电力系统、优化理论及Matlab编程基础的研究生、科研人员或从事综合能源系统、低碳调度方向的工程技术人员;熟悉YALMIP和常用优化算法者更佳。; 使用场景及目标:①学习和复现EI级别关于虚拟电厂低碳优化调度的学术论文;②掌握P2G-CCS、燃气掺氢等新型低碳技术在电力系统中的建模与应用;③理解阶梯碳交易机制对调度决策的影响;④实践基于Matlab/YALMIP的混合整数线性规划或非线性规划问题建模与求解流程。; 阅读建议:建议结合提供的网盘资源,先通读文档理解整体思路,再逐步调试代码,重点关注模型构建与代码实现之间的映射关系;可尝试修改参数、结构或引入新的约束条件以深化理解并拓展应用场景。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值