购物车系统中的用户类，private Integer id private Product product private String shopname private Double shopprice
标签： 用户
上传时间： 2017-08-03
上传用户：从此走出阴霾
Abtract - We propose a new family of fi lter banks, named NDFB, that can achieve the directional decomposition of arbitrary N-dimensional (N ≥ 2) signals with a simple and effi cient tree-structured construction.
标签： direction Abtract propose achieve
上传时间： 2014-01-15
上传用户：凤临西北
编写一个程序，输出基本数据类型char, short, int, long, float, double和指针类型void *, char *, short *, int *, long *, float *, double *的数据类型的长度。
上传时间： 2013-12-26
上传用户：pompey
Program helping you to remember the route. It cab be route from conference room to coffee-room, it can be tourist trip, it can be pathway in labyrinth. during first traversal you make notes in you phone, specifying direction of movement and target of each step. Phone remembers how much time each steps takes. Then you can just inspect information about this trip and check duration of each stage and the whole trip. You can also replay it in forward and backward direction. So if somebody show you the shortest way to coffee machine, you can easily find the way back and can repeat this trip in future.
标签： route coffee-room conference remember
上传时间： 2014-01-05
上传用户：1159797854
第一章关键字...................................................................................................................................9 1.1，最宽恒大量的关键字----auto..........................................................................................11 1.2，最快的关键字---- register............................................................................................... 11 1.2.1，皇帝身边的小太监----寄存器............................................................................. 11 1.2.2，使用register 修饰符的注意点.............................................................................11 1.3，最名不符实的关键字----static........................................................................................12 1.3.1，修饰变量...............................................................................................................12 1.3.2，修饰函数...............................................................................................................13 1.4，基本数据类型----short、int、long、char、float、double........................................... 13 1.4.1，数据类型与“模子”............................................................................................... 14 1.4.2，变量的命名规则...................................................................................................14 1.5，最冤枉的关键字----sizeof...............................................................................................18 1.5.1，常年被人误认为函数...........................................................................................18 1.5.2，sizeof（int）*p 表示什么意思？........................................................................18 1.4，signed、unsigned 关键字................................................................................................19 1.6，if、else 组合.................................................................................................................... 20 1.6.1，bool 变量与“零值”进行比较...............................................................................20 1.6.2, float 变量与“零值”进行比较.................................................................................21 1.6.3，指针变量与“零值”进行比较...............................................................................21 1.6.4，else 到底与哪个if 配对呢？...............................................................................22 1.6.5，if 语句后面的分号............................................................................................... 23 1.6.6，使用if 语句的其他注意事项.............................................................................. 24 1.7，switch、case 组合........................................................................................................... 24 1.7.1，不要拿青龙偃月刀去削苹果.............................................................................. 24 1.7.2，case 关键字后面的值有什么要求吗？.............................................................. 25 1.7.3，case 语句的排列顺序...........................................................................................25 1.7.4，使用case 语句的其他注意事项..........................................................................27 1.8，do、while、for 关键字................................................................................................... 28 1.8.1，break 与continue 的区别.....................................................................................28 1.8.2，循环语句的注意点...............................................................................................29 1.9，goto 关键字......................................................................................................................30 1.10，void 关键字....................................................................................................................31 1.10.1，void a？............................................................................................................31 1.10，return 关键字................................................................................................................. 34 1.11，const 关键字也许该被替换为readolny....................................................................... 34 1.11.2，节省空间，避免不必要的内存分配，同时提高效率.................................... 35 1.12，最易变的关键字----volatile.......................................................................................... 36 1.13，最会带帽子的关键字----extern.................................................................................... 37 1.14，struct 关键字..................................................................................................................38
标签： c语言深度剖析
上传时间： 2015-05-01
上传用户：cascas
#include "iostream" using namespace std; class Matrix { private: double** A; //矩阵A double *b; //向量b public: int size; Matrix(int ); ~Matrix(); friend double* Dooli(Matrix& ); void Input(); void Disp(); }; Matrix::Matrix(int x) { size=x; //为向量b分配空间并初始化为0 b=new double [x]; for(int j=0;j<x;j++) b[j]=0; //为向量A分配空间并初始化为0 A=new double* [x]; for(int i=0;i<x;i++) A[i]=new double [x]; for(int m=0;m<x;m++) for(int n=0;n<x;n++) A[m][n]=0; } Matrix::~Matrix() { cout<<"正在析构中~~~~"<<endl; delete b; for(int i=0;i<size;i++) delete A[i]; delete A; } void Matrix::Disp() { for(int i=0;i<size;i++) { for(int j=0;j<size;j++) cout<<A[i][j]<<" "; cout<<endl; } } void Matrix::Input() { cout<<"请输入A:"<<endl; for(int i=0;i<size;i++) for(int j=0;j<size;j++){ cout<<"第"<<i+1<<"行"<<"第"<<j+1<<"列:"<<endl; cin>>A[i][j]; } cout<<"请输入b:"<<endl; for(int j=0;j<size;j++){ cout<<"第"<<j+1<<"个:"<<endl; cin>>b[j]; } } double* Dooli(Matrix& A) { double *Xn=new double [A.size]; Matrix L(A.size),U(A.size); //分别求得U，L的第一行与第一列 for(int i=0;i<A.size;i++) U.A[0][i]=A.A[0][i]; for(int j=1;j<A.size;j++) L.A[j][0]=A.A[j][0]/U.A[0][0]; //分别求得U，L的第r行，第r列 double temp1=0,temp2=0; for(int r=1;r<A.size;r++){ //U for(int i=r;i<A.size;i++){ for(int k=0;k<r-1;k++) temp1=temp1+L.A[r][k]*U.A[k][i]; U.A[r][i]=A.A[r][i]-temp1; } //L for(int i=r+1;i<A.size;i++){ for(int k=0;k<r-1;k++) temp2=temp2+L.A[i][k]*U.A[k][r]; L.A[i][r]=(A.A[i][r]-temp2)/U.A[r][r]; } } cout<<"计算U得:"<<endl; U.Disp(); cout<<"计算L的:"<<endl; L.Disp(); double *Y=new double [A.size]; Y[0]=A.b[0]; for(int i=1;i<A.size;i++ ){ double temp3=0; for(int k=0;k<i-1;k++) temp3=temp3+L.A[i][k]*Y[k]; Y[i]=A.b[i]-temp3; } Xn[A.size-1]=Y[A.size-1]/U.A[A.size-1][A.size-1]; for(int i=A.size-1;i>=0;i--){ double temp4=0; for(int k=i+1;k<A.size;k++) temp4=temp4+U.A[i][k]*Xn[k]; Xn[i]=(Y[i]-temp4)/U.A[i][i]; } return Xn; } int main() { Matrix B(4); B.Input(); double *X; X=Dooli(B); cout<<"~~~~解得:"<<endl; for(int i=0;i<B.size;i++) cout<<"X["<<i<<"]:"<<X[i]<<" "; cout<<endl<<"呵呵呵呵呵"; return 0; }
标签： 道理特分解法
上传时间： 2018-05-20
上传用户：Aa123456789
参照栈类模板的例子编写一个队列类模板class <T> Queue，私有成员包括：队首指针Front，队尾指针Tail，队列容积max。实现：构造函数Queue，复制构造函数Queue，析构函数~Queue，入队函数In，出队函数Out（每次出队，后面的元素自动前移一位），判队列空函数Empty。并分别用队列类模板定义int和double对象，通过实例调用各个成员函数。
标签： Queue 函数 double class Front Empty 队列 Tail 模板 Out
上传时间： 2020-05-04
上传用户：1qw2e3r4t5y6u7i8
压缩包中有5篇论文，分别为《Data-driven analysis of variables and dependencies in continuous optimization problems and EDAs》这是一篇博士论文，较为详细的介绍了各种EDA算法；《Anisotropic adaptive variance scaling for Gaussian estimation of distribution algorithm》《Enhancing Gaussian Estimation of Distribution Algorithm by Exploiting Evolution Direction with Archive》《Niching an Archive-based Gaussian Estimation of Distribution Algorithm via Adaptive Clustering》《Supplementary material for Enhancing Gaussian Estimation of Distribution Algorithm by Exploiting Evolution Direction with Archive》《基于一般二阶混合矩的高斯分布估计算法》介绍了一些基于EDA的创新算法。
上传时间： 2020-05-25
上传用户：duwenhao
At present, there is a strong worldwide push toward bringing fiber closer to indi- vidual homes and businesses. Fiber-to-the-Home/Business (FTTH/B) or close to it networks are poised to become the next major success story for optical fiber com- munications. In fact, FTTH connections are currently experiencing double-digit or even higher growth rates, e.g., in the United States the annual growth rate was 112% between September 2006 and September 2007, and their presence can add value of U.S. $4,000–15,000 to the selling price of a home.
标签： Technologies Broadband Networks Access
上传时间： 2020-05-26
上传用户：shancjb
We were on the lookout for ice. I was in a 32 foot sailing yacht with writer and explorer Tristan Gooley, undertaking a double-handed sail from Scotland through the Faroes up to 66 33 45.7 N and the midnight sun. Now sailing out of the Arctic Circle we were approaching Iceland from the north, heading for the Denmark Straits, where ice flowed south. The Admiralty Pilot warned of bergs but the ice charts we had sailed with were over a week old. We needed an update.
标签： Interference Analysis
上传时间： 2020-05-27
上传用户：shancjb
