package fungi

  1. Overview
  2. Docs
A pure functional graph library

Install 

dune-project
 Dependency

harryk.dev Readme Changelog Edit opam file Versions (2)

Authors

  1. H
    Harry K <harryk@harryk.dev>

Maintainers

  1. H
    Harry K <kituyiharry@github.com>

Sources

0.2.0.tar.gz
md5=c034feedb30e2fa094e5e720c6eb5cea
sha512=c0ece9e10b5ebf4d34b714d4884a55c519773b500989ce2ade329ba874be5e8e931d53f2706e63c0adb53f455e9d02781757872fc8259b2fddd395474d2eabfe

doc/fungi/Fungi/Graph/Biject/argument-1-T/index.html

Parameter Biject.T

type t
include Set.OrderedType with type t := t
val compare : t -> t -> int

A total ordering function over the set elements. This is a two-argument function f such that f e1 e2 is zero if the elements e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

val zero : t
val one : t
val add : t -> t -> t
val sub : t -> t -> t
val min : t -> t -> t
val max : t -> t -> t
val neg : t -> t