const YsMatrix &YsMatrix::operator+=(const YsMatrix &a)
{
if(this!=&a)
{
if(nr()==a.nr() && nc()==a.nc())
{
int r,c;
for(r=1; r<=nr(); r++)
{
for(c=1; c<=nc(); c++)
{
Set(r,c,v(r,c)+a.v(r,c));
}
}
return *this;
}
else
{
YsErrOut("YsMatirx::operator+=\n Number of rows and/or columns doesn't match.\n");
return *this;
}
}
else
{
int r,c;
for(r=1; r<=nr(); r++)
{
for(c=1; c<=nc(); c++)
{
Set(r,c,v(r,c)*2);
}
}
return *this;
}
}
void
startoutput(void)
{
char *align;
double ps, vs, lm, rm, ti;
Rune buf[200];
if(isoutput)
return;
isoutput = 1;
if(getnr(L(".paragraph")) == 0)
return;
nr(L(".ns"), 0);
isoutput = 1;
ps = getnr(L(".s"));
if(ps <= 1)
ps = 10;
ps /= 72.0;
USED(ps);
vs = getnr(L(".v"))*getnr(L(".ls")) * 1.0/UPI;
vs /= (10.0/72.0); /* ps */
if(vs == 0)
vs = 1.2;
lm = (getnr(L(".o"))+getnr(L(".i"))) * 1.0/UPI;
ti = getnr(L(".ti")) * 1.0/UPI;
nr(L(".ti"), 0);
rm = 8.0 - getnr(L(".l"))*1.0/UPI - getnr(L(".o"))*1.0/UPI;
if(rm < 0)
rm = 0;
switch(getnr(L(".j"))){
default:
case 0:
align = "left";
break;
case 1:
align = "justify";
break;
case 3:
align = "center";
break;
case 5:
align = "right";
break;
}
if(getnr(L(".ce")))
align = "center";
if(!getnr(L(".margin")))
runesnprint(buf, nelem(buf), "<p style=\"line-height: %.1fem; text-indent: %.2fin; margin-top: 0; margin-bottom: 0; text-align: %s;\">\n",
vs, ti, align);
else
runesnprint(buf, nelem(buf), "<p style=\"line-height: %.1fem; margin-left: %.2fin; text-indent: %.2fin; margin-right: %.2fin; margin-top: 0; margin-bottom: 0; text-align: %s;\">\n",
vs, lm, ti, rm, align);
outhtml(buf);
}
/* set vertical baseline spacing */
void
vs(int v)
{
if(v == 0)
v = getnr(L(".v0"));
nr(L(".v0"), getnr(L(".v")));
nr(L(".v"), v);
}
void
in(int v)
{
nr(L(".i0"), getnr(L(".i")));
nr(L(".i"), v);
nr(L(".ti"), 0);
/* XXX */
}
/* set line spacing */
void
ls(int v)
{
if(v == 0)
v = getnr(L(".ls0"));
nr(L(".ls0"), getnr(L(".ls")));
nr(L(".ls"), v);
}
/* set line length */
void
ll(int v)
{
if(v == 0)
v = getnr(L(".l0"));
nr(L(".l0"), getnr(L(".l")));
nr(L(".l"), v);
}
void
inroman(Rune r)
{
int f;
f = getnr(L(".f"));
nr(L(".f"), 1);
runmacro1(L("font"));
outrune(r);
nr(L(".f"), f);
runmacro1(L("font"));
}
int
e_w(void)
{
Rune *a;
Rune buf[40];
a = getqarg();
runesnprint(buf, sizeof buf, "%ld", runestrlen(a));
pushinputstring(buf);
nr(L("st"), 0);
nr(L("sb"), 0);
nr(L("ct"), 0);
return 0;
}
void
t3init(void)
{
nr(L(".o"), eval(L("1i")));
nr(L(".o0"), eval(L("1i")));
nr(L(".p"), eval(L("11i")));
addreq(L("pl"), r_warn, -1);
addreq(L("bp"), r_nop, -1);
addreq(L("pn"), r_warn, -1);
addreq(L("po"), r_po, -1);
addreq(L("ne"), r_nop, -1);
addreq(L("mk"), r_nop, -1);
addreq(L("rt"), r_warn, -1);
}
::std::string to_str(::boost::numeric::ublas::matrix_expression<MatrixExprT> const& A)
{
namespace ublas = ::boost::numeric::ublas;
namespace ublasx = ::boost::numeric::ublasx;
typedef MatrixExprT matrix_type;
typedef typename ublas::matrix_traits<matrix_type>::size_type size_type;
size_type nr(ublasx::num_rows(A));
size_type nc(ublasx::num_columns(A));
::std::ostringstream oss;
oss << "[";
for (size_type r = 0; r < nr; ++r)
{
if (r > 0)
{
oss << ";";
}
for (size_type c = 0; c < nc; ++c)
{
if (c > 0)
{
oss << " ";
}
oss << A()(r,c);
}
}
oss << "]";
return oss.str();
}
int
runmacro(int dot, int argc, Rune **argv)
{
Rune *p;
int i;
Mac *m;
if(verbose && isupperrune(argv[0][0])) fprint(2, "run: %S\n", argv[0]);
p = getds(argv[0]);
if(p == nil){
if(verbose)
warn("ignoring unknown request %C%S", dot, argv[0]);
if(verbose > 1){
for(i=0; i<argc; i++)
fprint(2, " %S", argv[i]);
fprint(2, "\n");
}
return -1;
}
if(nmstack >= nelem(mstack)){
fprint(2, "%L: macro stack overflow:");
for(i=0; i<nmstack; i++)
fprint(2, " %S", mstack[i].argv[0]);
fprint(2, "\n");
return -1;
}
m = &mstack[nmstack++];
m->argc = argc;
for(i=0; i<argc; i++)
m->argv[i] = erunestrdup(argv[i]);
pushinputstring(p);
nr(L(".$"), argc-1);
inputnotify(popmacro);
return 0;
}
void tst_check_assumptions()
{
memory::initialize(0);
front_end_params params;
ast_manager mgr;
reg_decl_plugins(mgr);
sort_ref b(mgr.mk_bool_sort(), mgr);
func_decl_ref pPred(mgr.mk_func_decl(symbol("p"), 0, static_cast<sort * const *>(0), b), mgr);
func_decl_ref qPred(mgr.mk_func_decl(symbol("q"), 0, static_cast<sort * const *>(0), b), mgr);
func_decl_ref rPred(mgr.mk_func_decl(symbol("r"), 0, static_cast<sort * const *>(0), b), mgr);
app_ref p(mgr.mk_app(pPred,0,static_cast<expr * const *>(0)), mgr);
app_ref q(mgr.mk_app(qPred,0,static_cast<expr * const *>(0)), mgr);
app_ref r(mgr.mk_app(rPred,0,static_cast<expr * const *>(0)), mgr);
app_ref pOqOr(mgr.mk_or(p,q,r), mgr);
app_ref np(mgr.mk_not(p), mgr);
app_ref nq(mgr.mk_not(q), mgr);
app_ref nr(mgr.mk_not(r), mgr);
smt::context ctx(mgr, params);
ctx.assert_expr(pOqOr);
expr * npE = np.get();
lbool res1 = ctx.check(1, &npE);
SASSERT(res1==l_true);
ctx.assert_expr(npE);
expr * assumpt[] = { nq.get(), nr.get() };
//here it should crash
ctx.check(2, assumpt);
}
void
t5init(void)
{
addreq(L("vs"), r_vs, -1);
addreq(L("ls"), r_ls, -1);
addreq(L("sp"), r_sp, -1);
addreq(L("sv"), r_sp, -1);
addreq(L("os"), r_nop, -1);
addreq(L("ns"), r_ns, 0);
addreq(L("rs"), r_rs, 0);
nr(L(".v"), eval(L("12p")));
nr(L(".v0"), eval(L("12p")));
nr(L(".ls"), 1);
nr(L(".ls0"), 1);
}
void DisplayData(void)
{
int iTask;
printf("Display of the instance:\n");
printf("\t Time Horizon T: %ld\n",T());
printf("\t Number of Tasks N: %ld\n",N());
printf("\t Number of Machines M: %ld\n",M());
ConsoleTable ct("Tasks", N(), 6);
ct.SetColHeader(0, "QtyCPU")
.SetColHeader(1, "QtyGPU")
.SetColHeader(2, "QtyRAM")
.SetColHeader(3, "QtyHDD")
.SetColHeader(4, "IsPreemp")
.SetColHeader(5, "CostPreemp");
for (iTask=0;iTask<N();iTask++)
{
ct.Print(nc(iTask));
ct.Print(ng(iTask));
ct.Print(nr(iTask));
ct.Print(nh(iTask));
ct.Print(R(iTask));
ct.Print(rho(iTask));
}
}
void
r_rs(int argc, Rune **argv)
{
USED(argc);
USED(argv);
nr(L(".ns"), 0);
}
void Reviews::activated( const QModelIndex &index )
{
const QModelIndex authorIndex = m_authorProxy->mapToSource( index );
const QModelIndex filterIndex = m_groupProxy->mapToSource( authorIndex );
const QModelIndex annotIndex = m_filterProxy->mapToSource( filterIndex );
Okular::Annotation *annotation = m_model->annotationForIndex( annotIndex );
if ( !annotation )
return;
int pageNumber = m_model->data( annotIndex, AnnotationModel::PageRole ).toInt();
const Okular::Page * page = m_document->page( pageNumber );
// calculating the right coordinates to center the view on the annotation
QRect rect = Okular::AnnotationUtils::annotationGeometry( annotation, page->width(), page->height() );
Okular::NormalizedRect nr( rect, (int)page->width(), (int)page->height() );
// set the viewport parameters
Okular::DocumentViewport vp;
vp.pageNumber = pageNumber;
vp.rePos.enabled = true;
vp.rePos.pos = Okular::DocumentViewport::Center;
vp.rePos.normalizedX = ( nr.right + nr.left ) / 2.0;
vp.rePos.normalizedY = ( nr.bottom + nr.top ) / 2.0;
// setting the viewport
m_document->setViewport( vp, 0, true );
}
GaussAlgorithm::GaussAlgorithm (Matrix <double> &A) :
_mat (A), _n(_mat.getNRows()), _perm (new size_t [_n])
{
size_t k, i, j, nr (_mat.getNRows()), nc(_mat.getNCols());
double l;
for (k = 0; k < nc; k++)
{
// search pivot
double t = fabs(_mat(k, k));
_perm[k] = k;
for (i = k + 1; i < nr; i++)
if (std::abs(_mat(i,k)) > t)
{
t = std::abs(_mat(i,k));
_perm[k] = i;
}
// exchange rows
if (_perm[k] != k)
for (j = 0; j < nc; j++)
BASELIB::swap (_mat(_perm[k],j), _mat(k,j));
// eliminate
for (i = k + 1; i < nr; i++)
{
l = _mat(i,k) / _mat(k,k);
for (j = k; j < nc; j++)
_mat(i,j) -= _mat(k,j) * l;
_mat(i,k) = l;
}
}
}
void
r_margin(int argc, Rune **argv)
{
USED(argc);
nr(L(".margin"), eval(argv[1]));
}
boolean checkNDResponse() {
//mySerial.println("checkNDResponse");
// wait a small bit so the animation looks good
if (xbee.readPacket(ND_WAIT_TIME / 6)) {
// got a response!
// should be an AT command response
if (xbee.getResponse().getApiId() == AT_COMMAND_RESPONSE) {
xbee.getResponse().getAtCommandResponse(atResponse);
if (atResponse.isOk()) {
if (atResponse.getCommand()[0] == atCmd[0] && atResponse.getCommand()[1] == atCmd[1] && atResponse.getValueLength() > 3) {
//mySerial.println(pack(atResponse.getValue()[2],atResponse.getValue()[3],atResponse.getValue()[4],atResponse.getValue()[5]));
//mySerial.println(pack(atResponse.getValue()[6],atResponse.getValue()[7],atResponse.getValue()[8],atResponse.getValue()[9]));
addr64 = XBeeAddress64( pack(atResponse.getValue()[2],atResponse.getValue()[3],atResponse.getValue()[4],atResponse.getValue()[5]),pack(atResponse.getValue()[6],atResponse.getValue()[7],atResponse.getValue()[8],atResponse.getValue()[9]) );
return true;
}
}
else {
//nss.print("Command return error code: ");
//nss.println(atResponse.getStatus(), HEX);
nr(1);
}
} else {
//nss.print("Expected AT response but got ");
//nss.print(xbee.getResponse().getApiId(), HEX);
nr(2);
}
} else {
// at command failed
if (xbee.getResponse().isError()) {
//nss.print("Error reading packet. Error code: ");
//nss.println(xbee.getResponse().getErrorCode());
nr(3);
}
else {
//nss.print("No response from radio");
nr(4);
}
}
return false;
}
QNetworkRequest createRequest(const QUrl& url) const
{
QNetworkRequest nr(url);
nr.setRawHeader("Accept", "*/*");
nr.setRawHeader("X-Requested-With", "XMLHttpRequest");
nr.setRawHeader("Referer", MYZUKA_URL);
return nr;
}
int getDirectUrl()
{
QUrl url(QString("%1Song/Play/%2").arg(MYZUKA_URL).arg(tune_->url));
QNetworkRequest nr(createRequest(url));
QNetworkReply *reply = nam_->get(nr);
connect(reply, &QNetworkReply::finished, this, &MyzukaruResolveStrategyPrivate::tuneUrlFinished);
return startLoop();
}
void SfxPlayer::readSamples(int8_t *buf, int len) {
if (_delay == 0) {
memset(buf, 0, len * 2);
} else {
int8_t bufin[len * 2];
mixSamples(bufin, len);
nr(bufin, len, buf);
}
}
void
popmacro(void)
{
int i;
Mac *m;
if(--nmstack < 0){
fprint(2, "%L: macro stack underflow\n");
return;
}
m = &mstack[nmstack];
for(i=0; i<m->argc; i++)
free(m->argv[i]);
if(nmstack > 0)
nr(L(".$"), mstack[nmstack-1].argc-1);
else
nr(L(".$"), 0);
}
void
t6init(void)
{
addreq(L("ll"), r_ll, -1);
addreq(L("in"), r_in, -1);
addreq(L("ti"), r_ti, 1);
nr(L(".l"), eval(L("6.5i")));
}
dvector norm_res(const dvector& pred, const dvector& obs, double m)
{
RETURN_ARRAYS_INCREMENT();
pred += 0.0001;
obs += 0.0001;
dvector nr(1,size_count(obs));
nr = elem_div(obs-pred,sqrt(elem_prod(pred,(1.-pred))/m));
RETURN_ARRAYS_DECREMENT();
return nr;
}
/*
* 14. Three-part titles.
*/
void
r_lt(int argc, Rune **argv)
{
Rune *p;
if(argc < 2)
nr(L(".lt"), evalscale(L("6.5i"), 'm'));
else{
if(argc > 2)
warn("too many arguments for .lt");
p = argv[1];
if(p[0] == '-')
nr(L(".lt"), getnr(L(".lt"))-evalscale(p+1, 'm'));
else if(p[0] == '+')
nr(L(".lt"), getnr(L(".lt"))+evalscale(p+1, 'm'));
else
nr(L(".lt"), evalscale(p, 'm'));
}
}
int
e_w(void)
{
Rune *a;
Rune buf[40];
static Rune zero;
a = getqarg();
if(a == nil){
warn("no arg for \\w");
a = &zero;
}
runesnprint(buf, sizeof buf, "%ld", runestrlen(a));
pushinputstring(buf);
nr(L("st"), 0);
nr(L("sb"), 0);
nr(L("ct"), 0);
return 0;
}
int getBaseUrl()
{
if(tune_->directUrl.isEmpty())
return PageError;
QUrl url(QUrl::fromPercentEncoding(tune_->directUrl.toLatin1()));
QNetworkRequest nr(createRequest(url));
nr.setAttribute(QNetworkRequest::FollowRedirectsAttribute, true);
QNetworkReply *reply = nam_->get(nr);
connect(reply, &QNetworkReply::finished, this, &MyzukaruResolveStrategyPrivate::tunePageFinished);
return startLoop();
}
void Animation::updateBBox(const Vec &size, const Vec &alignPoint)
{
Vec tl(alignPoint);
Vec br(size);
tl.mult(-1.0f);
br.sub(alignPoint);
Rect nr(tl, br);
m_boundBox.merge(nr);
}
void
run(void)
{
t1init();
t2init();
t3init();
t4init();
t5init();
t6init();
t7init();
t8init();
/* t9init(); t9.c */
t10init();
t11init();
/* t12init(); t12.c */
t13init();
t14init();
t15init();
t16init();
t17init();
t18init();
t19init();
t20init();
htmlinit();
hideihtml();
addreq(L("margin"), r_margin, 1);
nr(L(".margin"), 1);
nr(L(".paragraph"), 1);
runinput();
while(popinput())
;
dot = '.';
if(verbose)
fprint(2, "eof\n");
runmacro1(L("eof"));
closehtml();
}
