Qt容器练习

#include <QtCore/QCoreApplication> #include<QVector> #include<QQueue> #include<QStack> #include<QMap> #include<QString> #include<QtAlgorithms> #include<iostream> #include<QString> #include<QList> #include<QStringList> using namespace std; void print(QVector<double> &v) { for( QVector<double>::const_iterator it= v.begin(); it != v.end(); it++ ) cout << *it << " "; cout << "v.size() = " << v.size(); cout << endl; } void Jprint( QVector<double> &v) { QVectorIterator<double> it(v); while( it.hasNext() ) { double val; val = it.next(); cout << val <<" "; } cout << endl; } void stringTest() { cout <<endl << endl << endl << "-------------string Test--------------------" << endl; QString str = QString(" a%1-%2A friend is never known till ").arg(2.2).arg(3); str += "a man "; str.append("has need"); cout << qPrintable(str) <<endl<< endl; cout << "qPrintable(str.toUpper()) :\n" << qPrintable(str.toUpper()) << endl<<endl; cout << "qPrintable(str.trimmed()) :\n" << qPrintable(str.trimmed()) <<endl<< endl; cout << "qPrintable(str.simplified()) :\n" << qPrintable(str.simplified()) <<endl<< endl; cout << "qPrintable(str.mid(15)) :\n" <<qPrintable(str.mid(15)) << endl<<endl; cout << "qPrintable(str.right(5)) :\n" <<qPrintable(str.right(5)) <<endl<< endl; cout << "qPrintable(str.left(15)) :\n" <<qPrintable(str.left(15)) << endl<<endl; cout << "qPrintable(str.replace(a,)) :\n" <<qPrintable(str.replace("a","A")) <<endl<< endl; QString str1 = QString::number(22.0125); cout << " str1 = QString::number(22.0125) :\n" << qPrintable(str1) <<endl<< endl; str1.insert(2,"sunny"); cout << "str1.insert(2,\" sunny \"):\n "<< qPrintable(str1) <<endl<< endl; cout << "str1.indexOf(\"2\"):\n" <<str1.indexOf("5") << endl<< endl; } int main(int argc, char *argv[]) { QCoreApplication a(argc, argv); QVector<double> v(5); v.fill(10.0); print(v); v.push_front(30.0); v.push_back(20.0); print(v); //QVector 支持push_front v.remove( 2 ,2); v.insert(v.begin() + 1, 15.0); print(v); v.replace(3,0.01); print(v); Jprint(v); cout << " the result of qSort(v.begin(), v.end()):" << endl; qSort(v.begin(), v.end()); Jprint(v); //test qLess cout << "the result of qSort<v.begin(), v.end(), qLess<int>()) :" << endl; qSort(v.begin(), v.end(), qLess<int>()); Jprint(v); //test qGreater cout << "the result of qSort<v.begin(), v.end(), qGreater<int>()) :" << endl; qSort(v.begin(), v.end(), qGreater<int>()); Jprint(v); cout << endl << endl; //test qCount int countOf10 = 0; qCount( v.begin(), v.end(), 10, countOf10); cout << "the result of qCount with keyvalue 10 = " << countOf10 << endl << endl; //qDeleteAll just can delete pointer // qDeleteAll(v.begin(), v.end()); //cout << "After qDeleteAll, v.size() = " << v.size() << " v.capacity() = " << v.capacity() << endl; //test qFind cout << "call qFind with parameter ( v.begin(), v.end(), 10.0):" << endl; QVector<double>::iterator it = qFind(v.begin(), v.end(), 10.0); if( it == v.end()) { cout << "not find " <<endl; } else { cout << "find, keyword = " << 10.0 << endl; } //test qCopy, QStringList cout << "Copy to QVector<QString> from QStringList :" << endl; QStringList list; list << "one" << "two" << "three" << "four" << "five" << "six" << "seven" << "eight" << "nine" << "ten"; QVector<QString> vect1(list.size()); qCopy(list.begin(), list.end(), vect1.begin()); //test foreach foreach( QString str, vect1) { cout << qPrintable( str ) <<" "; } stringTest(); return a.exec(); }



【无人机】基于改进粒子群算法的无人机路径规划研究[遗传算法、粒子群算法进行比较](Matlab代码实现)内容概要:本文围绕基于改进粒子群算法的无人机路径规划展开研究,重点探讨了在复杂环境中利用改进粒子群算法(PSO)实现无人机三维路径规划的方法,并将其与遗传算法(GA)、标准粒子群算法等传统优化算法进行对比分析。研究内容涵盖路径规划的多目标优化、避障策略、航路点约束以及算法收敛性寻优能力的评估,所有实验均通过Matlab代码实现,提供了完整的仿真验证流程。文章还提到了多种智能优化算法在无人机路径规划中的应用比较,突出了改进PSO在收敛速度全局寻优方面的优势。; 适合人群:具备一定Matlab编程基础优化算法知识的研究生、科研人员及从事无人机路径规划、智能优化算法研究的相关技术人员。; 使用场景及目标:①用于无人机在复杂地形或动态环境下的三维路径规划仿真研究;②比较不同智能优化算法(如PSO、GA、蚁群算法、RRT等)在路径规划中的性能差异;③为多目标优化问题提供算法选型改进思路。; 阅读建议:建议读者结合文中提供的Matlab代码进行实践操作,重点关注算法的参数设置、适应度函数设计及路径约束处理方式,同时可参考文中提到的多种算法对比思路,拓展到其他智能优化算法的研究与改进中。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值