Effective STL:Item 16: Know how to pass vector and string data to

 

Since C++was standardized in 1998,the C++elite haven¡¯tbeenterri-bly
subtle in their attempt to nudge programmers away from arrays
and towards vectors. They¡¯ve been similarly overt in trying to get devel-opers
to shift from char* pointers to string objects. There are good rea-sons
for making these changes, including the elimination of common
programming errors (see Item 13) and the ability to take full advan-tage
of the power of the STL algorithms (see, e.g., Item 31).
Still, obstacles remain, and one of the most common is the existence
of legacy C APIs that traffic in arrays and char* pointers instead of vec-tor
and string objects. Such APIs will exist for a long time, so we must
makepeace with them if we aretouse theSTL effectively.
Fortunately, it¡¯s easy. If you have a vector v and you need to get a
pointer to the data in v thatcan be viewedasan array,just use&v[0].
For a string s, the corresponding incantation is simply s.c_str().But
read on. As the fine print in advertising often points out, certain
restrictions apply.
Given
vector<int> v;
the expression v[0] yields a reference to the first element in the vector,
so &v[0] is a pointer to that first element. The elements in a vector are
constrained by the C++ Standard to be stored in contiguous memory,
just like an array, so if we wish to pass v to a C API that looks some-thing
like this,
void doSomething(const int* pInts, size_t numInts);
we can do it like this:
doSomething(&v[0], v.size());
Maybe. Probably. The only sticking point is if v is empty. If it is, v.si ze()
is zero, and &v[0] attempts to produce a pointer to something that
does not exist. Not good. Undefined results. A safer way to code the
call is this:ഊif (!v.empty()) {
doSomething(&v[0], v.size());
}
If you travel in the wrong circles, you may run across shady charac-ters
who will tell you that you can use v.begin() in place of &v[0],
because (these loathsome creatures will tell you) begin returns an iter-ator
into the vector,andforvectors, iterators are really pointers. That¡¯s
often true, but as Item 50 reveals, it¡¯s not always true, and you should
never rely on it. The return type of begin is an iterator, not a pointer,
and you should never use begin when you need to get a pointer to the
data in a vector.If you¡¯redeterminedto typev.begi n() for some reason,
type &*v.begin(), because that will yield the same pointer as &v[0],
though it¡¯s more work for you as a typist and more obscure for people
trying to make sense of your code. Frankly, if you¡¯re hanging out with
people who tell you to use v.begin() instead of &v[0],youneedto
rethink your social circle.
The approach to getting a pointer to container data that works for vec-tors
isn¡¯t reliable for strings, because (1) the data for strings arenot
guaranteed to be stored in contiguous memory, and (2) the internal
representation of a string is not guaranteed to end with a null charac-ter.
This explains the existence of the string member function c_str,
which returns a pointer to the value of the string in a form designed
for C. We can thus pass a string s to this function,
void doSomething(const char *pString);
like this:
doSomething(s.c_str());
This works even if the string is of length zero. In that case, c_str will
return a pointer to a null character. It also works if the string has
embedded nulls. If it does, however, doSomething is likely to interpret
the first embedded null as the end of the string. string objects don¡¯t
care if they contain null characters, but char*-based C APIs do.
Look again at the doSomething declarations:
void doSomething(const int* pInts, size_t numInts);
void doSomething(const char *pString);
In both cases, the pointers being passed are pointers to const.Thevec-tor
or string data are being passed to an API that will read it, not mod-ify
it. This is by far the safest thing to do. For strings, it¡¯s the only thing
to do, because there is no guarantee that c_str yields a pointer to the
internal representation of the string data; it could return a pointer to
an unmodifiable copy ofthe string¡¯s data,one that¡¯scorrectlyformat-ഊted for a C API. (If this makes the efficiency hairs on the back of your
neck rise up in alarm, rest assured that the alarm is probably false. I
don¡¯t know of any contemporary library implementation that takes
advantage of this latitude.)
For a vector, you have a little more flexibility. If you pass v to a C API
that modifies v¡¯s elements, that¡¯s typically okay, but the called routine
must not attempt to change the number of elements in the vector. For
example, it must not try to ¡°create¡± new elements in a vector¡¯s unused
capacity.If it does,v will become internally inconsistent, because it
won¡¯t know its correct size any longer. v.si ze() will yield incorrect
results. And if the called routine attempts to add data to a vector
whose size andcapacity(seeItem14)arethe same,truly horrible
things could happen. I don¡¯t even want to contemplate them. They¡¯re
just too awful.
Did you notice my use of the word ¡°typically¡± in the phrase ¡°that¡¯s typ-ically
okay¡± in the preceding paragraph? Of course you did. Some vec-tors
have extra constraints on their data, and if you pass a vector to
an API that modifies the vector¡¯s data, you must ensure that the addi-tional
constraints continue to be satisfied. For example, Item 23
explains how sorted vectors can often be a viable alternative to asso-ciative
containers, but it¡¯s important for such vectors to remain
sorted. If you pass a sorted vector to an API that may modify the vec-tor¡¯s
data, you¡¯ll need to take into account that the vector may no
longer be sorted after the call has returned.
If you have a vector that you¡¯d like to initialize with elements from a C
API, you can take advantage of the underlying layout compatibility of
vectors andarraysbypassingtothe APIthe storagefor thevector¡¯s
elements:
// C API: this function takes a pointer to an array of at most arraySize
// doubles and writes data to it. It returns the number of doubles written,
// which is never more than maxNumDoubles.
size_t fillArray(double *pArray, size_t arraySize);
vector<double> vd(maxNumDoubles); // create a vector whose
// size is maxNumDoubles
vd.resize(fillArray(&vd[0], vd.size())); // have fillArray write data
// into vd, then resize vd
// to the number of
// elements fillArray wrote
This technique works only for vectors, because only vectors areguar-anteed
to have the same underlying memory layout as arrays. If you
want to initialize a string with data from a C API, however, you can doഊit easily enough. Just have the API put the data into a vector<char>,
then copy the data from the vector to the string:
// C API: this function takes a pointer to an array of at most arraySize
// chars and writes data to it. It returns the number of chars written,
// which is never more than maxNumChars.
size_t fillString(char *pArray, size_t arraySize);
vector<char> vc(maxNumChars); // create a vector whose
// size is maxNumChars
size_t charsWritten = fillString(&vc[0], vc.size()); // have fillString write
// into vc
string s(vc.begin(), vc.begin()+charsWritten); // copy data from vc to s
// via range constructor
// ( see Item 5)
In fact, the idea of having a C API put data into a vector and then copy-ing
the data into the STL container you really want it in always works:
size_t fillArray(double *pArray, size_t arraySize); // as above
vector<double> vd(maxNumDoubles); // also as above
vd.resize(fillArray(&vd[0], vd.size());
deque<double> d(vd.begin(), vd.end()); // copy data into
// deque
list<double> l(vd.begin(), vd.end()); // copy data into list
set<double> s(vd.begin(), vd.end()); // copy data into set
Furthermore, this hints at how STL containers other than vector or
string can pass their data to C APIs. Just copy each container¡¯s data
into a vector, then pass it to the API:
void doSomething(const int* pInts, size_t numInts); // C API (from above)
set<int> intSet; // set that will hold
... // data to pass to API
vector<int> v(intSet.begin(), intSet.end()); // copy set data into
// a vector
if (!v.empty()) doSomething(&v[0], v.size()); // pass the data to
// the API
You could copy the data into an array, too, then pass the array to the
C API, but why would you want to? Unless you know the size of the
container during compilation, you¡¯d have to allocate the array dynam-ically,
and Item 13 explains why you should prefer vectors to dynami-cally
allocated arrays anyway.
内容概要:本文提出了一种基于非合作博弈理论的居民负荷分层调度模型,并结合双层鲸鱼优化算法(Two-level Whale Optimization Algorithm)进行高效求解,模型与算法均通过Matlab代码实现。研究针对电力系统中居民侧用电负荷的复杂调度问题,引入非合作博弈机制刻画各用户之间的利益竞争关系,实现负荷的分层优化分配;同时设计双层优化架构,上层优化资源配置,下层模拟用户自主决策行为,提升了模型的实用性与合理性。通过智能优化算法求解多层级、非凸非线性的博弈模型,有效提高了调度方案的收敛性与全局寻优能力,适用于现代智能电网中的需求侧管理与能源优化场景。; 适合人群:具备电力系统基础理论知识和Matlab编程能力,从事智能电网、能源优化调度、需求侧管理、博弈论应用等方向的科研人员、高校研究生及工程技术人员。; 使用场景及目标:①应用于居民区电力负荷的分层优化调度系统设计与仿真分析;②为非合作博弈在多主体能源系统建模中的应用提供方法论支持;③利用双层鲸鱼算法解决具有嵌套结构的复杂双层优化问题,提升求解效率与调度方案的可行性。; 阅读建议:建议读者结合提供的Matlab代码深入理解模型构建逻辑与算法实现流程,重点关注博弈模型的效用函数设计、纳什均衡求解思路以及双层优化结构的迭代机制,宜配合实际用电数据开展复现实验以验证模型有效性与鲁棒性。
内容概要:本文围绕基于自适应神经模糊推理系统(ANFIS)智能控制器的可再生能源微电网功率管理系统展开研究,结合Simulink仿真实现,深入探讨了微电网中功率的智能调控与经济机组组合调度问题。通过引入ANFIS控制器,有效应对风能、光伏等可再生能源出力的波动性与不确定性,提升系统运行的稳定性与电能质量。研究内容涵盖微电网多源协调控制策略、功率平衡管理、优化调度模型构建及仿真验证,实现了对分布式电源、储能系统和负荷的协同优化,兼顾经济性与可靠性目标,并通过仿真平台验证了所提方法的有效性与优越性。; 适合人群:具备电力系统、自动化或新能源相关专业背景,熟悉Matlab/Simulink仿真环境,从事微电网能量管理、智能控制、能源优化等领域研究的研究生、科研人员及工程技术人员。; 使用场景及目标:①用于高比例可再生能源接入场景下的微电网能量管理系统研发与教学实践;②为实现微电网功率稳定控制与经济高效运行提供先进的智能控制解决方案;③支撑高水平学术论文复现、科研课题攻关及实际工程项目的仿真验证与方案优化。; 阅读建议:建议结合提供的Simulink模型与相关代码进行动手实践,重点关注ANFIS控制器的设计流程、规则库构建与参数调优方法,并通过与传统PID或MPC控制策略的对比实验,深入理解其在动态响应与鲁棒性方面的优势。同时可进一步拓展文中提出的优化调度逻辑,应用于多目标、多约束的复杂实际应用场景中。
内容概要:本文档聚焦于“直流电机双闭环控制Matlab仿真”,系统阐述了基于Matlab/Simulink平台实现直流电机双闭环控制系统(主要包括速度环与电流环)的设计与仿真全过程。通过构建直流电机的数学模型,结合PI控制器进行调控,实现对电机转速和电枢电流的高精度动态控制,验证控制策略的稳定性与响应性能。文档详细介绍了仿真模型的搭建流程、关键参数的整定方法、系统动态波形的分析手段以及仿真结果的有效性验证,体现了经典自动控制理论在实际电机系统中的工程应用,是电机控制与电力电子技术相结合的典型研究案例。; 适合人群:具备自动控制原理、电机与拖动基础、电力电子技术和Matlab/Simulink仿真能力的电气工程、自动化、机电一体化等专业的本科生、研究生及从事电机驱动系统研发的工程技术人员。; 使用场景及目标:①作为高校课程设计或实验教学材料,帮助学生深入理解双闭环调速系统的工作机理与工程实现;②服务于科研项目,为新型电机控制算法(如滑模、模糊PID等)的开发与性能对比提供基础仿真验证平台;③作为工业界产品前期设计的仿真工具,用于评估不同控制策略在动态响应、抗干扰能力和稳态精度方面的可行性。; 阅读建议:建议读者在学习过程中紧密结合自动控制理论知识,亲手在Simulink环境中搭建完整的双闭环仿真模型,通过反复调整PI控制器的比例与积分参数,观察并分析转速、电流的阶跃响应曲线,从而深刻理解反馈控制的本质、系统稳定性条件以及参数整定对动态性能的影响,进而掌握电机控制系统的设计精髓。
内容概要:本文研究了基于Benders分解与输电网运营商(TSO)和配电网运营商(DSO)协调机制的不确定环境下输配电网双层优化模型,旨在提升高比例可再生能源接入背景下电网系统的协调性与鲁棒性。模型上层以系统整体经济性为目标进行优化调度,下层采用Benders分解实现TSO与DSO之间的信息交互与协同决策,通过引入割平面迭代机制保障求解的收敛性与全局最优性。研究充分考虑新能源出力与负荷需求的不确定性,构建了具有强适应性的双层优化框架,并基于Matlab完成了模型的编程实现与仿真验证,有效解决了多主体、多层级、多不确定性因素耦合下的电力系统优化调度难题。; 适合人群:具备电力系统分析、运筹学与优化理论基础,熟悉Matlab编程环境,从事智能电网、能源互联网、分布式能源集成、电力市场等方向的研究生、科研人员及工程技术人员。; 使用场景及目标:①研究高渗透率可再生能源条件下输配电网协同优化调度策略;②掌握Benders分解在电力系统双层优化建模中的应用方法与实现技巧;③构建TSO-DSO多主体协调机制,实现跨层级电网资源的高效互动与决策解耦;④提升对不确定性建模、分解算法设计及大规模优化问题求解能力。; 阅读建议:建议读者结合Matlab代码逐模块剖析模型构建流程,重点理解Benders割的生成逻辑、主从问题的信息传递机制及收敛判据设定,推荐在标准IEEE测试系统上复现实验以深入掌握模型特性与算法性能。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值