package goblint

You can search for identifiers within the package.

in-package search v0.2.0

Static analysis framework for C

Install

dune-project

Dependency

goblint.in.tum.de Readme Changelog Edit opam file Versions (9)

Authors

Maintainers

Sources

goblint-2.3.0.tbz

sha256=b729c94adb383a39aea32eb005c988dfd44b92af22ee6a4eedf4239542ac6c26

sha512=643b98770e5fe5644324c95c9ae3a9f698f25c8b11b298f0751d524e0b20af368b2a465fc8200b75a73d48fc9a053fd90f5e8920d4db070927f93188bb8687e0

doc/goblint.std/Goblint_std/GobList/index.html

Module `Goblint_std.GobList`Source

Sourceval combine_short : 'a list -> 'b list -> ('a * 'b) list

The normal haskell zip that throws no exception

Sourceval assoc_eq_opt : ('a -> 'a -> bool) -> 'a -> ('a * 'b) list -> 'b option

Source

val fold_left3 : 
  ('a -> 'b -> 'c -> 'd -> 'a) ->
  'a ->
  'b list ->
  'c list ->
  'd list ->
  'a

Source

val for_all3 : 
  ('a -> 'b -> 'c -> bool) ->
  'a list ->
  'b list ->
  'c list ->
  bool

Sourceval fold_while_some : ('a -> 'b -> 'a option) -> 'a -> 'b list -> 'a option

Sourceval equal : 'a BatOrd.eq -> 'a list BatOrd.eq

Sourceval until_last_with : ('a -> bool) -> 'a list -> 'a list * 'a list

Given a predicate and a list, returns two lists (l1, l2). l1 contains the prefix of the list until the last element that satisfies the predicate, l2 contains all subsequent elements. The order of elements is preserved.

Sourcemodule Syntax : sig ... end

Open this to use applicative functor/monad syntax for list.