int main() {
s[1] = 1;
for(int i = 2; i < maxn; ++i) {
if(!d[i])
pr[tot++] = d[i] = i;
for(int j = 0, k; (k = i * pr[j]) < maxn; ++j) {
d[k] = pr[j];
if(d[i] == pr[j])
break;
}
c[i] = c[i - 1] + (d[i] == i);
s[i] = (s[i - 1] + (d[i] == i ? cub(i) : 0)) % mod;
}
LL n = (LL)1e12, pos = 0;
int ans = 0, val = 0, adt = 1;
for(int i = 0; (LL)pr[i] * pr[i] < n; ++i) {
LL lim = n / pr[i];
if(lim != pos) {
pos = lim;
int upp = (int)ceil(sqrt(lim)) + 1;
val = (solve(lim, c[upp]) + s[upp] - 1) % mod;
}
adt = (adt + cub(pr[i])) % mod;
ans = (ans + (LL)cub(pr[i]) * (val - adt)) % mod;
}
printf("%d\n", ans < 0 ? ans + mod : ans);
return 0;
}
/* interpolate a quarter (half a window)
*
* ibuf buffer of ilen length is swept at rate speed.
* result put in output buffer obuf of size olen.
*/
static void interpolation(
pitch_t pitch,
st_sample_t *ibuf, int ilen,
PITCH_FLOAT * out, int olen,
PITCH_FLOAT rate) /* signed */
{
register int i, size;
register PITCH_FLOAT index;
size = pitch->step; /* size == olen? */
if (rate>0) /* sweep forwards */
{
for (index=ZERO, i=0; i<olen; i++, index+=rate)
{
register int ifl = (int) index; /* FLOOR */
register PITCH_FLOAT frac = index - ifl;
if (pitch->interopt==PITCH_INTERPOLE_LIN)
out[i] = lin((PITCH_FLOAT) ibuf[ifl],
(PITCH_FLOAT) ibuf[ifl+1],
frac);
else
out[i] = cub((PITCH_FLOAT) ibuf[ifl-1],
(PITCH_FLOAT) ibuf[ifl],
(PITCH_FLOAT) ibuf[ifl+1],
(PITCH_FLOAT) ibuf[ifl+2],
frac);
}
}
else /* rate < 0, sweep backwards */
{
for (index=ilen-1, i=olen-1; i>=0; i--, index+=rate)
{
register int ifl = (int) index; /* FLOOR */
register PITCH_FLOAT frac = index - ifl;
if (pitch->interopt==PITCH_INTERPOLE_LIN)
out[i] = lin((PITCH_FLOAT) ibuf[ifl],
(PITCH_FLOAT) ibuf[ifl+1],
frac);
else
out[i] = cub((PITCH_FLOAT) ibuf[ifl-1],
(PITCH_FLOAT) ibuf[ifl],
(PITCH_FLOAT) ibuf[ifl+1],
(PITCH_FLOAT) ibuf[ifl+2],
frac);
}
}
}
/*
* Clear around the box for fancy_bce_test().
*/
static void
fancy_bce_erases(BOX *box)
{
int i;
int first;
int limit;
cup(box->top - 1, min_cols / 2);
ed(1); /* clear from home to cursor */
cuf(1);
el(0); /* clear from cursor to end of line */
cup(box->bottom + 1, min_cols / 2);
ed(0); /* clear from cursor to end */
cub(1);
el(1); /* clear to beginning of line */
for (i = box->top; i <= box->bottom; i++) {
cup(i, box->left - 1);
el(1);
cup(i, box->right + 1);
limit = min_cols - box->right;
first = i + 1 - box->top;
if (first > limit)
first = limit;
dch(first);
limit -= first;
if (limit > 0)
ech(limit);
}
}
double spline_evaluate_segment(spline_p spline, spline_eval_type_t type,
int seg_index, double argument) {
spline_segment_p segment = &spline->segments[seg_index];
double x = argument-spline->arg_start[seg_index];
if (type == spline_first_derivative)
return 3.0*segment->a*sqr(x)+2.0*segment->b*x+segment->c;
else if (type == spline_second_derivative)
return 6.0*segment->a*x+2.0*segment->b;
else
return segment->a*cub(x)+segment->b*sqr(x)+segment->c*x+segment->d;
}
int solve(LL n, int k) {
if(!k)
return sum3(n);
if(n <= pr[k - 1])
return n > 0;
if(n < maxn) {
if(c[n] <= k)
return n > 0;
if(c[(int)sqrt(n)] <= k)
return (s[n] - s[pr[k - 1]] + (n > 0)) % mod;
}
return (solve(n, k - 1) - (LL)cub(pr[k - 1]) * solve(n / pr[k - 1], k - 1)) % mod;
}
int main()
{
glfwInit();
// Set all the required options for GLFW
glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 3);
glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 3);
glfwWindowHint(GLFW_OPENGL_PROFILE, GLFW_OPENGL_CORE_PROFILE);
glfwWindowHint(GLFW_RESIZABLE, GL_FALSE);
GLFWwindow *window = glfwCreateWindow(WIDTH, HEIGHT, "哈哈哈", nullptr, nullptr);
glfwMakeContextCurrent(window);
glewExperimental = GL_TRUE;
glewInit();
int width, height;
glfwSetKeyCallback(window, key_callback);
glfwGetFramebufferSize(window, &width, &height);
glViewport(0, 0, width, height);
Shader main_shader("main");
GLfloat vertices[] = {
0.5f, 0.5f, 0.0f, // Top Right
0.5f, -0.5f, 0.0f, // Bottom Right
-0.5f, -0.5f, 0.0f, // Bottom Left
-0.5f, 0.5f, 0.0f // Top Left
};
GLuint indices[] = {
0, 1, 2, // First Triangle
1, 2, 3 // Second Triangle
};
Cube cub(vertices, sizeof(vertices), indices, sizeof(indices));
// glPolygonMode(GL_FRONT_AND_BACK, GL_LINE);
glPolygonMode(GL_FRONT, GL_FILL);
// Game loop
GLfloat timeValue = glfwGetTime();
while (!glfwWindowShouldClose(window)) {
glfwPollEvents();
glClearColor(0.2f, 0.3f, 0.3f, 1.0f);
glClear(GL_COLOR_BUFFER_BIT);
timeValue = glfwGetTime();
GLfloat greenValue = (sin(timeValue) / 2) + 0.5;
GLint vertexColorLocation = glGetUniformLocation(main_shader.program, "timeColor");
glUniform4f(vertexColorLocation, 0.0f, greenValue, 0.0f, 1.0f);
main_shader.use_shader();
cub.draw();
glfwSwapBuffers(window);
}
glfwTerminate();
return 0;
}
/*
* Clear around the box for simple_bce_test().
*/
static void
simple_bce_erases(BOX *box)
{
int i;
cup(box->top - 1, min_cols / 2);
ed(1); /* clear from home to cursor */
cuf(1);
el(0); /* clear from cursor to end of line */
cup(box->bottom + 1, min_cols / 2);
ed(0); /* clear from cursor to end */
cub(1);
el(1); /* clear to beginning of line */
for (i = box->top; i <= box->bottom; i++) {
cup(i, box->left - 1);
el(1);
cup(i, box->right + 1);
el(0);
}
}
int main(void){
printf("Enter of value: ");
scanf("%lf", &value);
cub(value);
return 0;
}
ExecStatus
ElementUnion<SView,RView>::propagate(Space& home, const ModEventDelta&) {
Region r(home);
int n = iv.size();
bool loopVar;
do {
loopVar = false;
// Cache the upper bound iterator, as we have to
// modify the upper bound while iterating
LubRanges<RView> x1ub(x1);
Iter::Ranges::Cache<LubRanges<RView> > x1ubc(r,x1ub);
Iter::Ranges::ToValues<Iter::Ranges::Cache<LubRanges<RView> > >
vx1ub(x1ubc);
GlbRanges<RView> x1lb(x1);
Iter::Ranges::Cache<GlbRanges<RView> > x1lbc(r,x1lb);
Iter::Ranges::ToValues<Iter::Ranges::Cache<GlbRanges<RView> > >
vx1(x1lbc);
// In the first iteration, compute in before[i] the union
// of all the upper bounds of the x_i. At the same time,
// exclude inconsistent x_i from x1 and remove them from
// the list, cancel their dependencies.
GLBndSet sofarBefore(home);
LUBndSet selectedInter(home, IntSet (Limits::min,
Limits::max));
GLBndSet* before =
static_cast<GLBndSet*>(r.ralloc(sizeof(GLBndSet)*n));
int j = 0;
int i = 0;
unsigned int maxCard = 0;
unsigned int minCard = Limits::card;
while ( vx1ub() ) {
// Remove vars at indices not in the upper bound
if (iv[i].idx < vx1ub.val()) {
iv[i].view.cancel(home,*this, PC_SET_ANY);
++i;
continue;
}
assert(iv[i].idx == vx1ub.val());
iv[j] = iv[i];
SView candidate = iv[j].view;
int candidateInd = iv[j].idx;
// inter = glb(candidate) & complement(lub(x0))
GlbRanges<SView> candlb(candidate);
LubRanges<SView> x0ub(x0);
Iter::Ranges::Diff<GlbRanges<SView>,
LubRanges<SView> > diff(candlb, x0ub);
bool selectSingleInconsistent = false;
if (x1.cardMax() <= 1) {
GlbRanges<SView> x0lb(x0);
LubRanges<SView> candub(candidate);
Iter::Ranges::Diff<GlbRanges<SView>,
LubRanges<SView> > diff2(x0lb, candub);
selectSingleInconsistent = diff2() || candidate.cardMax() < x0.cardMin();
}
// exclude inconsistent x_i
// an x_i is inconsistent if
// * at most one x_i can be selected and there are
// elements in x_0 that can't be in x_i
// (selectSingleInconsistent)
// * its min cardinality is greater than maxCard of x0
// * inter is not empty (there are elements in x_i
// that can't be in x_0)
if (selectSingleInconsistent ||
candidate.cardMin() > x0.cardMax() ||
diff()) {
ModEvent me = (x1.exclude(home,candidateInd));
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
iv[j].view.cancel(home,*this, PC_SET_ANY);
++i;
++vx1ub;
continue;
} else {
// if x_i is consistent, check whether we know
// that its index is in x1
if (vx1() && vx1.val()==candidateInd) {
// x0 >= candidate, candidate <= x0
GlbRanges<SView> candlb(candidate);
ModEvent me = x0.includeI(home,candlb);
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
LubRanges<SView> x0ub(x0);
me = candidate.intersectI(home,x0ub);
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
++vx1;
}
new (&before[j]) GLBndSet(home);
before[j].update(home,sofarBefore);
LubRanges<SView> cub(candidate);
sofarBefore.includeI(home,cub);
GlbRanges<SView> clb(candidate);
selectedInter.intersectI(home,clb);
maxCard = std::max(maxCard, candidate.cardMax());
minCard = std::min(minCard, candidate.cardMin());
}
++vx1ub;
++i; ++j;
}
// cancel the variables with index greater than
// max of lub(x1)
for (int k=i; k<n; k++) {
iv[k].view.cancel(home,*this, PC_SET_ANY);
}
n = j;
iv.size(n);
if (x1.cardMax()==0) {
// Selector is empty, hence the result must be empty
{
GECODE_ME_CHECK(x0.cardMax(home,0));
}
for (int i=n; i--;)
before[i].dispose(home);
return home.ES_SUBSUMED(*this);
}
if (x1.cardMin() > 0) {
// Selector is not empty, hence the intersection of the
// possibly selected lower bounds is contained in x0
BndSetRanges si(selectedInter);
ModEvent me = x0.includeI(home, si);
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
me = x0.cardMin(home, minCard);
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
}
selectedInter.dispose(home);
if (x1.cardMax() <= 1) {
ModEvent me = x0.cardMax(home, maxCard);
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
}
{
// x0 <= sofarBefore
BndSetRanges sfB(sofarBefore);
ModEvent me = x0.intersectI(home,sfB);
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
}
sofarBefore.dispose(home);
GLBndSet sofarAfter(home);
// In the second iteration, this time backwards, compute
// sofarAfter as the union of all lub(x_j) with j>i
for (int i=n; i--;) {
// TODO: check for size of universe here?
// if (sofarAfter.size() == 0) break;
// extra = inter(before[i], sofarAfter) - lub(x0)
BndSetRanges b(before[i]);
BndSetRanges s(sofarAfter);
GlbRanges<SView> x0lb(x0);
Iter::Ranges::Union<BndSetRanges, BndSetRanges> inter(b,s);
Iter::Ranges::Diff<GlbRanges<SView>,
Iter::Ranges::Union<BndSetRanges,BndSetRanges> > diff(x0lb, inter);
if (diff()) {
ModEvent me = (x1.include(home,iv[i].idx));
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
// candidate != extra
me = iv[i].view.includeI(home,diff);
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
}
LubRanges<SView> iviub(iv[i].view);
sofarAfter.includeI(home,iviub);
before[i].dispose(home);
}
sofarAfter.dispose(home);
} while (loopVar);
// Test whether we determined x1 without determining x0
if (x1.assigned() && !x0.assigned()) {
int ubsize = static_cast<int>(x1.lubSize());
if (ubsize > 2) {
assert(ubsize==n);
ViewArray<SView> is(home,ubsize);
for (int i=n; i--;)
is[i]=iv[i].view;
GECODE_REWRITE(*this,(RelOp::UnionN<SView, SView>
::post(home(*this),is,x0)));
} else if (ubsize == 2) {
assert(n==2);
SView a = iv[0].view;
SView b = iv[1].view;
GECODE_REWRITE(*this,(RelOp::Union<SView, SView, SView>
::post(home(*this),a,b,x0)));
} else if (ubsize == 1) {
assert(n==1);
GECODE_REWRITE(*this,(Rel::Eq<SView,SView>::post(home(*this),x0,iv[0].view)));
} else {
GECODE_ME_CHECK(x0.cardMax(home, 0));
return home.ES_SUBSUMED(*this);
}
}
bool allAssigned = true;
for (int i=iv.size(); i--;) {
if (!iv[i].view.assigned()) {
allAssigned = false;
break;
}
}
if (x0.assigned() && x1.assigned() && allAssigned) {
return home.ES_SUBSUMED(*this);
}
return ES_FIX;
}
constexpr CMT_INLINE T pow3(const T& x)
{
return cub(x);
}
int
tst_doublesize(MENU_ARGS)
{
/* Test of:
DECSWL (Single Width Line)
DECDWL (Double Width Line)
DECDHL (Double Height Line) (also implicit double width)
*/
int col, i, w, w1;
/* Print the test pattern in both 80 and 132 character width */
for (w = 0; w <= 1; w++) {
w1 = 13 * w;
ed(2);
cup(1, 1);
if (w) {
deccolm(TRUE);
printf("%3d column mode", max_cols);
} else {
deccolm(FALSE);
printf("%3d column mode", min_cols);
}
cup(5, 3 + 2 * w1);
printf("v------- left margin");
cup(7, 3 + 2 * w1);
printf("This is a normal-sized line");
decdhl(0);
decdhl(1);
decdwl();
decswl();
cup(9, 2 + w1);
printf("This is a Double-width line");
decswl();
decdhl(0);
decdhl(1);
decdwl();
cup(11, 2 + w1);
decdwl();
decswl();
decdhl(1);
decdhl(0);
printf("This is a Double-width-and-height line");
cup(12, 2 + w1);
decdwl();
decswl();
decdhl(0);
decdhl(1);
printf("This is a Double-width-and-height line");
cup(14, 2 + w1);
decdwl();
decswl();
decdhl(1);
decdhl(0);
el(2);
printf("This is another such line");
cup(15, 2 + w1);
decdwl();
decswl();
decdhl(0);
decdhl(1);
printf("This is another such line");
cup(17, 3 + 2 * w1);
printf("^------- left margin");
cup(21, 1);
printf("This is not a double-width line");
for (i = 0; i <= 1; i++) {
cup(21, 6);
if (i) {
printf("**is**");
decdwl();
} else {
printf("is not");
decswl();
}
cup(max_lines - 1, 1);
holdit();
}
}
/* Set vanilla tabs for next test */
cup(1, 1);
tbc(3);
for (col = 1; col <= max_cols; col += TABWIDTH) {
cuf(TABWIDTH);
hts();
}
deccolm(FALSE);
ed(2);
/* *INDENT-OFF* */
scs_graphics();
cup( 8,1); decdhl(0); printf("lqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqk");
cup( 9,1); decdhl(1); printf("lqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqk");
cup(10,1); decdhl(0); printf("x%c%c%c%c%cx",9,9,9,9,9);
cup(11,1); decdhl(1); printf("x%c%c%c%c%cx",9,9,9,9,9);
cup(12,1); decdhl(0); printf("x%c%c%c%c%cx",9,9,9,9,9);
cup(13,1); decdhl(1); printf("x%c%c%c%c%cx",9,9,9,9,9);
scs(1, '0'); /* should look the same as scs_graphics() */
cup(14,1); decdhl(0); printf("x x");
cup(15,1); decdhl(1); printf("x x");
cup(16,1); decdhl(0); printf("mqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqj");
cup(17,1); decdhl(1); printf("mqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqj");
scs_normal();
/* *INDENT-ON* */
sgr("1;5");
cup(12, 3);
printf("* The mad programmer strikes again * ");
cup(13, 3);
printf("%c", 9);
cub(6);
printf("* The mad programmer strikes again *");
sgr("0");
cup(max_lines - 2, 1);
println("Another test pattern... a frame with blinking bold text,");
printf("all in double-height double-width size. ");
holdit();
decstbm(8, max_lines); /* Absolute origin mode, so cursor is set at (1,1) */
cup(8, 1);
for (i = 1; i <= 12; i++)
ri();
decstbm(0, 0); /* No scroll region */
cup(1, 1);
printf("%s", "Exactly half of the box should remain. ");
return MENU_HOLD;
}
int
tst_insdel(MENU_ARGS)
{
/* Test of:
SM/RM(4) (= IRM (Insertion/replacement mode))
ICH (Insert Character)
DCH (Delete character)
IL (Insert line)
DL (Delete line)
*/
int i, row, col, sw, dblchr, scr132;
for (scr132 = 0; scr132 <= 1; scr132++) {
if (scr132) {
deccolm(TRUE);
sw = max_cols;
} else {
deccolm(FALSE);
sw = min_cols;
}
ed(2);
cup(1, 1);
for (row = 1; row <= max_lines; row++) {
cup(row, 1);
for (col = 1; col <= sw; col++)
printf("%c", 'A' - 1 + row);
}
cup(4, 1);
printf("Screen accordion test (Insert & Delete Line). ");
holdit();
ri();
el(2);
decstbm(2, max_lines - 1);
decom(TRUE);
cup(1, 1);
for (row = 1; row <= max_lines; row++) {
il(row);
dl(row);
}
decom(FALSE);
decstbm(0, 0);
cup(2, 1);
printf("Top line: A's, bottom line: %c's, this line, nothing more. ",
'A' - 1 + max_lines);
holdit();
cup(2, 1);
ed(0);
cup(1, 2);
printf("B");
cub(1);
sm("4");
for (col = 2; col <= sw - 1; col++)
printf("*");
rm("4");
cup(4, 1);
printf("Test of 'Insert Mode'. The top line should be 'A*** ... ***B'. ");
holdit();
ri();
el(2);
cup(1, 2);
dch(sw - 2);
cup(4, 1);
printf("Test of 'Delete Character'. The top line should be 'AB'. ");
holdit();
for (dblchr = 1; dblchr <= 2; dblchr++) {
ed(2);
for (row = 1; row <= max_lines; row++) {
cup(row, 1);
if (dblchr == 2)
decdwl();
for (col = 1; col <= sw / dblchr; col++)
printf("%c", 'A' - 1 + row);
cup(row, sw / dblchr - row);
dch(row);
}
cup(4, 1);
println("The right column should be staggered ");
printf("by one. ");
holdit();
}
ed(2);
cup(1, 1);
println("If your terminal has the ANSI 'Insert Character' function");
println("(the VT102 does not), then you should see a line like this");
println(" A B C D E F G H I J K L M N O P Q R S T U V W X Y Z");
println("below:");
println("");
for (i = 'Z'; i >= 'A'; i--) {
printf("%c%c", i, BS);
ich(2);
}
cup(10, 1);
holdit();
if (sw == max_cols)
deccolm(FALSE);
}
return MENU_NOHOLD;
}
int
tst_movements(MENU_ARGS)
{
/* Test of:
CUF (Cursor Forward)
CUB (Cursor Backward)
CUD (Cursor Down) IND (Index) NEL (Next Line)
CUU (Cursor Up) RI (Reverse Index)
CUP (Cursor Position) HVP (Horizontal and Vertical Position)
ED (Erase in Display)
EL (Erase in Line)
DECALN (Screen Alignment Display)
DECAWM (Autowrap)
<CR> <BS>
Cursor control characters inside CSI sequences
*/
int i, row, col, pass, width, hlfxtra;
const char *ctext = "This is a correct sentence";
set_tty_crmod(TRUE); /* want to disable tab/space conversion */
for (pass = 0; pass <= 1; pass++) {
int inner_l, inner_r;
if (pass == 0) {
deccolm(FALSE);
width = min_cols;
} else {
deccolm(TRUE);
width = max_cols;
}
/* Compute left/right columns for a 60-column box centered in 'width' */
inner_l = (width - 60) / 2;
inner_r = 61 + inner_l;
hlfxtra = (width - 80) / 2;
if (LOG_ENABLED)
fprintf(log_fp, "tst_movements box(%d cols)\n", pass ? max_cols : min_cols);
decaln();
cup(9, inner_l);
ed(1);
cup(18, 60 + hlfxtra);
ed(0);
el(1);
cup(9, inner_r);
el(0);
/* 132: 36..97 */
/* 80: 10..71 */
for (row = 10; row <= 16; row++) {
cup(row, inner_l);
el(1);
cup(row, inner_r);
el(0);
}
cup(17, 30);
el(2);
for (col = 1; col <= width; col++) {
hvp(max_lines, col);
printf("*");
hvp(1, col);
printf("*");
}
cup(2, 2);
for (row = 2; row <= max_lines - 1; row++) {
printf("+");
cub(1);
ind();
}
cup(max_lines - 1, width - 1);
for (row = max_lines - 1; row >= 2; row--) {
printf("+");
cub(1);
ri();
}
cup(2, 1);
for (row = 2; row <= max_lines - 1; row++) {
printf("*");
cup(row, width);
printf("*");
cub(10);
if (row < 10)
nel();
else
printf("\n");
}
cup(2, 10);
cub(42 + hlfxtra);
cuf(2);
for (col = 3; col <= width - 2; col++) {
printf("+");
cuf(0);
cub(2);
cuf(1);
}
cup(max_lines - 1, inner_r - 1);
cuf(42 + hlfxtra);
cub(2);
for (col = width - 2; col >= 3; col--) {
printf("+");
cub(1);
cuf(1);
cub(0);
printf("%c", 8);
}
cup(1, 1);
cuu(10);
cuu(1);
cuu(0);
cup(max_lines, width);
cud(10);
cud(1);
cud(0);
cup(10, 2 + inner_l);
for (row = 10; row <= 15; row++) {
for (col = 2 + inner_l; col <= inner_r - 2; col++)
printf(" ");
cud(1);
cub(58);
}
cuu(5);
cuf(1);
printf("The screen should be cleared, and have an unbroken bor-");
cup(12, inner_l + 3);
printf("der of *'s and +'s around the edge, and exactly in the");
cup(13, inner_l + 3);
printf("middle there should be a frame of E's around this text");
cup(14, inner_l + 3);
printf("with one (1) free position around it. ");
holdit();
}
deccolm(FALSE);
/* DECAWM demo */
for (pass = 0; pass <= 1; pass++) {
static char on_left[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
static char on_right[] = "abcdefghijklmnopqrstuvwxyz";
int height = sizeof(on_left) - 1;
int region = max_lines - 6;
if (LOG_ENABLED)
fprintf(log_fp, "tst_movements wrap(%d cols)\n", pass ? max_cols : min_cols);
/* note: DECCOLM clears the screen */
if (pass == 0) {
deccolm(FALSE);
width = min_cols;
} else {
deccolm(TRUE);
width = max_cols;
}
println("Test of autowrap, mixing control and print characters.");
println("The left/right margins should have letters in order:");
decstbm(3, region + 3);
decom(TRUE); /* this also homes the cursor */
for (i = 0; i < height; ++i) {
switch (i % 4) {
case 0:
/* draw characters as-is, for reference */
__(cup(region + 1, 1), printf("%c", on_left[i]));
__(cup(region + 1, width), printf("%c", on_right[i]));
printf("\n");
break;
case 1:
/* simple wrapping */
__(cup(region, width), printf("%c%c", on_right[i - 1], on_left[i]));
/* backspace at right margin */
__(cup(region + 1, width), printf("%c%c %c",
on_left[i], BS, on_right[i]));
printf("\n");
break;
case 2:
/* tab to right margin */
__(cup(region + 1, width), printf("%c%c%c%c%c%c",
on_left[i], BS, BS,
TAB, TAB, on_right[i]));
__(cup(region + 1, 2), printf("%c%c\n", BS, on_left[i]));
break;
default:
/* newline at right margin */
__(cup(region + 1, width), printf("\n"));
__(cup(region, 1), printf("%c", on_left[i]));
__(cup(region, width), printf("%c", on_right[i]));
break;
}
}
decom(FALSE);
decstbm(0, 0);
cup(max_lines - 2, 1);
holdit();
}
deccolm(FALSE); /* 80 cols */
if (LOG_ENABLED)
fprintf(log_fp, "tst_movements cursor-controls in ESC sequences\n");
vt_clear(2);
vt_move(1, 1);
println("Test of cursor-control characters inside ESC sequences.");
println("Below should be four identical lines:");
println("");
println("A B C D E F G H I");
for (i = 1; i < 10; i++) {
printf("%c", '@' + i);
do_csi("2%cC", BS); /* Two forward, one backspace */
}
println("");
/* Now put CR in CUF sequence. */
printf("A ");
for (i = 2; i < 10; i++)
printf("%s%c%dC%c", csi_output(), CR, 2 * i - 2, '@' + i);
println("");
/* Now put VT in CUU sequence. */
rm("20");
for (i = 1; i < 10; i++) {
printf("%c ", '@' + i);
do_csi("1\013A");
}
println("");
println("");
holdit();
if (LOG_ENABLED)
fprintf(log_fp, "tst_movements leading zeros in ESC sequences\n");
vt_clear(2);
vt_move(1, 1);
println("Test of leading zeros in ESC sequences.");
printf("Two lines below you should see the sentence \"%s\".", ctext);
for (col = 1; *ctext; col++)
printf("%s00000000004;00000000%dH%c", csi_output(), col, *ctext++);
cup(20, 1);
restore_ttymodes();
return MENU_HOLD;
}
double bezier(double p1, double p2, double x) {
return 3 * x * sqr(1 - x) * p1 + 3 * sqr(x) * (1 - x) * p2 + cub(x);
}
int King_model(double w0, double rmin, double dlogr, int Nmax,
double *radius, double *potential, double *mass)
/*
Purpose:
This function will compute a king model of parameter w0 from rmin
up to the tidal radius of the cluster, logarithmically stepping
by dlogr.
Arguments:
double w0 - King parameter, the higher the deeper.
double rmin - starting radius, will be radius[0],
double dlogr - log radius bin
int Nmax - Maximum number of points we want
double *radius - Malloc'd (Nmax) array
double *potential - Malloc'd (Nmax) array
double *mass - Malloc'd (Nmax) array
Returns:
nrg - actual number of data points stored in the arrays
*/
{
/* ERROR CONTROL */
double eps = 1e-6;
/* MISC VARIABLES */
double sigma2=1.0;
double den1=1.0;
int i,j,nok,nbad,nk,nr,nrg;
int nvar = 2, Nrmax = Nmax;
double h1=1e-3, hmin = 1e-8;
double r1, r2, rt, ppot, a,b;
double oldpot1, oldpot2;
double p,tote,totm,h,r0,p0,ss,d0;
double pot[2];
double *den = ALLOC(Nrmax, double);
double *dene = ALLOC(Nrmax, double);
double *denm = ALLOC(Nrmax, double);
double *dene2 = ALLOC(Nrmax, double);
double *denm2 = ALLOC(Nrmax, double);
double *der = ALLOC(Nrmax, double);
double *v2 = ALLOC(Nrmax, double);
pot[0] = w0 * sigma2;
pot[1] = 0;
r2 = rmin;
/*--------------------------------------------------------------------
Integrate outward to tidal boundary. Store potential and
density, and mass at every step.
--------------------------------------------------------------------*/
for( nr=0; nr<Nrmax; nr++ ){
r1 = r2;
r2 = pow(10, log10(r1)+dlogr);
oldpot1 = pot[0];
oldpot2 = pot[1];
odeint( pot, nvar, r1, r2, eps, h1, hmin, &nok, &nbad,
sigma2 , den1, potdir, rkqs);
//printf("nr %d pot %le %le \n", nr, pot[0], pot[1]);
if(pot[0] > 0){
/* Have not reached rt yet; store data and continue.*/
radius[nr] = r2;
potential[nr] = pot[0];
mass[nr] = -pot[1]*r2*r2;
p = pot[0]/sigma2;
den[nr] = den1 * ( exp(p) * erf(sqrt(p)) -
sqrt(4.*p/M_PI)*(1. +2.*p/3) );
}else{
if (pot[0] == 0){
break;
}
/* Have passed rt. Use bisection to find it.*/
for( i=0; i<20; i++ ){
pot[0] = oldpot1;
pot[1] = oldpot2;
rt = 0.5 * (r1+r2);
odeint( pot, nvar, r1, rt, eps, h1, hmin, &nok,
&nbad, sigma2 , den1, potdir, rkqs);
if(pot[0] > 0){
r1 = rt;
oldpot1 = pot[0];
oldpot2 = pot[1];
}else if(pot[0] < 0){
r2 = rt;
}else{
break;
}
}
radius[nr] = rt;
potential[nr] = 0;
mass[nr] = -pot[1]*r2*r2;
den[nr] = 0;
break;
}
if(den[nr] < 0) break;
}
nrg = nr;
/*-------------------------------------------------------------------
Compute total mass and energy.
--------------------------------------------------------------------*/
for( nr=0; nr<nrg; nr++ ){
dene[nr] = radius[nr]*radius[nr] * den[nr] * potential[nr];
denm[nr] = radius[nr]*radius[nr] * den[nr];
}
spline(radius, dene, nrg, 0, 2e30, dene2);
spline(radius, denm, nrg, 0, 2e30, denm2);
tote = 0;
totm = 0;
for( nr=0; nr<nrg-1; nr++ ){
h = radius[nr+1]-radius[nr];
tote = tote + 0.5*h*( dene[nr+1] + dene[nr] ) -
cub(h)/24.*( dene2[nr+1] + dene2[nr] );
totm = totm + 0.5*h*( denm[nr+1] + denm[nr] ) -
cub(h)/24.*( denm2[nr+1] + denm2[nr] );
}
totm = 4.*M_PI*totm;
tote = 2.*M_PI*tote + 0.5*totm*totm/radius[nrg-1];
tote = 0.5*tote;
r0 = 4.*tote/sqre(totm);
p0 = totm/(4.*tote);
d0 = pow(totm,5)/cub(4.*tote);
for( nr=0; nr<nrg; nr++ ){
radius[nr] = r0*radius[nr];
potential[nr] = p0*potential[nr];
mass[nr] = mass[nr]/totm;
den[nr] = d0*den[nr];
}
/*--------------------------------------------------------------------
Get the mean square velocity v2 as a function of radius.
--------------------------------------------------------------------*/
/* for( nr=0; nr<nrg; nr++ ){ */
/* nk = 2; */
/* ppot = potential[nr]; */
/* a = 0; b = sqrt(2*ppot); */
/* ss = qromo(a, b, eps, kgvfnc, midpoint, nk, ppot, sigma2); */
/* v2[nr] = ss; */
/* nk = 0; */
/* ss = qromo(a, b, eps, kgvfnc, midpoint, nk, ppot, sigma2); */
/* v2[nr] = v2[nr]/ss; */
/* } */
free(v2);
free(den); free(dene); free(denm);
free(dene2); free(denm2); free(der);
return nrg;
}
ExecStatus
ElementUnionConst<SView,RView>::propagate(Space& home, const ModEventDelta&) {
Region r(home);
bool* stillSelected = r.alloc<bool>(n_iv);
bool loopVar;
do {
loopVar = false;
for (int i=n_iv; i--;)
stillSelected[i] = false;
// Cache the upper bound iterator, as we have to
// modify the upper bound while iterating
LubRanges<RView> x1ub(x1);
Iter::Ranges::Cache x1ubc(r,x1ub);
Iter::Ranges::ToValues<Iter::Ranges::Cache>
vx1ub(x1ubc);
GlbRanges<RView> x1lb(x1);
Iter::Ranges::Cache x1lbc(r,x1lb);
Iter::Ranges::ToValues<Iter::Ranges::Cache>
vx1(x1lbc);
// In the first iteration, compute in before[i] the union
// of all the upper bounds of the x_i. At the same time,
// exclude inconsistent x_i from x1.
GLBndSet sofarBefore(home);
LUBndSet selectedInter(home, IntSet (Limits::min,
Limits::max));
GLBndSet* before =
static_cast<GLBndSet*>(r.ralloc(sizeof(GLBndSet)*n_iv));
unsigned int maxCard = 0;
unsigned int minCard = Limits::card;
while (vx1ub()) {
int i = vx1ub.val();
IntSetRanges candCardR(iv[i]);
unsigned int candidateCard = Iter::Ranges::size(candCardR);
IntSetRanges candlb(iv[i]);
LubRanges<SView> x0ub(x0);
Iter::Ranges::Diff<IntSetRanges,
LubRanges<SView> > diff(candlb, x0ub);
bool selectSingleInconsistent = false;
if (x1.cardMax() <= 1) {
GlbRanges<SView> x0lb(x0);
IntSetRanges candub(iv[i]);
Iter::Ranges::Diff<GlbRanges<SView>,
IntSetRanges > diff2(x0lb, candub);
selectSingleInconsistent = diff2() || candidateCard < x0.cardMin();
}
// exclude inconsistent x_i
// an x_i is inconsistent if
// * at most one x_i can be selected and there are
// elements in x_0 that can't be in x_i
// (selectSingleInconsistent)
// * its min cardinality is greater than maxCard of x0
// * inter is not empty (there are elements in x_i
// that can't be in x_0)
if (selectSingleInconsistent ||
candidateCard > x0.cardMax() ||
diff()) {
ModEvent me = (x1.exclude(home,i));
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
} else {
stillSelected[i] = true;
// if x_i is consistent, check whether we know
// that its index is in x1
if (vx1() && vx1.val()==i) {
// x0 >= candidate, candidate <= x0
// GlbRanges<SView> candlb(candidate);
IntSetRanges candlb(iv[i]);
ModEvent me = x0.includeI(home,candlb);
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
++vx1;
}
new (&before[i]) GLBndSet(home);
before[i].update(home,sofarBefore);
IntSetRanges cub(iv[i]);
sofarBefore.includeI(home,cub);
IntSetRanges clb(iv[i]);
selectedInter.intersectI(home,clb);
maxCard = std::max(maxCard, candidateCard);
minCard = std::min(minCard, candidateCard);
}
++vx1ub;
}
if (x1.cardMax()==0) {
// Selector is empty, hence the result must be empty
{
GECODE_ME_CHECK(x0.cardMax(home,0));
}
for (int i=n_iv; i--;)
if (stillSelected[i])
before[i].dispose(home);
selectedInter.dispose(home);
sofarBefore.dispose(home);
return home.ES_SUBSUMED(*this);
}
if (x1.cardMin() > 0) {
// Selector is not empty, hence the intersection of the
// possibly selected lower bounds is contained in x0
BndSetRanges si(selectedInter);
ModEvent me = x0.includeI(home, si);
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
me = x0.cardMin(home, minCard);
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
}
selectedInter.dispose(home);
if (x1.cardMax() <= 1) {
ModEvent me = x0.cardMax(home, maxCard);
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
}
{
// x0 <= sofarBefore
BndSetRanges sfB(sofarBefore);
ModEvent me = x0.intersectI(home,sfB);
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
}
sofarBefore.dispose(home);
GLBndSet sofarAfter(home);
// In the second iteration, this time backwards, compute
// sofarAfter as the union of all lub(x_j) with j>i
for (int i=n_iv; i--;) {
if (!stillSelected[i])
continue;
BndSetRanges b(before[i]);
BndSetRanges s(sofarAfter);
GlbRanges<SView> x0lb(x0);
Iter::Ranges::Union<BndSetRanges, BndSetRanges> inter(b,s);
Iter::Ranges::Diff<GlbRanges<SView>,
Iter::Ranges::Union<BndSetRanges,BndSetRanges> > diff(x0lb, inter);
if (diff()) {
ModEvent me = (x1.include(home,i));
loopVar |= me_modified(me);
GECODE_ME_CHECK(me);
// candidate != extra
IntSetRanges ivi(iv[i]);
if (!Iter::Ranges::subset(diff, ivi))
GECODE_ME_CHECK(ME_SET_FAILED);
}
IntSetRanges iviub(iv[i]);
sofarAfter.includeI(home,iviub);
before[i].dispose(home);
}
sofarAfter.dispose(home);
} while (loopVar);
if (x1.assigned()) {
assert(x0.assigned());
return home.ES_SUBSUMED(*this);
}
return ES_FIX;
}
int Integration_Test01(const bool verbose) {
Teuchos::RCP<std::ostream> outStream;
Teuchos::oblackholestream bhs; // outputs nothing
if (verbose)
outStream = Teuchos::rcp(&std::cout, false);
else
outStream = Teuchos::rcp(&bhs, false);
Teuchos::oblackholestream oldFormatState;
oldFormatState.copyfmt(std::cout);
typedef typename
Kokkos::Impl::is_space<DeviceSpaceType>::host_mirror_space::execution_space HostSpaceType ;
*outStream << "DeviceSpace:: "; DeviceSpaceType::print_configuration(*outStream, false);
*outStream << "HostSpace:: "; HostSpaceType::print_configuration(*outStream, false);
*outStream
<< "===============================================================================\n"
<< "| |\n"
<< "| Unit Test (CubatureDirect,CubatureTensor) |\n"
<< "| |\n"
<< "| 1) Computing volumes of reference cells |\n"
<< "| |\n"
<< "| Questions? Contact Pavel Bochev ([email protected]) or |\n"
<< "| Denis Ridzal ([email protected]) or |\n"
<< "| Kyungjoo Kim ([email protected]). |\n"
<< "| |\n"
<< "| Intrepid's website: http://trilinos.sandia.gov/packages/intrepid |\n"
<< "| Trilinos website: http://trilinos.sandia.gov |\n"
<< "| |\n"
<< "===============================================================================\n";
typedef Kokkos::DynRankView<ValueType,DeviceSpaceType> DynRankView;
#define ConstructWithLabel(obj, ...) obj(#obj, __VA_ARGS__)
typedef ValueType pointValueType;
typedef ValueType weightValueType;
typedef CubatureDirectLineGauss <DeviceSpaceType,pointValueType,weightValueType> CubatureLineType;
typedef CubatureDirectLineGaussJacobi20<DeviceSpaceType,pointValueType,weightValueType> CubatureLineJacobiType;
typedef CubatureDirectTriDefault <DeviceSpaceType,pointValueType,weightValueType> CubatureTriType;
typedef CubatureDirectTetDefault <DeviceSpaceType,pointValueType,weightValueType> CubatureTetType;
typedef CubatureTensor <DeviceSpaceType,pointValueType,weightValueType> CubatureTensorType;
typedef CubatureTensorPyr <DeviceSpaceType,pointValueType,weightValueType> CubatureTensorPyrType;
const auto tol = 100.0 * tolerence();
int errorFlag = 0;
*outStream
<< "\n"
<< "===============================================================================\n"
<< "| TEST 1: exception |\n"
<< "===============================================================================\n";
try {
ordinal_type nthrow = 0, ncatch = 0;
#ifdef HAVE_INTREPID2_DEBUG
*outStream << "-> Line testing\n\n";
{
INTREPID2_TEST_ERROR_EXPECTED( CubatureLineType(-1) );
INTREPID2_TEST_ERROR_EXPECTED( CubatureLineType(Parameters::MaxCubatureDegreeEdge+1) );
}
*outStream << "-> Triangle testing\n\n";
{
INTREPID2_TEST_ERROR_EXPECTED( CubatureTriType triCub(-1) );
INTREPID2_TEST_ERROR_EXPECTED( CubatureTriType triCub(Parameters::MaxCubatureDegreeTri+1) );
}
*outStream << "-> Tetrahedron testing\n\n";
{
INTREPID2_TEST_ERROR_EXPECTED( CubatureTetType tetCub(-1) );
INTREPID2_TEST_ERROR_EXPECTED( CubatureTetType tetCub(Parameters::MaxCubatureDegreeTet+1) );
}
#endif
if (nthrow != ncatch) {
errorFlag++;
*outStream << std::setw(70) << "^^^^----FAILURE!" << "\n";
*outStream << "# of catch ("<< ncatch << ") is different from # of throw (" << ncatch << ")\n";
}
} catch (std::logic_error err) {
*outStream << err.what() << "\n";
errorFlag = -1000;
};
*outStream
<< "\n"
<< "===============================================================================\n"
<< "| TEST 2: basic functionalities |\n"
<< "===============================================================================\n";
try {
*outStream << "-> Line testing\n\n";
{
CubatureLineType lineCub(4);
INTREPID2_TEST_FOR_EXCEPTION( lineCub.getDimension() != 1, std::logic_error,
">>> ERROR (Integration::Test01): line cubature must have 1 dimension.");
INTREPID2_TEST_FOR_EXCEPTION( lineCub.getAccuracy() != 4, std::logic_error,
">>> ERROR (Integration::Test01): line cubature reports wrong accuracy.");
}
*outStream << "-> Triangle testing\n\n";
{
CubatureTriType triCub(17);
INTREPID2_TEST_FOR_EXCEPTION( triCub.getNumPoints() != 61, std::logic_error,
">>> ERROR (Integration::Test01): triangle cubature reports a wrong number of points.");
INTREPID2_TEST_FOR_EXCEPTION( triCub.getDimension() != 2, std::logic_error,
">>> ERROR (Integration::Test01): triangle cubature reports a wrong dimension.");
}
*outStream << "-> Tetrahedron testing\n\n";
{
CubatureTetType tetCub(17);
INTREPID2_TEST_FOR_EXCEPTION( tetCub.getNumPoints() != 495, std::logic_error,
">>> ERROR (Integration::Test01): tetrahedron cubature reports a wrong number of points.");
INTREPID2_TEST_FOR_EXCEPTION( tetCub.getDimension() != 3, std::logic_error,
">>> ERROR (Integration::Test01): tetrahedron cubature reports a wrong dimension.");
}
*outStream << "-> Quad testing\n\n";
{
CubatureTensorType quadCub( CubatureLineType(3), CubatureLineType(7) );
INTREPID2_TEST_FOR_EXCEPTION( quadCub.getDimension() != 2, std::logic_error,
">>> ERROR (Integration::Test01): quad cubature must have 2 dimension.");
ordinal_type accuracy[Parameters::MaxDimension];
quadCub.getAccuracy( accuracy );
INTREPID2_TEST_FOR_EXCEPTION( accuracy[0] != 3 || accuracy[1] != 7, std::logic_error,
">>> ERROR (Integration::Test01): quad cubature reports wrong accuracy.");
}
*outStream << "-> Hex testing\n\n";
{
CubatureTensorType hexCub( CubatureLineType(1), CubatureLineType(4), CubatureLineType(2) );
INTREPID2_TEST_FOR_EXCEPTION( hexCub.getDimension() != 3, std::logic_error,
">>> ERROR (Integration::Test01): hex cubature must have 3 dimension.");
ordinal_type accuracy[Parameters::MaxDimension];
hexCub.getAccuracy( accuracy );
INTREPID2_TEST_FOR_EXCEPTION( accuracy[0] != 1 || accuracy[1] != 4 || accuracy[2] != 2, std::logic_error,
">>> ERROR (Integration::Test01): hex cubature reports wrong accuracy.");
}
*outStream << "-> Prism testing\n\n";
{
CubatureTensorType prismCub( CubatureTriType(4), CubatureLineType(3) );
INTREPID2_TEST_FOR_EXCEPTION( prismCub.getDimension() != 3, std::logic_error,
">>> ERROR (Integration::Test01): prism cubature must have 3 dimension.");
ordinal_type accuracy[Parameters::MaxDimension];
prismCub.getAccuracy( accuracy );
INTREPID2_TEST_FOR_EXCEPTION( accuracy[0] != 4 || accuracy[1] != 3, std::logic_error,
">>> ERROR (Integration::Test01): prism cubature reports wrong accuracy.");
}
} catch (std::logic_error err) {
*outStream << err.what() << "\n";
errorFlag = -1000;
};
*outStream
<< "===============================================================================\n"
<< "| TEST 3: volume computations |\n"
<< "===============================================================================\n";
try {
DynRankView ConstructWithLabel(cubPoints, Parameters::MaxIntegrationPoints, Parameters::MaxDimension);
DynRankView ConstructWithLabel(cubWeights, Parameters::MaxIntegrationPoints);
*outStream << "-> Line testing\n\n";
{
for (ordinal_type deg=0;deg<=Parameters::MaxCubatureDegreeEdge;++deg) {
CubatureLineType cub(deg);
cub.getCubature(cubPoints, cubWeights);
const auto npts = cub.getNumPoints();
const auto testVol = computeRefVolume(npts, cubWeights);
const auto refVol = 2.0;
if (std::abs(testVol - refVol) > tol) {
*outStream << std::setw(30) << "Line volume --> " << std::setw(10) << std::scientific << testVol <<
std::setw(10) << "diff = " << std::setw(10) << std::scientific << std::abs(testVol - refVol) << "\n";
++errorFlag;
*outStream << std::setw(70) << "^^^^----FAILURE!" << "\n";
}
}
}
*outStream << "-> Triangle testing\n\n";
{
for (auto deg=0;deg<=Parameters::MaxCubatureDegreeTri;++deg) {
CubatureTriType cub(deg);
cub.getCubature(cubPoints, cubWeights);
const auto npts = cub.getNumPoints();
const auto testVol = computeRefVolume(npts, cubWeights);
const auto refVol = 0.5;
if (std::abs(testVol - refVol) > tol) {
*outStream << std::setw(30) << "Triangle volume --> " << std::setw(10) << std::scientific << testVol <<
std::setw(10) << "diff = " << std::setw(10) << std::scientific << std::abs(testVol - refVol) << "\n";
++errorFlag;
*outStream << std::setw(70) << "^^^^----FAILURE!" << "\n";
}
}
}
*outStream << "-> Quad testing\n\n";
{
for (ordinal_type y_deg=0;y_deg<=Parameters::MaxCubatureDegreeEdge;++y_deg)
for (ordinal_type x_deg=0;x_deg<=Parameters::MaxCubatureDegreeEdge;++x_deg) {
const auto x_line = CubatureLineType(x_deg);
const auto y_line = CubatureLineType(y_deg);
CubatureTensorType cub( x_line, y_line );
cub.getCubature(cubPoints, cubWeights);
const auto npts = cub.getNumPoints();
const auto testVol = computeRefVolume(npts, cubWeights);
const auto refVol = 4.0;
if (std::abs(testVol - refVol) > tol) {
*outStream << std::setw(30) << "Quadrilateral volume --> " << std::setw(10) << std::scientific << testVol <<
std::setw(10) << "diff = " << std::setw(10) << std::scientific << std::abs(testVol - refVol) << "\n";
++errorFlag;
*outStream << std::setw(70) << "^^^^----FAILURE!" << "\n";
}
}
}
*outStream << "-> Tetrahedron testing\n\n";
{
for (auto deg=0;deg<=Parameters::MaxCubatureDegreeTet;++deg) {
CubatureTetType cub(deg);
cub.getCubature(cubPoints, cubWeights);
const auto npts = cub.getNumPoints();
const auto testVol = computeRefVolume(npts, cubWeights);
const auto refVol = 1.0/6.0;
if (std::abs(testVol - refVol) > tol) {
*outStream << std::setw(30) << "Tetrahedron volume --> " << std::setw(10) << std::scientific << testVol <<
std::setw(10) << "diff = " << std::setw(10) << std::scientific << std::abs(testVol - refVol) << "\n";
++errorFlag;
*outStream << std::setw(70) << "^^^^----FAILURE!" << "\n";
}
}
}
*outStream << "-> Hexahedron testing\n\n";
{
// when hex is tested with max cubature degree edge, it exceeds max integration points 1001
for (ordinal_type z_deg=0;z_deg<Parameters::MaxCubatureDegreeEdge;++z_deg)
for (ordinal_type y_deg=0;y_deg<Parameters::MaxCubatureDegreeEdge;++y_deg)
for (ordinal_type x_deg=0;x_deg<Parameters::MaxCubatureDegreeEdge;++x_deg) {
const auto x_line = CubatureLineType(x_deg);
const auto y_line = CubatureLineType(y_deg);
const auto z_line = CubatureLineType(z_deg);
CubatureTensorType cub( x_line, y_line, z_line );
cub.getCubature(cubPoints, cubWeights);
const auto npts = cub.getNumPoints();
const auto testVol = computeRefVolume(npts, cubWeights);
const auto refVol = 8.0;
if (std::abs(testVol - refVol) > tol) {
*outStream << std::setw(30) << "Hexahedron volume --> " << std::setw(10) << std::scientific << testVol <<
std::setw(10) << "diff = " << std::setw(10) << std::scientific << std::abs(testVol - refVol) << "\n";
++errorFlag;
*outStream << std::setw(70) << "^^^^----FAILURE!" << "\n";
}
}
}
*outStream << "-> Prism testing\n\n";
{
for (auto z_deg=0;z_deg<Parameters::MaxCubatureDegreeEdge;++z_deg)
for (auto xy_deg=0;xy_deg<Parameters::MaxCubatureDegreeTri;++xy_deg) {
const auto xy_tri = CubatureTriType(xy_deg);
const auto z_line = CubatureLineType(z_deg);
CubatureTensorType cub( xy_tri, z_line );
cub.getCubature(cubPoints, cubWeights);
const auto npts = cub.getNumPoints();
const auto testVol = computeRefVolume(npts, cubWeights);
const auto refVol = 1.0;
if (std::abs(testVol - refVol) > tol) {
*outStream << std::setw(30) << "Wedge volume --> " << std::setw(10) << std::scientific << testVol <<
std::setw(10) << "diff = " << std::setw(10) << std::scientific << std::abs(testVol - refVol) << "\n";
++errorFlag;
*outStream << std::setw(70) << "^^^^----FAILURE!" << "\n";
}
}
}
*outStream << "-> Pyramid testing: over-integration by 2 (due to duffy transformation) \n\n";
{
for (auto deg=0;deg<=Parameters::MaxCubatureDegreePyr;++deg) {
const auto xy_line = CubatureLineType(deg);
const auto z_line = CubatureLineJacobiType(deg);
CubatureTensorPyrType cub( xy_line, xy_line, z_line );
cub.getCubature(cubPoints, cubWeights);
const auto npts = cub.getNumPoints();
const auto testVol = computeRefVolume(npts, cubWeights);
const auto refVol = 4.0/3.0;
if (std::abs(testVol - refVol) > tol) {
*outStream << std::setw(30) << "Pyramid volume --> " << std::setw(10) << std::scientific << testVol <<
std::setw(10) << "diff = " << std::setw(10) << std::scientific << std::abs(testVol - refVol) << "\n";
++errorFlag;
*outStream << std::setw(70) << "^^^^----FAILURE!" << "\n";
}
}
}
*outStream << "-> Hypercube testing\n\n";
// later.... refVol = 32
// for (int deg=0; deg<=20; deg++) {
// Teuchos::RCP<CubatureLineType > lineCub = Teuchos::rcp(new CubatureLineType(deg));
// CubatureTensorType hypercubeCub(lineCub, 5);
// int numCubPoints = hypercubeCub.getNumPoints();
// FieldContainer<DeviceSpaceType> cubPoints( numCubPoints, hypercubeCub.getDimension() );
// FieldContainer<DeviceSpaceType> cubWeights( numCubPoints );
// hypercubeCub.getCubature(cubPoints, cubWeights);
// testVol = 0;
// for (int i=0; i<numCubPoints; i++)
// testVol += cubWeights(i);
// *outStream << std::setw(30) << "5-D Hypercube volume --> " << std::setw(10) << std::scientific << testVol <<
// std::setw(10) << "diff = " << std::setw(10) << std::scientific << std::abs(testVol - volumeList[8]) << "\n";
// if (std::abs(testVol - volumeList[8])/std::abs(testVol) > tol) {
// errorFlag = 1;
// *outStream << std::setw(70) << "^^^^----FAILURE!" << "\n";
// }
// }
} catch (std::logic_error err) {
*outStream << err.what() << "\n";
errorFlag = -1;
};
if (errorFlag != 0)
std::cout << "End Result: TEST FAILED\n";
else
std::cout << "End Result: TEST PASSED\n";
// reset format state of std::cout
std::cout.copyfmt(oldFormatState);
Kokkos::finalize();
return errorFlag;
}