Array update. Remarks: The node a must have an array sort [domain -> range], i must have sort domain, v must have sort range. The sort of the result is [domain -> range]. The semantics of this function is given by the theory of arrays described in the
(Expr<ArraySort<D, R>> a, Expr<D> i, Expr<R> v)
| 1913 | |
| 1914 | **/ |
| 1915 | public final <D extends Sort, R extends Sort> ArrayExpr<D, R> mkStore(Expr<ArraySort<D, R>> a, Expr<D> i, Expr<R> v) |
| 1916 | { |
| 1917 | checkContextMatch(a); |
| 1918 | checkContextMatch(i); |
| 1919 | checkContextMatch(v); |
| 1920 | return new ArrayExpr<>(this, Native.mkStore(nCtx(), a.getNativeObject(), |
| 1921 | i.getNativeObject(), v.getNativeObject())); |
| 1922 | } |
| 1923 | |
| 1924 | /** |
| 1925 | * Array update. |
no test coverage detected