测试.cpp

浏览该文件的文档.

//
//  测试.cpp
//  多线程
//
//  Created by 赵明明 on 2023/6/16.
//
 
#include "测试.hpp"
#include "cude_30.hpp"
 
void test_DrawPlane(矩阵* img){
    
    // 准备数据
    D3P* d3p = new D3P();
    //d3p->img=new 矩阵(300,300,(float)0);
    d3p->img = img;
    //float data[]={20,0,70,28,10,20};
    //float data[]={172.59416,208.23482,192.20932,195.64584,193.60979,193.60979,173.83084,206.82564};
    //float data[]={167.77657,209.48589,183.75443,197.52885,192.20932,195.64584,172.59416,208.23482};
    //float data[]={159.98738,210.35248,169.0131,198.87709,183.75443,197.52885,167.77657,209.48589};
    //float data[]={128.40584,208.23482,108.79068,195.64584,117.24558,197.52885,133.22343,209.48589};
    //float data[]={150.5,89.53356,128.40584,92.76518,127.16916,94.17436};
    /*
    float data_0[]={172.59416,208.23482,192.20932,195.64584,193.60979,193.60979,173.83084,206.82564};
    float vns_0[]={-0.353101804477644,0.9240814883102055,0.14625991901178756,-0.6527987287973793,0.7076287060184845,0.2703978876642792,-0.7065841769241161,0.7076281757079974,-0.0,-0.38219478530246154,0.9240814808981521,-0.0};
    */
    for(int i=0;i<1032;i++){
        
        d3p->points_plane= new 矩阵(L[i],2,(data_vt[i]),1);
        d3p->points_plane->取整();
        //cout<<*d3p->points_plane;
        d3p->vns_plane=new 矩阵(L[i],3,vns[i],1);
        //cout<<*(d3p->vns_plane);
        //绘制
        DrawPlane dp=DrawPlane(d3p);
        dp.draw_plane_index(i);
        //cout<<*(d3p->img);
        
    }
    cout<<"test_DrawPlane\n";
}
void test_FillPology(void){
    float data[]={20,0,70,28,10,20};
    矩阵* 多边形顶点=new 矩阵(3,2,data,1);
    FillPology fp=FillPology(多边形顶点);
    cout<<"*多边形顶点"<<endl;
    cout<<*多边形顶点;
    
    fp.fill_test();
    //矩阵* sp=fp.get_select_pos(0);
    矩阵* 左右=fp.get_scan();
    cout<<"扫描出左右边界:";
    cout<<*左右;
    矩阵* sp=fp.get_select_pos_from_scan(左右);
    cout<<"得到多边形内部的点";
    cout<<*sp;
    
    矩阵* img = new 矩阵(50,70,(float)0);
    float color=5;
    fp.fill_color(img, &color);
    cout<<"img\n";
    cout<<*img;
}
 
void test_线(void){
    
    cout<<"求两个点所在直线:"<<endl;
    矩阵 两个点=*(new 矩阵(2,2,(float)0));
    两个点[0]=-3;
    两个点[1]=-1;
    两个点[2]=1;
    两个点[3]=1;
    cout<<两个点<<endl;
    线 line = *(new 线(0,0));
    line.斜率和截距(&两个点);
    cout<<line;
    
    
    cout<<"直线交点";
    线 线1=线(0.2,0.5);
    线 线2=线(-0.2,0);
    矩阵 交点=线1.求交点(线1, 线2);
    cout<<交点<<endl;
    
    
    cout<<"线段交点";
    矩阵 两个点1=*(new 矩阵(2,2,(float)0));
    两个点1[0]=0;
    两个点1[1]=10;
    两个点1[2]=300;
    两个点1[3]=10;
    cout<<"线段1:";
    cout<<两个点1;
    矩阵 两个点2=*(new 矩阵(2,2,(float)0));
    两个点2[0]=20;
    两个点2[1]=0;
    两个点2[2]=10;
    两个点2[3]=20;
    cout<<"线段2:";
    cout<<两个点2;
    
    float 被替换的序号=0;
    //矩阵* 交点1=new 矩阵(1,2,0);
    矩阵* 交点1=线1.线段交点(两个点1, 两个点2,&被替换的序号);
    cout<<"两线段的交点:";
    cout<<*(交点1);
    cout<<"线段1的第几个点可用交点代替:";
    cout<<被替换的序号<<endl;
    
    矩阵 两个点3=*(new 矩阵(2,2,(float)0));
    两个点3[0]=20;
    两个点3[1]=0;
    两个点3[2]=70;
    两个点3[3]=28;
    cout<<"线段3:";
    cout<<两个点3;
    float 被替换的序号2=0;
    矩阵* 交点2=线1.线段交点(两个点1, 两个点3,&被替换的序号2);
    cout<<"两线段的交点:";
    cout<<*(交点2);
    cout<<"线段1的第几个点可用交点代替:";
    cout<<被替换的序号2<<endl;
    
    矩阵* 两个交点=交点1->r_(交点1,交点2);
    cout<<*(两个交点);
    
    
}
void test_单位化(void){
    //float data[]={142.0685,203.69131,134.71452,204.39499,150.5,211.46643};
    float data[]={0,0,1,0.5,0.7,0,2,10,20,20};
    矩阵* 阵=new 矩阵(3,3,data,1);
    cout<<"单位化"<<endl;
    矩阵* 单位=阵->单位化();
    cout<<*单位;
    
    cout<<"点积";
    cout<<*((*单位)["0,:"]->点积(*((*单位)["0,:"])));
    cout<<*((*单位)["0,:"]->点积(*((*单位)["1,:"])));
    cout<<*((*单位)["0,:"]->点积(*((*单位)["2,:"])));
    
}
void test_和(void){
    float data_116[]={142.0685,203.69131,134.71452,204.39499,150.5,211.46643};
    矩阵* 多边形顶点=new 矩阵(3,2,data_116,1);
    矩阵* 和= 多边形顶点->和();
    cout<<*多边形顶点;
    cout<<"多边形顶点->和:"<<endl;
    cout<<*和;
    
    和= 多边形顶点->和(0);
    cout<<"多边形顶点->和:"<<endl;
    cout<<*和;
    
    和= 多边形顶点->和(1);
    cout<<"多边形顶点->和:"<<endl;
    cout<<*和;
    
}
void test_minmax(void){
    float data[]={20,0,70,28,10,20};
    矩阵* 多边形顶点=new 矩阵(3,2,data,1);
    矩阵* minmax=多边形顶点->minmax();
    cout<<"多边形顶点->minmax();"<<endl;
    cout<<*(minmax);
    minmax=多边形顶点->minmax(0);
    cout<<"多边形顶点->minmax(0);"<<endl;
    cout<<*(minmax);
    minmax=多边形顶点->minmax(1);
    cout<<"多边形顶点->minmax(1);"<<endl;
    cout<<*(minmax);
    
    minmax=多边形顶点->minmax(2);
    cout<<"多边形顶点->minmax(2);"<<endl;
    // 由于minmax是空指针，所以类内的宽度和高度都是随机的，所以在按照宽度和高度输出时，就会报错。
    cout<<*(minmax);
    
    
    
    
}
void test_add_sub(void){
    矩阵 m = *(new 矩阵(5,0));
    m.operator[](1)=2;
    m[2]=3;
    矩阵 两个点=*(new 矩阵(5,5,(float)0));
    矩阵 两个点1=*(new 矩阵(5,5,(float)2));
    两个点[0]=-1;
    两个点[1]=-1;
    两个点[2]=-1;
    两个点[-1]=-3;
    cout<<两个点<<endl;
    两个点1[-1]=-3;
    cout<<两个点1<<endl;
    cout<<"两个矩阵相加"<<endl;
    矩阵 果=两个点+两个点1;
    cout<<果<<endl;
    
    矩阵 果加1=两个点+3.5;
    cout<<果加1<<endl;
    
    cout<<"两个矩阵相减"<<endl;
    矩阵 果减 = 两个点-两个点1;
    cout<<果减<<endl;
    矩阵 果减1=两个点-3.5;
    cout<<果减1<<endl;
    
    cout<<"两个矩阵相乘"<<endl;
    矩阵 果乘 = 两个点*两个点1;
    cout<<果乘<<endl;
    矩阵 果乘1=两个点*3.5;
    cout<<果乘1<<endl;
    
    cout<<"两个矩阵相除"<<endl;
    矩阵 果除 = 两个点/两个点1;
    cout<<果除<<endl;
    矩阵 果除1=两个点/3.5;
    cout<<果除1<<endl;
    
    
}
void test_子矩阵(void){
    矩阵 m = *(new 矩阵(5,0));
    m.operator[](1)=2;
    m[2]=3;
    矩阵 两个点=*(new 矩阵(50,50,(float)0));
    两个点[0]=-1;
    两个点[1]=-1;
    两个点[2]=-1;
    两个点[-1]=-3;
    cout<<两个点<<endl;
   
    // 测试输出行或者列
    cout<<"第0,1行"<<endl;
    cout<<*(两个点["0:2,:"])<<endl;
    cout<<*(两个点.行(0,2))<<endl;
    
    cout<<"第47,48,49行"<<endl;
    
    cout<<*(两个点["47:50,:"])<<endl;
    
    
    
    cout<<"第0,1列"<<endl;
    cout<<*(两个点[":,0:2"])<<endl;
    cout<<*(两个点.列(0,2))<<endl;
    
    cout<<"第47,48,49列"<<endl;
    cout<<*(两个点[":,47:50"])<<endl;
    
    
    cout<<"输出1,49,48,2,0行"<<endl;
    cout<<*(两个点.行们(5,1,49,48,2,0));
    cout<<"输出1,49,48,2,0列"<<endl;
    cout<<*(两个点.列们(5,1,49,48,2,0));
    
    cout<<"输出1,49,48,2,0行的第1,49,48,2,0列"<<endl;
    cout<<*((两个点.行们(5,1,49,48,2,0))->列们(5,1,49,48,2,0));
    
    
    cout<<"转置"<<endl;
    cout<<*(两个点.转置())<<endl;
}
void test_c_(void){
    矩阵* 矩阵1=new  矩阵(3,1,(float)0);
    矩阵* 矩阵2=new  矩阵(3,1,(float)2);
    矩阵* 矩阵3=矩阵1->c_(矩阵1,矩阵2);
    cout<<(*矩阵1)<<endl;
    cout<<(*矩阵2)<<endl;
    cout<<(*矩阵3)<<endl;
}
void test_r_(void){
    矩阵* 矩阵1=new  矩阵(3,1,(float)0);
    矩阵* 矩阵2=new  矩阵(3,1,(float)2);
    矩阵* 矩阵3=矩阵1->r_(矩阵1,矩阵2);
    cout<<(*矩阵1)<<endl;
    cout<<(*矩阵2)<<endl;
    cout<<(*矩阵3)<<endl;
    
    矩阵* 矩阵4=new  矩阵(4,2,(float)0);
    矩阵* 矩阵5=new  矩阵(3,1,(float)2);
    矩阵* 矩阵6=矩阵4->r_(矩阵4,矩阵5);
    cout<<(*矩阵4)<<endl;
    cout<<(*矩阵5)<<endl;
    cout<<(*矩阵6)<<endl;
    
}
void test_矩阵(void){
    
    矩阵 m = *(new 矩阵(5,0));
    m.operator[](1)=2;
    m[2]=3;
    矩阵 两个点=*(new 矩阵(2,2,(float)0));
    两个点[0]=0;
    两个点[1]=1;
    两个点[2]=2;
    两个点[-1]=3;
    cout<<两个点.取(1,1)<<endl;
    
    // 测试按照行列输出数据 通过
    cout<<*(两个点["1,1"])<<endl;
    
    // 测试输出行或者列
    cout<<"第0行,第1行"<<endl;
    cout<<*(两个点["0,:"])<<endl;
    cout<<*(两个点["1,:"])<<endl;
    
    cout<<"第0列，第1列"<<endl;
    cout<<*(两个点[":,0"])<<endl;
    cout<<*(两个点[":,1"])<<endl;
    
    
    //测试重载输出 通过
    
    cout<<"输出矩阵:两个点"<<endl;
    cout<<两个点<<endl;
    
    cout<<"第0行-第1行:"<<endl;
    矩阵 果减=*(两个点["0,:"])-*(两个点["1,:"]);
    cout<<果减<<endl;
    
    cout<<"第0列-第1列:"<<endl;
    矩阵 果减1=*(两个点[":,0"])-*(两个点[":,1"]);
    cout<<果减1<<endl;
    
}