Method Problem

src/fflib/problem.cpp:13642–13773

Problem::Problem(const C_args * ca,const ListOfId &l,size_t & top) :
op(new C_args(*ca)),
var(l.size()),
type_var(),
VF(false),
offset(align8(top)),
dim( isCompositeProblem(l) ? 6 :  ( isSameDimAndComplexTypeProblem(l).first ? dimProblem(l) : 6 ) )
{
    if( verbosity > 999)  cout << "Problem : ----------------------------- " << top << " dim = " << dim<<" " << nargs <<  endl;
    
    if(dim==6){
        top = offset + sizeof( DataComposite );
    }
    else{
        top = offset + max(sizeof(Data<FESpace>),sizeof(Data<FESpace>));
    }
    bool iscomplex=isSameDimAndComplexTypeProblem(l).second; // iscomplex of the type of argument u1,u2, ... of : problem myproblem([u1,u2],[v1,v2]), ...

    if(dim==2)
        iscomplex=GetBilinearParam<pfer,pfec>(l,name_param,n_name_param,nargs, Nitem,Mitem,var);
    else if (dim==3)
        iscomplex=GetBilinearParam<pf3r,pf3c>(l,name_param,n_name_param,nargs, Nitem,Mitem,var);
    else if (dim==4)  // dim = 4 for a 3D surface problem
        iscomplex=GetBilinearParam<pfSr,pfSc>(l,name_param,n_name_param,nargs, Nitem,Mitem,var);
    else if (dim==5)  // dim = 5 for a 3D curve problem
        iscomplex=GetBilinearParam<pfLr,pfLc>(l,name_param,n_name_param,nargs, Nitem,Mitem,var);
    else if (dim==6){
        if(! isCompositeProblem(l) ){
            cerr << "write our problem/solve in composite form." << endl;
            cerr << "problem pb(<[u1,u2],[u3]>,<[v1,v2],[v3]>) = " << endl;
            ffassert(0);
        }
        ffassert( (isCompositeProblem(l) == true) ); // ???
        Nitem = 0; // initialize value to zero
        Mitem = 0; // initialize value
        
        KN<size_t> UhNbItem;
        KN<size_t> VhNbItem;
        GetBilinearParamCompositeFESpace(l,name_param,n_name_param,nargs, Nitem,Mitem,var,type_var,UhNbItem,VhNbItem);
        
        // recuperation de la taille des FESpaces 
        int NpUh = (int) UhNbItem.size(); 
        int NpVh = (int) VhNbItem.size(); 

        KN<int> indexBlockUh(Nitem);
        KN<int> indexBlockVh(Mitem);
        KN<int> localIndexInTheBlockUh(Nitem);
        KN<int> localIndexInTheBlockVh(Mitem);

        // index for the construction of the block of Uh
        {
            // ===========================================
            //
            // varf([u0,u1,...,u4], ... ) 
            // varf([ [u0_blk1,u1_blk1],[u0_blk2,u1_blk2,u2_blk2] ], ... ) 

            // u4 correspond to u2_blk2 in the block varf
            // ============================================