package codex
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
The Codex library for building static analysers based on abstract interpretation
Install
dune-project
Dependency
Authors
Maintainers
Sources
1.0-rc4.tar.gz
md5=bc7266a140c6886add673ede90e335d3
sha512=8da42c0ff2c1098c5f9cb2b5b43b306faf7ac93b8f5ae00c176918cee761f249ff45b29309f31a05bbcf6312304f86a0d5a000eb3f1094d3d3c2b9b4c7f5c386
doc/codex.single_value_abstraction/Single_value_abstraction/Stats/Make/Integer_Backward/index.html
Module Make.Integer_BackwardSource
val itimes : Z.t -> (integer, integer) Operator.Backward_Arity.ar1Multiply an integer by a constant
val iadd : (integer, integer, integer) Operator.Backward_Arity.ar2val imul : (integer, integer, integer) Operator.Backward_Arity.ar2val idiv : (integer, integer, integer) Operator.Backward_Arity.ar2This is truncated (C99-like) integer division
val imod : (integer, integer, integer) Operator.Backward_Arity.ar2val ishl : (integer, integer, integer) Operator.Backward_Arity.ar2val ishr : (integer, integer, integer) Operator.Backward_Arity.ar2val iand : (integer, integer, integer) Operator.Backward_Arity.ar2Bitwise and, where negative integers are seen as prefixed by infinite ones
val ior : (integer, integer, integer) Operator.Backward_Arity.ar2Bitwise or, where negative integers are seen as prefixed by infinite ones
val ixor : (integer, integer, integer) Operator.Backward_Arity.ar2val isub : (integer, integer, integer) Operator.Backward_Arity.ar2val ieq : (integer, integer, boolean) Operator.Backward_Arity.ar2val ile : (integer, integer, boolean) Operator.Backward_Arity.ar2 sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>