// string bpfs(void) const {return _bpfs.value();}
	/// Derive the bpf
	void derive(void) {
		
		std::cout << "compute problem input data : " << _bpfs.value() << " - " << std::endl;
		string str1 = _bpfs.value();
		string str2 (") (");
		string sub1,sub2;
		size_t found;
		
		// different member versions of find in the same order as above:
		found=str1.find(str2);
		if (found!=string::npos)
			cout << "first ))(( found at: " << int(found) << endl;
		sub1 = str1.substr(1,found);
		sub2 =  str1.substr(found +1,str1.size() - found - 2);
		cout << " " << str1.substr(1,found) << endl;
		cout <<" " << str1.substr(found +1,str1.size() - found - 2) << endl;
		
		cout <<"SIZE " << _size.value() << endl;
		
		Bpf bpf0(sub1);
		thebpfs[0]=bpf0;
		profils[0]=bpf0.profil(size() - 1);
		
		Bpf bpf1(sub2);
		thebpfs[1]=bpf1;
		profils[1]=bpf1.profil(size() - 1);
		
		
		bpfs_n = 1;	
	}

 /// Return number of colors
 unsigned int colors(void) const { return _colors.value(); }

 /// Return width
 unsigned int width(void)  const { 
   if (_size.value() == 0)
     return _width.value(); 
   else
     return _size.value(); 
 }

 /// Return height
 unsigned int height(void) const { 
   if (_size.value() == 0)
     return _height.value(); 
   else
     return _size.value(); 
 }

 // Return len2
 unsigned int len2(void) const { return _len2.value(); }

 // Return the start number (0 or 1)
 unsigned int start(void) const { return _start.value(); }

 // Return base to use
 unsigned int base(void) const  { return _base.value();  }

	/// Return number of chords
	unsigned int size(void) const { return _size.value(); }

	/// Return minimum distance
	unsigned int distance(void) const { return _distance.value(); }

	/// Return maximum number of notes
	unsigned int nn(void) const { return _nn.value(); }

 /// Return number of bits
 unsigned int bits(void) const { return _bits.value(); }