package electrod
Formal analysis for the Electrod formal pivot language
Install
Dune Dependency
Authors
Maintainers
Sources
electrod-1.0.0.tbz
sha256=4da251e58d97c797d6e940e586d225a09715777fbb1b25c5527a6a2e1e3c2d58
sha512=89c45ebd0d3401b17eac4217289ed21ec87135ab5fa62bf63b2bed1ad1435a381e3434582c2ec99c2e6d8d87ce23cecfa7ba14d76234493992ae06879b808dd2
doc/src/electrod.libelectrod/Symbol.ml.html
Source file Symbol.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54
(******************************************************************************* * electrod - a model finder for relational first-order linear temporal logic * * Copyright (C) 2016-2020 ONERA * Authors: Julien Brunel (ONERA), David Chemouil (ONERA) * * This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this * file, You can obtain one at http://mozilla.org/MPL/2.0/. * * SPDX-License-Identifier: MPL-2.0 * License-Filename: LICENSE.md ******************************************************************************) open Containers module H = Hashcons type t = string H.hash_consed module S = H.Make (struct type t = string let hash = String.hash let equal = String.equal end) (* ********************* *) (* table for hashconsing *) (* ********************* *) let table = S.create 271 (* ********************* *) let make s = S.hashcons table s let hash sym = sym.H.hkey let compare s1 s2 = s1.H.tag - s2.H.tag let compare_string s1 s2 = String.compare s1.H.node s2.H.node let equal x1 x2 = Stdlib.(x1 == x2) let pp out at = (* Format.fprintf out "%s/%d" at.H.node at.H.tag *) Format.fprintf out "%s" at.H.node include Intf.Print.Mixin (struct type nonrec t = t let pp = pp end)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>