Function post

gecode/int/linear/int-post.cpp:218–404

  }

  void
  post(Home home, Term<IntView>* t, int n, IntRelType irt, int c,
       IntPropLevel ipl) {

    Limits::check(c,"Int::linear");

    long long int d = c;

    eliminate(t,n,d);

    Term<IntView> *t_p, *t_n;
    int n_p, n_n, gcd=1;
    bool is_unit = normalize<IntView>(t,n,t_p,n_p,t_n,n_n,gcd);

    rewrite(irt,d,t_p,n_p,t_n,n_n);

    // Divide by gcd
    if (gcd > 1) {
      switch (irt) {
      case IRT_EQ:
        if ((d % gcd) != 0) {
          home.fail();
          return;
        }
        d /= gcd;
        break;
      case IRT_NQ:
        if ((d % gcd) != 0)
          return;
        d /= gcd;
        break;
      case IRT_LQ:
        d = floor_div_xp(d,static_cast<long long int>(gcd));
        break;
      default: GECODE_NEVER;
      }
    }

    if (n == 0) {
      switch (irt) {
      case IRT_EQ: if (d != 0) home.fail(); break;
      case IRT_NQ: if (d == 0) home.fail(); break;
      case IRT_LQ: if (d < 0)  home.fail(); break;
      default: GECODE_NEVER;
      }
      return;
    }

    if (n == 1) {
      if (n_p == 1) {
        LLongScaleView y(t_p[0].a,t_p[0].x);
        switch (irt) {
        case IRT_EQ: GECODE_ME_FAIL(y.eq(home,d)); break;
        case IRT_NQ: GECODE_ME_FAIL(y.nq(home,d)); break;
        case IRT_LQ: GECODE_ME_FAIL(y.lq(home,d)); break;
        default: GECODE_NEVER;
        }
      } else {