Package aterm

Examples of aterm.ATermAppl.containsAtLeast()


            }

      /*
       * Second half of condition 9 - 11 block
       */
      if (dr.containsAtLeast(inequalityCount(ne, i) + 1)) {
        it.remove();
        removeInequalities(ne, i);
        continue;
      }

View Full Code Here


      }

      /*
       * Data range is a singleton, replace variable with constant (lines 17 - 18)
       */
      if (dr.isFinite() && dr.isEnumerable() && !dr.containsAtLeast(2)) {
        final Object c = dr.valueIterator().next();
        it.remove();
        consts.add(i);
        constValues[i] = c;
        normalized[i] = TRIVIALLY_SATISFIABLE;
View Full Code Here

      final DataRange<?> dr = normalized[i];

      final Set<Integer> diffs = ne[i];
      final int min = (diffs == null) ? 1 : diffs.size() + 1;
      if (dr.containsAtLeast(min)) {
        it.remove();
        for (int j : diffs) {
          if (ne[j] != null) {
                      ne[j].remove(i);
                    }
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.