使用C语言实现面向对象编程

需积分: 10 70 浏览量更新于2024-07-26 2 收藏 1.21MB PDF 举报

"面向对象的标准C编程.pdf" 本书探讨的主题是将面向对象的编程思想应用于标准C语言，旨在揭示如何在不使用专门设计为面向对象的语言（如C++）的情况下，利用C语言实现对象导向编程。面向对象编程（OOP）虽然已有超过十年的历史，但至今仍被视为解决各种问题的有效方法。然而，它并不是万能的，没有一种编程技术能够解决所有问题，也没有一种编程语言能确保程序总是无误。核心思想是，OOP主要是对长期以来我们被教导的良好编程原则的实践，例如封装、继承和多态性。尽管C++等语言因其面向对象特性而备受推崇，但并不意味着必须使用这些语言才能进行OOP。实际上，纯正的ANSI C语言也能实现类似的目标，只是需要更巧妙地利用其机制。书中并不倾向于推崇或贬低任何特定的编程范式。作者的目的是通过ANSI C来探索OOP的方法，理解其技术细节，并阐述这些技术如何帮助我们更好地解决问题并实现代码重用。在过去的编程实践中，优秀的程序员会携带他们的工具包和库，这实际上就是早期形式的代码重用。然而，面向对象的编程通过更系统化的方式，使得代码重用成为跨项目开发的标准实践。书中的内容可能会涵盖以下关键点： 1. **封装**：解释如何在C语言中通过结构体和函数指针实现数据隐藏和封装，创建类的抽象概念。 2. **继承**：探讨如何模拟继承，通过组合和接口的概念，使一个结构体可以包含另一个结构体，实现类的层次结构。 3. **多态性**：介绍如何使用函数指针和回调函数实现类似于C++虚函数的效果，允许不同的对象对同一消息做出不同的响应。 4. **设计模式**：讨论在C语言中实现常见的面向对象设计模式，如工厂模式、单例模式和观察者模式。 5. **代码复用和库**：深入讲解如何构建可重用的库，以及如何在C语言中管理这些库，以提高代码的模块性和可维护性。 6. **案例研究**：通过实际的项目例子，展示如何在标准C中应用OOP原则来解决复杂问题。 7. **最佳实践**：分享如何在C语言环境中采用面向对象思维，编写清晰、高效且易于扩展的代码。 8. **性能考虑**：探讨面向对象编程在C语言中的性能影响，以及如何平衡设计和性能之间的权衡。这本书将帮助读者理解和掌握如何在C编程中应用面向对象的思想，从而提升代码质量和项目效率，即使在非面向对象的语言环境下，也能充分利用面向对象的优势。

___________________________________________________________________________

1 Abstract Data Types

— Information Hiding

apply() calls action() for each element in set and passes the rest of the argument

list. action() must not change set but it may return zero to terminate apply() early.

apply() returns true if all elements were processed.

___________________________________________________________________________

Dynamic Linkage

Generic Functions

2.1 Constructors and Destructors

Let us implement a simple string data type which we will later include into a set.

For a new string we allocate a dynamic buffer to hold the text. When the string is

deleted, we will have to reclaim the buffer.

new() is responsible for creating an object and delete() must reclaim the

resources it owns. new() knows what kind of object it is creating, because it has

the description of the object as a first parameter. Based on the parameter, we

could use a chain of if statements to handle each creation individually. The draw-

back is that new() would explicitly contain code for each data type which we sup-

port.

delete(), however, has a bigger problem. It, too, must behave differently based

on the type of the object being deleted: for a string the text buffer must be freed;

for an object as used in chapter 1 only the object itself has to be reclaimed; and a

set may have acquired various chunks of memory to store references to its ele-

ments.

We could give delete() another parameter: either our type descriptor or the

function to do the cleaning up, but this approach is clumsy and error-prone. There

is a much more general and elegant way: each object must know how to destroy

its own resources. Part of each and every object will be a pointer with which we

can locate a clean-up function. We call such a function a destructor for the object.

Now new() has a problem. It is responsible for creating objects and returning

pointers that can be passed to delete(), i.e., new() must install the destructor infor-

mation in each object. The obvious approach is to make a pointer to the destructor

part of the type descriptor which is passed to new(). So far we need something like

the following declarations:

struct type {

size_t size; /* size of an object */

void (* dtor) (void *); /* destructor */

};

struct String {

char * text; /* dynamic string */

const void * destroy; /* locate destructor */

};

struct Set {

... information ...

const void * destroy; /* locate destructor */

};

___________________________________________________________________________

2 Dynamic Linkage — Generic Functions

It looks like we have another problem: somebody needs to copy the destructor

pointer dtor from the type description to destroy in the new object and the copy

may have to be placed into a different position in each class of objects.

Initialization is part of the job of

new() and different types require different work

— new() may even require different arguments for different types:

new(Set); /* make a set */

new(String, "text"); /* make a string */

For initialization we use another type-specific function which we will call a

construc-

tor. Since constructor and destructor are type-specific and do not change, we pass

both to new() as part of the type description.

Note that constructor and destructor are not responsible for acquiring and

releasing the memory for an object itself — this is the job of new() and delete().

The constructor is called by new() and is only responsible for initializing the memory

area allocated by new(). For a string, this does involve acquiring another piece of

memory to store the text, but the space for struct String itself is allocated by

new(). This space is later freed by delete(). First, however, delete() calls the des-

tructor which essentially reverses the initialization done by the constructor before

delete() recycles the memory area allocated by new().

2.2 Methods, Messages, Classes and Objects

delete() must be able to locate the destructor without knowing what type of object

it has been given. Therefore, revising the declarations shown in section 2.1, we

must insist that the pointer used to locate the destructor must be at the beginning

of all objects passed to delete(), no matter what type they have.

What should this pointer point to? If all we have is the address of an object,

this pointer gives us access to type-specific information for the object, such as its

destructor function. It seems likely that we will soon invent other type-specific

functions such as a function to display objects, or our comparison function differ(),

or a function clone() to create a complete copy of an object. Therefore we will use

a pointer to a table of function pointers.

Looking closely, we realize that this table must be part of the type description

passed to new(), and the obvious solution is to let an object point to the entire type

description:

struct Class {

size_t size;

void * (* ctor) (void * self, va_list * app);

void * (* dtor) (void * self);

void * (* clone) (const void * self);

int (* differ) (const void * self, const void * b);

};

struct String {

const void * class; /* must be first */

char * text;

};

___________________________________________________________________________

2.3 Selectors, Dynamic Linkage, and Polymorphisms

struct Set {

const void * class; /* must be first */

...

};

Each of our objects starts with a pointer to its own type description, and through

this type description we can locate type-specific information for the object:

.size is

the length that new() allocates for the object; .ctor points to the constructor called

by new() which receives the allocated area and the rest of the argument list passed

to new() originally; .dtor points to the destructor called by delete() which receives

the object to be destroyed; .clone points to a copy function which receives the

object to be copied; and .differ points to a function which compares its object to

something else.

Looking down this list, we notice that every function works for the object

through which it will be selected. Only the constructor may have to cope with a

partially initialized memory area. We call these functions methods for the objects.

Calling a method is termed a message and we have marked the receiving object of

the message with the parameter name self. Since we are using plain C functions,

self need not be the first parameter.

Many objects will share the same type descriptor, i.e., they need the same

amount of memory and the same methods can be applied to them. We call all

objects with the same type descriptor a class; a single object is called an instance

of the class. So far a class, an abstract data type, and a set of possible values

together with operations, i.e., a data type, are pretty much the same.

An object is an instance of a class, i.e., it has a state represented by the

memory allocated by new() and the state is manipulated with the methods of its

class. Conventionally speaking, an object is a value of a particular data type.

2.3 Selectors, Dynamic Linkage, and Polymorphisms

Who does the messaging? The constructor is called by new() for a new memory

area which is mostly uninitialized:

void * new (const void * _class, ...)

{ const struct Class * class = _class;

void * p = calloc(1, class —> size);

assert(p);

* (const struct Class **) p = class;

if (class —> ctor)

{ va_list ap;

va_start(ap, _class);

p = class —> ctor(p, & ap);

va_end(ap);

}

return p;

}

The existence of the struct Class pointer at the beginning of an object is extremely

important. This is why we initialize this pointer already in new():

___________________________________________________________________________

2 Dynamic Linkage

— Generic Functions

•p

object

•

...........

class

size

ctor

dtor

clone

differ

struct Class

The type description class at the right is initialized at compile time. The object is

created at run time and the dashed pointers are then inserted. In the assignment

* (const struct Class **) p = class;

p points to the beginning of the new memory area for the object. We force a

conversion of p which treats the beginning of the object as a pointer to a struct

Class and set the argument class as the value of this pointer.

Next, if a constructor is part of the type description, we call it and return its

result as the result of new(), i.e., as the new object. Section 2.6 illustrates that a

clever constructor can, therefore, decide on its own memory management.

Note that only explicitly visible functions like new() can have a variable parame-

ter list. The list is accessed with a va_list variable ap which is initialized using the

macro va_start() from stdarg.h. new() can only pass the entire list to the construc-

tor; therefore, .ctor is declared with a va_list parameter and not with its own vari-

able parameter list. Since we might later want to share the original parameters

among several functions, we pass the address of ap to the constructor — when it

returns, ap will point to the first argument not consumed by the constructor.

delete() assumes that each object, i.e., each non-null pointer, points to a type

description. This is used to call the destructor if any exists. Here, self plays the

role of p in the previous picture. We force the conversion using a local variable cp

and very carefully thread our way from self to its description:

void delete (void * self)

{ const struct Class ** cp = self;

if (self && * cp && (* cp) —> dtor)

self = (* cp) —> dtor(self);

free(self);

}

The destructor, too, gets a chance to substitute its own pointer to be passed to

free() by delete(). If the constructor decides to cheat, the destructor thus has a

chance to correct things, see section 2.6. If an object does not want to be deleted,

its destructor would return a null pointer.

All other methods stored in the type description are called in a similar fashion.

In each case we have a single receiving object self and we need to route the

method call through its descriptor:

剩余220页未读，继续阅读

吴铭仕

粉丝: 4
资源: 29

使用C语言实现面向对象编程

"C核心编程.pdf：探索面向对象技术，解析内存分区模型

C语言面向对象编程教程解析

嵌入式系统中C语言面向对象编程资料解析

轻量级的面向对象C语言编程框架.pdf

面向对象编程实验报告.pdf

C语言与面向对象编程.pdf

用C语言实现面向对象编程.pdf

Linux下的类C语言编程.pdf

嵌入式C语言中的面向对象与多线程编程.pdf

matlab面向对象编程.pdf

最新资源