void max(float4 *res,
float4 tmp0x, float4 tmp0y, float4 tmp0z, float4 tmp0w,
float4 tmp1x, float4 tmp1y, float4 tmp1z, float4 tmp1w)
{
res[0] = maxvec(tmp0x, tmp1x);
res[1] = maxvec(tmp0y, tmp1y);
res[2] = maxvec(tmp0z, tmp1z);
res[3] = maxvec(tmp0w, tmp1w);
}
bool
ImageBufAlgo::clamp (ImageBuf &dst, const ImageBuf &src,
float min, float max,
bool clampalpha01, ROI roi, int nthreads)
{
std::vector<float> minvec (src.nchannels(), min);
std::vector<float> maxvec (src.nchannels(), max);
return clamp (dst, src, &minvec[0], &maxvec[0], clampalpha01, roi, nthreads);
}
int btPersistentManifold::sortCachedPoints(const btManifoldPoint& pt)
{
//calculate 4 possible cases areas, and take biggest area
//also need to keep 'deepest'
int maxPenetrationIndex = -1;
#define KEEP_DEEPEST_POINT 1
#ifdef KEEP_DEEPEST_POINT
btScalar maxPenetration = pt.getDistance();
for (int i=0;i<4;i++)
{
if (m_pointCache[i].getDistance() < maxPenetration)
{
maxPenetrationIndex = i;
maxPenetration = m_pointCache[i].getDistance();
}
}
#endif //KEEP_DEEPEST_POINT
btScalar res0(btScalar(0.)),res1(btScalar(0.)),res2(btScalar(0.)),res3(btScalar(0.));
if (maxPenetrationIndex != 0)
{
btVector3 a0 = pt.m_localPointA-m_pointCache[1].m_localPointA;
btVector3 b0 = m_pointCache[3].m_localPointA-m_pointCache[2].m_localPointA;
btVector3 cross = a0.cross(b0);
res0 = cross.length2();
}
if (maxPenetrationIndex != 1)
{
btVector3 a1 = pt.m_localPointA-m_pointCache[0].m_localPointA;
btVector3 b1 = m_pointCache[3].m_localPointA-m_pointCache[2].m_localPointA;
btVector3 cross = a1.cross(b1);
res1 = cross.length2();
}
if (maxPenetrationIndex != 2)
{
btVector3 a2 = pt.m_localPointA-m_pointCache[0].m_localPointA;
btVector3 b2 = m_pointCache[3].m_localPointA-m_pointCache[1].m_localPointA;
btVector3 cross = a2.cross(b2);
res2 = cross.length2();
}
if (maxPenetrationIndex != 3)
{
btVector3 a3 = pt.m_localPointA-m_pointCache[0].m_localPointA;
btVector3 b3 = m_pointCache[2].m_localPointA-m_pointCache[1].m_localPointA;
btVector3 cross = a3.cross(b3);
res3 = cross.length2();
}
btVector4 maxvec(res0,res1,res2,res3);
int biggestarea = maxvec.closestAxis4();
return biggestarea;
}
bool
ImageBufAlgo::clamp (ImageBuf &dst, float min, float max,
bool clampalpha01, ROI roi, int nthreads)
{
IBAprep (roi, &dst);
std::vector<float> minvec (dst.nchannels(), min);
std::vector<float> maxvec (dst.nchannels(), max);
OIIO_DISPATCH_TYPES ("clamp", clamp_, dst.spec().format, dst,
&minvec[0], &maxvec[0], clampalpha01, roi, nthreads);
return false;
}
void lit(float4 *res,
float4 tmp0x, float4 tmp0y, float4 tmp0z, float4 tmp0w)
{
const float4 zerovec = (float4) {0.0, 0.0, 0.0, 0.0};
const float4 min128 = (float4) {-128.f, -128.f, -128.f, -128.f};
const float4 plus128 = (float4) {128.f, 128.f, 128.f, 128.f};
res[0] = (float4){1.0, 1.0, 1.0, 1.0};
if (tmp0x.x > 0) {
float4 tmpy = maxvec(tmp0y, zerovec);
float4 tmpw = minvec(tmp0w, plus128);
tmpw = maxvec(tmpw, min128);
res[1] = tmp0x;
res[2] = powvec(tmpy, tmpw);
} else {
res[1] = zerovec;
res[2] = zerovec;
}
res[3] = (float4){1.0, 1.0, 1.0, 1.0};
}
void CameraTool::setCameraConstraint ( int nodeid, float percentOfView )
{
float minarr[3], maxarr[3];
get_bbox ( nodeid, minarr, maxarr );
SGR::vec3f minvec(minarr), maxvec(maxarr);
SGR::vec3f sz = (maxvec - minvec) / percentOfView;
SGR::vec3f center = ( minvec + maxvec ) / 2.0f;
QSize wndsize ( _pview->getWidth(), _pview->getHeight() );
if ( wndsize.width() > wndsize.height() )
sz.x ( (wndsize.width() / wndsize.height()) * sz.y () );
else
sz.y ( (wndsize.height() / wndsize.width()) * sz.x () );
_minTranslate = center - (sz / 2.0f);
_maxTranslate = center + (sz / 2.0f);
_minScale = calcScale ( _minTranslate, _maxTranslate );
_maxScale = 1;
_isInConstraintMode = true;
}
void VarianceDecompInOrthoBasis (int *param, double *z, double *matvp,
double *phylogram, double *phylo95,double *sig025, double *sig975,
double *R2Max, double *SkR2k, double*Dmax, double *SCE, double *ratio)
{
/* param contient 4 entiers : nobs le nombre de points, npro le nombre de vecteurs
nrepet le nombre de permutations, posinega la nombre de vecteurs de la classe posi
qui est nul si cette notion n'existe pas. Exemple : la base Bscores d'une phylogénie a posinega = 0
mais la base Ascores a posinega à prendre dans Adim
z est un vecteur à nobs composantes de norme 1
pour la pondération uniforme. matvp est une matrice nobsxnpro contenant en
colonnes des vecteurs orthonormés pour la pondération uniforme. En géné
La procédure placera
dans phylogram les R2 de la décomposition de z dans la base matvp
dans phylo95 les quantiles 0.95 des R2
dans sig025 les quantiles 0.025 des R2 cumulés
dans sig975 les quantiles 0.975 des R2 cumulés
Ecrit à l'origine pour les phylogénies
peut servir pour une base de vecteurs propres de voisinage */
/* Declarations des variables C locales */
int nobs, npro, nrepet, i, j, k, n1, n2, n3, n4;
int irepet, posinega, *numero, *vecrepet;
double **vecpro, *zperm, *znorm;
double *locphylogram, *modelnul;
double a1, provi, **simul, *copivec, *copicol;
/* Allocation memoire pour les variables C locales */
nobs = param[0];
npro = param [1];
nrepet = param [2];
posinega = param[3];
vecalloc (&znorm, nobs);
vecalloc (&zperm, nobs);
vecalloc (&copivec, npro);
vecalloc (&copicol, nrepet);
taballoc (&vecpro, nobs, npro);
taballoc (&simul, nrepet, npro);
vecalloc (&locphylogram, npro);
vecalloc (&modelnul, npro);
vecintalloc (&numero, nobs);
vecintalloc (&vecrepet, nrepet);
/* Définitions des variables C locales */
for (i = 1 ; i<= nobs; i++) znorm[i] = z[i-1];
for (i = 1 ; i<= npro; i++) modelnul[i] = (double) i/ (double) npro;
k = 0;
for (j=1; j<=npro; j++) {
for (i=1; i<=nobs; i++) {
vecpro[i][j] = matvp[k] ;
k = k+1 ;
}
}
/* calcul du phylogramme observé */
for (j = 1; j<= npro; j++) {
provi = 0;
for (i=1; i<=nobs; i++) provi = provi + vecpro[i][j]*znorm[i];
provi = provi*provi/nobs/nobs;
locphylogram[j] = provi;
}
for (i =1 ; i<= npro ; i++) phylogram[i-1] = locphylogram[i];
/* calcul des simulations
Chaque ligne de simul est un phylogramme après permutation des données */
for (irepet=1; irepet<=nrepet; irepet++) {
getpermutation (numero, irepet);
vecpermut (znorm, numero, zperm);
provi = 0;
for (j = 1; j<= npro; j++) {
provi = 0;
for (i=1; i<=nobs; i++) provi = provi + vecpro[i][j]*zperm[i];
provi = provi*provi/nobs/nobs;
simul[irepet][j] = provi;
}
}
/* calcul du test sur le max du phylogramme */
for (irepet=1; irepet<=nrepet; irepet++) {
for (j=1; j<=npro; j++) copivec[j] = simul[irepet][j];
R2Max[irepet] = maxvec(copivec);
provi=0;
for (j=1; j<=npro; j++) provi = provi + j*simul[irepet][j];
SkR2k[irepet] =provi;
if (posinega>0) {
provi=0;
for (j=1; j<posinega; j++) provi = provi + simul[irepet][j];
ratio[irepet] = provi;
}
}
R2Max[0] = maxvec(locphylogram);
provi=0;
for (j=1; j<=npro; j++) provi = provi + j*locphylogram[j];
SkR2k[0] =provi;
if (posinega>0) {
provi=0;
for (j=1; j<posinega; j++) provi = provi + locphylogram[j];
ratio[0] = provi;
}
/* quantiles 95 du sup */
n1 = (int) floor (nrepet*0.95);
n2 = (int) ceil (nrepet*0.95);
for (i =1; i<=npro; i++) {
for (irepet = 1; irepet<= nrepet; irepet++) {
copicol[irepet] = simul [irepet][i];
}
trirap (copicol, vecrepet);
phylo95[i-1] = 0.5*(copicol[n1]+copicol[n2]);
}
for (irepet=1; irepet<=nrepet; irepet++) {
provi = 0;
for (j=1; j<=npro; j++) {
provi = provi + simul[irepet][j];
copivec[j] = provi;
}
for (j=1; j<=npro; j++) simul[irepet][j] = copivec[j];
}
n1 = (int) floor (nrepet*0.025);
n2 = (int) ceil (nrepet*0.025);
n3 = (int) floor (nrepet*0.975);
n4 = (int) ceil (nrepet*0.975);
/* quantiles 2.5 du cumul */
for (i =1; i<=npro; i++) {
for (irepet = 1; irepet<= nrepet; irepet++) {
copicol[irepet] = simul [irepet][i];
}
trirap (copicol, vecrepet);
sig025[i-1] = 0.5*(copicol[n1]+copicol[n2]);
sig975[i-1] = 0.5*(copicol[n3]+copicol[n4]);
}
provi = 0;
for (j=1; j<=npro; j++) {
a1 = modelnul[j];
provi = provi + locphylogram[j];
locphylogram[j] = provi-a1;
for (irepet = 1; irepet<= nrepet; irepet++) {
simul [irepet][j] = simul [irepet][j]-a1;
}
}
/* simul contient maintenant les cumulés simulés en écarts */
/* locphylogram contient maintenant les cumulés observés en écart*/
/* Dmax */
for (j=1; j<=npro; j++) {
for (irepet=1; irepet<=nrepet; irepet++) {
for (j=1; j<=npro; j++) copivec[j] = simul[irepet][j];
Dmax[irepet] = maxvec(copivec);
provi=0;
for (j=1; j<=npro; j++) provi = provi + copivec[j]* copivec[j];
SCE[irepet] =provi;
}
}
Dmax[0] = maxvec (locphylogram);
provi=0;
for (j=1; j<=npro; j++) provi = provi +locphylogram[j]*locphylogram[j];
SCE[0] =provi;
/* retour */
freevec (znorm);
freevec (modelnul);
freevec(copivec);
freevec(copicol);
freevec (zperm);
freetab (vecpro);
freetab (simul);
freevec (locphylogram);
freeintvec (numero);
freeintvec (vecrepet);
}
