d3                 51 data/sphere/2014paperALE_sphere/improve_sphere.cpp 		double d1,d2,d3;
d3                 52 data/sphere/2014paperALE_sphere/improve_sphere.cpp 		if( !(line >> d1 >> d2 >> d3) || !(line >> ws).eof() )
d3                 56 data/sphere/2014paperALE_sphere/improve_sphere.cpp 		const double node_norm = sqrt(d1*d1 + d2*d2 + d3*d3);
d3                 59 data/sphere/2014paperALE_sphere/improve_sphere.cpp 		d3 /= node_norm;
d3                 63 data/sphere/2014paperALE_sphere/improve_sphere.cpp 					  << d1 << ' ' << d2 << ' ' << d3;
d3                 27 data/sphere/first_revision/test.cpp 		double d1,d2,d3;
d3                 29 data/sphere/first_revision/test.cpp 		ss >> d1 >> d2 >> d3;
d3                 30 data/sphere/first_revision/test.cpp 		int i1 = d1-1, i2 = d2-1, i3 = d3-1;
d3                122 data/sphere/level_set_test.cpp   double d1, d2, d3;
d3                123 data/sphere/level_set_test.cpp   if(!(iss >> d1 >> d2 >> d3) || !(iss >> std::ws).eof() )
d3                125 data/sphere/level_set_test.cpp   return {d1, d2, d3};
d3                 63 src/maxH_main.cpp 	double d1, d2, d3;
d3                 64 src/maxH_main.cpp 	iss >> d1 >> d2 >> d3;
d3                 65 src/maxH_main.cpp 	T t1(d1), t2(d2), t3(d3);  // this may narrow