void TransposeAxpyContract
( T alpha, const ElementalMatrix<T>& A,
ElementalMatrix<T>& B, bool conjugate )
{
EL_DEBUG_CSE
const Dist U = B.ColDist();
const Dist V = B.RowDist();
if( A.ColDist() == V && A.RowDist() == U )
{
TransposeAxpy( alpha, A, B, conjugate );
}
else if( (A.ColDist() == V && A.RowDist() == Partial(U)) ||
(A.ColDist() == V && A.RowDist() == Collect(U)) ||
(A.RowDist() == U && A.ColDist() == Partial(V)) ||
(A.RowDist() == U && A.ColDist() == Collect(V)) )
{
unique_ptr<ElementalMatrix<T>>
ASumFilt( B.ConstructTranspose(B.Grid(),B.Root()) );
if( B.ColConstrained() )
ASumFilt->AlignRowsWith( B, true );
if( B.RowConstrained() )
ASumFilt->AlignColsWith( B, true );
Contract( A, *ASumFilt );
if( !B.ColConstrained() )
B.AlignColsWith( *ASumFilt, false );
if( !B.RowConstrained() )
B.AlignRowsWith( *ASumFilt, false );
// We should have ensured that the alignments are compatible
TransposeAxpy( alpha, ASumFilt->LockedMatrix(), B.Matrix(), conjugate );
}
else
LogicError("Incompatible distributions");
}
void Contract
( const BlockMatrix<T>& A,
BlockMatrix<T>& B )
{
DEBUG_ONLY(CSE cse("Contract"))
AssertSameGrids( A, B );
const Dist U = B.ColDist();
const Dist V = B.RowDist();
// TODO: Shorten this implementation?
if( A.ColDist() == U && A.RowDist() == V )
{
Copy( A, B );
}
else if( A.ColDist() == U && A.RowDist() == Partial(V) )
{
B.AlignAndResize
( A.BlockHeight(), A.BlockWidth(),
A.ColAlign(), A.RowAlign(), A.ColCut(), A.RowCut(),
A.Height(), A.Width(), false, false );
Zeros( B.Matrix(), B.LocalHeight(), B.LocalWidth() );
AxpyContract( T(1), A, B );
}
else if( A.ColDist() == Partial(U) && A.RowDist() == V )
{
B.AlignAndResize
( A.BlockHeight(), A.BlockWidth(),
A.ColAlign(), A.RowAlign(), A.ColCut(), A.RowCut(),
A.Height(), A.Width(), false, false );
Zeros( B.Matrix(), B.LocalHeight(), B.LocalWidth() );
AxpyContract( T(1), A, B );
}
else if( A.ColDist() == U && A.RowDist() == Collect(V) )
{
B.AlignColsAndResize
( A.BlockHeight(), A.ColAlign(), A.ColCut(), A.Height(), A.Width(),
false, false );
Zeros( B.Matrix(), B.LocalHeight(), B.LocalWidth() );
AxpyContract( T(1), A, B );
}
else if( A.ColDist() == Collect(U) && A.RowDist() == V )
{
B.AlignRowsAndResize
( A.BlockWidth(), A.RowAlign(), A.RowCut(), A.Height(), A.Width(),
false, false );
Zeros( B.Matrix(), B.LocalHeight(), B.LocalWidth() );
AxpyContract( T(1), A, B );
}
else if( A.ColDist() == Collect(U) && A.RowDist() == Collect(V) )
{
Zeros( B, A.Height(), A.Width() );
AxpyContract( T(1), A, B );
}
else
LogicError("Incompatible distributions");
}
/**
GetLastPosition
@param aPos container for the position being returned (with KErrNone return)
@param aOldestValidTime the oldest valid time for a position being returned. If there is a valid position no older than this time, it should be returned.
@param aAllowPartial whether partial updates should be considered
@return ETrue if the fix fulfills the requirements,
*/
TBool CNETResponseHandler::GetLastPosition(TPositionInfoBase& aPos, TTime aOldestValidTime, TBool aAllowPartial)
{
TBool ret = EFalse;
TTime actualTime;
TPositionInfo posInfo;
TPosition pos;
TInt err;
err = iNETDataBus->GetLastPositionInfo(posInfo, actualTime);
if( err == KErrNone && actualTime >= aOldestValidTime) // got a recent enough position
{
posInfo.GetPosition(pos);
if(aAllowPartial || !Partial(pos))// complete enough
{
TRAPD(error, CopyPositionTypes(aPos, posInfo));
if(!error)
{
ret = ETrue;
}
else
{
LBSLOG(ELogP1, "CNetResponseHandler::GetLastPosition() failed to copy position ");
ret = EFalse;
}
}
}
return ret;
}
*/ static void Sort_String(REBVAL *string, REBFLG ccase, REBVAL *skipv, REBVAL *compv, REBVAL *part, REBFLG all, REBFLG rev)
/*
***********************************************************************/
{
REBCNT len;
REBCNT skip = 1;
REBCNT size = 1;
int (*sfunc)(const void *v1, const void *v2);
// Determine length of sort:
len = Partial(string, 0, part, 0);
if (len <= 1) return;
// Skip factor:
if (!IS_NONE(skipv)) {
skip = Get_Num_Arg(skipv);
if (skip <= 0 || len % skip != 0 || skip > len)
Trap_Arg(skipv);
}
// Use fast quicksort library function:
if (skip > 1) len /= skip, size *= skip;
sfunc = rev ? Compare_Chr_Rev : Compare_Chr;
//!!uni - needs to compare wide chars too
qsort((void *)VAL_DATA(string), len, size * SERIES_WIDE(VAL_SERIES(string)), sfunc);
}
void TransposeContract
( const BlockMatrix<T>& A,
BlockMatrix<T>& B, bool conjugate )
{
EL_DEBUG_CSE
const Dist U = B.ColDist();
const Dist V = B.RowDist();
if( A.ColDist() == V && A.RowDist() == Partial(U) )
{
Transpose( A, B, conjugate );
}
else
{
unique_ptr<BlockMatrix<T>>
ASumFilt( B.ConstructTranspose(B.Grid(),B.Root()) );
if( B.ColConstrained() )
ASumFilt->AlignRowsWith( B, true );
if( B.RowConstrained() )
ASumFilt->AlignColsWith( B, true );
Contract( A, *ASumFilt );
if( !B.ColConstrained() )
B.AlignColsWith( *ASumFilt, false );
if( !B.RowConstrained() )
B.AlignRowsWith( *ASumFilt, false );
// We should have ensured that the alignments match
B.Resize( A.Width(), A.Height() );
Transpose( ASumFilt->LockedMatrix(), B.Matrix(), conjugate );
}
}
void VideoFluids::updateField(Matrix& Zn,Matrix& U,Matrix& V)
{
Matrix tmp(height,width),tmp1(height,width);
Matrix result(height,width);
Matrix Ux(height,width),Vy(height,width);
Partial(Zn,tmp,AXIS_X);
DotMul(tmp,U,result);
Partial(Zn,tmp,AXIS_Y);
DotMul(tmp,V,tmp1);
result+=tmp1;
Partial(U,tmp,AXIS_X);
Partial(V,Vy,AXIS_Y);
tmp+=Vy;
DotMul(Zn,tmp,tmp1);
result+=tmp1;
result*=-1;
}
inline double
Timer::Stop()
{
#ifndef RELEASE
CallStackEntry entry("Timer::Stop");
if( !running_ )
LogicError("Tried to stop a timer before starting it");
#endif
const double partial = Partial();
time_ += partial;
running_ = false;
return partial;
}
*/ void Change_Case(REBVAL *out, REBVAL *val, REBVAL *part, REBOOL upper)
/*
** Common code for string case handling.
**
***********************************************************************/
{
REBCNT len;
REBCNT n;
*out = *val;
if (IS_CHAR(val)) {
REBUNI c = VAL_CHAR(val);
if (c < UNICODE_CASES) {
c = upper ? UP_CASE(c) : LO_CASE(c);
}
VAL_CHAR(out) = c;
return;
}
// String series:
if (IS_PROTECT_SERIES(VAL_SERIES(val))) raise Error_0(RE_PROTECTED);
len = Partial(val, 0, part, 0);
n = VAL_INDEX(val);
len += n;
if (VAL_BYTE_SIZE(val)) {
REBYTE *bp = VAL_BIN(val);
if (upper)
for (; n < len; n++) bp[n] = (REBYTE)UP_CASE(bp[n]);
else {
for (; n < len; n++) bp[n] = (REBYTE)LO_CASE(bp[n]);
}
} else {
REBUNI *up = VAL_UNI(val);
if (upper) {
for (; n < len; n++) {
if (up[n] < UNICODE_CASES) up[n] = UP_CASE(up[n]);
}
}
else {
for (; n < len; n++) {
if (up[n] < UNICODE_CASES) up[n] = LO_CASE(up[n]);
}
}
}
}
/* a valid (legal) move. */
int CheckHumanMove(void)
{
int i,full=0,partial=0;
if(jumpptr) {
for(i=0; i<jumpptr; i++) {
if(Match(jumplist[i],hmove)) full=1; else
if(Partial(jumplist[i],hmove,hlen)) partial=1;
}
}
else {
for(i=0; i<moveptr; i++) if(Match(movelist[i],hmove)) full = 1;
}
if(full) return FULL; else
if(partial) return PARTIAL; else
return ILLEGAL;
}
//
// Change_Case: C
//
// Common code for string case handling.
//
void Change_Case(REBVAL *out, REBVAL *val, REBVAL *part, REBOOL upper)
{
REBCNT len;
REBCNT n;
*out = *val;
if (IS_CHAR(val)) {
REBUNI c = VAL_CHAR(val);
if (c < UNICODE_CASES) {
c = upper ? UP_CASE(c) : LO_CASE(c);
}
VAL_CHAR(out) = c;
return;
}
// String series:
FAIL_IF_LOCKED_SERIES(VAL_SERIES(val));
len = Partial(val, 0, part);
n = VAL_INDEX(val);
len += n;
if (VAL_BYTE_SIZE(val)) {
REBYTE *bp = VAL_BIN(val);
if (upper)
for (; n < len; n++) bp[n] = (REBYTE)UP_CASE(bp[n]);
else {
for (; n < len; n++) bp[n] = (REBYTE)LO_CASE(bp[n]);
}
} else {
REBUNI *up = VAL_UNI(val);
if (upper) {
for (; n < len; n++) {
if (up[n] < UNICODE_CASES) up[n] = UP_CASE(up[n]);
}
}
else {
for (; n < len; n++) {
if (up[n] < UNICODE_CASES) up[n] = LO_CASE(up[n]);
}
}
}
}
*/ REBINT Do_Series_Action(REBCNT action, REBVAL *value, REBVAL *arg)
/*
** Common series functions.
**
***********************************************************************/
{
REBINT index;
REBINT tail;
REBINT len = 0;
// Common setup code for all actions:
if (action != A_MAKE && action != A_TO) {
index = (REBINT)VAL_INDEX(value);
tail = (REBINT)VAL_TAIL(value);
} else return -1;
switch (action) {
//-- Navigation:
case A_HEAD:
VAL_INDEX(value) = 0;
break;
case A_TAIL:
VAL_INDEX(value) = (REBCNT)tail;
break;
case A_HEADQ:
DECIDE(index == 0);
case A_TAILQ:
DECIDE(index >= tail);
case A_PASTQ:
DECIDE(index > tail);
case A_NEXT:
if (index < tail) VAL_INDEX(value)++;
break;
case A_BACK:
if (index > 0) VAL_INDEX(value)--;
break;
case A_SKIP:
case A_AT:
len = Get_Num_Arg(arg);
{
REBI64 i = (REBI64)index + (REBI64)len;
if (action == A_SKIP) {
if (IS_LOGIC(arg)) i--;
} else { // A_AT
if (len > 0) i--;
}
if (i > (REBI64)tail) i = (REBI64)tail;
else if (i < 0) i = 0;
VAL_INDEX(value) = (REBCNT)i;
}
break;
/*
case A_ATZ:
len = Get_Num_Arg(arg);
{
REBI64 idx = Add_Max(0, index, len, MAX_I32);
if (idx < 0) idx = 0;
VAL_INDEX(value) = (REBCNT)idx;
}
break;
*/
case A_INDEXQ:
SET_INTEGER(DS_RETURN, ((REBI64)index) + 1);
return R_RET;
case A_LENGTHQ:
SET_INTEGER(DS_RETURN, tail > index ? tail - index : 0);
return R_RET;
case A_REMOVE:
// /PART length
TRAP_PROTECT(VAL_SERIES(value));
len = DS_REF(2) ? Partial(value, 0, DS_ARG(3), 0) : 1;
index = (REBINT)VAL_INDEX(value);
if (index < tail && len != 0)
Remove_Series(VAL_SERIES(value), VAL_INDEX(value), len);
break;
case A_ADD: // Join_Strings(value, arg);
case A_SUBTRACT: // "test this" - 10
case A_MULTIPLY: // "t" * 4 = "tttt"
case A_DIVIDE:
case A_REMAINDER:
case A_POWER:
case A_ODDQ:
case A_EVENQ:
case A_ABSOLUTE:
Trap_Action(VAL_TYPE(value), action);
default:
return -1;
}
DS_RET_VALUE(value);
return R_RET;
is_false:
return R_FALSE;
is_true:
return R_TRUE;
}
BaseVector ADFun<Base,RecBase>::Reverse(size_t q, const BaseVector &w)
{ // used to identify the RecBase type in calls to sweeps
RecBase not_used_rec_base;
// constants
const Base zero(0);
// temporary indices
size_t i, j, k;
// number of independent variables
size_t n = ind_taddr_.size();
// number of dependent variables
size_t m = dep_taddr_.size();
// check BaseVector is Simple Vector class with Base type elements
CheckSimpleVector<Base, BaseVector>();
CPPAD_ASSERT_KNOWN(
size_t(w.size()) == m || size_t(w.size()) == (m * q),
"Argument w to Reverse does not have length equal to\n"
"the dimension of the range or dimension of range times q."
);
CPPAD_ASSERT_KNOWN(
q > 0,
"The first argument to Reverse must be greater than zero."
);
CPPAD_ASSERT_KNOWN(
num_order_taylor_ >= q,
"Less than q Taylor coefficients are currently stored"
" in this ADFun object."
);
// special case where multiple forward directions have been computed,
// but we are only using the one direction zero order results
if( (q == 1) & (num_direction_taylor_ > 1) )
{ num_order_taylor_ = 1; // number of orders to copy
size_t c = cap_order_taylor_; // keep the same capacity setting
size_t r = 1; // only keep one direction
capacity_order(c, r);
}
CPPAD_ASSERT_KNOWN(
num_direction_taylor_ == 1,
"Reverse mode for Forward(q, r, xq) with more than one direction"
"\n(r > 1) is not yet supported for q > 1."
);
// initialize entire Partial matrix to zero
local::pod_vector_maybe<Base> Partial(num_var_tape_ * q);
for(i = 0; i < num_var_tape_; i++)
for(j = 0; j < q; j++)
Partial[i * q + j] = zero;
// set the dependent variable direction
// (use += because two dependent variables can point to same location)
for(i = 0; i < m; i++)
{ CPPAD_ASSERT_UNKNOWN( dep_taddr_[i] < num_var_tape_ );
if( size_t(w.size()) == m )
Partial[dep_taddr_[i] * q + q - 1] += w[i];
else
{ for(k = 0; k < q; k++)
// ? should use += here, first make test to demonstrate bug
Partial[ dep_taddr_[i] * q + k ] = w[i * q + k ];
}
}
// evaluate the derivatives
CPPAD_ASSERT_UNKNOWN( cskip_op_.size() == play_.num_op_rec() );
CPPAD_ASSERT_UNKNOWN( load_op_.size() == play_.num_load_op_rec() );
local::play::const_sequential_iterator play_itr = play_.end();
local::sweep::reverse(
q - 1,
n,
num_var_tape_,
&play_,
cap_order_taylor_,
taylor_.data(),
q,
Partial.data(),
cskip_op_.data(),
load_op_,
play_itr,
not_used_rec_base
);
// return the derivative values
BaseVector value(n * q);
for(j = 0; j < n; j++)
{ CPPAD_ASSERT_UNKNOWN( ind_taddr_[j] < num_var_tape_ );
// independent variable taddr equals its operator taddr
CPPAD_ASSERT_UNKNOWN( play_.GetOp( ind_taddr_[j] ) == local::InvOp );
// by the Reverse Identity Theorem
// partial of y^{(k)} w.r.t. u^{(0)} is equal to
// partial of y^{(q-1)} w.r.t. u^{(q - 1 - k)}
if( size_t(w.size()) == m )
{ for(k = 0; k < q; k++)
value[j * q + k ] =
Partial[ind_taddr_[j] * q + q - 1 - k];
}
else
{ for(k = 0; k < q; k++)
value[j * q + k ] =
Partial[ind_taddr_[j] * q + k];
}
}
CPPAD_ASSERT_KNOWN( ! ( hasnan(value) && check_for_nan_ ) ,
"dw = f.Reverse(q, w): has a nan,\n"
"but none of its Taylor coefficents are nan."
);
return value;
}
//
// Series_Common_Action_Returns: C
//
// This routine is called to handle actions on ANY-SERIES! that can be taken
// care of without knowing what specific kind of series it is. So generally
// index manipulation, and things like LENGTH/etc.
//
// The strange name is to convey the result in an if statement, in the same
// spirit as the `if (XXX_Throws(...)) { /* handle throw */ }` pattern.
//
REBOOL Series_Common_Action_Returns(
REB_R *r, // `r_out` would be slightly confusing, considering R_OUT
REBFRM *frame_,
REBSYM action
) {
REBVAL *value = D_ARG(1);
REBVAL *arg = D_ARGC > 1 ? D_ARG(2) : NULL;
REBINT index = cast(REBINT, VAL_INDEX(value));
REBINT tail = cast(REBINT, VAL_LEN_HEAD(value));
REBINT len = 0;
switch (action) {
//-- Navigation:
case SYM_HEAD:
VAL_INDEX(value) = 0;
break;
case SYM_TAIL:
VAL_INDEX(value) = (REBCNT)tail;
break;
case SYM_HEAD_Q:
*r = (index == 0) ? R_TRUE : R_FALSE;
return TRUE; // handled
case SYM_TAIL_Q:
*r = (index >= tail) ? R_TRUE : R_FALSE;
return TRUE; // handled
case SYM_PAST_Q:
*r = (index > tail) ? R_TRUE : R_FALSE;
return TRUE; // handled
case SYM_NEXT:
if (index < tail) VAL_INDEX(value)++;
break;
case SYM_BACK:
if (index > 0) VAL_INDEX(value)--;
break;
case SYM_SKIP:
case SYM_AT:
len = Get_Num_From_Arg(arg);
{
REBI64 i = (REBI64)index + (REBI64)len;
if (action == SYM_SKIP) {
if (IS_LOGIC(arg)) i--;
} else { // A_AT
if (len > 0) i--;
}
if (i > (REBI64)tail) i = (REBI64)tail;
else if (i < 0) i = 0;
VAL_INDEX(value) = (REBCNT)i;
}
break;
case SYM_INDEX_OF:
SET_INTEGER(D_OUT, cast(REBI64, index) + 1);
*r = R_OUT;
return TRUE; // handled
case SYM_LENGTH:
SET_INTEGER(D_OUT, tail > index ? tail - index : 0);
*r = R_OUT;
return TRUE; // handled
case SYM_REMOVE:
// /PART length
FAIL_IF_LOCKED_SERIES(VAL_SERIES(value));
len = D_REF(2) ? Partial(value, 0, D_ARG(3)) : 1;
index = cast(REBINT, VAL_INDEX(value));
if (index < tail && len != 0)
Remove_Series(VAL_SERIES(value), VAL_INDEX(value), len);
break;
case SYM_ADD: // Join_Strings(value, arg);
case SYM_SUBTRACT: // "test this" - 10
case SYM_MULTIPLY: // "t" * 4 = "tttt"
case SYM_DIVIDE:
case SYM_REMAINDER:
case SYM_POWER:
case SYM_ODD_Q:
case SYM_EVEN_Q:
case SYM_ABSOLUTE:
fail (Error_Illegal_Action(VAL_TYPE(value), action));
default:
return FALSE; // not a common operation, not handled
}
*D_OUT = *value;
*r = R_OUT;
return TRUE; // handled
}
void VideoFluids::trackVelocity(Matrix& Zn1,Matrix& Zn,Matrix& U,Matrix& V)
{
Matrix Zx(height,width),Zy(height,width),ZZx(height,width),ZZy(height,width),Zt(height,width),ZZt(height,width),ZZtx(height,width),ZZty(height,width);
Matrix Au1(height,width),Au2(height,width),Av1(height,width),Av2(height,width);
Matrix Z2x(height,width),Z2y(height,width),Z2(height,width);
Matrix Cu(height,width),Cv(height,width);
Matrix tmp(height,width),tmp1(height,width);
Matrix U_old(height,width),V_old(height,width),Ux(height,width),Uy(height,width),Vx(height,width),Vy(height,width),Uax(height,width),Uay(height,width),Vax(height,width),Vay(height,width),Uxy(height,width),Vxy(height,width);
Matrix Coe(height,width);
Zt = Zn;
Zt -= Zn1;
DotMul(Zn,Zt,ZZt);
Zn.output("Zn.txt");
Zn1.output("Zn1.txt");
Zt.output("Zt.txt");
Partial(ZZt,ZZtx,AXIS_X);
Partial(ZZt,ZZty,AXIS_Y);
Partial(Zn,Zx,AXIS_X);
Partial(Zn,Zy,AXIS_Y);
DotMul(Zn,Zx,ZZx);
DotMul(Zn,Zy,ZZy);
DotMul(Zx,Zx,Au1);
Partial(ZZx,tmp,AXIS_X);
Au1-=tmp;
DotMul(Zn,Zn,tmp);
Au1+=tmp;
Au1+=2*alpha*alpha;
DotMul(Zx,Zy,Au2);
Partial(ZZy,tmp,AXIS_X);
Au2-=tmp;
DotMul(Zx,Zy,Av1);
Partial(ZZx,tmp,AXIS_Y);
Av1-=tmp;
DotMul(Zy,Zy,Av2);
Partial(ZZy,tmp,AXIS_Y);
Av2-=tmp;
DotMul(Zn,Zn,tmp);
Av2+=tmp;
Av2+=2*alpha*alpha;
DotMul(Zn,Zn,Z2);
Partial(Z2,Z2x,AXIS_X);
Partial(Z2,Z2y,AXIS_Y);
for (int i = 0;i<height;i++)
for (int j = 0;j<width;j++)
Coe[i][j] = 1.0/(Au1[i][j]*Av2[i][j]-Au2[i][j]*Av1[i][j]);
U = 0.0;
V = 0.0;
for (int iter_time = 0;iter_time<iterationTime;iter_time++)
{
V_old = V;
U_old = U;
Partial(U,Ux,AXIS_X);
Partial(U,Uy,AXIS_Y);
Partial(V,Vx,AXIS_X);
Partial(V,Vy,AXIS_Y);
Partial(Vx,Vxy,AXIS_Y);
Partial(Ux,Uxy,AXIS_Y);
Average(U,Uax,AXIS_X);
Average(U,Uay,AXIS_Y);
Average(V,Vax,AXIS_X);
Average(V,Vay,AXIS_Y);
DotMul(Z2x,Ux,Cu);
DotMul(ZZy,Vx,tmp);
Cu += tmp;
tmp = ZZx*-1;
tmp+=Z2x;
DotMul(tmp,Vy,tmp1);
Cu+=tmp1;
tmp = Z2;
tmp+=alpha*alpha;
DotMul(tmp,Uax,tmp1);
Cu+=tmp1;
tmp1=Uay;
tmp1*=alpha*alpha;
Cu+=tmp1;
DotMul(Z2,Vxy,tmp1);
Cu+=tmp1;
DotMul(Zx,Zt,tmp);
Cu-=tmp;
Cu+=ZZtx;
DotMul(Z2y,Vy,Cv);
DotMul(ZZx,Uy,tmp);
Cv += tmp;
tmp = ZZy;
tmp*=-1;
tmp+=Z2y;
DotMul(tmp,Ux,tmp1);
Cv+=tmp1;
tmp = Z2;
tmp+=alpha*alpha;
DotMul(tmp,Vay,tmp1);
Cv+=tmp1;
tmp1=Vax;
tmp1*=alpha*alpha;
Cv+=tmp1;
DotMul(Z2,Uxy,tmp1);
Cv+=tmp1;
DotMul(Zy,Zt,tmp);
Cv-=tmp;
Cv+=ZZty;
for (int i = 0;i<height;i++)
for (int j = 0;j<width;j++)
{
U[i][j] = Coe[i][j]*(Av2[i][j]*Cu[i][j]-Au2[i][j]*Cv[i][j]);
V[i][j] = Coe[i][j]*(-Av1[i][j]*Cu[i][j]+Au1[i][j]*Cv[i][j]);
}
for (int i = 0;i<height;i++)
{
U[i][0] = U[i][1];
U[i][width-1] = U[i][width-2];
V[i][0] = V[i][1];
V[i][width-1] =V[i][width-2];
}
for (int i = 0;i<width;i++)
{
U[0][i] = U[1][i];
U[height-1][i] = U[height-2][i];
V[0][i] = V[1][i];
V[height-1][i] =V[height-2][i];
}
FILE* fp;
// Au1.output("Au1.txt");
// Au2.output("Au2.txt");
// Av1.output("Av1.txt");
// Av2.output("Av2.txt");
// Cu.output("Cu.txt");
// Cv.output("Cv.txt");
float d1 = Difference(U,U_old);
float d2 = Difference(V,V_old);
// U.output("U.txt");
// U_old.output("U_old.txt");
// V.output("V.txt");
cout<<d1<<' '<<d2<<endl;
if (d1<iterationTorlerance && d2<iterationTorlerance)
break;
}
U.output("U.txt");
cv::Mat showV(height,width,CV_8UC3);
float lowv=10000000,lowu=10000000,highu=-10000000,highv=-1000000;
for(int j=0;j<height;j++){
for(int k=0;k<width;k++){
if(U[j][k]>highu)
highu=U[j][k];
if(U[j][k]<lowu)
lowu=U[j][k];
if(V[j][k]>highv)
highv=V[j][k];
if(V[j][k]<lowv)
lowv=V[j][k];
}
}
for(int j=0;j<height;j++){
for(int k=0;k<width;k++){
//printf("%d %d\n",j,k);
//if(sfs_list[i][j][k]<low)
// showH.at<uchar>(j,k)=0;
//else
float u=(U[j][k]-lowu)/(highu-lowu);
float v=(V[j][k]-lowv)/(highv-lowv);
if(u>0.5)
showV.at<cv::Vec3b>(j,k)[2]=255;
else
showV.at<cv::Vec3b>(j,k)[2]=255*u;
if(v>0.5){
showV.at<cv::Vec3b>(j,k)[0]=255;
showV.at<cv::Vec3b>(j,k)[1]=255*(1-v);
}
else{
showV.at<cv::Vec3b>(j,k)[1]=255;
showV.at<cv::Vec3b>(j,k)[0]=255*v;
}
}
}
cv::imwrite("testV.bmp",showV);
printf("show you");
}
